2024 ICPC Gran Premio de Mexico 2da Fecha

13 problems from 2024 ICPC Gran Premio de Mexico 2da Fecha (contest 105216), difficulty -. 0/13 solutions verified against sample I/O.

13 items

2024 ICPC Gran Premio de Mexico 2da Fecha

ICPC/IOI | 13 problems | 0/13 verified | Difficulty - | 38m 38s

#	Problem	Time
A	Another Problem About Maximum in Range	5m 8s
B	Birthday Cake	5m 24s
C	Cuckoo Synchronization	1m 11s
D	Dueling Digits	1m 24s
E	Egotistical Command Chain	1m 12s
F	Fair Prize	1m 14s
G	Graphoria's Villages Visit	1m 31s
H	Hiring Candidates Game	5m 25s
I	Intersection of Hyperrectangles	6m 48s
J	Japanese Samurai Fight	1m 37s
K	K Happy Computers	1m 19s
L	Lost Shoes	1m 10s
M	Maximizing the Sauce	5m 15s

Practice › Codeforces Solutions › 2024 ICPC Gran Premio de Mexico 2da Fecha ›

CF 105216M - Maximizing the Sauce

Codeforces 105216M: Maximizing the Sauce

Practice › Codeforces Solutions › 2024 ICPC Gran Premio de Mexico 2da Fecha ›

CF 105216I - Intersection of Hyperrectangles

Codeforces 105216I: Intersection of Hyperrectangles

Practice › Codeforces Solutions › 2024 ICPC Gran Premio de Mexico 2da Fecha ›

CF 105216L - Lost Shoes

We are given a family of $N$ people, where each person currently holds two shoes: one right shoe and one left shoe. However, these shoes are mixed up.

Practice › Codeforces Solutions › 2024 ICPC Gran Premio de Mexico 2da Fecha ›

CF 105216H - Hiring Candidates Game

We are simulating a shrinking circle of candidates, each labeled from 1 to n in clockwise order. Two pointers move around this circle repeatedly.

Practice › Codeforces Solutions › 2024 ICPC Gran Premio de Mexico 2da Fecha ›

CF 105216K - K Happy Computers

We are simulating a process where computers arrive one per week. Each computer is assigned a random “name”, which is just an integer chosen uniformly from the range $1$ to $N$. Jose can only keep at most $k$ computers at any moment.

Practice › Codeforces Solutions › 2024 ICPC Gran Premio de Mexico 2da Fecha ›

CF 105216J - Japanese Samurai Fight

We are given a group of samurais and some pairs that already mutually respect each other. Respect is symmetric, so the information can be viewed as an undirected graph where vertices are samurais and edges are existing respect relationships.

Practice › Codeforces Solutions › 2024 ICPC Gran Premio de Mexico 2da Fecha ›

CF 105216G - Graphoria's Villages Visit

We are given a tree with up to one million nodes, and every pair of nodes is implicitly generating a travel request: a traveler starts from the smaller numbered node and goes to the larger numbered node, following the unique simple path in the tree.

Practice › Codeforces Solutions › 2024 ICPC Gran Premio de Mexico 2da Fecha ›

CF 105216B - Birthday Cake

Codeforces 105216B: Birthday Cake

Practice › Codeforces Solutions › 2024 ICPC Gran Premio de Mexico 2da Fecha ›

CF 105216A - Another Problem About Maximum in Range

We are given a sequence of numbers indexed from left to right. For every pair of indices $i le j$, we look at the subarray from $i$ to $j$, take its maximum element, and multiply it by the square of $gcd(i, j)$. The task is to sum this value over all possible subarrays.

Practice › Codeforces Solutions › 2024 ICPC Gran Premio de Mexico 2da Fecha ›

CF 105216F - Fair Prize

We are given a row of prize values, each prize having a positive integer value. John has a score limit $p$, and he is only allowed to pick prizes whose value does not exceed $p$. Among all valid prizes, he wants the one with the largest value.

Practice › Codeforces Solutions › 2024 ICPC Gran Premio de Mexico 2da Fecha ›

CF 105216E - Egotistical Command Chain

We are asked to build a directed acyclic graph on $N$ labeled vertices, where vertex $i$ represents a programmer.

Practice › Codeforces Solutions › 2024 ICPC Gran Premio de Mexico 2da Fecha ›

CF 105216D - Dueling Digits

We are asked to count how many ordered pairs of two $N$-digit numbers satisfy a tight set of digit-level constraints. Each number has exactly $N$ digits, neither can start with zero, and when we compare them position by position, the digits must always differ.

Practice › Codeforces Solutions › 2024 ICPC Gran Premio de Mexico 2da Fecha ›

CF 105216C - Cuckoo Synchronization

We are given several independent scenarios. In each scenario, there are $N$ cuckoo clocks, and each clock has its own fixed periodic behavior. Clock $i$ produces a sound at times $1, 1+i, 1+2i, 1+3i,dots$.