2024 ICPC Gran Premio de Mexico Repechaje

11 problems from 2024 ICPC Gran Premio de Mexico Repechaje (contest 105408), difficulty -. 2/11 solutions verified against sample I/O.

11 items

2024 ICPC Gran Premio de Mexico Repechaje

ICPC/IOI | 11 problems | 2/11 verified | Difficulty - | 15m 19s

#	Problem	Time	✓
A	AAEGGLNU	1m 11s
B	Best tests	1m 45s
C	Conner Reading Session	1m 24s
D	Dance of Ferrets	1m 45s
E	Expected Closest Friend	1m 25s	✓
F	Fair Toy Missing	1m 3s
G	GCDland Mystical Arrays	1m 57s	✓
H	Hidden Treasure of Arrayland	19s
I	Impossible Octagon Filling	1m 19s
J	Just Deer Cookies	1m 54s
K	Kitchen Closing	1m 17s

Practice › Codeforces Solutions › 2024 ICPC Gran Premio de Mexico Repechaje ›

CF 105408J - Just Deer Cookies

We are given a binary string representing a row of cookies arranged in a line. Each position is either a deer cookie (1) or a human cookie (0).

Practice › Codeforces Solutions › 2024 ICPC Gran Premio de Mexico Repechaje ›

CF 105408K - Kitchen Closing

We are given a kitchen with a fixed stock of several ingredients. Each ingredient starts with some quantity. There is a menu of dishes, and every dish consumes certain amounts of these ingredients when prepared.

Practice › Codeforces Solutions › 2024 ICPC Gran Premio de Mexico Repechaje ›

CF 105408I - Impossible Octagon Filling

We are simulating an infinite process that places identical regular octagons on the plane. Each octagon has a well-defined center, and every new octagon is attached to a previous one by sharing one of its sides. Once placed, each octagon is fixed.

Practice › Codeforces Solutions › 2024 ICPC Gran Premio de Mexico Repechaje ›

CF 105408D - Dance of Ferrets

We are given a permutation that describes how ferrets move on a circular arrangement of positions. At any moment, each position on the circle is occupied by exactly one ferret, and applying the permutation advances all ferrets to their next positions simultaneously.

Practice › Codeforces Solutions › 2024 ICPC Gran Premio de Mexico Repechaje ›

CF 105408F - Fair Toy Missing

We are given two small collections of toy identifiers. Alice’s bag contains five toys, and Bob’s bag is supposed to contain exactly the same set of toys but one item is missing, so his bag has only four.

Practice › Codeforces Solutions › 2024 ICPC Gran Premio de Mexico Repechaje ›

CF 105408H - Hidden Treasure of Arrayland

I don’t have the actual statement of Codeforces 105408H - Hidden Treasure of Arrayland in context, and it isn’t something I can reliably reconstruct from the title alone without risking inventing details.

Practice › Codeforces Solutions › 2024 ICPC Gran Premio de Mexico Repechaje ›

CF 105408B - Best tests

We are given a convex polygon with vertices listed in counterclockwise order. From this polygon we can pick any subsequence of vertices, as long as we keep their original order and choose at least three points.

Practice › Codeforces Solutions › 2024 ICPC Gran Premio de Mexico Repechaje ›

CF 105408C - Conner Reading Session

We are given a collection of books. Each book has three attributes: how many pages it contains, how enjoyable it is for Conner, and how much fame it gives him if he finishes it.

Practice › Codeforces Solutions › 2024 ICPC Gran Premio de Mexico Repechaje ›

CF 105408A - AAEGGLNU

We are given a collection of words that form a dictionary and a sequence of query words. The ordering of words is not the usual lexicographic order on the raw strings.

Practice › Codeforces Solutions › 2024 ICPC Gran Premio de Mexico Repechaje ›

CF 105408E - Expected Closest Friend

We are given a weighted, undirected, connected graph of cities. Jorge lives at city 0. Each edge represents a road with a positive length, and shortest paths define the distance between any two cities. Jorge has k friends, and each friend independently occupies a distinct city.

Practice › Codeforces Solutions › 2024 ICPC Gran Premio de Mexico Repechaje ›

CF 105408G - GCDland Mystical Arrays

We are given a list of integers and asked to verify a very specific structural property: every pair of numbers in the list must share exactly the same greatest common divisor.