2023 ICPC Gran Premio de Mexico 1ra Fecha

11 problems from 2023 ICPC Gran Premio de Mexico 1ra Fecha (contest 104375), difficulty -. 7/11 solutions verified against sample I/O.

11 items

2023 ICPC Gran Premio de Mexico 1ra Fecha

ICPC/IOI | 11 problems | 7/11 verified | Difficulty - | 17m 39s

#	Problem	Time	✓
A	Aliases	1m 24s	✓
B	Bucket storing	1m 4s	✓
C	Counting Stars	1m 47s
D	Dynamic Collection	1m 35s	✓
E	Employees Bonus	2m 1s
F	Finding the Best Guess	2m 53s
G	Growing game	1m 13s	✓
H	Hell or paradise?	1m 13s	✓
I	Improving Chewing Candy	1m 51s
J	Jumping Reaction	1m 14s	✓
K	Kingdom Power C.	1m 24s	✓

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

CF 104375K - Kingdom Power C.

The game can be modeled as a directed graph where each level is a node and each prerequisite relation is a directed edge. If there is an edge from level u to level v, then finishing u unlocks v, so v becomes playable after u is completed.

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

CF 104375J - Jumping Reaction

We are given an array of integers where each value represents a “jumping energy” of a substance. When two substances with energies $a$ and $b$ are mixed, they contribute an energy of $ab$.

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

CF 104375I - Improving Chewing Candy

We are given a circular arrangement of candy blocks, where each block has a flavor represented by a lowercase letter. The circularity means the first and last positions are adjacent, so any segment we take can wrap around the end of the string.

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

CF 104375F - Finding the Best Guess

We are given a tree where every node carries a positive weight. A process runs for exactly $n$ rounds. In each round, one remaining node is chosen uniformly at random.

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

CF 104375H - Hell or paradise?

We are given a collection of words and a long string written on a monster’s body. The task is to determine how many ways we can cut this long string into consecutive pieces so that each piece exactly matches one of the given words.

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

CF 104375G - Growing game

We are given a pile of chips and two players who alternate turns, starting with Jane. On each turn, the player removes between 1 and a bounded number of chips, where the bound grows with the turn index.

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

CF 104375E - Employees Bonus

We are given a company hierarchy that forms a rooted tree. Each employee corresponds to a node, and every node has a subtree consisting of all employees they supervise directly or indirectly, including themselves. The company processes a sequence of bonus events.

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

CF 104375D - Dynamic Collection

We maintain a multiset of integers with two operations: inserting or modifying the structure in a specific ordered way, and answering how many elements lie inside a numeric interval. The collection is not just a static bag.

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

CF 104375C - Counting Stars

We are given a set of points in the plane, each representing a star. We want to count how many valid “spoke constellations” can be formed. A configuration is defined by choosing one star as a center and then selecting other stars around it in a very structured way.

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

CF 104375A - Aliases

Each person’s full name is given as a sequence of words. From that name, a compact identifier called a NAME is constructed by taking the first letter of every word and concatenating these letters in order. So a name like “jose osorio jimenez orozco” becomes “jojo”.

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

CF 104375B - Bucket storing

We are given a situation where coffee is first packed into several identical small containers. Each small container always holds exactly $K$ units of coffee, and there are $N$ such containers. So the total amount of coffee is simply $N times K$.