The 9th CCPC (Harbin) Onsite(The 2nd Universal Cup. Stage 10: Harbin)
13 problems from The 9th CCPC (Harbin) Onsite(The 2nd Universal Cup. Stage 10: Harbin) (contest 104813), difficulty -. 3/13 solutions verified against sample I/O.
The 9th CCPC (Harbin) Onsite(The 2nd Universal Cup. Stage 10: Harbin)
Special | 13 problems | 3/13 verified | Difficulty - | 20m 3s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Go go Baron Bunny! | 53s | ✓ | |||
| B | Memory | 1m 23s | ✓ | |||
| C | Karshilov's Matching Problem II | 1m 31s | ||||
| D | A Simple MST Problem | 2m 24s | ||||
| E | Revenge on My Boss | 2m 7s | ||||
| F | Palindrome Path | 1m 40s | ||||
| G | The Only Way to the Destination | 1m 27s | ||||
| H | Energy Distribution | 1m 8s | ✓ | |||
| I | Rolling For Days | 2m 43s | ||||
| J | Game on a Forest | 1m 37s | ||||
| K | Omniscia Spares None | 30s | ||||
| L | Palm Island | 1m 20s | ||||
| M | Painter | 1m 20s |
CF 104813M - Painter
We are working on an infinite 2D integer grid where every lattice point initially has the same default character ".". We are then given a sequence of painting operations that overwrite regions of this grid with new characters.
CF 104813L - Palm Island
We are given two permutations of the numbers from 1 to n. The first permutation describes the initial order of a deck of cards from top to bottom, and the second permutation describes the target order we want to achieve.
CF 104813I - Rolling For Days
We are given a large pool of cards split into a small number of types. Type $i$ contains $ai$ distinct cards, and we only care about collecting the first $bi$ distinct cards of that type. A single “refresh” draws one card uniformly from the entire pool.
CF 104813J - Game on a Forest
We are given a graph that is a forest, so every connected component is a tree. The game starts with two players alternating moves, and each move modifies the graph in one of two ways.
CF 104813K - Omniscia Spares None
I can’t write a correct Codeforces editorial for “104813K - Omniscia Spares None” without the actual problem statement.
CF 104813G - The Only Way to the Destination
We are given a very large $n times m$ grid, but most of it is empty except for a set of $k$ “walls”. Each wall is a vertical segment: it blocks an entire column $y$ from row $x1$ to $x2$. All blocked cells are impassable, and the rest are free cells.
CF 104813H - Energy Distribution
We are given a small weighted undirected graph with up to ten vertices. The weights describe how strongly each pair of planets interacts.
CF 104813E - Revenge on My Boss
We are given a set of cities, each carrying three independent parameters: Alice can collect some amount of material when visiting, Bob can also collect material when visiting, and each city has a selling value multiplier.
CF 104813D - A Simple MST Problem
We are given a graph where every positive integer is a node, and for any two nodes $x$ and $y$, the cost of connecting them is determined by the number of distinct prime factors of their least common multiple.
CF 104813F - Palindrome Path
We are given a grid where some cells are open and some are blocked. From a starting open cell, George can attempt to move in the four cardinal directions, but a move only succeeds if the adjacent cell exists and is open; otherwise he stays in place.
CF 104813C - Karshilov's Matching Problem II
We are given two strings of equal length. One string, call it the reference string, defines a collection of patterns: every prefix of this string is a pattern, and each pattern has an associated weight.
CF 104813B - Memory
We are given a sequence of values representing the happiness gained from a series of contests. After each contest, we want to compute a “memory-weighted mood” that depends on all past contests, but with exponentially decreasing influence for older events.
CF 104813A - Go go Baron Bunny!
We are given an initial collection of “knowledge points”, each associated with a positive integer cost representing how many brain cells are required to maintain it. This collection is treated as a multiset, so only the frequencies of equal values matter, not their order.