Codeforces Round 469 (Div. 1)

6 problems from Codeforces Round 469 (Div. 1) (contest 949), difficulty 1600-3300. 2/6 solutions verified against sample I/O.

6 items

Codeforces Round 469 (Div. 1)

Div. 1 | 6 problems | 2/6 verified | Difficulty 1600-3300 | 14m 46s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Zebras	1600	greedy	5,655	1m 32s
B	A Leapfrog in the Array	1700	constructive-algorithms, math	3,833	1m 32s
C	Data Center Maintenance	1900	dfs-and-similar, graphs	2,252	5m 25s
D	Curfew	2300	binary-search, brute-force, greedy	881	3m 41s
E	Binary Cards	2700	brute-force	769	1m 27s	✓
F	Astronomy	3300	geometry, probabilities	63	1m 9s	✓

Practice › Codeforces Solutions › Codeforces Round 469 (Div. 1) ›

CF 949C - Data Center Maintenance

Codeforces 949C: Data Center Maintenance

Practice › Codeforces Solutions › Codeforces Round 469 (Div. 1) ›

CF 949D - Curfew

There are n rooms arranged in a line. Each room must end up with exactly b students being counted by inspectors, but initially the distribution is arbitrary as an array a[i], and the total number of students equals n · b, so globally there is just enough “mass” to satisfy…

Practice › Codeforces Solutions › Codeforces Round 469 (Div. 1) ›

CF 949F - Astronomy

We are given 2n lattice points in the plane, each representing a star. Somewhere in the original astronomical configuration there existed a special point, the Moon, with integer coordinates, such that the stars could be partitioned into n pairs with a very rigid geometric…

Practice › Codeforces Solutions › Codeforces Round 469 (Div. 1) ›

CF 949E - Binary Cards

We are allowed to build a multiset of “coins”, where each coin has a value that is either a positive or negative power of two. In every round, a target integer is announced, and we must be able to select some subset of our fixed coins so that their sum equals that target.

Practice › Codeforces Solutions › Codeforces Round 469 (Div. 1) ›

CF 949A - Zebras

We are given a binary string representing a chronological sequence of days, where each character is either 0 or 1.

Practice › Codeforces Solutions › Codeforces Round 469 (Div. 1) ›

CF 949B - A Leapfrog in the Array

We start with numbers from 1 to $n$. Instead of placing them directly into positions $1$ through $n$, each number $i$ is initially placed at position $2i-1$. So the array of length $2n$ has numbers only in odd positions, while even positions are empty.