Codeforces Round 530 (Div. 1)

6 problems from Codeforces Round 530 (Div. 1) (contest 1098), difficulty 1600-3500. 3/6 solutions verified against sample I/O.

6 items

Codeforces Round 530 (Div. 1)

Div. 1 | 6 problems | 3/6 verified | Difficulty 1600-3500 | 37m 57s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Sum in the tree	1600	constructive-algorithms, dfs-and-similar, greedy	9,547	9m 13s
B	Nice table	2100	brute-force, constructive-algorithms, greedy	1,797	5m 15s	✓
C	Construct a tree	2400	binary-search, constructive-algorithms, dfs-and-similar	1,161	5m 19s	✓
D	Eels	2800	data-structures	882	4m 20s	✓
E	Fedya the Potter	3400	binary-search, implementation, math	273	5m 43s
F	\u0416-function	3500	string-suffix-structures, strings	277	8m 7s

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

CF 1098F - Ж-function

We are given a fixed string and many substring queries. For each query, we take the substring and compute a specific aggregate over all its suffixes. For a string, the Z-function at position i measures how long the prefix of the string matches the substring starting at i.

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

CF 1098D - Eels

We maintain a dynamic multiset of positive integers, where each number represents the weight of an eel. After every update, we are asked to compute a value called “danger”, which depends on an optimal process of repeatedly merging all eels into a single one.

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

CF 1098E - Fedya the Potter

We are given an array and asked to repeatedly build new structures on top of derived information from its subarrays. The first transformation takes every contiguous segment and replaces it with the greatest integer that divides all elements inside that segment.

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

CF 1098A - Sum in the tree

We are given a rooted tree where vertex 1 is the root. Every vertex originally had a non-negative integer value written on it, but those values are now lost. What remains is partial information about prefix sums along root paths.

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

CF 1098C - Construct a tree

We are asked to build a rooted tree on vertices labeled from 1 to n, where vertex 1 is fixed as the root. Each node except the root has exactly one parent, so the structure is fully determined by the parent array.

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

CF 1098B - Nice table

We are given a grid of size $n times m$, where each cell contains one of four characters: A, G, C, or T. We need to construct a new grid of the same dimensions that satisfies a strict local rule: every 2 by 2 subgrid must contain all four different characters exactly once.