XIX Open Olympiad in Informatics - Final Stage, Day 1 (Unrated, Online Mirror, IOI rules)
4 problems from XIX Open Olympiad in Informatics - Final Stage, Day 1 (Unrated, Online Mirror, IOI rules) (contest 2079), difficulty 1800-3300. 3/4 solutions verified against sample I/O.
XIX Open Olympiad in Informatics - Final Stage, Day 1 (Unrated, Online Mirror, IOI rules)
ICPC/IOI | 4 problems | 3/4 verified | Difficulty 1800-3300 | 3m 34s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Alice, Bob, And Two Arrays | 3300 | *special, data-structures, dp | 37 | 55s | ✓ |
| B | Arithmetic Exercise | 2600 | *special, data-structures, dp | 155 | 1m 2s | ✓ |
| C | Dreaming Is Not Harmful | 2300 | *special | 222 | 49s | |
| D | Cute Subsequences | 1800 | *special, sortings | 682 | 48s | ✓ |
CF 2079D - Cute Subsequences
The problem gives us a sequence of integers and asks us to count the number of cute subsequences. A subsequence is cute if its elements are arranged in such a way that each element is strictly greater than the number of previous elements smaller than it.
CF 2079B - Arithmetic Exercise
The problem presents a sequence of arithmetic exercises, each consisting of a pair of integers $(ai, bi)$. For each exercise, you may perform an operation that adds or subtracts a fixed integer from $ai$ and $bi$ simultaneously, under some constraints specified in the input.
CF 2079A - Alice, Bob, And Two Arrays
We have two players, Alice and Bob, each with their own array of integers of the same length. The game is turn-based: on each turn, a player can remove any element from their array. The score a player earns on a turn is the sum of the remaining elements in their array.