Codeforces Round 1093 (Div. 1)

6 problems from Codeforces Round 1093 (Div. 1) (contest 2219), difficulty -. 1/6 solutions verified against sample I/O.

6 items

Codeforces Round 1093 (Div. 1)

Div. 1 | 6 problems | 1/6 verified | Difficulty - | 15m 59s

#	Problem	Tags	Accepted	Time	✓
A	Grid L	brute-force, constructive-algorithms, math	8,928	1m 59s
B1	Unique Values (Easy version)	binary-search, constructive-algorithms, divide-and-conquer	3,577	1m 55s
B2	Unique Values (Hard version)	binary-search, bitmasks, constructive-algorithms	3,185	2m 3s
C	Coloring a Red Black Tree	dfs-and-similar, dp, greedy	1,199	3m 53s
D	MEX Replacement on Tree	data-structures, implementation, math	425	2m 11s
E	Weird Chessboard	constructive-algorithms, math	92	3m 58s	✓

Practice › Codeforces Solutions › Codeforces Round 1093 (Div. 1) ›

CF 2219E - Weird Chessboard

We are asked to construct a configuration of pieces on an $n times n$ chessboard such that every cell is "good." A piece placed at $(i,j)$ attacks every cell $(x,y)$ where $x ge i$ and $y ge j$, excluding the cell itself.

Practice › Codeforces Solutions › Codeforces Round 1093 (Div. 1) ›

CF 2219C - Coloring a Red Black Tree

We are given a tree with n nodes, where each node is initially colored either red or black according to a binary string. Red nodes are marked 1 and black nodes 0.

Practice › Codeforces Solutions › Codeforces Round 1093 (Div. 1) ›

CF 2219D - MEX Replacement on Tree

We are given a tree with n vertices rooted at vertex 1. Each vertex has a unique integer weight between 0 and n-1. For any vertex v, we define Sv as the set of weights along the path from the root to v, inclusive.

Practice › Codeforces Solutions › Codeforces Round 1093 (Div. 1) ›

CF 2219B2 - Unique Values (Hard version)

We are given an array of length $2n+1$ containing integers from $1$ to $n$. Every integer appears exactly twice, except one integer, which appears three times. Our task is to identify the positions of the integer that appears three times.

Practice › Codeforces Solutions › Codeforces Round 1093 (Div. 1) ›

CF 2219A - Grid L

We are given two types of tiles: unit-length segments (1×1 edges) and L-shaped pieces formed by joining two segments at a right angle.

Practice › Codeforces Solutions › Codeforces Round 1093 (Div. 1) ›

CF 2219B1 - Unique Values (Easy version)

We are given an array of length $2n+1$. Every number lies in the range $1$ to $n$. The structure is highly constrained: all values appear exactly twice except for one special value that appears exactly three times.