2021-2022 ICPC NERC (NEERC), North-Western Russia Regional Contest (Northern Subregionals)
14 problems from 2021-2022 ICPC NERC (NEERC), North-Western Russia Regional Contest (Northern Subregionals) (contest 104011), difficulty -. 13/14 solutions verified against sample I/O.
2021-2022 ICPC NERC (NEERC), North-Western Russia Regional Contest (Northern Subregionals)
ICPC/IOI | 14 problems | 13/14 verified | Difficulty - | 17m
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Anno Domini 2022 | 48s | ✓ | |||
| B | Boris and Berta | 2m 8s | ||||
| C | Clean Up! | 48s | ✓ | |||
| D | Day Streak | 49s | ✓ | |||
| E | Extreme Problem | 58s | ✓ | |||
| F | First to Solve | 1m 6s | ✓ | |||
| G | Grand Center | 4m 20s | ✓ | |||
| H | Halfway There | 48s | ✓ | |||
| I | Imprecise Permutation Sort | 47s | ✓ | |||
| J | Journey in Fog | 1m 4s | ✓ | |||
| K | Kaleidoscopic Route | 49s | ✓ | |||
| L | Letters Q and F | 50s | ✓ | |||
| M | Multithreaded Program | 52s | ✓ | |||
| N | New White-Black Tree | 53s | ✓ |
CF 104011G - Grand Center
We are given a strictly convex polygon, and we imagine choosing a point inside it. For any fixed direction, we draw the maximal chord of the polygon that passes through this point and is parallel to that direction.
CF 104011M - Multithreaded Program
We are given several threads, and each thread contains a fixed sequence of assignment operations. Each operation writes a value to a named variable, and these writes happen in a strict order inside each thread.
CF 104011N - New White-Black Tree
We are given a collection of independent trees. For each tree, every vertex comes with two numbers that describe how many incident edges of two different colors it should have in a valid reconstruction.
CF 104011L - Letters Q and F
We are given a final picture of an $n times m$ grid consisting of white and black cells. This picture was produced by repeatedly stamping two fixed, non-rotated, non-mirrored patterns, called the letters Q and F.
CF 104011K - Kaleidoscopic Route
We are given an undirected graph with weighted edges, where the weight is called colorfulness. The task is to travel from city 1 to city n, but not just by any path.
CF 104011J - Journey in Fog
We are working on a one-dimensional street of fixed length $L$. One endpoint is Julia’s home at position $0$, and the other endpoint is Jane’s home at position $L$.
CF 104011I - Imprecise Permutation Sort
We are given a hidden permutation of size $n$, where the values are a rearrangement of the integers from 1 to $n$. We cannot see the array directly. Instead, we can interact with it using two operations.
CF 104011F - First to Solve
Each contestant has a personal list of problems they are capable of solving. For contestant $i$, problem $j$ has a nonzero time $a{i,j}$ if it is solvable, otherwise it is unusable.
CF 104011H - Halfway There
We are given a number $n$, and we consider all integers from $1$ up to $n-1$. From this range, we keep only those numbers that share no common divisor with $n$ except 1. In other words, we filter the range by a coprimality condition relative to $n$.
CF 104011E - Extreme Problem
We are working on a small fixed integer grid of size 21 by 21, where both coordinates range from minus 10 to 10. The task is not to compute anything dynamically but to construct a function over this grid and output it in reverse Polish notation using a restricted set of…
CF 104011B - Boris and Berta
Exercise 225 constructs a ZDD whose paths encode all simple paths between two fixed vertices $s$ and $t$. The construction proceeds by a controlled search over partial edge sets: each ZDD node represents a state of the partial path, and each decision corresponds to including…
CF 104011D - Day Streak
We are given a sequence of timestamps when problems were solved, already sorted in increasing order. Each timestamp represents a moment in continuous time, but the platform converts these moments into discrete “days” using a floor division after shifting time by a chosen…
CF 104011A - Anno Domini 2022
We are given two points on a simplified timeline where every year is labeled either in the AD system or in the BC system. Each input line describes a year like “AD 2022” or “5508 BC”.
CF 104011C - Clean Up!
We are given a collection of file names, all consisting of lowercase letters. Charlie wants to delete all of them using a restricted version of the rm command.