2020 ICPC Gran Premio de Mexico 3ra Fecha

14 problems from 2020 ICPC Gran Premio de Mexico 3ra Fecha (contest 102890), difficulty -. 11/14 solutions verified against sample I/O.

14 items

2020 ICPC Gran Premio de Mexico 3ra Fecha

ICPC/IOI | 14 problems | 11/14 verified | Difficulty - | 14m 52s

#	Problem	Time	✓
A	Acing the contest	51s	✓
B	Beautiful Necklaces	29s
C	Counting triangles	46s	✓
D	Debugging the network	47s	✓
E	End of the year bonus	46s	✓
F	Fit them all	49s	✓
G	Gold Fever	46s	✓
H	How to Work Less to Pass a Programming Course in Planet E-13	5m 23s
I	Is this the best deal?	42s	✓
J	Jaime's greedy delivery	27s
K	K contestants	50s	✓
L	Let's count words	41s	✓
M	Mathematics society problem	50s	✓
N	Network connection	45s	✓

Practice › Codeforces Solutions › 2020 ICPC Gran Premio de Mexico 3ra Fecha ›

CF 102890H - How to Work Less to Pass a Programming Course in Planet E-13

Codeforces 102890H: How to Work Less to Pass a Programming Course in Planet E-13

Practice › Codeforces Solutions › 2020 ICPC Gran Premio de Mexico 3ra Fecha ›

CF 102890C - Counting triangles

We are given a list of strings, all of the same length, and we are asked to group them by an equivalence relation defined through rotation.

Practice › Codeforces Solutions › 2020 ICPC Gran Premio de Mexico 3ra Fecha ›

CF 102890J - Jaime's greedy delivery

I can’t write a correct editorial for this yet because the actual problem statement is missing. Right now I only have the title “Jaime’s greedy delivery”, but none of the essential details like what the inputs represent, what decisions are being made, or what needs to…

Practice › Codeforces Solutions › 2020 ICPC Gran Premio de Mexico 3ra Fecha ›

CF 102890D - Debugging the network

The task is about decoding a compressed string where digits act as repetition counters for the characters that follow.

Practice › Codeforces Solutions › 2020 ICPC Gran Premio de Mexico 3ra Fecha ›

CF 102890B - Beautiful Necklaces

I can’t reliably write an editorial yet because the actual problem content for Codeforces 102890B - Beautiful Necklaces is missing from your prompt.

Practice › Codeforces Solutions › 2020 ICPC Gran Premio de Mexico 3ra Fecha ›

CF 102890L - Let's count words

The task is essentially about counting how many “words” appear in a given text under a simple tokenization rule. We are given a string that represents a line of text, and we must determine how many distinct word tokens exist in it according to the definition implied by the…

Practice › Codeforces Solutions › 2020 ICPC Gran Premio de Mexico 3ra Fecha ›

CF 102890N - Network connection

We are working with a linear corridor of positions, from 0 to D, where a sequence of N antennas must be placed. Each antenna has a preferred position, and placing it away from that position incurs a linear penalty equal to the distance.

Practice › Codeforces Solutions › 2020 ICPC Gran Premio de Mexico 3ra Fecha ›

CF 102890M - Mathematics society problem

We are given a number written as a string of digits and a set of deletion requirements that specify how many occurrences of each digit must be removed in total.

Practice › Codeforces Solutions › 2020 ICPC Gran Premio de Mexico 3ra Fecha ›

CF 102890K - K contestants

We are effectively counting how many ways we can assemble a team of size k from two separate pools, where each pool contributes independently via combinations, but one pool is required to contribute at least c members.

Practice › Codeforces Solutions › 2020 ICPC Gran Premio de Mexico 3ra Fecha ›

CF 102890I - Is this the best deal?

We are given three purchase amounts, denoted $t1, t2, t3$. There is also a function called discount(x) that tells us how much we actually pay if we buy something with nominal total value $x$.

Practice › Codeforces Solutions › 2020 ICPC Gran Premio de Mexico 3ra Fecha ›

CF 102890G - Gold Fever

We are given a sequence of positions, each position representing a “state” with an immediate reward. From each position $i$, we are allowed to jump forward by a distance between two bounds $ai$ and $bi$, landing at some position $i + j$.

Practice › Codeforces Solutions › 2020 ICPC Gran Premio de Mexico 3ra Fecha ›

CF 102890F - Fit them all

We are given a packing problem on a fixed platform. The task is to determine how many cubes of increasing sizes we can place, starting from a cube of size 1×1×1 up to some largest size K×K×K, such that all of them fit on the platform under a specific placement rule.

Practice › Codeforces Solutions › 2020 ICPC Gran Premio de Mexico 3ra Fecha ›

CF 102890E - End of the year bonus

We are given a circular line of people, each with a performance value. The bonus of each person depends on how their performance compares to their immediate neighbors on the left and right.

Practice › Codeforces Solutions › 2020 ICPC Gran Premio de Mexico 3ra Fecha ›

CF 102890A - Acing the contest

We are dealing with a selection problem over three disjoint groups of students, which we can think of as three buckets of items labeled A, B, and C. Each group has a fixed number of students, and we want to form a team of exactly K students.