2023 ICPC Gran Premio de Mexico 2da Fecha

14 problems from 2023 ICPC Gran Premio de Mexico 2da Fecha (contest 104412), difficulty -. 10/14 solutions verified against sample I/O.

14 items

2023 ICPC Gran Premio de Mexico 2da Fecha

ICPC/IOI | 14 problems | 10/14 verified | Difficulty - | 21m 45s

#	Problem	Time	✓
A	Alaric Magic Partition	1m 40s	✓
B	Bogo Sort Probability	1m 33s	✓
C	Choose Two	3m 36s
D	Draconis Subarrays	59s	✓
E	Earnings Report	2m 8s
F	Fibonacci Fever	1m 19s	✓
G	Guessing Two Steps into the Multiverse	1m 52s	✓
H	How Many Groups	1m	✓
I	Iron Fist Ketil vs King Canute	1m	✓
J	JP's List of Trips	1m 36s	✓
K	Knockout Spell	51s	✓
L	ICPC Teams	1m 19s	✓
M	Modify the Array	1m 27s
N	Necklace	1m 25s

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

CF 104412C - Choose Two

Your result “1” corresponds to assuming: every configuration contributes exactly 1 cycle deterministically So the code is effectively treating the structure as if cycles are always fully formed, which is wrong.

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

CF 104412N - Necklace

We are given a circular necklace represented as a linear array of pearls, where each position has two attributes: a value and a type.

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

CF 104412M - Modify the Array

We are given a permutation of numbers from 1 to n, and we are allowed to repeatedly compress any contiguous segment into a single value equal to the minimum element in that segment.

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

CF 104412E - Earnings Report

We are given a collection of jobs, each of which pays a fixed amount repeatedly over time according to a deterministic calendar rule.

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

CF 104412H - How Many Groups

We are given a company hierarchy that forms a rooted tree. Each employee has exactly one direct supervisor except for the top-most manager, who has none.

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

CF 104412I - Iron Fist Ketil vs King Canute

We are given two groups of people facing each other in a one-time battle. One side has Ketil’s farmers, the other has Canute’s soldiers.

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

CF 104412A - Alaric Magic Partition

We are given a long digit string, and we are allowed to carve it into several disjoint contiguous pieces. Each chosen piece is interpreted as a decimal number, and it is only considered valid if that number is either a prime or a perfect square.

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

CF 104412L - ICPC Teams

We are given three people who can work in parallel, each having a different productivity rate. There is also a list of programming tasks, each with a base amount of work.

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

CF 104412J - JP's List of Trips

We are given a connected undirected graph of up to one hundred thousand cities and roads. Each road can be used in both directions. On top of this network, we are given queries, each query asking about a pair of cities S and E.

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

CF 104412K - Knockout Spell

We are given a square grid of size $N times N$, where each cell contains a digit from 0 to 9 representing terrain type. We are also given a fixed size $K$, and we need to examine every possible $K times K$ sub-square inside the grid.

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

CF 104412G - Guessing Two Steps into the Multiverse

We are given a directed multigraph on n universes. Edges (called portals) appear one by one over time, and each portal is directed. After each new edge is added, we must maintain two values.

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

CF 104412F - Fibonacci Fever

We are asked to evaluate a sum over Fibonacci numbers, but not the Fibonacci sequence itself directly. For each index from 1 up to a very large limit n, we take the corresponding Fibonacci number and raise it to a fixed power k, then add everything together under modulo $10^9…

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

CF 104412D - Draconis Subarrays

We are given two integer arrays. The first array, call it the pattern array, has length $M$. The second array, call it the source array, has length $N$.

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

CF 104412B - Bogo Sort Probability

The process described is a randomized sorting procedure that repeatedly shuffles the array until it happens to become sorted. A single “successful iteration” means that after one random shuffle, the resulting permutation is already sorted.