The 2020 ICPC Asia Macau Regional Contest

12 problems from The 2020 ICPC Asia Macau Regional Contest (contest 103119), difficulty -. 11/12 solutions verified against sample I/O.

12 items

The 2020 ICPC Asia Macau Regional Contest

ICPC/IOI | 12 problems | 11/12 verified | Difficulty - | 13m 3s

# Problem Rating Tags Accepted Time ✓
A Accelerator 55s ✓
B Boring Problem 1m 4s ✓
C Club Assignment 51s ✓
D Artifacts 48s ✓
E Mountain 1m 7s ✓
F Fixing Networks 49s ✓
G Game on Sequence 1m 8s ✓
H Fly Me To The Moon 1m 5s ✓
I Nim Cheater 2m 23s
J Jewel Grab 54s ✓
K Candy Ads 58s ✓
L Random Permutation 1m 1s ✓
Practice › Codeforces Solutions › The 2020 ICPC Asia Macau Regional Contest ›

CF 103119I - Nim Cheater

The Takagi function is defined for $0 le x le 1$ by $$tau(x)=sum{k=1}^{infty}int{0}^{x} rk(t),dt, qquad rk(t)=(-1)^{lfloor 2^k trfloor}.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The 2020 ICPC Asia Macau Regional Contest ›

CF 103119B - Boring Problem

We are given a random string construction process. You start with an initial string, and repeatedly append one character at a time. Each character is chosen independently from a fixed alphabet of size k, with known probabilities.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The 2020 ICPC Asia Macau Regional Contest ›

CF 103119D - Artifacts

We are given five artifact items, one for each equipment slot. Each artifact contributes exactly five stat lines, and across all artifacts we only care about four statistics: flat ATK, ATK percentage, Crit Rate, and Crit Damage.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The 2020 ICPC Asia Macau Regional Contest ›

CF 103119L - Random Permutation

We are generating a random upper bound array of size $n$, where each entry $ai$ is chosen independently and uniformly from the integers $1$ to $n$.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The 2020 ICPC Asia Macau Regional Contest ›

CF 103119K - Candy Ads

We are given a set of rectangular advertisements, each one active only during a time interval and occupying a fixed axis-aligned rectangle on a discrete grid. Each ad is therefore a space-time object: a rectangle in 2D space that exists across a contiguous range of days.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The 2020 ICPC Asia Macau Regional Contest ›

CF 103119J - Jewel Grab

We are given a row of jewels indexed from left to right. Each position contains a jewel with a color and a value. The colors are arbitrary integers, and values are large positive numbers. We process two types of operations.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The 2020 ICPC Asia Macau Regional Contest ›

CF 103119H - Fly Me To The Moon

We are working on a huge directed system of “stations” placed on every integer coordinate point in a 1000 by 1000 grid, except for the origin and the destination. The journey starts at (0, 0) and must end at (1000, 1000).
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The 2020 ICPC Asia Macau Regional Contest ›

CF 103119G - Game on Sequence

We are given a growing sequence of numbers, where each number is between 0 and 255, so every value fits in 8 bits. After each update, we may be asked to start a two-player game from a given position in the sequence. From a starting index k, a token sits on position k.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The 2020 ICPC Asia Macau Regional Contest ›

CF 103119F - Fixing Networks

We are asked to construct an undirected simple graph on $n$ labeled vertices. Every vertex must have exactly degree $d$, meaning each station is connected to exactly $d$ other stations. Self-loops and multiple edges are forbidden, so this is a standard simple $d$-regular graph.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The 2020 ICPC Asia Macau Regional Contest ›

CF 103119E - Mountain

The mountain is a polygonal terrain formed by connecting points from left to right, starting at ground level, rising through given heights, and then returning back to ground.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The 2020 ICPC Asia Macau Regional Contest ›

CF 103119A - Accelerator

We are given a sequence of accelerators, each carrying a multiplicative factor. A spaceship starts with velocity zero and passes through all accelerators in some order.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The 2020 ICPC Asia Macau Regional Contest ›

CF 103119C - Club Assignment

We are given several independent test cases. In each test case, there are $n$ students, and each student has a single integer attribute $wi$. We must split these students into two clubs, labeled 1 and 2.
codeforces competitive-programming Jul 3, 2026