Codeforces Round 631 (Div. 1) - Thanks, Denis aramis Shitov!

5 problems from Codeforces Round 631 (Div. 1) - Thanks, Denis aramis Shitov! (contest 1329), difficulty 1700-3300. 2/5 solutions verified against sample I/O.

5 items

Codeforces Round 631 (Div. 1) - Thanks, Denis aramis Shitov!

Div. 1 | 5 problems | 2/5 verified | Difficulty 1700-3300 | 23m 52s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Dreamoon Likes Coloring	1800	constructive-algorithms, greedy, implementation	9,669	5m 5s
B	Dreamoon Likes Sequences	1700	bitmasks, combinatorics, math	7,056	6m 56s	✓
C	Drazil Likes Heap	2400	constructive-algorithms, data-structures, greedy	1,804	5m 42s
D	Dreamoon Likes Strings	3100	constructive-algorithms, data-structures	536	3m 12s
E	Dreamoon Loves AA	3300	binary-search, greedy	265	2m 57s	✓

Practice › Codeforces Solutions › Codeforces Round 631 (Div. 1) - Thanks, Denis aramis Shitov! ›

CF 1329E - Dreamoon Loves AA

We are given a very long binary string consisting only of the characters A and B, with the guarantee that the first and last characters are always A. In addition to these fixed endpoints, we are given the positions of some other A characters inside the string.

Practice › Codeforces Solutions › Codeforces Round 631 (Div. 1) - Thanks, Denis aramis Shitov! ›

CF 1329D - Dreamoon Likes Strings

We are given a string that evolves under a deletion game. In one move, we are allowed to pick a contiguous substring, but only if that substring is “locally alternating”, meaning no two adjacent characters inside it are equal.

Practice › Codeforces Solutions › Codeforces Round 631 (Div. 1) - Thanks, Denis aramis Shitov! ›

CF 1329B - Dreamoon Likes Sequences

We are asked to count how many strictly increasing sequences of integers we can choose from the range $[1, d]$, with an extra constraint that depends on cumulative XORs of the chosen values.

Practice › Codeforces Solutions › Codeforces Round 631 (Div. 1) - Thanks, Denis aramis Shitov! ›

CF 1329C - Drazil Likes Heap

Codeforces 1329C: Drazil Likes Heap

Practice › Codeforces Solutions › Codeforces Round 631 (Div. 1) - Thanks, Denis aramis Shitov! ›

CF 1329A - Dreamoon Likes Coloring

We are given a row of cells initially all unpainted. We will perform a sequence of painting operations, where each operation paints a contiguous segment of fixed length, but we are free to choose the starting position of that segment.