Codeforces Round 648 (Div. 2)

5 problems from Codeforces Round 648 (Div. 2) (contest 1365), difficulty 1100-2800. 3/5 solutions verified against sample I/O.

5 items

Codeforces Round 648 (Div. 2)

Div. 2 | 5 problems | 3/5 verified | Difficulty 1100-2800 | 18m

#	Problem	Rating	Tags	Accepted	Time	✓
A	Matrix Game	1100	games, greedy, implementation	25,046	8m 5s	✓
B	Trouble Sort	1300	constructive-algorithms, implementation	28,831	1m 45s	✓
E	Maximum Subsequence Value	1900	brute-force, constructive-algorithms	8,318	3m 39s	✓
F	Swaps Again	2100	constructive-algorithms, implementation, sortings	4,756	2m 28s
G	Secure Password	2800	bitmasks, combinatorics, constructive-algorithms	1,415	2m 3s

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

CF 1365F - Swaps Again

We are given two arrays of equal length and a very specific transformation rule. Starting from the first array, we are allowed to repeatedly pick a split size and swap two equal-length blocks: the prefix of that size and the suffix of the same size.

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

CF 1365G - Secure Password

We are given an unknown array of non-negative integers, each up to 64-bit range. We cannot see the array directly. Instead, we can query any subset of indices, and the judge returns the bitwise OR of the elements at those positions.

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

CF 1365A - Matrix Game

We are given a grid where some cells are already occupied. Two players alternate turns, and on each move a player must pick a previously unused cell under a strong restriction: no two chosen cells are allowed to share a row or a column.

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

CF 1365E - Maximum Subsequence Value

We are given an array of up to 500 positive integers. We may choose any non-empty subsequence and compute its value according to a bitwise rule.

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

CF 1365B - Trouble Sort

We are given a sequence of numbers ai each tagged with a type bi that is either 0 or 1. The task is to determine if it is possible to sort the sequence in non-decreasing order by only swapping elements of different types.