Codeforces Round 122 (Div. 1)

Solutions for Codeforces Round 122 (Div. 1) (contest 193). 3/4 problems verified against sample I/O. Difficulty range: 1700-2900.

4 items

Codeforces Round 122 (Div. 1)

Type: Div. 1 | Problems: 4 | Verified: 3/4 | Rating range: 1700-2900 | Time: 8m 3s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Cutting Figure	1700	constructive-algorithms, graphs, trees	1m 41s	✓
B	Xor	2000	brute-force	1m 53s	✓
C	Hamming Distance	2400	constructive-algorithms, greedy, math	2m 31s	✗
D	Two Segments	2900	data-structures	1m 58s	✓

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

CF 193A - Cutting Figure

We are given a rectangular grid where some cells are painted with . All painted cells initially form one connected component using 4-directional adjacency, meaning movement is allowed only through shared sides. We may delete painted cells one by one.

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

CF 193B - Xor

We start with an array a and must perform exactly u operations. Every operation is one of two types. The first type applies a bitwise xor independently to every position: $$ai leftarrow ai oplus bi$$ The second type simultaneously permutes the array using permutation p and…

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

CF 193C - Hamming Distance

We are given the six pairwise Hamming distances between four unknown binary strings. Every string contains only 'a' and 'b', and all four strings must have the same length. The task is not to recover the original strings.

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

CF 193D - Two Segments

We are given a permutation of numbers from 1 to n. We want to count all sets of positions that can be represented as two non-overlapping segments and whose values form a consecutive range of integers.