2024 ICPC Gran Premio de Mexico 1ra Fecha

12 problems from 2024 ICPC Gran Premio de Mexico 1ra Fecha (contest 105164), difficulty -. 1/12 solutions verified against sample I/O.

12 items

2024 ICPC Gran Premio de Mexico 1ra Fecha

ICPC/IOI | 12 problems | 1/12 verified | Difficulty - | 17m 54s

#	Problem	Time	✓
A	Arrayland's Challenge	3m 13s
B	Bacterial Sampling	1m 29s
C	Chocolate Packing	1m 20s
D	Different Triangles	1m 13s	✓
E	Evaluating Linear Expressions	1m 5s
F	Factory TikTak Trend	1m 22s
G	Granitus Stone Towers	1m 41s
H	Highest Score APPQ	42s
I	Inspecting Merge Algorithm	2m 37s
J	Journey To Stringland	1m 13s
K	Knights In The Board	1m 26s
L	Lost Land of Numeralia	33s

Practice › Codeforces Solutions › 2024 ICPC Gran Premio de Mexico 1ra Fecha ›

CF 105164I - Inspecting Merge Algorithm

We are given a target sequence, and we imagine it was produced by repeatedly merging a collection of $M$ non-empty sequences using a very specific two-pointer merge procedure.

Practice › Codeforces Solutions › 2024 ICPC Gran Premio de Mexico 1ra Fecha ›

CF 105164L - Lost Land of Numeralia

Codeforces 105164L: Lost Land of Numeralia

Practice › Codeforces Solutions › 2024 ICPC Gran Premio de Mexico 1ra Fecha ›

CF 105164K - Knights In The Board

We are given a set of knights placed on distinct squares of an $N times N$ chessboard. Each knight has the standard chess movement: it can attack up to eight potential squares in an L-shaped pattern. Two knights are in conflict if one can reach the other in a single move.

Practice › Codeforces Solutions › 2024 ICPC Gran Premio de Mexico 1ra Fecha ›

CF 105164J - Journey To Stringland

We are given a string $S$ of length $N$. We are allowed to change characters in this string arbitrarily, with each change costing one operation.

Practice › Codeforces Solutions › 2024 ICPC Gran Premio de Mexico 1ra Fecha ›

CF 105164G - Granitus Stone Towers

We are given a collection of stone towers, each with some positive height. Two players alternately perform the same type of move.

Practice › Codeforces Solutions › 2024 ICPC Gran Premio de Mexico 1ra Fecha ›

CF 105164F - Factory TikTak Trend

We are given two strings of equal length, and we repeatedly apply deterministic cyclic transformations to each of them. For the first string, each state corresponds to a left rotation, shifting the first character to the end.

Practice › Codeforces Solutions › 2024 ICPC Gran Premio de Mexico 1ra Fecha ›

CF 105164H - Highest Score APPQ

We are given a universe of numbers generated in a very structured way. Each number corresponds to a vector of exponents over the first $n$ primes.

Practice › Codeforces Solutions › 2024 ICPC Gran Premio de Mexico 1ra Fecha ›

CF 105164A - Arrayland's Challenge

We are given a static array of integers. Each query asks us to look at a contiguous segment of this array and determine how tightly packed the values are inside that segment.

Practice › Codeforces Solutions › 2024 ICPC Gran Premio de Mexico 1ra Fecha ›

CF 105164D - Different Triangles

We are asked to count how many different triangles can be formed using matchsticks, where each side length is an integer number of sticks. A triangle is determined by three positive integers $a le b le c$, and the perimeter is $a + b + c$, which must not exceed $N$.

Practice › Codeforces Solutions › 2024 ICPC Gran Premio de Mexico 1ra Fecha ›

CF 105164E - Evaluating Linear Expressions

We are given a simple linear rule that transforms an integer input $x$ into an output value $ax + b$. The task is to apply this rule repeatedly for consecutive values of $x$, starting from 1 up to $k$, and print all resulting outputs in order.

Practice › Codeforces Solutions › 2024 ICPC Gran Premio de Mexico 1ra Fecha ›

CF 105164B - Bacterial Sampling

We are simulating a population of bacteria inside a container, starting with a single newborn organism at time zero. Each bacterium follows a very rigid lifecycle. It spends its first two minutes in a non-reproductive “immature” state.

Practice › Codeforces Solutions › 2024 ICPC Gran Premio de Mexico 1ra Fecha ›

CF 105164C - Chocolate Packing

We are given two rectangular prisms. One is a large shipping container with dimensions $L times W times H$, and the other is a smaller identical chocolate box with dimensions $l times w times h$. The goal is to determine how many small boxes can be packed inside the large one.