AdaByron Regional Madrid 2023

11 problems from AdaByron Regional Madrid 2023 (contest 104442), difficulty -. 10/11 solutions verified against sample I/O.

11 items

AdaByron Regional Madrid 2023

Special | 11 problems | 10/11 verified | Difficulty - | 9m 28s

# Problem Rating Tags Accepted Time ✓
A El bruxeador 52s ✓
B IKERobot 59s ✓
C Crimen en Villacep\u00e9 1m 12s ✓
D El abeXORro 47s ✓
E Obras de ingenier\u00eda 48s ✓
F Fechas de entrenamiento 28s
G El jard\u00edn del Ed\u00e9n 54s ✓
H El m\u00e1ximo de diversi\u00f3n 46s ✓
I C\u00e1lculo num\u00e9rico 57s ✓
J Aviones 52s ✓
K P = NP 53s ✓
Practice › Codeforces Solutions › AdaByron Regional Madrid 2023 ›

CF 104442K - P = NP

We are working in a machine model where all arithmetic is performed using 32-bit unsigned integers. That means every result is reduced modulo $2^{32}$ whenever it exceeds the representable range.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › AdaByron Regional Madrid 2023 ›

CF 104442J - Aviones

The grid describes a black-and-white image where most cells are background and the remaining cells belong to an airplane. Every airplane cell is labeled with a digit from 0 to 9, and all cells sharing the same digit form a single “zone type”.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › AdaByron Regional Madrid 2023 ›

CF 104442I - Cálculo numérico

We are given several independent scenarios on a 2D integer plane. In each scenario, a robot starts at a coordinate $I = (x1, y1)$ and must reach a target coordinate $F = (x2, y2)$.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › AdaByron Regional Madrid 2023 ›

CF 104442G - El jardín del Edén

We are given a binary cellular automaton of fixed length. Each configuration is a row of C cells, where each cell is either 0 or 1.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › AdaByron Regional Madrid 2023 ›

CF 104442H - El máximo de diversión

We are given several independent sequences of points in the plane, where each sequence describes a fixed route that must be followed in order. Each route is a list of coordinates $(x1, y1), (x2, y2), dots, (xn, yn)$, and we only care about movements between consecutive points.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › AdaByron Regional Madrid 2023 ›

CF 104442E - Obras de ingeniería

We are given several independent test cases. Each test case describes a sequence of building heights along a one-way street. The city wants to transform this sequence so that as we move from left to right, the heights never decrease.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › AdaByron Regional Madrid 2023 ›

CF 104442F - Fechas de entrenamiento

The statement you pasted is truncated, so there isn’t enough information to reconstruct the actual problem. Right now we only see the title “Fechas de entrenamiento” and empty Input/Output sections.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › AdaByron Regional Madrid 2023 ›

CF 104442D - El abeXORro

We are given several independent test cases. In each one, there is an array of values placed on nodes, which we can think of as flowers carrying some amount of pollen.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › AdaByron Regional Madrid 2023 ›

CF 104442C - Crimen en Villacepé

We are given a graph on $n$ people. Each input edge between two people means there was some declaration between them, but the content of the declaration has been lost.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › AdaByron Regional Madrid 2023 ›

CF 104442B - IKERobot

We are given a robot moving on an infinite integer grid. It starts at a given coordinate and must reach a target coordinate while avoiding a set of blocked grid points that cannot be stepped on.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › AdaByron Regional Madrid 2023 ›

CF 104442A - El bruxeador

We are given an array of weights, and we must split these values into exactly $k$ non-empty groups, where each weight belongs to exactly one group. For any group, its cost is defined as the difference between the largest and smallest value inside that group.
codeforces competitive-programming Jun 30, 2026