Codeforces Round 616 (Div. 1)

5 problems from Codeforces Round 616 (Div. 1) (contest 1290), difficulty 1600-3500. 1/5 solutions verified against sample I/O.

5 items

Codeforces Round 616 (Div. 1)

Div. 1 | 5 problems | 1/5 verified | Difficulty 1600-3500 | 19m 56s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Mind Control	1600	brute-force, data-structures, implementation	8,899	5m 40s
C	Prefix Enlightenment	2400	dfs-and-similar, dsu, graphs	2,012	1m 56s	✓
D	Coffee Varieties (hard version)	3000	constructive-algorithms, graphs, interactive	948	3m 41s
E	Cartesian Tree	3300	data-structures	670	4m 7s
F	Making Shapes	3500	dp	590	4m 32s

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

CF 1290F - Making Shapes

We are given a small set of integer vectors in the plane. Each vector can be used repeatedly as a step, and we form a closed polygonal walk by starting at the origin, repeatedly adding chosen vectors head-to-tail, and eventually returning to the origin.

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

CF 1290A - Mind Control

We are given an array of numbers and a line of people who will remove elements from the array one by one. Each person, when it becomes their turn, sees the current array and takes either the leftmost or rightmost element.

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

CF 1290E - Cartesian Tree

We are building a sequence one element at a time, where after inserting the first i values, we take the current array and construct its Cartesian tree.

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

CF 1290D - Coffee Varieties (hard version)

We are given a hidden array of length $n$, where each position represents a café and each café produces exactly one type of coffee. The value at position $i$ is the coffee variety label $ai$, but we never see it directly.

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

CF 1290C - Prefix Enlightenment

We have a line of n lamps, each either on or off. The goal is to compute, for every prefix of the lamps, the minimum number of subset toggle operations required to turn all lamps in that prefix on.