Codeforces Round 562 (Div. 1)

5 problems from Codeforces Round 562 (Div. 1) (contest 1168), difficulty 1700-3100. 3/5 solutions verified against sample I/O.

5 items

Codeforces Round 562 (Div. 1)

Div. 1 | 5 problems | 3/5 verified | Difficulty 1700-3100 | 23m 43s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Increasing by Modulo	1700	binary-search, greedy	7,595	2m 19s	✓
B	Good Triple	1900	brute-force, two-pointers	3,811	3m 3s	✓
C	And Reachability	2200	bitmasks, dp	2,728	4m 57s	✓
D	Anagram Paths	3000	dp, implementation, trees	435	8m 7s
E	Xor Permutations	3100	constructive-algorithms, math	428	5m 17s

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

CF 1168D - Anagram Paths

We are given a rooted binary tree where each edge carries either a fixed lowercase letter or a wildcard character. Every leaf defines a string obtained by walking from the root to that leaf and concatenating edge labels.

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

CF 1168C - And Reachability

We are given a sequence of integers arranged on a line, and we want to answer connectivity queries between pairs of positions, but connectivity is not based on adjacency.

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

CF 1168E - Xor Permutations

We are given a multiset-like array of length $2^k$, where every value lies in the same range as indices of permutations of size $2^k$.

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

CF 1168B - Good Triple

We are given a binary string and we look at all possible contiguous substrings. For each substring, we want to know whether it contains a pattern of three equally spaced positions where all three characters are identical.

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

CF 1168A - Increasing by Modulo

We are given a circular-valued array where each element lies in the range from zero up to some fixed modulus minus one. One operation consists of choosing any subset of positions, and incrementing all chosen values by one with wraparound at the modulus boundary.