The 2023 ICPC Masters Mexico Regional #ICPCMX2023 Edition

9 problems from The 2023 ICPC Masters Mexico Regional #ICPCMX2023 Edition (contest 104758), difficulty -. 3/9 solutions verified against sample I/O.

9 items

The 2023 ICPC Masters Mexico Regional #ICPCMX2023 Edition

ICPC/IOI | 9 problems | 3/9 verified | Difficulty - | 12m 54s

#	Problem	Time	✓
A	Alaric Journey	1m 13s
B	Bionaccia's Sequence	1m 23s	✓
C	Counting Decorations	1m 22s	✓
D	Determine Pool Area	1m 29s
E	Earning Profit	1m 31s
F	Floral Garden	2m 7s
G	Gojo Satoru	1m 40s
H	Highly Resilient Network	1m 20s
I	ICPC Masters	49s	✓

Practice › Codeforces Solutions › The 2023 ICPC Masters Mexico Regional #ICPCMX2023 Edition ›

CF 104758C - Counting Decorations

We are building a triangular decoration with $N$ horizontal levels. Level $i$ contains exactly $i$ stickers, and every sticker must be colored using one of three colors: red, green, or blue.

Practice › Codeforces Solutions › The 2023 ICPC Masters Mexico Regional #ICPCMX2023 Edition ›

CF 104758A - Alaric Journey

We are given a sequence of integers arranged in a line. In one move, we may take two neighboring elements and replace them with their sum, effectively shortening the sequence by one element while preserving order elsewhere.

Practice › Codeforces Solutions › The 2023 ICPC Masters Mexico Regional #ICPCMX2023 Edition ›

CF 104758I - ICPC Masters

We are given a line of participants who need to be split into teams. The organizers always try to form as many complete teams as possible, where each complete team contains exactly $K$ people.

Practice › Codeforces Solutions › The 2023 ICPC Masters Mexico Regional #ICPCMX2023 Edition ›

CF 104758F - Floral Garden

We are given a grid where each cell has a numeric value representing flower beauty. A “photo” corresponds to choosing any contiguous subrectangle of this grid. For each chosen subrectangle, we look at every row inside it and take the maximum value in that row segment.

Practice › Codeforces Solutions › The 2023 ICPC Masters Mexico Regional #ICPCMX2023 Edition ›

CF 104758H - Highly Resilient Network

We are given a network of servers where every server is a node and each connection is an undirected edge. The current network may be disconnected.

Practice › Codeforces Solutions › The 2023 ICPC Masters Mexico Regional #ICPCMX2023 Edition ›

CF 104758G - Gojo Satoru

We are modelling a process where a character accumulates energy over time and occasionally converts all stored energy into a permanent change in production rate. At the start, energy is generated at a fixed rate of one unit per minute.

Practice › Codeforces Solutions › The 2023 ICPC Masters Mexico Regional #ICPCMX2023 Edition ›

CF 104758E - Earning Profit

We are given a directed network of cities connected by flights. Each flight has a direction and a cost, so traveling from city U to city V reduces our money by C if we take that flight.

Practice › Codeforces Solutions › The 2023 ICPC Masters Mexico Regional #ICPCMX2023 Edition ›

CF 104758D - Determine Pool Area

We are given a sequence of numbers representing heights along a line. From this array, we want to select a contiguous segment that behaves like a “pool”, meaning the segment is anchored by two boundary positions and the structure between them does not introduce any higher…

Practice › Codeforces Solutions › The 2023 ICPC Masters Mexico Regional #ICPCMX2023 Edition ›

CF 104758B - Bionaccia's Sequence

We are given a single very large index $K$, and asked to compute the $K$-th value of a sequence defined by a third-order recurrence. The sequence starts with three fixed values, and every later term is built from the previous three terms plus an additional constant contribution.