Codeforces Round 1071 (Div. 3)

8 problems from Codeforces Round 1071 (Div. 3) (contest 2179), difficulty 800-2200. 1/8 solutions verified against sample I/O.

8 items

Codeforces Round 1071 (Div. 3)

Div. 3 | 8 problems | 1/8 verified | Difficulty 800-2200 | 17m 58s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Blackslex and Password	800	math, strings	34,401	5m 16s
B	Blackslex and Showering	800	dp, greedy, implementation	28,324	1m 19s	✓
C	Blackslex and Number Theory	1100	implementation, math, number-theory	22,283	2m 22s
D	Blackslex and Penguin Civilization	1300	bitmasks, constructive-algorithms, greedy	13,501	1m 48s
E	Blackslex and Girls	1800	constructive-algorithms, geometry, math	5,770	2m 7s
F	Blackslex and Another RGB Walking	2000	communication, constructive-algorithms, graphs	2,746	1m 44s
G	Blackslex and Penguin Migration	2200	brute-force, interactive, math	1,208	1m 54s
H	Blackslex and Plants	2200	bitmasks, data-structures, dp	1,301	1m 28s

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

CF 2179G - Blackslex and Penguin Migration

We are asked to reconstruct the positions of penguins on an $n times n$ grid after a migration, knowing only the Manhattan distances between pairs of penguins.

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

CF 2179H - Blackslex and Plants

We are given a line of plants indexed from 1 to n, all initially holding zero water. Each query specifies a segment $[l, r]$, and for every position $i$ in that segment we add a value that depends on how far $i$ is from $l$.

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

CF 2179A - Blackslex and Password

We are asked to determine, for given integers $k$ and $x$, the smallest string length $n$ for which no valid password exists under specific rules. Each password uses only the first $k$ lowercase letters.

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

CF 2179F - Blackslex and Another RGB Walking

We are asked to solve a two-part communication problem on a connected bipartite graph. In the first part, the agent colors vertices using three colors to encode directional information.

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

CF 2179E - Blackslex and Girls

We are asked to divide voters into districts according to a binary pattern while respecting minimum district sizes. Specifically, we have two parties, A and B, with a total of x and y voters, respectively.

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

CF 2179D - Blackslex and Penguin Civilization

We are asked to construct a permutation of all integers from $0$ to $2^n - 1$. The quality of a permutation is defined through a running process over prefixes: we maintain the bitwise AND of the prefix seen so far, and at each step we add the number of set bits in that AND…

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

CF 2179C - Blackslex and Number Theory

Working

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

CF 2179B - Blackslex and Showering

We are given a sequence of floors that Blackslex needs to visit in order, and moving between floors takes time proportional to the absolute difference between consecutive floors. Blackslex can skip at most one floor in the sequence.