Квалификационный раунд Чемпионата Северо-Запада России и Москвы ICPC 2019
12 problems from Квалификационный раунд Чемпионата Северо-Запада России и Москвы ICPC 2019 (contest 102375), difficulty -. 4/12 solutions verified against sample I/O.
Квалификационный раунд Чемпионата Северо-Запада России и Москвы ICPC 2019
ICPC/IOI | 12 problems | 4/12 verified | Difficulty - | 1h 49m
CF 102375J - Порталы
The maze is an (N times M) grid. A cell is either free, occupied by a solid wall W, or occupied by a glass wall G. Ordinary movement is possible only between adjacent free cells. The outer border consists of solid walls, so every ray eventually reaches a solid wall.
CF 102375H - ICPC
For a given maximum word length (N), the dictionary contains every lowercase English string whose length is from (1) through (N). Words of the same length appear in lexicographic order, while all shorter words come first.
CF 102375G - Есть ли делитель?
We are given one nonempty decimal string, with no leading zero. The string is not necessarily interpreted in base 10. We may choose a base (B), provided every digit appearing in the string is a valid digit in that base.
CF 102375F - Правильный подмногоугольник
We start with a regular polygon containing (N) vertices and want to keep as few of those vertices as possible while making the selected vertices themselves form a regular polygon.
CF 102375E - Думский регламент
We are given a chronological log of a parliamentary session. Every Add x event means that party x introduces a new bill. The newly introduced bill immediately becomes the one being discussed, so the bill that was being discussed before it is suspended.
CF 102375L - Ближайшие точки
We have an integer grid inside the rectangle with corners (0, 0) and (X, Y). Among all marked points, p1 is special. We need to count every grid point whose Euclidean distance to p1 is no larger than its distance to every other marked point.
CF 102375C - Совпадения
There are exactly (N) rooms, numbered from (1) to (N), and exactly (N) participants. Participant (i) has passport number (ai).
CF 102375I - Составление задач
We have (P) participants and (T) available problems. Each input pair ((u,v)) says that participant (u) knows problem (v). A problem may be known by several participants, and a participant is unable to compete if they know at least one problem that was selected for the contest.
CF 102375B - Большие перемены
We have (N) labeled cities and must build a connected undirected graph using exactly (N-1) distinct airline connections. Since a connected graph on (N) vertices with exactly (N-1) edges is a tree, the problem is really about labeled trees.
CF 102375K - <<Контакт>> для двоих
We have a dictionary of known words. For every query, one dictionary entry is chosen as the secret word (S), and an integer (K) determines how many unsuccessful guesses the second player may make before another letter of (S) is revealed.
CF 102375D - Драфт НБА
For each candidate, we know five integer statistics: height, wingspan, points per game, rebounds per game, and assists per game. Each statistic has its own expected interval, and the candidate is judged by where every value lies relative to that interval.
CF 102375A - Арифметическая магия
The spectator secretly chooses two numbers, say (a) and (b). The trick constructs a value from them by first increasing both numbers by one, multiplying the results, then subtracting (a), subtracting (b), and finally subtracting (ab).