2020 ICPC World Finals

15 problems from 2020 ICPC World Finals (contest 104633), difficulty -. 15/15 solutions verified against sample I/O.

15 items

2020 ICPC World Finals

ICPC/IOI | 15 problems | 15/15 verified | Difficulty - | 16m 3s

# Problem Rating Tags Accepted Time ✓
A Cardiology 55s ✓
B The Cost of Speed Limits 1m 28s ✓
C Domes 55s ✓
D Gene Folding 1m 9s ✓
E Landscape Generator 1m 6s ✓
F Ley Lines 1m 9s ✓
G Opportunity Cost 1m 4s ✓
H QC QC 53s ✓
I Quests 1m 13s ✓
J \u2019S No Problem 1m 3s ✓
K Space Walls 1m 15s ✓
L Sweep Stakes 1m 15s ✓
M Trailing Digits 58s ✓
N What\u2019s Our Vector, Victor? 51s ✓
O Which Planet is This?! 49s ✓
Practice › Codeforces Solutions › 2020 ICPC World Finals ›

CF 104633O - Which Planet is This?!

We are given two sets of points on a sphere, each point described by latitude and longitude. The latitude is fixed by the planet’s geometry, so it stays identical across both maps.
codeforces competitive-programming Jun 29, 2026
Practice › Codeforces Solutions › 2020 ICPC World Finals ›

CF 104633N - What’s Our Vector, Victor?

We are given several points in a d-dimensional Euclidean space. Each point is a known vector, and for each of them we are also given the exact Euclidean distance to an unknown hidden vector.
codeforces competitive-programming Jun 29, 2026
Practice › Codeforces Solutions › 2020 ICPC World Finals ›

CF 104633L - Sweep Stakes

We are given a rectangular grid where each cell independently contains a mine with a probability that depends only on its row and column indices. Specifically, a cell at position $(i, j)$ is mined with probability $pi + qj$.
codeforces competitive-programming Jun 29, 2026
Practice › Codeforces Solutions › 2020 ICPC World Finals ›

CF 104633M - Trailing Digits

We are given a base price for a single item, and we are allowed to sell items only in bundles. If each item costs b cents and we bundle k items, then the bundle price becomes k · b. The goal is not to maximize revenue in the usual sense.
codeforces competitive-programming Jun 29, 2026
Practice › Codeforces Solutions › 2020 ICPC World Finals ›

CF 104633K - Space Walls

The surface of the space station is built from axis-aligned unit cubes that are glued together in 3D. Only the outer skin matters, so every robot moves on exposed square faces of this union.
codeforces competitive-programming Jun 29, 2026
Practice › Codeforces Solutions › 2020 ICPC World Finals ›

CF 104633J - ’S No Problem

We are given a weighted tree representing a campus. Buildings are nodes and sidewalks are edges with lengths. Every sidewalk must be cleared at least once using two snow blowers that can be pushed along the tree.
codeforces competitive-programming Jun 29, 2026
Practice › Codeforces Solutions › 2020 ICPC World Finals ›

CF 104633I - Quests

We are given a set of quests. Each quest has a reward value and a required level. Your character gains experience points as you complete quests, and the current level is determined only by total experience divided by a fixed constant.
codeforces competitive-programming Jun 29, 2026
Practice › Codeforces Solutions › 2020 ICPC World Finals ›

CF 104633G - Opportunity Cost

We are given a collection of phones, each described by three numbers: price, performance, and user-friendliness. For any phone we decide to buy, we compare it against every other phone and measure how much worse it is along each dimension, but only in the direction where the…
codeforces competitive-programming Jun 29, 2026
Practice › Codeforces Solutions › 2020 ICPC World Finals ›

CF 104633H - QC QC

We are given a batch of $n$ machines. Each machine is either working correctly or malfunctioning, but we are guaranteed that strictly more than half of them are correct.
codeforces competitive-programming Jun 29, 2026
Practice › Codeforces Solutions › 2020 ICPC World Finals ›

CF 104633F - Ley Lines

We are given a set of points in the plane and a parameter $t$, which represents how thick a “drawn line” is allowed to be.
codeforces competitive-programming Jun 29, 2026
Practice › Codeforces Solutions › 2020 ICPC World Finals ›

CF 104633D - Gene Folding

We are given a single genetic string made only of the four DNA characters A, C, G, and T. The process allowed on this string repeatedly picks a “cut position” between two adjacent characters, but only if the string is symmetric around that cut: if you look outward from the…
codeforces competitive-programming Jun 29, 2026
Practice › Codeforces Solutions › 2020 ICPC World Finals ›

CF 104633E - Landscape Generator

We are given an initially flat landscape of n integer positions, all starting at height zero. Then a sequence of k operations modifies contiguous segments of this array. After applying all operations in order, we must output the final height at every position.
codeforces competitive-programming Jun 29, 2026
Practice › Codeforces Solutions › 2020 ICPC World Finals ›

CF 104633B - The Cost of Speed Limits

We are given a road system that forms a tree. Every road connects two intersections and already has a speed limit. We are allowed to increase any road’s speed limit, but never decrease it.
codeforces competitive-programming Jun 29, 2026
Practice › Codeforces Solutions › 2020 ICPC World Finals ›

CF 104633C - Domes

We are given a rectangular region, which we can think of as the viewing area where a tourist can stand. Inside this rectangle are several fixed points, called domes.
codeforces competitive-programming Jun 29, 2026
Practice › Codeforces Solutions › 2020 ICPC World Finals ›

CF 104633A - Cardiology

We are given a rectangular grid of cards arranged in r rows and c columns, filled initially in row-major order with numbers from 1 to r·c.
codeforces competitive-programming Jun 29, 2026