EPIC Institute of Technology Round Summer 2024 (Div. 1 + Div. 2)
Solutions for EPIC Institute of Technology Round Summer 2024 (Div. 1 + Div. 2) (contest 1987). 3/10 problems verified against sample I/O. Difficulty range: 800-3500.
EPIC Institute of Technology Round Summer 2024 (Div. 1 + Div. 2)
Type: Div. 1+2 | Problems: 10 | Verified: 3/10 | Rating range: 800-3500 | Time: 29m 10s
| Problem | Name | Rating | Tags | Solve Time | Verified |
|---|---|---|---|---|---|
| A | Upload More RAM | 800 | greedy, math | 1m 39s | ✗ |
| B | K-Sort | 1000 | greedy | 6m 11s | ✗ |
| C | Basil's Garden | 1200 | dp, greedy | 2m 18s | ✓ |
| D | World is Mine | 1800 | dp, games | 5m 18s | ✗ |
| E | Wonderful Tree! | 2000 | brute-force, data-structures, dfs-and-similar | 2m 2s | ✓ |
| F1 | Interesting Problem (Easy Version) | 2500 | dp | 1m 28s | ✓ |
| F2 | Interesting Problem (Hard Version) | 2600 | dp | 1m 22s | ✗ |
| G1 | Spinning Round (Easy Version) | 2900 | divide-and-conquer, dp, trees | 3m 32s | ✗ |
| G2 | Spinning Round (Hard Version) | 3500 | divide-and-conquer, dp, trees | 3m 28s | ✗ |
| H | Fumo Temple | 3500 | interactive | 1m 52s | ✗ |
CF 1987G2 - Spinning Round (Hard Version)
We are given a permutation of integers from 1 to $n$ and a string of instructions of length $n$, where each instruction is either L, R, or ?. Each position in the permutation can either connect to its nearest larger number to the left (L) or to the right (R), and ?
CF 1987H - Fumo Temple
We are asked to find a hidden cell in a rectangular matrix of size $n times m$, where each cell contains either -1, 0, or 1.
CF 1987G1 - Spinning Round (Easy Version)
We are given a permutation p of length n and a string s of the same length consisting only of ?. Each position i in the permutation defines two special indices: li is the last index before i where the permutation value is larger, and ri is the first index after i where the…
CF 1987B - K-Sort
We are given an array of integers representing a sequence of numbers that we want to make non-decreasing. The only operation allowed is to choose a set of k indices and increment each of those selected elements by one, paying k + 1 coins for the operation.
CF 1987D - World is Mine
We have a two-player game between Alice and Bob played over a set of cakes, each with an integer tastiness. Alice goes first.
CF 1987F2 - Interesting Problem (Hard Version)
We are given an array of integers where each element lies between 1 and the array's length. The operation we can perform requires finding an index i such that the value at that position equals i. When we do, we remove both a[i] and the following element a[i+1] from the array.
CF 1987F1 - Interesting Problem (Easy Version)
We are given an array of integers of length $n$. At each step, we can choose an index $i$ where $ai = i$ and $i < n$, and remove both $ai$ and $a{i+1}$. The goal is to maximize the number of times we can perform this operation until no more valid indices exist.
CF 1987A - Upload More RAM
We are asked to determine the minimum time required to upload a certain amount of RAM, measured in gigabytes. You can upload either 0 or 1 GB per second, but there is a constraint on the network: in any consecutive block of $k$ seconds, the total upload cannot exceed 1 GB.
CF 1987E - Wonderful Tree!
We are given a rooted tree with integer values assigned to each node. The tree is rooted at vertex 1. A tree is considered wonderful if, for every non-leaf vertex, its value is at most the sum of the values of its immediate children.
CF 1987C - Basil's Garden
We are asked to simulate a garden of flowers arranged in a line, where each flower has an initial height. The wind blows from the left every second and decreases the height of some flowers according to a strict rule: a flower will shrink if it is the last flower in the line or…