La Salle-Pui Ching Programming Challenge 培正喇沙編程挑戰賽 2023

12 problems from La Salle-Pui Ching Programming Challenge 培正喇沙編程挑戰賽 2023 (contest 105276), difficulty -. 6/12 solutions verified against sample I/O.

12 items

La Salle-Pui Ching Programming Challenge 培正喇沙編程挑戰賽 2023

Special | 12 problems | 6/12 verified | Difficulty - | 18m 27s

#	Problem	Time	✓
A	Always Right	1m 17s	✓
B	Binary Bracket	2m 6s
C	Cross Across the Grid	1m 36s
D	Decisive Duels	1m 24s	✓
E	Enthusiast of Algorithms	1m 6s	✓
F	Far-reaching Citations	1m 49s
G	GPT Intrusion	1m	✓
H	Handful of Balls	1m 9s	✓
I	Ideal Cutting	1m 24s	✓
J	Joining Two Trees	2m 26s
K	Keep Them Stacked	1m 51s
L	Lift Problem	1m 19s

Practice › Codeforces Solutions › La Salle-Pui Ching Programming Challenge 培正喇沙編程挑戰賽 2023 ›

CF 105276K - Keep Them Stacked

We are given three rectangular sheets, each with a fixed width and height, and we are allowed to place them on a plane without rotating them. The task is to arrange all three so that the total area of the region they occupy is as small as possible.

Practice › Codeforces Solutions › La Salle-Pui Ching Programming Challenge 培正喇沙編程挑戰賽 2023 ›

CF 105276L - Lift Problem

There are $N$ lifts and $N$ special floors called waiting floors. The $i$-th waiting floor is fixed at height $10i - 5$, so these floors are evenly spaced and strictly ordered. Each lift initially sits on its own waiting floor: lift $i$ starts at floor $10i - 5$.

Practice › Codeforces Solutions › La Salle-Pui Ching Programming Challenge 培正喇沙編程挑戰賽 2023 ›

CF 105276I - Ideal Cutting

We are given a convex polygon described by its vertices in counterclockwise order. The task is to cut this polygon into triangles using non-intersecting diagonals between vertices, exactly forming a triangulation.

Practice › Codeforces Solutions › La Salle-Pui Ching Programming Challenge 培正喇沙編程挑戰賽 2023 ›

CF 105276H - Handful of Balls

We are given a triangular board of side length $N$. The board is not a rectangle but a triangle where row $k$ contains $k$ cells, aligned to the left, forming the familiar triangular grid structure.

Practice › Codeforces Solutions › La Salle-Pui Ching Programming Challenge 培正喇沙編程挑戰賽 2023 ›

CF 105276F - Far-reaching Citations

Each published paper is constructed incrementally. Some papers are independent strings, while others are formed by taking an earlier paper and appending an extra string to its end.

Practice › Codeforces Solutions › La Salle-Pui Ching Programming Challenge 培正喇沙編程挑戰賽 2023 ›

CF 105276G - GPT Intrusion

We are given a program as plain text, split into several lines. The task is to determine whether this program is “suspected to be written by GPT and exceeds its output limit.

Practice › Codeforces Solutions › La Salle-Pui Ching Programming Challenge 培正喇沙編程挑戰賽 2023 ›

CF 105276E - Enthusiast of Algorithms

We are given several categories of algorithms, where each category contains a certain number of distinct algorithms. Over the next $K$ days, Bob will study exactly one category per day, and on that day he must learn exactly $M$ algorithms from that chosen category.

Practice › Codeforces Solutions › La Salle-Pui Ching Programming Challenge 培正喇沙編程挑戰賽 2023 ›

CF 105276C - Cross Across the Grid

The grid can be thought of as a set of concentric square rings around the center cell. Because the size is odd, there is a single center and every other cell belongs to exactly one ring.

Practice › Codeforces Solutions › La Salle-Pui Ching Programming Challenge 培正喇沙編程挑戰賽 2023 ›

CF 105276D - Decisive Duels

We are given a binary string where each character represents the outcome of a point in a badminton match simulation. A substring corresponds to a single match, and we scan it from left to right, updating a running score: 1 adds a point to David, 0 adds a point to the opponent.

Practice › Codeforces Solutions › La Salle-Pui Ching Programming Challenge 培正喇沙編程挑戰賽 2023 ›

CF 105276A - Always Right

We are working on a grid maze where each cell is either a wall or a free space, and exactly one cell is marked as a start and one as an exit. The movement rules are not the usual four-directional steps.

Practice › Codeforces Solutions › La Salle-Pui Ching Programming Challenge 培正喇沙編程挑戰賽 2023 ›

CF 105276J - Joining Two Trees

We are given two separate trees, one on the vertices of the first block and one on the vertices of the second block. We are allowed to connect exactly one vertex from the first tree to exactly one vertex from the second tree, turning the whole structure into a single tree.

Practice › Codeforces Solutions › La Salle-Pui Ching Programming Challenge 培正喇沙編程挑戰賽 2023 ›

CF 105276B - Binary Bracket

We are given a fixed single-elimination tournament with $2^K$ players. The bracket structure is completely predetermined: players are placed in order, first round pairs adjacent indices, then winners of adjacent matches face each other in the next round, and so on until one…