Codeforces Round 1060 (Div. 2)

8 problems from Codeforces Round 1060 (Div. 2) (contest 2154), difficulty 800-3300. 2/8 solutions verified against sample I/O.

8 items

Codeforces Round 1060 (Div. 2)

Div. 2 | 8 problems | 2/8 verified | Difficulty 800-3300 | 15m 6s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Notelock	800	greedy, two-pointers	23,153	1m 36s
B	Make it Zigzag	1000	constructive-algorithms, greedy	19,800	1m 57s
C1	No Cost Too Great (Easy Version)	1400	greedy, implementation, math	13,534	1m 18s	✓
C2	No Cost Too Great (Hard Version)	2000	greedy, math, number-theory	5,507	1m 59s	✓
D	Catshock	1900	constructive-algorithms, dfs-and-similar, graphs	4,760	3m 16s
E	No Mind To Think	2500	binary-search, divide-and-conquer, greedy	1,202	1m 42s
F1	Bombing (Easy Version)	2700	brute-force, combinatorics, constructive-algorithms	565	1m 41s
F2	Bombing (Hard Version)	3300	combinatorics, dp	175	1m 37s

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

CF 2154F2 - Bombing (Hard Version)

We are asked to count the number of ways to fill in missing values in a partially specified permutation such that the resulting permutation can be split into two consecutive subsequences whose combined order gives the sorted permutation from $1$ to $n$.

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

CF 2154F1 - Bombing (Easy Version)

We are given an array of length $n$ that is supposed to be a permutation of $1 dots n$, but some positions are unknown and marked as $-1$.

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

CF 2154D - Catshock

The tree represents a world where a cat starts at node 1 and tries to reach node n. You cannot directly control the cat’s path when it moves.

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

CF 2154E - No Mind To Think

We are given an array of positive integers. We are allowed to choose one odd length $x$, and then repeatedly perform an operation up to $k$ times. Each operation picks any subsequence of length $x$, computes its median, and overwrites all chosen elements with that median value.

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

CF 2154C2 - No Cost Too Great (Hard Version)

We are given an array of integers a, where each element behaves like a “value sitting on a position”, and a second array b which describes how expensive it is to increase each corresponding a[i] by 1.

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

CF 2154B - Make it Zigzag

We are given an array of integers and want to transform it into a zigzag sequence. A zigzag array is one where each element alternates between being smaller and larger than its neighbor: the first element is smaller than the second, the second is larger than the third, and so on.

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

CF 2154A - Notelock

We are given a binary string consisting of 0s and 1s and a positive integer k. Each 1 in the string can be “turned off” by Teto according to a simple local rule: if a 1 is not protected and there are no other 1s in the previous k-1 positions, it can be changed to 0.

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

CF 2154C1 - No Cost Too Great (Easy Version)

We are given an array of positive integers a of length n. For each element ai, we can increment it by 1 any number of times at a cost of 1 per increment.