Codeforces Round 577 (Div. 2)

6 problems from Codeforces Round 577 (Div. 2) (contest 1201), difficulty 900-3000. 4/6 solutions verified against sample I/O.

6 items

Codeforces Round 577 (Div. 2)

Div. 2 | 6 problems | 4/6 verified | Difficulty 900-3000 | 19m 55s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Important Exam	900	implementation, strings	17,032	1m 22s	✓
B	Zero Array	1500	greedy, math	25,455	5m 5s	✓
C	Maximum Median	1400	binary-search, greedy, math	33,200	3m 59s	✓
D	Treasure Hunting	2100	binary-search, dp, greedy	2,532	1m 42s
E1	Knightmare (easy)	2900	graphs, interactive, shortest-paths	146	1m 55s	✓
E2	Knightmare (hard)	3000	graphs, interactive, shortest-paths	165	5m 52s

Practice › Codeforces Solutions › Codeforces Round 577 (Div. 2) ›

CF 1201E2 - Knightmare (hard)

We are placed on an even-by-even grid, and two knights start on different squares. One is white, one is black. Each player controls exactly one knight and alternates moves, starting with the white side if we choose it. A move is standard knight movement.

Practice › Codeforces Solutions › Codeforces Round 577 (Div. 2) ›

CF 1201B - Zero Array

We are given a list of numbers, and we repeatedly perform an operation that picks two different positions and reduces both values by one. The goal is to decide whether we can eventually bring every value down exactly to zero using some sequence of such operations.

Practice › Codeforces Solutions › Codeforces Round 577 (Div. 2) ›

CF 1201C - Maximum Median

We are given a list of numbers and allowed to repeatedly increase any single element by one. Each such increment has a cost of one operation, and we have a total budget of at most $k$ operations.

Practice › Codeforces Solutions › Codeforces Round 577 (Div. 2) ›

CF 1201D - Treasure Hunting

We are given a grid with rows increasing upward and columns increasing left to right. We start at the bottom-left cell and want to collect all treasures placed on various cells.

Practice › Codeforces Solutions › Codeforces Round 577 (Div. 2) ›

CF 1201E1 - Knightmare (easy)

We are given a small chessboard and two knights placed on it. One knight is white and moves first, the other is black. On each turn, a player moves their own knight using standard knight moves. The interaction continues until one side wins or 350 moves are reached.

Practice › Codeforces Solutions › Codeforces Round 577 (Div. 2) ›

CF 1201A - Important Exam

Each student answers a multiple-choice test with $m$ questions, where each question has five possible options. We are given the full answer sheet of every student, but the correct answers are unknown.