Codeforces Round 486 (Div. 3)

3 problems from Codeforces Round 486 (Div. 3) (contest 988), difficulty 1100-2100. 1/3 solutions verified against sample I/O.

3 items

Codeforces Round 486 (Div. 3)

Div. 3 | 3 problems | 1/3 verified | Difficulty 1100-2100 | 4m 21s

#	Problem	Rating	Tags	Accepted	Time	✓
B	Substrings Sort	1100	sortings, strings	20,279	1m 22s	✓
C	Equal Sums	1400	implementation, sortings	11,135	1m 23s
F	Rain and Umbrellas	2100	dp	2,776	1m 36s

Practice › Codeforces Solutions › Codeforces Round 486 (Div. 3) ›

CF 988F - Rain and Umbrellas

We are given a line from position 0 to position $a$. Polycarp moves only to the right, one unit at a time. Some disjoint intervals on this line are rainy, and if he traverses an edge fully contained inside any rainy interval, he must carry at least one umbrella during that…

Practice › Codeforces Solutions › Codeforces Round 486 (Div. 3) ›

CF 988C - Equal Sums

We are given several independent integer arrays. From each array we are allowed to remove exactly one element, and this creates a “modified sum” for that array, meaning the original sum minus the removed element.

Practice › Codeforces Solutions › Codeforces Round 486 (Div. 3) ›

CF 988B - Substrings Sort

We are given a collection of strings, and we are allowed to rearrange them in any order. After rearranging, we want a very specific nesting property: every string must contain all strings that appear before it as substrings.