Codeforces Round 734 (Div. 3)

7 problems from Codeforces Round 734 (Div. 3) (contest 1551), difficulty 800-2200. 4/7 solutions verified against sample I/O.

7 items

Codeforces Round 734 (Div. 3)

Div. 3 | 7 problems | 4/7 verified | Difficulty 800-2200 | 36m 51s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Polycarp and Coins	800	greedy, math	58,331	3m 20s	✓
B1	Wonderful Coloring - 1	800	greedy, strings	31,317	5m 2s	✓
B2	Wonderful Coloring - 2	1400	binary-search, constructive-algorithms, data-structures	16,661	7m 25s
C	Interesting Story	1500	greedy, sortings, strings	14,538	4m 47s	✓
D1	Domino (easy version)	1700	constructive-algorithms, math	7,573	7m 9s
D2	Domino (hard version)	2100	constructive-algorithms, implementation, math	2,990	5m 14s
F	Equidistant Vertices	2200	brute-force, combinatorics, dfs-and-similar	2,177	3m 54s	✓

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

CF 1551D1 - Domino (easy version)

We are given a rectangular board with $n$ rows and $m$ columns, containing $n cdot m$ unit cells. Since this product is even, the board can be fully tiled by dominoes, where each domino always covers exactly two adjacent cells sharing a side.

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

CF 1551B1 - Wonderful Coloring - 1

We are given a string made of lowercase Latin letters. We want to select some of its positions and assign each selected position one of two colors, red or green, with three rules. First, every chosen position gets exactly one color, while some positions may remain unpainted.

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

CF 1551F - Equidistant Vertices

The task is about selecting a subset of vertices in a tree such that every pair of chosen vertices is equally far apart.

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

CF 1551D2 - Domino (hard version)

We are given a rectangular grid with $n$ rows and $m$ columns, and we must tile it completely using dominoes, each covering exactly two adjacent cells. Every cell must belong to exactly one domino, so the grid is fully partitioned into pairs of neighbors.

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

CF 1551B2 - Wonderful Coloring - 2

We are given several test cases. In each case there is a sequence of integers and a number of colors. We want to “paint” some occurrences of these integers using up to $k$ colors, with the option to leave elements unpainted. The constraints inside the coloring are subtle.

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

CF 1551C - Interesting Story

We are given several independent test cases. In each test case, we receive a list of words, and we want to select as many of these words as possible so that the selected subset satisfies a specific imbalance condition.

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

CF 1551A - Polycarp and Coins

Polycarp needs to pay exactly n burles using only coins worth 1 burle and 2 burles. Let c1 be the number of 1-burle coins and c2 be the number of 2-burle coins.