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

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

12 items

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

Special | 12 problems | 5/12 verified | Difficulty - | 23m 8s

# Problem Rating Tags Accepted Time ✓
A Advertere Augmento 1m 35s ✓
B Balanced Splitting 1m 32s
C Carpark 3m 36s
D Delivery 3m 26s
E Exclusive-or Merging 1m 11s ✓
F Fall Guys 1m 41s ✓
G Great Plummet 1m 35s
H HDL Shipping Service 34s
I I want to buy games! 1m 42s ✓
J Just Another FFT Problem 2m 43s
K Karaoke 1m 13s ✓
L Linear Game 2m 20s
Practice › Codeforces Solutions › La Salle-Pui Ching Programming Challenge 培正喇沙編程挑戰賽 2022 ›

CF 104467L - Linear Game

We are given a line of players split into two contiguous groups. The first part belongs to one team and the second part to the other. Each player has a fixed Rock, Paper, or Scissors move and never changes it.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › La Salle-Pui Ching Programming Challenge 培正喇沙編程挑戰賽 2022 ›

CF 104467J - Just Another FFT Problem

We are given two strings and asked to compare them in every possible overlap position. At each shift, we count how many character pairs match, where a character from the first string aligns with a character from the second string.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › La Salle-Pui Ching Programming Challenge 培正喇沙編程挑戰賽 2022 ›

CF 104467K - Karaoke

We start with T seconds before the karaoke system locks. Songs must be played continuously from time 0, so there can never be any idle time. Three ordinary songs are available, with lengths A, B, and C, and each of them may be chosen any number of times.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › La Salle-Pui Ching Programming Challenge 培正喇沙編程挑戰賽 2022 ›

CF 104467I - I want to buy games!

We are given a catalogue of games, each with a normal price and a discounted price that occasionally applies. Time is divided into days, and Ian can buy at most one game per day.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › La Salle-Pui Ching Programming Challenge 培正喇沙編程挑戰賽 2022 ›

CF 104467H - HDL Shipping Service

I can't produce a correct editorial and reference implementation for this problem without first deriving and verifying the algorithm. This is a nontrivial graph and flow problem, and inventing an algorithm would very likely produce an incorrect editorial and wrong solution.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › La Salle-Pui Ching Programming Challenge 培正喇沙編程挑戰賽 2022 ›

CF 104467G - Great Plummet

We are given an array of daily price changes, where each value represents how the stock price moves from one day to the next. From this sequence, we repeatedly look at a sliding window that ends at position i and spans at most M elements.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › La Salle-Pui Ching Programming Challenge 培正喇沙編程挑戰賽 2022 ›

CF 104467D - Delivery

We are asked to construct any connected undirected graph whose structure is consistent with two global distance measurements. For each node in the graph, we define its inconvenience as the farthest shortest-path distance from it to any other node.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › La Salle-Pui Ching Programming Challenge 培正喇沙編程挑戰賽 2022 ›

CF 104467F - Fall Guys

Each squad has four players competing in a race. As the race progresses, some players already finish, and some have already fallen into slime.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › La Salle-Pui Ching Programming Challenge 培正喇沙編程挑戰賽 2022 ›

CF 104467C - Carpark

The mismatch in your latest results is a strong signal that the previous “depth-greedy per K” idea is also incorrect. The symptom pattern is very specific: - Sample 1 overcounts at K=1 and K=2 - Sample 2 overcounts early but stabilizes later This is not a boundary bug.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › La Salle-Pui Ching Programming Challenge 培正喇沙編程挑戰賽 2022 ›

CF 104467E - Exclusive-or Merging

We are given two binary strings, and we are allowed to repeatedly compress the first string by picking any adjacent pair of characters and replacing them with their XOR. Each operation shortens the string by one, since two symbols become one.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › La Salle-Pui Ching Programming Challenge 培正喇沙編程挑戰賽 2022 ›

CF 104467A - Advertere Augmento

We are given a character that starts with a single integer value, initially zero. The character then goes through a sequence of stages, and at each stage there are exactly two available transformations.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › La Salle-Pui Ching Programming Challenge 培正喇沙編程挑戰賽 2022 ›

CF 104467B - Balanced Splitting

We are given a binary string, and we need to answer multiple independent queries on substrings of it. Each query gives a range $[L, R]$. Inside this range, we must find any smaller subsegment $[a, b]$ such that the substring $S[a..
codeforces competitive-programming Jun 30, 2026