SLPC 2024 Open Division

10 problems from SLPC 2024 Open Division (contest 104941), difficulty -. 2/10 solutions verified against sample I/O.

10 items

SLPC 2024 Open Division

Special | 10 problems | 2/10 verified | Difficulty - | 10m 56s

#	Problem	Time	✓
A	Ancient Math	1m 4s	✓
B	Buying Croissants	1m 18s	✓
C	Cutting Sandwiches	25s
D	Dangerous Driving	1m 34s
E	Even Walk	1m 25s
F	Fun Tournament	34s
G	Gaming!	1m 44s
H	How Does It Fit?	22s
I	I Spy	1m 7s
J	Just Use an Umbrella	1m 23s

Practice › Codeforces Solutions › SLPC 2024 Open Division ›

CF 104941J - Just Use an Umbrella

We are given a sequence of rain intensities over time, where each minute has a non-negative amount of rain falling. Alongside this timeline, there are multiple students, and each student performs a single continuous outdoor interval.

Practice › Codeforces Solutions › SLPC 2024 Open Division ›

CF 104941I - I Spy

We are given a grid with $n$ rows and $m$ columns. Each cell represents a window that can either be lit or dark. The configuration is constrained in two ways. First, every row $i$ has a fixed number $ai$ of lit windows.

Practice › Codeforces Solutions › SLPC 2024 Open Division ›

CF 104941G - Gaming!

We are given a directed graph where each vertex already has at most one incoming and at most one outgoing edge. This restriction means every connected component is structurally very simple: it is either a directed path or a directed cycle, and no vertex is ever a branching point.

Practice › Codeforces Solutions › SLPC 2024 Open Division ›

CF 104941E - Even Walk

We are given an undirected graph of towns connected by roads, where Womais can traverse edges any number of times and even revisit vertices freely. He starts at a fixed town $s$ and wants to reach a destination $t$.

Practice › Codeforces Solutions › SLPC 2024 Open Division ›

CF 104941H - How Does It Fit?

We are given a mutable string $s$ and a pattern $p$ that contains lowercase letters and wildcard stars. A star can be replaced by any (possibly empty) string, independently of other stars.

Practice › Codeforces Solutions › SLPC 2024 Open Division ›

CF 104941F - Fun Tournament

We are given a set of contestants, each described by two integers. Think of each contestant as carrying two “moves”: the first move is $ai$, and the second move is $bi$.

Practice › Codeforces Solutions › SLPC 2024 Open Division ›

CF 104941D - Dangerous Driving

The road can be thought of as a single journey of length $d$ kilometers, while the environment changes over time due to events involving other cars.

Practice › Codeforces Solutions › SLPC 2024 Open Division ›

CF 104941B - Buying Croissants

We are given a sequence of daily croissant prices for the next $n$ days. Each day, exactly one croissant must be eaten, and croissants are perishable: any croissant remains edible only for 7 days after purchase, including the purchase day, and becomes useless afterward.

Practice › Codeforces Solutions › SLPC 2024 Open Division ›

CF 104941C - Cutting Sandwiches

Working

Practice › Codeforces Solutions › SLPC 2024 Open Division ›

CF 104941A - Ancient Math

We are given the radius of a circle, and we are asked to construct a square that has exactly the same area as that circle. The task is not geometric construction in the classical sense, but a direct numerical computation: we must output the side length of such a square.