Codeforces Round 981 (Div. 3)

Solutions for Codeforces Round 981 (Div. 3) (contest 2033). 4/7 problems verified against sample I/O. Difficulty range: 800-2200.

7 items

Codeforces Round 981 (Div. 3)

Type: Div. 3 | Problems: 7 | Verified: 4/7 | Rating range: 800-2200 | Time: 11m 39s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Sakurako and Kosuke	800	constructive-algorithms, implementation, math	1m 43s	✗
B	Sakurako and Water	900	brute-force, constructive-algorithms, greedy	1m 12s	✗
C	Sakurako's Field Trip	1400	dp, greedy, two-pointers	2m 3s	✓
D	Kousuke's Assignment	1300	data-structures, dp, dsu	1m 32s	✓
E	Sakurako, Kosuke, and the Permutation	1400	brute-force, data-structures, dfs-and-similar	1m 18s	✓
F	Kosuke's Sloth	1800	brute-force, math, number-theory	2m 1s	✓
G	Sakurako and Chefir	2200	data-structures, dfs-and-similar, dp	1m 50s	✗

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

CF 2033G - Sakurako and Chefir

We are asked to analyze movement on a rooted tree. The tree has $n$ vertices, with vertex $1$ as the root. Chefir, starting at a given vertex $vi$, has a limited stamina $ki$.

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

CF 2033F - Kosuke's Sloth

For a fixed integer $k$, look at the Fibonacci sequence and mark every position whose Fibonacci value is divisible by $k$. For example, when $k=2$: $$1,1,mathbf{2},3,5,mathbf{8},13,21,mathbf{34},dots$$ The marked positions are $3,6,9,dots$.

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

CF 2033E - Sakurako, Kosuke, and the Permutation

We are given a permutation of numbers from 1 to n. We are allowed to repeatedly swap any two positions. After performing some swaps, we want the permutation to satisfy a structural condition on every index i.

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

CF 2033D - Kousuke's Assignment

We are given an array of integers and need to identify subarrays, or contiguous segments, whose sum is zero. These segments are called beautiful. The task is not just to find all beautiful segments but to maximize the number of them without overlaps.

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

CF 2033C - Sakurako's Field Trip

We are given a line of students, each associated with a topic of interest, represented by an integer. The disturbance of the line is counted as the number of adjacent pairs of students who share the same topic.

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

CF 2033A - Sakurako and Kosuke

We are asked to determine the winner of a turn-based game where two players move a dot along a number line starting at position zero. Sakurako always moves left by increasing odd numbers of units on her turn: -1, -5, -9, and so on.

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

CF 2033B - Sakurako and Water

We are given an $n times n$ grid of integers, where each cell represents a height. Negative values represent “bad” cells that we want to eliminate by increasing values.