Codeforces Round 534 (Div. 1)

4 problems from Codeforces Round 534 (Div. 1) (contest 1103), difficulty 1400-3100. 2/4 solutions verified against sample I/O.

4 items

Codeforces Round 534 (Div. 1)

Div. 1 | 4 problems | 2/4 verified | Difficulty 1400-3100 | 20m 50s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Grid game	1400	constructive-algorithms, implementation	10,596	3m 23s	✓
B	Game with modulo	2000	binary-search, constructive-algorithms, interactive	3,528	4m 44s
C	Johnny Solving	2700	constructive-algorithms, dfs-and-similar, graphs	953	4m 21s	✓
D	Professional layer	3100	bitmasks, dp	493	8m 22s

Practice › Codeforces Solutions › Codeforces Round 534 (Div. 1) ›

CF 1103B - Game with modulo

We are interacting with a hidden integer $a$ chosen by the judge, and our task is to determine its exact value for multiple games. Each game allows us to query pairs of non-negative integers $(x, y)$, and the judge compares their remainders modulo $a$.

Practice › Codeforces Solutions › Codeforces Round 534 (Div. 1) ›

CF 1103C - Johnny Solving

We are given a connected undirected simple graph where every vertex has degree at least three. Along with the graph, we are also given an integer $k$. The task is not to compute a single structure, but to decide between two fundamentally different constructions.

Practice › Codeforces Solutions › Codeforces Round 534 (Div. 1) ›

CF 1103D - Professional layer

We are given a collection of judges. Each judge has a value $ai$, which behaves like a number that can be “reduced”, and a cost $ei$, which is paid if we decide to interact with that judge. We may choose a subset of judges to play with.

Practice › Codeforces Solutions › Codeforces Round 534 (Div. 1) ›

CF 1103A - Grid game

We are working on a fixed 4 by 4 board that starts empty. A stream of dominoes arrives one by one, and each domino must be placed immediately when it comes. Each domino is either vertical, covering two cells in the same column, or horizontal, covering two cells in the same row.