Codeforces Round 634 (Div. 3)

5 problems from Codeforces Round 634 (Div. 3) (contest 1335), difficulty 900-2200. 0/5 solutions verified against sample I/O.

5 items

Codeforces Round 634 (Div. 3)

Div. 3 | 5 problems | 0/5 verified | Difficulty 900-2200 | 14m 22s

#	Problem	Rating	Tags	Accepted	Time
B	Construct the String	900	constructive-algorithms	42,582	2m 4s
C	Two Teams Composing	1100	binary-search, greedy, implementation	38,955	2m 50s
D	Anti-Sudoku	1300	constructive-algorithms, implementation	29,456	2m 22s
E2	Three Blocks Palindrome (hard version)	1800	brute-force, data-structures, dp	9,373	5m 55s
F	Robots on a Grid	2200	data-structures, dfs-and-similar, dsu	2,422	1m 11s

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

CF 1335E2 - Three Blocks Palindrome (hard version)

Codeforces 1335E2: Three Blocks Palindrome (hard version)

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

CF 1335F - Robots on a Grid

Each cell in the grid behaves like a deterministic state in a directed graph. From every cell, there is exactly one outgoing edge pointing to one of its four neighbors, as dictated by the arrow in that cell.

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

CF 1335C - Two Teams Composing

We are given a multiset of student skills for each test case. From this pool we must form two disjoint groups of students, both of the same size, say $x$.

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

CF 1335D - Anti-Sudoku

We start with a fully valid Sudoku grid. Every row, every column, and every 3 by 3 subgrid contains the digits 1 through 9 exactly once.

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

CF 1335B - Construct the String

For each test case we have to build a lowercase string of length n. The condition is that every contiguous segment of length a must contain exactly b different letters. Any valid string is acceptable. The numbers describe a sliding window condition. If we look at positions 1...