2023 Benelux Algorithm Programming Contest (BAPC 23)

12 problems from 2023 Benelux Algorithm Programming Contest (BAPC 23) (contest 104790), difficulty -. 12/12 solutions verified against sample I/O.

12 items

2023 Benelux Algorithm Programming Contest (BAPC 23)

Special | 12 problems | 12/12 verified | Difficulty - | 12m 14s

#	Problem	Time	✓
A	\texttt{apt upgrade}	58s	✓
B	Battle Bots	59s	✓
C	Compressing Commands	52s	✓
D	Democratic Naming	1m 15s	✓
E	Exam Study Planning	1m 9s	✓
F	Funicular Frenzy	1m 9s	✓
G	Geometry Game	1m 5s	✓
H	Hidden Art	1m 6s	✓
I	International Irregularities	1m 9s	✓
J	Jungle Job	45s	✓
K	King of the Hill	42s	✓
L	Locking Doors	1m 5s	✓

Practice › Codeforces Solutions › 2023 Benelux Algorithm Programming Contest (BAPC 23) ›

CF 104790I - International Irregularities

We are given a collection of countries, each assigned a nondecreasing infection score. Traveling between any two countries always takes one day of travel, but arrival can trigger an additional quarantine penalty depending on how much worse the previous country is compared to…

Practice › Codeforces Solutions › 2023 Benelux Algorithm Programming Contest (BAPC 23) ›

CF 104790D - Democratic Naming

Every city in the new county has a name of the same length. The county's final name is chosen one character at a time. For each position, every city votes for the letter that appears at that position in its own name.

Practice › Codeforces Solutions › 2023 Benelux Algorithm Programming Contest (BAPC 23) ›

CF 104790E - Exam Study Planning

Each exam occupies a fixed slot in time, and exams do not overlap. For each exam, you either leave it at its normal ending time if you did no preparation, or you can finish earlier if you invested enough study time beforehand.

Practice › Codeforces Solutions › 2023 Benelux Algorithm Programming Contest (BAPC 23) ›

CF 104790B - Battle Bots

We are given a number $n$, which represents how many single-unit claw operations are required to completely dismantle an opponent robot if we relied only on the claw.

Practice › Codeforces Solutions › 2023 Benelux Algorithm Programming Contest (BAPC 23) ›

CF 104790K - King of the Hill

We are given an unknown grid of size $n times n$, where each cell contains a distinct integer height. The grid is not visible directly. Instead, we can only query individual coordinates and receive the height at that location.

Practice › Codeforces Solutions › 2023 Benelux Algorithm Programming Contest (BAPC 23) ›

CF 104790L - Locking Doors

We are given a collection of rooms connected by doors. Each door can be traversed in both directions, so physically the layout is an undirected connected graph.

Practice › Codeforces Solutions › 2023 Benelux Algorithm Programming Contest (BAPC 23) ›

CF 104790J - Jungle Job

We are given a rooted tree with $n$ vertices, numbered from $0$ to $n-1$. Each edge connects a node to its parent, so the input implicitly defines a rooted structure.

Practice › Codeforces Solutions › 2023 Benelux Algorithm Programming Contest (BAPC 23) ›

CF 104790H - Hidden Art

We are given a finite rectangular pattern made of four colors, but this pattern is repeated infinitely in both horizontal and vertical directions, forming an infinite tiling of the plane.

Practice › Codeforces Solutions › 2023 Benelux Algorithm Programming Contest (BAPC 23) ›

CF 104790G - Geometry Game

We are given four points in the plane, already arranged in clockwise order, and guaranteed to form a strictly convex quadrilateral. Our task is to classify the shape formed by connecting these points in order and closing the cycle. The classification is hierarchical.

Practice › Codeforces Solutions › 2023 Benelux Algorithm Programming Contest (BAPC 23) ›

CF 104790F - Funicular Frenzy

There is a queueing system in front of a funicular that runs for a fixed number of minutes during the day. Each minute, a known number of people arrive and join the queue, and immediately after those arrivals are processed, a carriage departs and removes up to a fixed number…

Practice › Codeforces Solutions › 2023 Benelux Algorithm Programming Contest (BAPC 23) ›

CF 104790A - \texttt{apt upgrade}

We are given a collection of software packages, each with a known download size. At some moment during an upgrade process, we observe that exactly some number of packages have already fully completed downloading, while up to a fixed number of packages can be downloading at the…

Practice › Codeforces Solutions › 2023 Benelux Algorithm Programming Contest (BAPC 23) ›

CF 104790C - Compressing Commands

We are given several absolute file paths in a Unix-like filesystem. We are allowed to choose a single working directory anywhere in the tree, but not inside a file.