Codeforces Round 618 (Div. 1)

3 problems from Codeforces Round 618 (Div. 1) (contest 1299), difficulty 1800-3400. 1/3 solutions verified against sample I/O.

3 items

Codeforces Round 618 (Div. 1)

Div. 1 | 3 problems | 1/3 verified | Difficulty 1800-3400 | 15m 48s

#	Problem	Rating	Tags	Accepted	Time	✓
B	Aerodynamic	1800	geometry	5,609	1m 58s	✓
C	Water Balance	2100	data-structures, geometry, greedy	4,333	4m 42s
E	So Mean	3400	interactive, math	195	9m 8s

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

CF 1299E - So Mean

We are given a hidden permutation of numbers from $1$ to $n$, where $n$ is even. We cannot directly see it, but we can query any subset of indices. For a chosen subset, the judge tells us only whether the average value of the selected positions is an integer.

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

CF 1299C - Water Balance

We are given a sequence of water volumes arranged in a line. One operation allows us to pick any contiguous segment and replace every value in that segment with their average. This operation can be repeated any number of times on any segments.

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

CF 1299B - Aerodynamic

We are given a strictly convex polygon $P$ in the plane as a list of its vertices in counterclockwise order. Each vertex has integer coordinates, and no three vertices are collinear.