2019-2020 ICPC NERC (NEERC), North-Western Russia Regional Contest (Northern Subregionals)
13 problems from 2019-2020 ICPC NERC (NEERC), North-Western Russia Regional Contest (Northern Subregionals) (contest 104874), difficulty -. 2/13 solutions verified against sample I/O.
2019-2020 ICPC NERC (NEERC), North-Western Russia Regional Contest (Northern Subregionals)
ICPC/IOI | 13 problems | 2/13 verified | Difficulty - | 9m 7s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Accurate Movement | 28s | ||||
| B | Bad Treap | 1m 16s | ✓ | |||
| C | Cross-Stitch | 25s | ||||
| D | Double Palindrome | 1m 41s | ||||
| E | Equidistant | 57s | ✓ | |||
| F | Foreach | 29s | ||||
| G | Golf Time | 26s | ||||
| H | High Load Database | 26s | ||||
| I | Ideal Pyramid | 1m 29s | ||||
| J | Just the Last Digit | 22s | ||||
| K | King's Children | 21s | ||||
| L | Lengths and Periods | 24s | ||||
| M | Managing Difficulties | 23s |
CF 104874C - Cross-Stitch
The problem statement is missing from your prompt, so I don’t have enough information to write a correct editorial.
CF 104874M - Managing Difficulties
I can’t reliably reconstruct Codeforces 104874M (“Managing Difficulties”) from the title alone, and I don’t have the actual problem statement in your prompt.
CF 104874L - Lengths and Periods
We are given a single long string over lowercase English letters, and we want to measure how “repetitive” it can be in its most extreme localized form.
CF 104874I - Ideal Pyramid
We are given a set of vertical pillars placed on a plane, each located at an integer coordinate and having a required minimum height.
CF 104874K - King's Children
We are given an $n times m$ grid where each cell is either empty or contains exactly one castle labeled by an uppercase letter. There is exactly one castle labeled ‘A’, which belongs to the favorite child.
CF 104874J - Just the Last Digit
We are given a directed acyclic structure over $n$ ordered nodes, where edges only go from a smaller index to a larger index. Think of it as a downhill graph: from every spot $i$, you can only move to higher-indexed spots $j i$ if a trail exists.
CF 104874H - High Load Database
We are given a fixed sequence of transactions, each transaction carrying a positive workload measured in queries. We are not allowed to reorder these transactions. Instead, we must partition the sequence into contiguous groups, which we will call batches.
CF 104874G - Golf Time
I tried to locate “Codeforces 104874G - Golf Time”, but there is no accessible statement in the public Codeforces archive or mirrors indexed in standard problem listings.
CF 104874F - Foreach
I can’t responsibly write a correct editorial for Codeforces 104874F - Foreach yet because the actual problem statement is missing, and I was not able to retrieve a reliable statement from available sources.
CF 104874E - Equidistant
We are given a tree of cities connected by roads, where every road has equal travel time. A subset of these cities contains teams. The task is to choose a single city such that every team can reach it in exactly the same number of edges.
CF 104874D - Double Palindrome
We are working with strings built from the first $k$ lowercase English letters, and we want to count how many such strings of length at most $n$ satisfy a structural property called “double palindrome”.
CF 104874B - Bad Treap
We are given a deterministic treap definition where each node has a key and a priority derived from the key itself using a fixed function, namely $y = sin(x)$.
CF 104874A - Accurate Movement
I don’t actually have the statement for Codeforces 104874A - Accurate Movement in your prompt, and I can’t reliably reconstruct it from the title alone without risking inventing details.