OCPC 2024 Winter, Day 8: Borys Minaiev Contest 1 (The 3rd Universal Cup. Stage 27: London)
13 problems from OCPC 2024 Winter, Day 8: Borys Minaiev Contest 1 (The 3rd Universal Cup. Stage 27: London) (contest 105699), difficulty -. 13/13 solutions verified against sample I/O.
OCPC 2024 Winter, Day 8: Borys Minaiev Contest 1 (The 3rd Universal Cup. Stage 27: London)
Special | 13 problems | 13/13 verified | Difficulty - | 11m 53s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | (A + B) mod P | 55s | ✓ | |||
| B | The Best Wife | 1m 2s | ✓ | |||
| C | Cardinality | 47s | ✓ | |||
| D | 3D | 51s | ✓ | |||
| E | Equal Strings | 45s | ✓ | |||
| F | Fast Tree Queries | 1m 9s | ✓ | |||
| G | Geo Sharding | 1m 11s | ✓ | |||
| H | Have You Seen This Subarray? | 48s | ✓ | |||
| I | Interactive Casino | 42s | ✓ | |||
| J | Jigsaw Puzzle | 1m 3s | ✓ | |||
| K | Knapsack | 55s | ✓ | |||
| L | London Underground | 1m | ✓ | |||
| M | Meta | 45s | ✓ |
CF 105699M - Meta
We are given a small set of programming contest problems, and for each problem we know how long each of three teammates would need to implement it if they are the one assigned to it. A value of -1 means that a particular teammate is unable to implement that problem at all.
CF 105699L - London Underground
We are working with a fixed railway network of 426 stations. The connections between stations are also fixed across all test cases, and each station is identified by a string name.
CF 105699K - Knapsack
We are given an array of integers, each quite large and chosen independently at random. From these numbers we are allowed to keep some and discard others. Every kept number must be assigned to exactly one of three labeled groups, A, B, or C.
CF 105699J - Jigsaw Puzzle
We are given a set of polygonal “tiles”. Each tile is a piece of a unit square that was repeatedly cut by straight lines, so the original object was a square and every cut was a straight segment crossing it.
CF 105699I - Interactive Casino
Each round of the game presents a state of your current capital and an integer chosen by the judge. That integer is drawn uniformly from the range from 1 up to your current money, so larger balances immediately increase the range of possible outcomes for that round.
CF 105699G - Geo Sharding
We are given an $n times n$ grid of cells, and we must assign a color to every cell. The coloring is constrained in two ways. First, each color is allowed to appear only a limited number of times globally, at most 150 cells per color.
CF 105699H - Have You Seen This Subarray?
We start with a clean permutation where the array is initially a[i] = i. Each operation performs a swap between two positions, and after a sequence of such swaps the array becomes a time-evolving permutation of 1..n.
CF 105699F - Fast Tree Queries
We are working with a tree where every vertex initially holds its own index as its value. Over time, the values change because we repeatedly pick a path between two vertices and add a number to every value along that path.
CF 105699E - Equal Strings
We are given a hidden collection of binary strings, each of fixed length 50. There are n of these strings, but they are not revealed directly.
CF 105699D - 3D
We are given a complete set of pairwise “distances” between up to ten unknown points in three-dimensional space. These values are not exact Euclidean distances. Each true geometric distance has been perturbed independently by a small random value in the interval $[-0.1, 0.
CF 105699B - The Best Wife
We are given a stream of intervals, and after each new interval arrives we must answer a planning question: using only the intervals seen so far, what is the largest number of them that can be chosen so that none overlap in time.