Codeforces Round 515 (Div. 3)

6 problems from Codeforces Round 515 (Div. 3) (contest 1066), difficulty 1100-2100. 6/6 solutions verified against sample I/O.

6 items

Codeforces Round 515 (Div. 3)

Div. 3 | 6 problems | 6/6 verified | Difficulty 1100-2100 | 24m 11s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Vova and Train	1100	math	15,427	6m 16s	✓
B	Heaters	1500	greedy, two-pointers	9,379	4m 14s	✓
C	Books Queries	1400	implementation	10,358	2m 55s	✓
D	Boxes Packing	1800	binary-search, implementation	5,945	2m 51s	✓
E	Binary Numbers AND Sum	1700	data-structures, implementation, math	6,575	3m 13s	✓
F	Yet another 2D Walking	2100	dp	2,269	4m 42s	✓

Practice › Codeforces Solutions › Codeforces Round 515 (Div. 3) ›

CF 1066E - Binary Numbers AND Sum

We are given two very large binary numbers, not as integers but as strings. The first number is fixed throughout the process, while the second number keeps shrinking. The process is mechanical: start with the full value of b.

Practice › Codeforces Solutions › Codeforces Round 515 (Div. 3) ›

CF 1066C - Books Queries

We are simulating a growing sequence of books placed on a shelf. Each book has a unique identifier, and we only ever add books either to the far left end or the far right end of the current arrangement. Over time, this produces a fixed linear ordering of all inserted books.

Practice › Codeforces Solutions › Codeforces Round 515 (Div. 3) ›

CF 1066D - Boxes Packing

We are given a sequence of objects laid out from left to right, each with a positive size, and a fixed number of identical boxes, each having the same capacity.

Practice › Codeforces Solutions › Codeforces Round 515 (Div. 3) ›

CF 1066F - Yet another 2D Walking

We are given a set of points in the first quadrant of the grid, and Maksim starts at the origin. In one move he can step to any of the four neighboring lattice points, so every move costs one unit of Manhattan distance. The key restriction is not geometric but structural.

Practice › Codeforces Solutions › Codeforces Round 515 (Div. 3) ›

CF 1066B - Heaters

We are given a one-dimensional house represented as a binary array. Some positions contain heaters, marked with 1, while empty positions are 0. Every heater, if activated, warms a continuous interval around its position.

Practice › Codeforces Solutions › Codeforces Round 515 (Div. 3) ›

CF 1066A - Vova and Train

The setting is a one-dimensional path from position 1 to position L, where time and position are synchronized so that at minute i, Vova is at coordinate i.