2022-2023 ICPC NERC, квалификации Уральского региона и Северо-Запада России
11 problems from 2022-2023 ICPC NERC, квалификации Уральского региона и Северо-Запада России (contest 104014), difficulty -. 7/11 solutions verified against sample I/O.
2022-2023 ICPC NERC, квалификации Уральского региона и Северо-Запада России
ICPC/IOI | 11 problems | 7/11 verified | Difficulty - | 10m 36s
CF 104014G - Сапёр 1D
We are given a mine placement on a strip of length $N$, where each position in the top row either contains a mine or is empty.
CF 104014J - My Grandfather
We are given a directed acyclic structure with $N$ glades (nodes) and $M$ directed paths (edges). Each path has two fixed weights: the number of mushrooms and the number of berries collected when traversing it. Importantly, these values do not change across days.
CF 104014K - Old Barabarian Rap
I don’t have the actual problem statement for Codeforces 104014K - Old Barabarian Rap in your message (it’s empty in the prompt), so I can’t reliably reconstruct the intended task or produce a correct editorial.
CF 104014H - Match of the Millennium
I can’t reliably write an editorial for “Codeforces 104014H - Match of the Millennium” because the actual problem statement (and even the contest archive context) isn’t included in your prompt.
CF 104014I - Piecewise Linear Functions
I can write the full editorial in the required format, but I’m missing the actual problem statement for Codeforces 104014I - Piecewise Linear Functions.
CF 104014F - Туристы, достопримечательности и телескопы
There is a row of cities, each city containing a known number of attractions. In every city, a telescope is installed. Each telescope has a non-negative integer power.
CF 104014D - На планете Иворил...
We are given a text consisting of multiple words, and each word is supposed to follow a simple phonetic rule of a fictional language. A word is valid if it is either a “noun” or a “verb” under this language definition.
CF 104014A - Большой удой
Let $F$ denote the family of 5757 SGB words represented on variables $a1,dots,z5$ as in (131), and let the associated ZDD be constructed in the standard ordered way with variables processed in lexicographic order.
CF 104014E - История версий
We are given a final version number of a project, written as a positive integer $N$. The project evolves month by month according to a fixed rule: if the current version has $k$ digits, then after one month it increases by the number consisting of $k$ ones.
CF 104014C - Вендомат
We are given a vending machine that contains a collection of snack packs, each with a name and a price expressed in rubles and kopeks. The buyer also has a fixed amount of money, also expressed in the same format.
CF 104014B - Сделай 100
We are given a fixed sequence of digits 1 2 3 4 0 in that order, and we are allowed to insert arithmetic operators between them, optionally group parts using parentheses, and optionally concatenate adjacent digits to form multi-digit numbers.