Codeforces Round 526 (Div. 1)

6 problems from Codeforces Round 526 (Div. 1) (contest 1083), difficulty 1800-3500. 2/6 solutions verified against sample I/O.

6 items

Codeforces Round 526 (Div. 1)

Div. 1 | 6 problems | 2/6 verified | Difficulty 1800-3500 | 14m 56s

#	Problem	Rating	Tags	Accepted	Time	✓
A	The Fair Nut and the Best Path	1800	data-structures, dp, trees	6,268	2m 11s	✓
B	The Fair Nut and Strings	2000	greedy, strings	2,142	2m 28s
C	Max Mex	2900	data-structures, trees	1,112	2m 13s	✓
D	The Fair Nut's getting crazy	3500	data-structures, implementation	356	2m 19s
E	The Fair Nut and Rectangles	2400	data-structures, dp, geometry	5,611	2m 30s
F	The Fair Nut and Amusing Xor	3300	data-structures	315	3m 15s

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

CF 1083F - The Fair Nut and Amusing Xor

Two arrays evolve over time, and after each update we must determine how many operations are needed to make them identical under a very specific operation model.

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

CF 1083E - The Fair Nut and Rectangles

Each rectangle is anchored at the origin and stretches to a point $(xi, yi)$, so geometrically every rectangle is a lower-left aligned axis-parallel rectangle.

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

CF 1083D - The Fair Nut's getting crazy

We are given an array and we want to count how many ordered pairs of subarrays behave in a very specific geometric way on the index line. Each subarray is a contiguous segment on indices. We choose two such segments. They must overlap, so their intersection is not empty.

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

CF 1083B - The Fair Nut and Strings

We are working with binary strings of fixed length, where each string consists only of characters a and b. The Fair Nut originally had a multiset of k such strings, each of length n, but the exact strings are lost.

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

CF 1083C - Max Mex

We are given a rooted tree on $n$ nodes. Each node stores a distinct value from $0$ to $n-1$, so the values form a permutation. Alongside this, the tree structure is fixed, but the values can change over time through swap operations. Two operations are supported.

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

CF 1083A - The Fair Nut and the Best Path

We are given a tree where each node represents a city. Every city contains a fuel station, and each station allows us to obtain some fixed amount of fuel $wi$. Traveling between two cities connected by a road consumes fuel equal to that road’s length.