BdOI Preliminary 2024

5 problems from BdOI Preliminary 2024 (contest 104973), difficulty -. 4/5 solutions verified against sample I/O.

5 items

BdOI Preliminary 2024

Special | 5 problems | 4/5 verified | Difficulty - | 8m 55s

# Problem Rating Tags Accepted Time ✓
A Median 5m 20s
B Hats 45s ✓
C Pepeland 1m 10s ✓
D Removals 46s ✓
E Databases 54s ✓
Practice › Codeforces Solutions › BdOI Preliminary 2024 ›

CF 104973A - Median

Codeforces 104973A: Median
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › BdOI Preliminary 2024 ›

CF 104973E - Databases

We are given a collection of databases arranged in a line. Each database behaves like a queue with a fixed capacity. We also have a sequence of operations, and each operation takes a value and pushes it into every database whose index lies inside a given interval.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › BdOI Preliminary 2024 ›

CF 104973D - Removals

We start with an array a whose elements contribute to a total sum we want to maximize. We are allowed to delete elements from a, but deletions are not arbitrary: each deletion is triggered by choosing a position from a second array b, and removing the corresponding indexed…
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › BdOI Preliminary 2024 ›

CF 104973C - Pepeland

We are given an undirected graph with $n$ cities and $m$ proposed tunnels. Each tunnel connects two cities and carries a numeric tag. We are allowed to assign each city a label, also a number.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › BdOI Preliminary 2024 ›

CF 104973B - Hats

We are given a stack of hats, where each hat has a unique label and only the top of the stack is accessible at any time. People arrive one by one in fixed order from 1 to n.
codeforces competitive-programming Jun 28, 2026