2019-2020 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred)
8 problems from 2019-2020 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) (contest 1267), difficulty 900-3200. 2/8 solutions verified against sample I/O.
2019-2020 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred)
ICPC/IOI | 8 problems | 2/8 verified | Difficulty 900-3200 | 32m 4s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Apprentice Learning Trajectory | 2400 | 1,061 | 2m 35s | ||
| B | Balls of Buma | 900 | 4,538 | 2m | ✓ | |
| D | DevOps Best Practices | 2800 | constructive-algorithms | 261 | 4m 47s | |
| E | Elections | 1700 | greedy | 3,518 | 5m 50s | |
| F | Foolpr\u00fcf Security | 2600 | graphs | 720 | 43s | |
| H | Help BerLine | 3200 | constructive-algorithms | 229 | 2m 39s | |
| I | Intriguing Selection | 2600 | brute-force, constructive-algorithms, implementation | 1,068 | 10m 9s | |
| J | Just Arrange the Icons | 1800 | greedy, implementation, math | 3,057 | 3m 21s | ✓ |
CF 1267I - Intriguing Selection
We are given $2n$ players, each with a hidden, distinct strength. We cannot see these strengths directly, but we can compare any two players through a query that tells us which of the two is stronger.
CF 1267J - Just Arrange the Icons
We are given a multiset of applications, each belonging to a category. The only thing that matters about a category is how many apps it contains, so the input can be compressed into frequencies of each distinct category. We must place all apps into “screens”.
CF 1267E - Elections
We are given a collection of polling stations, each producing a fixed vector of vote counts for all candidates. One candidate is special: the opposition, which is always the last candidate in the list.
CF 1267D - DevOps Best Practices
Each server in the system has two independent properties for each of the three features: whether the feature is required on that server, and whether the feature passes local tests on that server.
CF 1267H - Help BerLine
There is not enough information to diagnose the bug or provide a corrected solution. The sample with expected output appears to belong to a string construction problem, but you have not provided: - the problem statement, - the original Python solution, - or even the name of…
CF 1267F - Foolprüf Security
Before I dive into writing the full editorial, I want to clarify one thing: Codeforces Problem 1267F, Foolprüf Security, involves a graph with weighted edges and some combinatorial security constraint.
CF 1267A - Apprentice Learning Trajectory
There is not enough information to diagnose the bug or provide a corrected solution. The sample with expected output appears to belong to a string construction problem, but you have not provided: - the problem statement, - the original Python solution, - or even the name of…
CF 1267B - Balls of Buma
We are given a row of colored balls represented as a string of uppercase letters. The task is to insert a single ball of any color at any position, including at the ends, so that after the insertion, a chain reaction of eliminations occurs until no segment of length three or…