Educational Codeforces Round 141 (Rated for Div. 2)

Solutions for Educational Codeforces Round 141 (Rated for Div. 2) (contest 1783). 0/7 problems verified against sample I/O. Difficulty range: 800-2800.

7 items

Educational Codeforces Round 141 (Rated for Div. 2)

Type: Div. 2 | Problems: 7 | Verified: 0/7 | Rating range: 800-2800 | Time: 18m 50s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Make it Beautiful	800	constructive-algorithms, math, sortings	1m 43s	✗
B	Matrix of Differences	1100	constructive-algorithms, math	2m 48s	✗
C	Yet Another Tournament	1700	binary-search, greedy, sortings	1m 52s	✗
D	Different Arrays	2000	brute-force, dp, implementation	3m 23s	✗
E	Game of the Year	2300	brute-force, data-structures, math	2m 6s	✗
F	Double Sort II	2500	dfs-and-similar, flows, graph-matchings	1m 26s	✗
G	Weighed Tree Radius	2800	data-structures, divide-and-conquer, implementation	5m 32s	✗

Practice › Codeforces Solutions › Educational Codeforces Round 141 (Rated for Div. 2) ›

CF 1783G - Weighed Tree Radius

We are given a tree with $n$ vertices, where each vertex has an initial weight $ai$. Distances between vertices are measured in the usual unweighted tree sense (number of edges along the path), but we define a weighted distance from vertex $v$ to vertex $u$ as $wv(u) = dv(u) +…

Practice › Codeforces Solutions › Educational Codeforces Round 141 (Rated for Div. 2) ›

CF 1783D - Different Arrays

We start with a fixed integer array. The process described in the problem does not allow arbitrary modifications.

Practice › Codeforces Solutions › Educational Codeforces Round 141 (Rated for Div. 2) ›

CF 1783F - Double Sort II

We are given two rows of numbers, each row being a permutation of 1..n. Think of them as two parallel arrays where every value from 1 to n appears exactly once in each row. The only allowed move is driven by a value i, not by a position.

Practice › Codeforces Solutions › Educational Codeforces Round 141 (Rated for Div. 2) ›

CF 1783E - Game of the Year

For each boss, Monocarp would kill it on his a[i]-th personal attempt, while Polycarp would kill it on his b[i]-th personal attempt. The fight is divided into blocks of size k. Monocarp performs k attempts, then Polycarp performs k attempts, then Monocarp again, and so on.

Practice › Codeforces Solutions › Educational Codeforces Round 141 (Rated for Div. 2) ›

CF 1783B - Matrix of Differences

We are asked to construct an $n times n$ grid filled with the integers from $1$ to $n^2$ exactly once. Once the grid is built, we look at every pair of cells that share a side and compute the absolute difference of their values.

Practice › Codeforces Solutions › Educational Codeforces Round 141 (Rated for Div. 2) ›

CF 1783C - Yet Another Tournament

We are in a round-robin tournament with $n+1$ participants: you and $n$ opponents labeled from 1 to $n$. Every opponent pair plays exactly once, and stronger opponents always beat weaker ones: opponent $i$ beats $j$ if $i j$. Against you, the situation is different.

Practice › Codeforces Solutions › Educational Codeforces Round 141 (Rated for Div. 2) ›

CF 1783A - Make it Beautiful

We are given an array of integers sorted in non-decreasing order, and we need to rearrange its elements so that no element equals the sum of all previous elements. If such a rearrangement is impossible, we must report it.