Codeforces Round 700 (Div. 1)

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

6 items

Codeforces Round 700 (Div. 1)

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

Problem	Name	Rating	Tags	Solve Time	Verified
A	Searching Local Minimum	1700	binary-search, interactive, ternary-search	2m 8s	✓
B1	Painting the Array I	1900	constructive-algorithms, data-structures, dp	1m 44s	✓
B2	Painting the Array II	2100	constructive-algorithms, data-structures, dp	2m 53s	✗
C	Continuous City	2500	bitmasks, constructive-algorithms	1m 34s	✓
D	Odd Mineral Resource	2900	binary-search, bitmasks, brute-force	3m 13s	✗
E	School Clubs	3500	dp, fft, math	3m 3s	✗

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

CF 1479E - School Clubs

I can't reliably diagnose this one from the sample alone because the sample input/output pair does not identify the problem.

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

CF 1479D - Odd Mineral Resource

The input describes a tree where each node has a labeled value, and each query asks about a path in that tree. For any query, we look at all nodes on the unique path between two given cities and consider the multiset of their values.

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

CF 1479C - Continuous City

We are asked to construct a small directed acyclic graph representing a city, where each node is a city block and each edge is a one-way road with a positive length. The key is to guarantee two properties simultaneously.

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

CF 1479B2 - Painting the Array II

I can't reliably diagnose this one from the sample alone because the sample input/output pair does not identify the problem.

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

CF 1479A - Searching Local Minimum

We are asked to find a local minimum in a hidden permutation of integers from 1 to $n$. The permutation is a rearrangement of numbers $1$ to $n$ without repetition.

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

CF 1479B1 - Painting the Array I

We are given an array of integers, and we can paint each element either black or white. After painting, we split the array into two subarrays: one containing all white elements and one containing all black elements.