Codeforces Round 746 (Div. 2)

Solutions for Codeforces Round 746 (Div. 2) (contest 1592). 3/7 problems verified against sample I/O. Difficulty range: 800-2800.

7 items

Codeforces Round 746 (Div. 2)

Type: Div. 2 | Problems: 7 | Verified: 3/7 | Rating range: 800-2800 | Time: 21m 17s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Gamer Hemose	800	binary-search, greedy, math	1m 38s	✓
B	Hemose Shopping	1200	constructive-algorithms, dsu, math	1m 50s	✓
C	Bakry and Partitioning	1700	bitmasks, constructive-algorithms, dfs-and-similar	8m 32s	✓
D	Hemose in ICPC ?	2300	binary-search, dfs-and-similar, implementation	1m 53s	✗
E	Bored Bakry	2400	bitmasks, greedy, math	2m 14s	✗
F1	Alice and Recoloring 1	2600	constructive-algorithms, greedy	3m 4s	✗
F2	Alice and Recoloring 2	2800	constructive-algorithms, flows, graph-matchings	2m 6s	✗

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

CF 1592C - Bakry and Partitioning

Thank you. Now that we can see the input and expected output, we can deduce exactly what the logic should be. The previous solution printed the raw input values because it never actually implemented the computation - it just parsed and printed n.

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

CF 1592F1 - Alice and Recoloring 1

We are asked to transform a white grid into a target pattern of black and white cells using four types of rectangle-flip operations, each anchored at a corner and each with a different cost. Flipping a rectangle means inverting the color of all the cells inside it.

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

CF 1592F2 - Alice and Recoloring 2

We are given an $n times m$ grid that starts completely white, and we want to transform it into a target pattern of white and black cells. The only allowed moves are flipping all cells in a subrectangle that must touch one of the four corners of the grid.

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

CF 1592E - Bored Bakry

We are given a sequence of integers and asked to find the longest contiguous segment where a specific bitwise inequality holds: the bitwise AND of all elements in the segment is strictly greater than the bitwise XOR of the same segment.

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

CF 1592D - Hemose in ICPC ?

We are given a tree where each edge has an unknown positive weight. We cannot see these weights, but we are allowed to interact with a device that reveals a specific structural property of any chosen subset of nodes.

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

CF 1592B - Hemose Shopping

We are given an array of integers and a restriction on swapping elements: we can only swap two elements if their positions differ by at least x. The task is to determine whether it is possible to sort the array in non-decreasing order under this constraint.

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

CF 1592A - Gamer Hemose

We are asked to determine how quickly an Agent in a game can defeat an enemy with a given health using a set of weapons, each with a fixed damage. The Agent can attack multiple times, but cannot use the same weapon twice in a row.