2024 Benelux Algorithm Programming Contest (BAPC 24)

13 problems from 2024 Benelux Algorithm Programming Contest (BAPC 24) (contest 105492), difficulty -. 13/13 solutions verified against sample I/O.

13 items

2024 Benelux Algorithm Programming Contest (BAPC 24)

Special | 13 problems | 13/13 verified | Difficulty - | 13m 22s

#	Problem	Time	✓
A	`Aaawww...'' or` Aaayyy!!!''	57s	✓
B	Buggy Blinkers	1m 12s	✓
C	Concurrent Contests	1m 46s	✓
D	Disgruntled Diner	1m 13s	✓
E	Extraterrestrial Exploration	55s	✓
F	Failing Factory	45s	✓
G	Grocery Greed	53s	✓
H	Horse Habitat	50s	✓
I	Interrail Pass	55s	✓
J	Jumbled Scoreboards	55s	✓
K	Karaoke Compression	54s	✓
L	Levelling Locks	58s	✓
M	Museum Visit	1m 9s	✓

Practice › Codeforces Solutions › 2024 Benelux Algorithm Programming Contest (BAPC 24) ›

CF 105492C - Concurrent Contests

There are several programming contests happening at the same time, and a set of participants must be distributed among them. Each contest has a single prize that only its winner receives.

Practice › Codeforces Solutions › 2024 Benelux Algorithm Programming Contest (BAPC 24) ›

CF 105492M - Museum Visit

We are given a timeline of days, each day having a known “discomfort cost” if we choose to visit the museum on that day. Alongside this, there are multiple exhibitions, and each exhibition is active over a contiguous range of days.

Practice › Codeforces Solutions › 2024 Benelux Algorithm Programming Contest (BAPC 24) ›

CF 105492K - Karaoke Compression

We are given a single string representing a sequence of lyrics. We are allowed to perform exactly one compression operation.

Practice › Codeforces Solutions › 2024 Benelux Algorithm Programming Contest (BAPC 24) ›

CF 105492J - Jumbled Scoreboards

We receive a sequence of snapshots from a game scoreboard, where each snapshot contains two integers representing the scores of two competing teams at that moment.

Practice › Codeforces Solutions › 2024 Benelux Algorithm Programming Contest (BAPC 24) ›

CF 105492I - Interrail Pass

We are given a fixed itinerary consisting of n travel days, each occurring on a specific calendar day. For each of these days, there is a cost if we decide to buy a single ticket independently. These days are already sorted by time, and no two days share the same timestamp.

Practice › Codeforces Solutions › 2024 Benelux Algorithm Programming Contest (BAPC 24) ›

CF 105492G - Grocery Greed

Each item has a price given with exactly two decimal places. You are allowed to split the set of items into groups, and each group can be paid for either in cash or by card. Card payment charges the exact sum of the items in the group.

Practice › Codeforces Solutions › 2024 Benelux Algorithm Programming Contest (BAPC 24) ›

CF 105492F - Failing Factory

We are given a factory modeled as a directed graph where each node represents a processing step. Every step independently fails with a given probability.

Practice › Codeforces Solutions › 2024 Benelux Algorithm Programming Contest (BAPC 24) ›

CF 105492E - Extraterrestrial Exploration

We are given an array of $n$ hidden integers, revealed only through queries. Each position corresponds to a canister of fuel, and querying index $i$ returns its value $ai$. The array is sorted in non-decreasing order.

Practice › Codeforces Solutions › 2024 Benelux Algorithm Programming Contest (BAPC 24) ›

CF 105492D - Disgruntled Diner

We are given a log of orders where each order is a pair consisting of a menu item and a table number. Think of each order as an edge connecting a letter node (the dish) to a digit node (the table). The central computer knows all such edges.

Practice › Codeforces Solutions › 2024 Benelux Algorithm Programming Contest (BAPC 24) ›

CF 105492A - ``Aaawww...'' or ``Aaayyy!!!''

We are given a frozen contest scoreboard with several teams already ordered from best to worst. Each team has a row describing its submission status per problem: accepted, rejected, pending, or no submission at all.

Practice › Codeforces Solutions › 2024 Benelux Algorithm Programming Contest (BAPC 24) ›

CF 105492L - Levelling Locks

We are given a line of water-filled chambers, each with its own initial water level. All adjacent chambers are separated by gates, and initially every gate is closed, so nothing is connected.

Practice › Codeforces Solutions › 2024 Benelux Algorithm Programming Contest (BAPC 24) ›

CF 105492H - Horse Habitat

We are given a large rectangular grid where each cell is either usable terrain or blocked terrain. A usable cell can be part of a training course, while a blocked cell cannot.

Practice › Codeforces Solutions › 2024 Benelux Algorithm Programming Contest (BAPC 24) ›

CF 105492B - Buggy Blinkers

We are given a directed graph where each node represents an intersection and each edge corresponds to a one-way road in one of the four cardinal directions.