Codeforces Round 1066 (Div. 1 + Div. 2)

9 problems from Codeforces Round 1066 (Div. 1 + Div. 2) (contest 2157), difficulty 800-3500. 3/9 solutions verified against sample I/O.

9 items

Codeforces Round 1066 (Div. 1 + Div. 2)

Div. 1+2 | 9 problems | 3/9 verified | Difficulty 800-3500 | 21m 20s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Dungeon Equilibrium	800	greedy, implementation, sortings	16,486	3m 8s	✓
B	Expansion Plan 2	900	implementation, math	12,839	1m 33s	✓
C	Meximum Array 2	1400	constructive-algorithms, greedy, implementation	9,234	3m 21s
D	Billion Players Game	1600	binary-search, greedy, math	5,995	1m 26s
E	Adjusting Drones	1900	binary-search, brute-force, data-structures	3,568	1m 57s
F	Git Gud	2400	brute-force, constructive-algorithms, divide-and-conquer	1,290	3m 8s	✓
G	Isaac's Queries	2800	bitmasks, brute-force, constructive-algorithms	411	1m 49s
H	Keygen 3	3200	brute-force, combinatorics, constructive-algorithms	116	1m 45s
I	Hyper Smawk Bros	3500	dp, games	171	3m 13s

Practice › Codeforces Solutions › Codeforces Round 1066 (Div. 1 + Div. 2) ›

CF 2157I - Hyper Smawk Bros

In Hyper Smawk Bros, two players take turns attacking a boss with health n. Each attack reduces the health by an integer damage x between 1 and m. The catch is that on your turn, you cannot repeat the exact damage your opponent used on the previous turn.

Practice › Codeforces Solutions › Codeforces Round 1066 (Div. 1 + Div. 2) ›

CF 2157H - Keygen 3

We are asked to construct permutations of size $n$ that satisfy two independent structural constraints, and then output as many distinct valid permutations as exist, capped at 2000.

Practice › Codeforces Solutions › Codeforces Round 1066 (Div. 1 + Div. 2) ›

CF 2157F - Git Gud

We are asked to simulate a sequence of missions that guarantees our skill reaches at least a target value n regardless of our starting skill s, which is unknown and can be any integer from 1 to n. Each mission has a difficulty y and a duration l.

Practice › Codeforces Solutions › Codeforces Round 1066 (Div. 1 + Div. 2) ›

CF 2157G - Isaac's Queries

We are dealing with a hidden array of integers, where each integer is in the range [0, 2^30). We are allowed to ask queries about contiguous subarrays.

Practice › Codeforces Solutions › Codeforces Round 1066 (Div. 1 + Div. 2) ›

CF 2157E - Adjusting Drones

We are managing a fleet of drones, each with an initial energy level. The rule is that no energy level should appear more than k times.

Practice › Codeforces Solutions › Codeforces Round 1066 (Div. 1 + Div. 2) ›

CF 2157C - Meximum Array 2

We are asked to construct an array of length $n$, where each position holds a non-negative integer, such that a collection of interval constraints is satisfied.

Practice › Codeforces Solutions › Codeforces Round 1066 (Div. 1 + Div. 2) ›

CF 2157A - Dungeon Equilibrium

We are given an array of integers, and the goal is to make it "balanced." An array is balanced if each number x that appears in it does so exactly x times. So if a number appears too few or too many times, we need to remove some elements to fix it.

Practice › Codeforces Solutions › Codeforces Round 1066 (Div. 1 + Div. 2) ›

CF 2157D - Billion Players Game

We are given a hidden integer position $p$ that will eventually be chosen somewhere inside a fixed interval $[l, r]$. We do not know the exact value, and our goal is to prepare a strategy before seeing $p$.

Practice › Codeforces Solutions › Codeforces Round 1066 (Div. 1 + Div. 2) ›

CF 2157B - Expansion Plan 2

We have an infinite 2D grid with a black cell initially at the origin (0, 0). We perform a sequence of expansion operations, each either type "4" or type "8".