Codeforces Round 1021 (Div. 1)

Solutions for Codeforces Round 1021 (Div. 1) (contest 2097). 2/6 problems verified against sample I/O. Difficulty range: 1400-3500.

6 items

Codeforces Round 1021 (Div. 1)

Type: Div. 1 | Problems: 6 | Verified: 2/6 | Rating range: 1400-3500 | Time: 9m 51s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Sports Betting	1400	2-sat, brute-force, math	1m 32s	✗
B	Baggage Claim	2300	combinatorics, dfs-and-similar, dp	2m 8s	✗
C	Bermuda Triangle	2400	chinese-remainder-theorem, geometry, implementation	1m 42s	✗
D	Homework	2800	bitmasks, math, matrices	1m 42s	✗
E	Clearing the Snowdrift	3100	data-structures, dfs-and-similar, dp	1m 39s	✓
F	Lost Luggage	3500	dp, flows	1m 8s	✓

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

CF 2097E - Clearing the Snowdrift

We are given a runway divided into n sections, each covered with some snow. The snow in the i-th section has height ai. A snowplow can operate on any contiguous segment of at most length d.

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

CF 2097D - Homework

We are given two binary strings of the same length, and we are allowed to repeatedly apply a very specific transformation that acts on halves of substrings and mixes corresponding bits using XOR-like behavior.

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

CF 2097B - Baggage Claim

The task is to reconstruct a simple path on a rectangular grid where only the cells with odd indices are known. Specifically, the path alternates between "known" and "unknown" cells, starting and ending with known cells.

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

CF 2097C - Bermuda Triangle

The plane moves inside a right triangle with corners at $(0,0)$, $(n,0)$, and $(0,n)$. The aircraft starts strictly inside this triangle at $(x,y)$ and moves with a constant velocity vector $(vx, vy)$.

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

CF 2097A - Sports Betting

We are given several independent scenarios. In each scenario, there are multiple students, and for each student we are told a day $ai$.

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

CF 2097F - Lost Luggage

We are dealing with a network of airports where lost luggage moves around according to daily flights and is partially recovered through inspections. Each airport has an initial number of lost luggage pieces.