Ethflow Round 1 (Codeforces Round 1001, Div. 1 + Div. 2)

9 problems from Ethflow Round 1 (Codeforces Round 1001, Div. 1 + Div. 2) (contest 2062), difficulty 800-3500. 1/9 solutions verified against sample I/O.

9 items

Ethflow Round 1 (Codeforces Round 1001, Div. 1 + Div. 2)

Div. 1+2 | 9 problems | 1/9 verified | Difficulty 800-3500 | 17m 45s

#	Problem	Rating	Tags	Accepted	Time	✓
A	String	800	constructive-algorithms, greedy, math	28,273	1m 47s	✓
B	Clockwork	900	greedy, math	23,742	2m 7s
C	Cirno and Operations	1200	brute-force, math	18,381	1m 48s
D	Balanced Tree	2200	dfs-and-similar, dp, graphs	3,541	1m 57s
E1	The Game (Easy Version)	2000	data-structures, dfs-and-similar, games	4,328	1m 55s
E2	The Game (Hard Version)	3000	data-structures, dfs-and-similar, games	450	1m 38s
F	Traveling Salescat	2900	constructive-algorithms, dp, geometry	613	2m 21s
G	Permutation Factory	3500	flows, geometry, graph-matchings	174	1m 55s
H	Galaxy Generator	3500	bitmasks, combinatorics, dp	174	2m 17s

Practice › Codeforces Solutions › Ethflow Round 1 (Codeforces Round 1001, Div. 1 + Div. 2) ›

CF 2062F - Traveling Salescat

We are given a set of cities, each described by two integers $ai$ and $bi$. Roads exist between every pair of cities, and the cost of traveling from city $i$ to city $j$ is defined as $max(ai + bj, bi + aj)$.

Practice › Codeforces Solutions › Ethflow Round 1 (Codeforces Round 1001, Div. 1 + Div. 2) ›

CF 2062H - Galaxy Generator

We are given a two-dimensional grid of size $n times n$ representing stars. A star is present at cell $(x, y)$ if the corresponding grid entry is 1.

Practice › Codeforces Solutions › Ethflow Round 1 (Codeforces Round 1001, Div. 1 + Div. 2) ›

CF 2062G - Permutation Factory

We are given two permutations of length $n$, $p$ and $q$, and our goal is to transform $p$ into $q$ using a sequence of swap operations.

Practice › Codeforces Solutions › Ethflow Round 1 (Codeforces Round 1001, Div. 1 + Div. 2) ›

CF 2062E2 - The Game (Hard Version)

We are given a tree with n nodes rooted at node 1, and each node has an associated integer weight. Cirno and Daiyousei play a sequential game on this tree.

Practice › Codeforces Solutions › Ethflow Round 1 (Codeforces Round 1001, Div. 1 + Div. 2) ›

CF 2062D - Balanced Tree

We are given a rooted tree where each node has a range of allowable values [li, ri]. Initially, each node can be assigned any value within its range. The goal is to make the tree balanced, meaning all nodes have the same final value.

Practice › Codeforces Solutions › Ethflow Round 1 (Codeforces Round 1001, Div. 1 + Div. 2) ›

CF 2062E1 - The Game (Easy Version)

We are given a rooted tree where each node has a weight. Two players play a turn-based game. On each move, a player chooses a node whose weight is strictly larger than the weight chosen in the previous move and deletes its entire subtree.

Practice › Codeforces Solutions › Ethflow Round 1 (Codeforces Round 1001, Div. 1 + Div. 2) ›

CF 2062B - Clockwork

We are asked to determine if we can indefinitely avoid letting any clock hit zero in a sequence of clocks. Each clock has an initial time ai. Every second, all clocks decrease by one. We can move to an adjacent clock and immediately reset its time back to ai.

Practice › Codeforces Solutions › Ethflow Round 1 (Codeforces Round 1001, Div. 1 + Div. 2) ›

CF 2062C - Cirno and Operations

We are given an array and allowed to repeatedly transform it using two operations: reversing it, or replacing it by its difference array, which shrinks the array by one element where each new value is the difference between consecutive elements.

Practice › Codeforces Solutions › Ethflow Round 1 (Codeforces Round 1001, Div. 1 + Div. 2) ›

CF 2062A - String

We are given a binary string consisting of characters 0 and 1. The goal is to convert every character in the string to 0.