XXII Open Cup, Grand Prix of Daejeon

12 problems from XXII Open Cup, Grand Prix of Daejeon (contest 103627), difficulty -. 12/12 solutions verified against sample I/O.

12 items

XXII Open Cup, Grand Prix of Daejeon

Special | 12 problems | 12/12 verified | Difficulty - | 10m 3s

# Problem Rating Tags Accepted Time ✓
A Points 52s ✓
B Bingo 45s ✓
C AND PLUS OR 56s ✓
D Two Bullets 54s ✓
E Yet Another Interval Graph Problem 51s ✓
F Lag 53s ✓
G Critical Vertex 52s ✓
H Endless Road 50s ✓
I Streetlights 45s ✓
J Diameter Pair Sum 52s ✓
K Fake Plastic Trees 2 44s ✓
L Curly Racetrack 49s ✓
Practice › Codeforces Solutions › XXII Open Cup, Grand Prix of Daejeon ›

CF 103627F - Lag

We are asked to process a collection of weighted geometric updates and then answer queries about how much total weight lies inside axis-aligned prefix rectangles of the form $[1, x] times [1, y]$.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › XXII Open Cup, Grand Prix of Daejeon ›

CF 103627K - Fake Plastic Trees 2

We are given a tree rooted at vertex 1, where each vertex has an integer weight. Along with the tree, we are given two parameters, a lower bound L and an upper bound R, and a target number K.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › XXII Open Cup, Grand Prix of Daejeon ›

CF 103627G - Critical Vertex

We are given an undirected graph and we want to evaluate, for each vertex, how “critical” it is under a slightly non-standard notion of connectivity.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › XXII Open Cup, Grand Prix of Daejeon ›

CF 103627A - Points

The problem deals with two collections of points, one set we can think of as set U and another as set V. Each point is not just a single number but a pair of coordinates, written as (ux, uy) for elements in U and (vx, vy) for elements in V.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › XXII Open Cup, Grand Prix of Daejeon ›

CF 103627L - Curly Racetrack

We are given a rectangular grid that represents a partial configuration of a racetrack made of curved tiles. Some cells are already fixed as containing a curly tile, while others are empty and can later be filled by the admin.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › XXII Open Cup, Grand Prix of Daejeon ›

CF 103627J - Diameter Pair Sum

We are working with a tree that is being dynamically modified, and each query asks us to compute a quantity that depends on distances inside a connected component of that tree.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › XXII Open Cup, Grand Prix of Daejeon ›

CF 103627I - Streetlights

We are given a line of streetlights, each with a height, and a sequence of updates and queries. The updates change the height of a specific streetlight over time, while the queries ask us to count how many “visible pairs” of streetlights currently exist.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › XXII Open Cup, Grand Prix of Daejeon ›

CF 103627H - Endless Road

We are given a collection of segments on a line, where each segment represents a member and the interval of road they cover. The road itself is conceptually continuous, but the only interesting structure comes from segment endpoints.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › XXII Open Cup, Grand Prix of Daejeon ›

CF 103627E - Yet Another Interval Graph Problem

We are given a collection of weighted intervals on a line. Each interval can be thought of as an edge that connects its endpoints, and if two intervals overlap or touch through a chain of overlaps, they belong to the same connected component in the induced interval graph.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › XXII Open Cup, Grand Prix of Daejeon ›

CF 103627D - Two Bullets

We are given a sequence of values indexed from left to right. Each index represents a building, and each building has a height.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › XXII Open Cup, Grand Prix of Daejeon ›

CF 103627C - AND PLUS OR

We are given a universe of elements indexed from 0 to N − 1. Every subset of this universe is associated with a value through a function a(S).
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › XXII Open Cup, Grand Prix of Daejeon ›

CF 103627B - Bingo

We are working with an $n times n$ grid where each cell can either be filled or left empty. The goal is to construct a pattern of empty cells that avoids forming any complete “bingo line”, where a bingo line corresponds to a fully empty row, fully empty column, or a fully…
codeforces competitive-programming Jul 2, 2026