Codeforces Round 817 (Div. 4)

7 problems from Codeforces Round 817 (Div. 4) (contest 1722), difficulty 800-1700. 3/7 solutions verified against sample I/O.

7 items

Codeforces Round 817 (Div. 4)

Div. 4 | 7 problems | 3/7 verified | Difficulty 800-1700 | 21m 51s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Spell Check	800	implementation	65,585	2m 2s	✓
B	Colourblindness	800	implementation	56,428	2m 14s	✓
C	Word Game	800	data-structures, implementation	36,163	4m 33s
D	Line	1100	greedy, sortings	26,546	3m 13s
E	Counting Rectangles	1600	brute-force, data-structures, dp	13,352	4m 54s
F	L-shapes	1700	dfs-and-similar, implementation	8,006	1m 48s	✓
G	Even-Odd XOR	1500	bitmasks, constructive-algorithms, greedy	14,169	3m 7s

Practice › Codeforces Solutions › Codeforces Round 817 (Div. 4) ›

CF 1722G - Even-Odd XOR

We are asked to construct, for each test case, a sequence of distinct nonnegative integers, all strictly below $2^{31}$, with a very specific balancing condition.

Practice › Codeforces Solutions › Codeforces Round 817 (Div. 4) ›

CF 1722E - Counting Rectangles

We are given a collection of axis-aligned rectangles, each defined by its height and width. For every query, we are also given two bounding rectangles: a “small inner constraint” rectangle and a “large outer constraint” rectangle.

Practice › Codeforces Solutions › Codeforces Round 817 (Div. 4) ›

CF 1722D - Line

We are given a row of people, each either facing left or right. The contribution of a person depends on how many people lie in the direction they are looking.

Practice › Codeforces Solutions › Codeforces Round 817 (Div. 4) ›

CF 1722C - Word Game

Each test case describes a small three-player word submission game. Every player independently writes down the same number of short strings, each string having length exactly three. After all words are written, scoring is determined by how many people included each distinct word.

Practice › Codeforces Solutions › Codeforces Round 817 (Div. 4) ›

CF 1722B - Colourblindness

We are given a very small grid with exactly two horizontal strips and some number of vertical columns. Each cell contains one of three colors, but the viewer is colorblind in a specific way: green and blue are indistinguishable, while red remains distinct from both.

Practice › Codeforces Solutions › Codeforces Round 817 (Div. 4) ›

CF 1722A - Spell Check

We are given a short string in each test case and we need to decide whether it can be interpreted as a rearrangement of the name “Timur” under a very specific spelling rule. The rule is not just that the letters match.

Practice › Codeforces Solutions › Codeforces Round 817 (Div. 4) ›

CF 1722F - L-shapes

We are given a rectangular grid with cells that are either empty or shaded. Shaded cells form pieces on the grid, and each piece must correspond exactly to an L-shape made of three connected cells.