2024 ICPC Universidad Nacional de Colombia Programming Contest

13 problems from 2024 ICPC Universidad Nacional de Colombia Programming Contest (contest 105278), difficulty -. 1/13 solutions verified against sample I/O.

13 items

2024 ICPC Universidad Nacional de Colombia Programming Contest

ICPC/IOI | 13 problems | 1/13 verified | Difficulty - | 20m 54s

# Problem Rating Tags Accepted Time ✓
A Pacman and Russian Roulette 1m 35s
B Missing LDAP 1m 37s
C s-parkour 1m 28s
D Wise Splitting 1m 53s
E Chaves and habibi arrays 1m 25s
F Pacman or Shot 1m 34s ✓
G Chocolate Volcano 1m 59s
H Emblems 1m 29s
I d-parkour 1m 37s
J Gerrymandering 1m 33s
K Baby Chaves 1m 51s
L Strobogrammatic 1m 23s
M grinch 1m 30s
Practice › Codeforces Solutions › 2024 ICPC Universidad Nacional de Colombia Programming Contest ›

CF 105278M - grinch

We are given a tree with up to one million nodes. A token starts on some node, and two players alternately move it.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › 2024 ICPC Universidad Nacional de Colombia Programming Contest ›

CF 105278L - Strobogrammatic

We are given a single number written in hexadecimal, using digits 0 to 9 and letters A, b, C, d, E, F. The task is to modify this string into a strobogrammatic number, meaning that if we rotate the representation by 180 degrees, it should look identical again.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › 2024 ICPC Universidad Nacional de Colombia Programming Contest ›

CF 105278K - Baby Chaves

We are given a line of integers. In one move we pick two neighboring positions and transfer any amount of value between them: we add some integer $k$ to one side and subtract the same $k$ from the other side.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › 2024 ICPC Universidad Nacional de Colombia Programming Contest ›

CF 105278J - Gerrymandering

We are given a circular arrangement of voters, each voting for either J or L. We must cut this circle into exactly K consecutive segments, where the last segment wraps around to the beginning.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › 2024 ICPC Universidad Nacional de Colombia Programming Contest ›

CF 105278I - d-parkour

We are given a sequence of buildings, each with a distinct height. For any interval of buildings from index i to j, we consider two traversals: moving from left to right and moving from right to left.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › 2024 ICPC Universidad Nacional de Colombia Programming Contest ›

CF 105278G - Chocolate Volcano

We are given a polygonal “cake” whose upper boundary is defined by a polyline through $n$ points whose x-coordinates are strictly increasing.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › 2024 ICPC Universidad Nacional de Colombia Programming Contest ›

CF 105278F - Pacman or Shot

The grid represents a maze where two agents move over discrete time steps: Pacman and a ghost. Pacman starts at a fixed cell and then follows a predetermined sequence of moves consisting of up, down, left, and right commands.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › 2024 ICPC Universidad Nacional de Colombia Programming Contest ›

CF 105278E - Chaves and habibi arrays

We are given a permutation of length $N$, meaning all values are distinct. From this array we consider every contiguous subarray, and we want to count how many of those subarrays are “valid” according to a stack simulation rule.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › 2024 ICPC Universidad Nacional de Colombia Programming Contest ›

CF 105278D - Wise Splitting

We are given a list of money transfers between people, where each record says that one person paid on behalf of another, creating an implicit debt relationship. From these transactions we can compute how much each person ultimately owes or is owed.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › 2024 ICPC Universidad Nacional de Colombia Programming Contest ›

CF 105278B - Missing LDAP

We are given a person’s full name split into three or four words. The last two words are fixed surnames, while everything before them forms the given names. From this name, we must reconstruct a very specific sequence of candidate login identifiers called LDAPs.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › 2024 ICPC Universidad Nacional de Colombia Programming Contest ›

CF 105278A - Pacman and Russian Roulette

We are simulating a short sequence of moves on a toroidal 15 by 15 grid, where Pacman follows a fixed deterministic path while a hidden ghost moves randomly. Both start from the same uniformly random cell.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › 2024 ICPC Universidad Nacional de Colombia Programming Contest ›

CF 105278H - Emblems

A Codeforces user is tracked through their rating history, and their “status tier” changes as their rating crosses fixed thresholds such as pupil, specialist, expert, and so on.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › 2024 ICPC Universidad Nacional de Colombia Programming Contest ›

CF 105278C - s-parkour

We are given a sequence of building heights, all distinct. For any interval from index $i$ to $j$, we imagine walking along the buildings in order. Each step compares two consecutive heights: if we move to a higher building it is an ascent, otherwise it is a descent.
codeforces competitive-programming Jun 23, 2026