Codeforces Round 737 (Div. 2)

5 problems from Codeforces Round 737 (Div. 2) (contest 1557), difficulty 800-2800. 3/5 solutions verified against sample I/O.

5 items

Codeforces Round 737 (Div. 2)

Div. 2 | 5 problems | 3/5 verified | Difficulty 800-2800 | 19m 9s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Ezzat and Two Subsequences	800	brute-force, math, sortings	29,144	3m 16s	✓
B	Moamen and k-subarrays	1100	greedy, sortings	24,608	3m 16s	✓
C	Moamen and XOR	1700	bitmasks, combinatorics, dp	10,496	5m 29s	✓
D	Ezzat and Grid	2200	data-structures, dp, greedy	3,002	5m 8s
E	Assiut Chess	2800	brute-force, constructive-algorithms, interactive	764	2m

Practice › Codeforces Solutions › Codeforces Round 737 (Div. 2) ›

CF 1557D - Ezzat and Grid

We are given a very wide grid with a small number of rows. Each row is not stored explicitly as a full binary string. Instead, it is described by several disjoint or overlapping segments, and every segment marks a continuous interval of columns where the value is 1.

Practice › Codeforces Solutions › Codeforces Round 737 (Div. 2) ›

CF 1557E - Assiut Chess

We are playing an interactive game on an 8 by 8 chessboard. There is a queen that we control and a king controlled by the judge. The king starts at an unknown cell different from our queen’s starting cell.

Practice › Codeforces Solutions › Codeforces Round 737 (Div. 2) ›

CF 1557A - Ezzat and Two Subsequences

We are given an array of integers, and we must split it into two non-empty groups while preserving every element exactly once. Each group has a score equal to its arithmetic mean, and the goal is to maximize the sum of these two means.

Practice › Codeforces Solutions › Codeforces Round 737 (Div. 2) ›

CF 1557B - Moamen and k-subarrays

We are given an array of distinct integers and allowed to perform a very specific transformation exactly once. First, we cut the array into exactly k contiguous pieces, each piece non-empty.

Practice › Codeforces Solutions › Codeforces Round 737 (Div. 2) ›

CF 1557C - Moamen and XOR

We are counting how many arrays of length n can be formed when each element is an integer in the range [0, 2^k - 1], with the additional constraint that a certain bitwise inequality holds.