GPL 2023 Advanced

10 problems from GPL 2023 Advanced (contest 104598), difficulty -. 7/10 solutions verified against sample I/O.

10 items

GPL 2023 Advanced

Special | 10 problems | 7/10 verified | Difficulty - | 14m 13s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Dividing Data				1m 1s	✓
B	Speedrun Splits				1m 20s	✓
C	Lots of Triangles				1m 8s	✓
D	Intergalactic Terrorism				1m 41s
E	AI Duck				2m 22s
F	Silly Nilly's Stuffies				1m 13s	✓
G	Mysterious Maze				1m 3s	✓
H	Model Evaluation				1m 26s	✓
I	Thomas the Train				1m 44s	✓
J	Special Word Search				1m 15s

Practice › Codeforces Solutions › GPL 2023 Advanced ›

CF 104598J - Special Word Search

We are given a square grid of characters, and a list of words. A word is considered “found” if its letters can be traced on the grid in a straight line: horizontally, vertically, or diagonally.

Practice › Codeforces Solutions › GPL 2023 Advanced ›

CF 104598I - Thomas the Train

We are given a complete network of train stations, where every station has a single passenger that appears at a fixed timestamp. Traveling between any two stations takes a known amount of time, and this travel time is not necessarily symmetric.

Practice › Codeforces Solutions › GPL 2023 Advanced ›

CF 104598E - AI Duck

We are working on a grid from $(1,1)$ to $(N,M)$, and movement is restricted to only right or up moves. This means every valid path is monotone: both coordinates strictly increase along the path. On top of that, we are given $K$ special cells that must all be visited by the path.

Practice › Codeforces Solutions › GPL 2023 Advanced ›

CF 104598G - Mysterious Maze

We are given a set of horizontal and vertical line segments on an infinite grid. Neo-Bot starts at the origin and is only allowed to move along these segments. Each segment has an associated length equal to its Manhattan length along the line.

Practice › Codeforces Solutions › GPL 2023 Advanced ›

CF 104598D - Intergalactic Terrorism

We are given a tree with $n$ nodes. Each node has a positive value $ai$. The tree is rooted implicitly by the parent array, but the structure is still an undirected tree. Kafka will add exactly one extra edge between two distinct nodes $u$ and $v$. That edge has weight $au + av$.

Practice › Codeforces Solutions › GPL 2023 Advanced ›

CF 104598C - Lots of Triangles

We are given a collection of geometric objects in three-dimensional space. Each object is a triangle, described by three points in $(x, y, z)$ coordinates.

Practice › Codeforces Solutions › GPL 2023 Advanced ›

CF 104598H - Model Evaluation

The task gives two square grids of numbers, both of size $N times N$, representing pixel intensities of two images. For each query, we are given a rectangular subregion inside these grids, specified by two opposite corners.

Practice › Codeforces Solutions › GPL 2023 Advanced ›

CF 104598F - Silly Nilly's Stuffies

We are given a sequence of piles, each pile containing some number of stuffed animals. In one move, we are allowed to increase or decrease the size of any single pile by exactly one, and we can do this as many times as needed.

Practice › Codeforces Solutions › GPL 2023 Advanced ›

CF 104598B - Speedrun Splits

Each run of the game records a sequence of split times, and every run contains the same number of splits. You can think of the input as a matrix with $N$ rows and $K$ columns, where row $i$ stores the time taken for each split in run $i$, and the columns correspond to the same…

Practice › Codeforces Solutions › GPL 2023 Advanced ›

CF 104598A - Dividing Data

We are given a collection of files, each with a positive size measured in bits, and a storage budget that limits how many total bits we can allocate.