Codeforces Round 1065 (Div. 3)

9 problems from Codeforces Round 1065 (Div. 3) (contest 2171), difficulty 800-2400. 3/9 solutions verified against sample I/O.

9 items

Codeforces Round 1065 (Div. 3)

Div. 3 | 9 problems | 3/9 verified | Difficulty 800-2400 | 17m 12s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Shizuku Hoshikawa and Farm Legs	800	brute-force, math	37,229	36s
B	Yuu Koito and Minimum Absolute Sum	900	math	27,072	1m 24s	✓
C1	Renako Amaori and XOR Game (easy version)	1100	bitmasks, games, greedy	19,223	3m 41s
C2	Renako Amaori and XOR Game (hard version)	1400	bitmasks, games, greedy	11,832	1m 23s
D	Rae Taylor and Trees (easy version)	1400	binary-search, data-structures, dp	11,563	2m 1s
E	Anisphia Wynn Palettia and Good Permutations	2000	constructive-algorithms, greedy, number-theory	3,649	2m 1s	✓
F	Rae Taylor and Trees (hard version)	1600	binary-search, constructive-algorithms, data-structures	7,119	1m 54s
G	Sakura Adachi and Optimal Sequences	2000	bitmasks, combinatorics, greedy	2,321	2m 19s
H	Shiori Miyagi and Maximum Array Score	2400	binary-search, data-structures, dp	1,013	1m 53s	✓

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

CF 2171G - Sakura Adachi and Optimal Sequences

We are given two arrays of the same length, a and b, where each element of a is at most the corresponding element in b. The task is to transform a into b using two allowed operations: incrementing a single element of a by 1, or doubling all elements in a.

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

CF 2171H - Shiori Miyagi and Maximum Array Score

The task asks us to construct an array of length n with strictly increasing integers, all bounded by m, such that a particular score is maximized. The score is the sum of v(i, ai) from i=2 to n, where v(b, x) is the largest power k such that b^k divides x.

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

CF 2171F - Rae Taylor and Trees (hard version)

We are asked to construct a tree on $n$ vertices labeled from $1$ to $n$ such that for every edge connecting vertices $u$ and $v$ with $u < v$, the vertex $u$ appears before $v$ in a given permutation $p$.

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

CF 2171E - Anisphia Wynn Palettia and Good Permutations

We are asked to construct permutations of integers from 1 to n such that in every consecutive triplet of elements, at most six indices are "bad." An index i is bad if the three consecutive numbers starting at i are pairwise coprime.

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

CF 2171C1 - Renako Amaori and XOR Game (easy version)

Each test case gives two binary arrays of equal length. On position $i$, there is a pair of bits $(ai, bi)$. During the game, players go through indices from left to right.

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

CF 2171D - Rae Taylor and Trees (easy version)

We are asked to check whether a tree can be built from a permutation of numbers from 1 to n, subject to a specific ordering constraint.

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

CF 2171C2 - Renako Amaori and XOR Game (hard version)

We are asked to simulate a two-player game on two arrays of integers, a and b, each of length n. Players take turns: Ajisai moves on odd-numbered turns, Mai moves on even-numbered turns. On a player’s turn, they can swap the current element a[i] with b[i] or leave it as is.

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

CF 2171B - Yuu Koito and Minimum Absolute Sum

We are given an array of nonnegative integers with some entries marked as -1, representing blanks. Our task is to replace each blank with a nonnegative integer to minimize the absolute value of the sum of differences between consecutive elements.

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

CF 2171A - Shizuku Hoshikawa and Farm Legs

Error in message stream