Codeforces Round 659 (Div. 1)

5 problems from Codeforces Round 659 (Div. 1) (contest 1383), difficulty 1700-3200. 3/5 solutions verified against sample I/O.

5 items

Codeforces Round 659 (Div. 1)

Div. 1 | 5 problems | 3/5 verified | Difficulty 1700-3200 | 14m 47s

#	Problem	Rating	Tags	Accepted	Time	✓
A	String Transformation 1	1700	dsu, graphs, greedy	11,263	1m 37s	✓
B	GameGame	1900	bitmasks, constructive-algorithms, dp	5,440	1m 32s	✓
C	String Transformation 2	3100	bitmasks, dp, graphs	663	4m 49s
D	Rearrange	2800	brute-force, constructive-algorithms, graphs	761	5m 10s
F	Special Edges	3200	flows, graphs	437	1m 39s	✓

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

CF 1383D - Rearrange

We are given a complete permutation of numbers from 1 to $n cdot m$ arranged in an $n times m$ grid. From this grid we extract two small summaries: the set of row maxima and the set of column maxima.

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

CF 1383C - String Transformation 2

We are given two strings of equal length, built from a small alphabet of 20 letters. We start with string A and want to transform it into string B using a specific operation. One operation works like this: pick a letter x.

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

CF 1383F - Special Edges

We have a directed flow network with source 1 and sink n. The first k edges are special. Their capacities are not fixed. Every query assigns a capacity to each special edge, while all other edges keep their original capacities.

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

CF 1383A - String Transformation 1

We are given two strings A and B of the same length, using only the first 20 lowercase letters from a to t. We are allowed to repeatedly select a group of positions in A that all contain the same letter x and replace them with a strictly larger letter y.

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

CF 1383B - GameGame

The problem describes a two-player game played on an array of non-negative integers. The players take turns removing an element from the array and XOR-ing it with their current score.