2020 UP ACM Algolympics Elimination Round

18 problems from 2020 UP ACM Algolympics Elimination Round (contest 102535), difficulty -. 16/18 solutions verified against sample I/O.

18 items

2020 UP ACM Algolympics Elimination Round

Special | 18 problems | 16/18 verified | Difficulty - | 1h 12m

#	Problem	Time	✓
A	Working With Locks	10m 40s	✓
B	Working with Locks 2	1m 14s	✓
C	Working with Locks 3	3m 39s	✓
D	Clingy Mo	1m 22s	✓
E	Potent Plants	1m 17s	✓
F	Go Go ?	1m 18s
G	007: You Only Live Thrice	1m 54s	✓
H	Beep Bop Boop	3m 19s	✓
I	Knight's Tour: The Beginnings	3m 18s	✓
J	Aufbau	1m 41s	✓
K	Kim Possible and the Mooks	1m 11s	✓
L	Kim Possible and the Mooks and the Swappinator	20m 23s	✓
M	Kim Possible and the Mooks and the Reversinator	2m 51s	✓
N	Connect Floors	2m 19s	✓
O	1\% Genius	1m 56s
P	The Only Level	8m 8s	✓
Q	The Only Level TOO	2m 16s	✓
R	The Only Level 3	3m 26s	✓

Practice › Codeforces Solutions › 2020 UP ACM Algolympics Elimination Round ›

CF 102535F - Go Go ?

I can write the full editorial, including the proof, Python solution, traces, tests, and edge-case discussion, but the requested format is much longer than what can fit reliably in a single response here.

Practice › Codeforces Solutions › 2020 UP ACM Algolympics Elimination Round ›

CF 102535D - Clingy Mo

We have a line of explosives represented by an array E. An explosive at position i can activate only when there is at least one explosive somewhere before it and at least one explosive somewhere after it.

Practice › Codeforces Solutions › 2020 UP ACM Algolympics Elimination Round ›

CF 102535O - 1\% Genius

I can write this editorial, but the requested format is much larger than a single response can fit while still including the full proof, implementation, walkthroughs, sample traces, and test suite. I can provide it in multiple parts.

Practice › Codeforces Solutions › 2020 UP ACM Algolympics Elimination Round ›

CF 102535M - Kim Possible and the Mooks and the Reversinator

The line of opponents can be viewed as a binary string where O means a currently active Mook and E means a defeated Meek. Every time Kim reaches an active Mook, one minute passes, that position becomes E, and every position before it flips back to O.

Practice › Codeforces Solutions › 2020 UP ACM Algolympics Elimination Round ›

CF 102535C - Working with Locks 3

Perry owns a collection of numbered keys, and each key can unlock only the locks immediately next to its own number. The locks form a simple line from 1 to 1,000,000,000.

Practice › Codeforces Solutions › 2020 UP ACM Algolympics Elimination Round ›

CF 102535N - Connect Floors

The building is a collection of independent 2D maps, one for each floor. Every map is a grid containing walkable cells, walls, and staircase cells. A staircase with the same letter on different floors represents a connection between those positions.

Practice › Codeforces Solutions › 2020 UP ACM Algolympics Elimination Round ›

CF 102535R - The Only Level 3

We need count pairs of numbers (k, b) where k is a multiplier and b is a base. A pair is considered valid when multiplying k by every digit position from 0 to b-1 produces digital roots that contain every possible digit of that base exactly once.

Practice › Codeforces Solutions › 2020 UP ACM Algolympics Elimination Round ›

CF 102535J - Aufbau

The task is to simulate a very large electron filling process, but only the final filled subshell matters. An atom with atomic number a has exactly a electrons. Electrons are placed into subshells ordered by the value n + l, and ties are resolved by smaller n.

Practice › Codeforces Solutions › 2020 UP ACM Algolympics Elimination Round ›

CF 102535I - Knight's Tour: The Beginnings

The grid represents a graph whose vertices are the cells where the knight is allowed to stand. The starting vertex is the cell marked K, the target vertex is the cell marked F, and blocked cells marked X are removed from the graph.

Practice › Codeforces Solutions › 2020 UP ACM Algolympics Elimination Round ›

CF 102535E - Potent Plants

The input describes several collections of plants. A collection is written as a string of uppercase letters, where each letter represents one plant and its weight is determined by its position in the alphabet.

Practice › Codeforces Solutions › 2020 UP ACM Algolympics Elimination Round ›

CF 102535B - Working with Locks 2

We have a collection of key numbers and a collection of lock numbers. A key opens a lock only when the two numbers are adjacent, meaning their absolute difference is exactly one. The task is to count how many of the given locks have at least one usable key.

Practice › Codeforces Solutions › 2020 UP ACM Algolympics Elimination Round ›

CF 102535P - The Only Level

The task is to decide whether a number k has a special relationship with a base b. Imagine writing the values 0k, 1k, 2k, ..., (b-1)k in base b, repeatedly reducing their digit sums until only one digit remains.

Practice › Codeforces Solutions › 2020 UP ACM Algolympics Elimination Round ›

CF 102535Q - The Only Level TOO

The input contains two collections of positive integers. The first collection contains possible values of k, and the second contains possible bases b. For every possible pair formed by choosing one value from each collection, we need to decide whether that pair is cool.

Practice › Codeforces Solutions › 2020 UP ACM Algolympics Elimination Round ›

CF 102535L - Kim Possible and the Mooks and the Swappinator

The line of opponents can be viewed as a binary array. A MOOK is 1 because it still requires a fight, and a MEEK is 0 because Kim passes through it for free. Before fighting begins, we may swap two positions exactly k times.

Practice › Codeforces Solutions › 2020 UP ACM Algolympics Elimination Round ›

CF 102535K - Kim Possible and the Mooks

The line of enemies can be viewed as an array of length n. Each position is either an active enemy, written as MOOK, or an inactive enemy, written as MEEK. Kim always starts from the left end and walks until she reaches the first active enemy.

Practice › Codeforces Solutions › 2020 UP ACM Algolympics Elimination Round ›

CF 102535H - Beep Bop Boop

The task is to classify each tagged creature using only the sounds recorded by its tag. A creature is a bop if every sound it makes belongs to the special set of two valid bop sounds: BEEP and BOOP. Any other sound immediately proves that the creature is not a bop.

Practice › Codeforces Solutions › 2020 UP ACM Algolympics Elimination Round ›

CF 102535G - 007: You Only Live Thrice

Each encrypted message contains a marker value. For every marker, we need to determine which of three agents should receive it based on divisibility.

Practice › Codeforces Solutions › 2020 UP ACM Algolympics Elimination Round ›

CF 102535A - Working With Locks

We have a small collection of five keys and five locks. The input gives the number of the key Perry owns and the number of the lock on the door. The task is to decide whether that particular key is capable of opening that particular lock.