Codeforces Round 698 (Div. 1)

Solutions for Codeforces Round 698 (Div. 1) (contest 1477). 3/6 problems verified against sample I/O. Difficulty range: 1800-3500.

6 items

Codeforces Round 698 (Div. 1)

Type: Div. 1 | Problems: 6 | Verified: 3/6 | Rating range: 1800-3500 | Time: 14m 36s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Nezzar and Board	1800	constructive-algorithms, math, number-theory	2m 1s	✓
B	Nezzar and Binary String	1900	data-structures, greedy	2m 25s	✓
C	Nezzar and Nice Beatmap	2200	constructive-algorithms, geometry, greedy	2m 41s	✓
D	Nezzar and Hidden Permutations	2800	constructive-algorithms, dfs-and-similar, graphs	3m 22s	✗
E	Nezzar and Tournaments	3300	data-structures, greedy	1m 54s	✗
F	Nezzar and Chocolate Bars	3500	combinatorics, fft, math	2m 13s	✗

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

CF 1477D - Nezzar and Hidden Permutations

We are given an undirected graph on vertices 1..n. Every pair (l, r) chosen by Nanako becomes an edge of this graph. Nezzar must construct two permutations p and q of 1..n. For every edge (u, v), the differences p[u] - p[v] and q[u] - q[v] must have the same sign.

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

CF 1477F - Nezzar and Chocolate Bars

Nezzar has a collection of chocolate bars with given lengths. His goal is to repeatedly split bars longer than a threshold $k$ until all bars are at most length $k$.

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

CF 1477E - Nezzar and Tournaments

We are given two teams of players, each with an integer potential. The first team has n players with potentials a1, a2, ..., an, and the second team has m players with potentials b1, b2, ..., bm.

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

CF 1477C - Nezzar and Nice Beatmap

We are given a set of $n$ distinct points on a 2D plane. Nezzar wants to reorder these points so that in the resulting sequence, every three consecutive points form an angle strictly less than 90 degrees at the middle point.

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

CF 1477B - Nezzar and Binary String

We start with a binary string that must eventually become another binary string after a sequence of operations. Each day, a fixed segment is inspected. If that segment contains both 0 and 1, the process immediately fails.

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

CF 1477A - Nezzar and Board

We are given a board with $n$ distinct integers, and we can repeatedly perform an operation that takes two numbers $x$ and $y$ from the board and writes down $2x - y$.