Codeforces Round 1035 (Div. 2)

6 problems from Codeforces Round 1035 (Div. 2) (contest 2119), difficulty 800-3300. 2/6 solutions verified against sample I/O.

6 items

Codeforces Round 1035 (Div. 2)

Div. 2 | 6 problems | 2/6 verified | Difficulty 800-3300 | 9m 21s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Add or XOR	800	bitmasks, greedy, math	27,187	1m 23s	✓
B	Line Segments	1200	geometry, greedy, math	18,296	1m 11s	✓
C	A Good Problem	1300	bitmasks, constructive-algorithms, math	16,288	1m 37s
D	Token Removing	2100	combinatorics, dp, math	3,467	1m 37s
E	And Constraint	2600	bitmasks, dp, greedy	705	1m 39s
F	Volcanic Eruptions	3300	dfs-and-similar, dp, greedy	173	1m 54s

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

CF 2119F - Volcanic Eruptions

We are given a rooted tree where every node carries a value of either +1 or −1. A lava wave starts from the root and expands outward one edge per time unit, so at time t every node at distance at most t from the root is already unsafe.

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

CF 2119E - And Constraint

We are given two sequences, a of length n-1 and b of length n. The goal is to increase elements in b using the fewest increments so that for every adjacent pair (bi, b{i+1}), their bitwise AND equals ai.

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

CF 2119D - Token Removing

We are given sequences where each position i can store a value a[i] between 0 and i inclusive. Think of the index i as a time step and also as the right endpoint of a segment. Now interpret the process that defines the weight.

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

CF 2119C - A Good Problem

We are asked to construct an array of length n using integers within a given range [l, r], such that the bitwise AND of all elements equals the bitwise XOR of all elements. We do not need to output the full array; only the k-th element in lexicographical order.

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

CF 2119A - Add or XOR

We are given two non-negative integers a and b and two operations that can transform a. The first operation increments a by one at a cost x. The second operation flips the least significant bit of a (using a XOR 1) at a cost y.

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

CF 2119B - Line Segments

We are given two fixed points on a plane: a starting location and a destination. We also receive a sequence of movement lengths. At step i, we must move from our current position to any point whose Euclidean distance from the current position is exactly ai.