2022 China Collegiate Programming Contest (CCPC) Mianyang Onsite
13 problems from 2022 China Collegiate Programming Contest (CCPC) Mianyang Onsite (contest 104065), difficulty -. 12/13 solutions verified against sample I/O.
2022 China Collegiate Programming Contest (CCPC) Mianyang Onsite
Special | 13 problems | 12/13 verified | Difficulty - | 15m 16s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Ban or Pick, What's the Trick | 1m 10s | ✓ | |||
| B | Call Me Call Me | 2m 8s | ||||
| C | Catch You Catch Me | 50s | ✓ | |||
| D | Gambler's Ruin | 48s | ✓ | |||
| E | Hammer to Fall | 48s | ✓ | |||
| F | Infinite Strife | 1m 18s | ✓ | |||
| G | Let Them Eat Cake | 3m 20s | ✓ | |||
| H | Life is Hard and Undecidable, but... | 49s | ✓ | |||
| I | Mental Abuse To Humans | 53s | ✓ | |||
| J | Middle Race | 50s | ✓ | |||
| K | Pattern Matching in A Minor ``Low Space'' | 49s | ✓ | |||
| L | Por Una Cabeza | 47s | ✓ | |||
| M | Rock-Paper-Scissors Pyramid | 46s | ✓ |
CF 104065M - Rock-Paper-Scissors Pyramid
We are given a base row of tiles, each tile labeled R, P, or S. Above every adjacent pair of tiles, we place a new tile according to the rock-paper-scissors rule: identical inputs propagate unchanged, while differing inputs resolve to the winning symbol among the pair.
CF 104065L - Por Una Cabeza
We are given a directed structure formed by two kinds of nodes. The first type is a set of audience nodes, each carrying a binary value and a cost that represents how expensive it is to flip that value.
CF 104065G - Let Them Eat Cake
We are given a permutation of numbers from $1$ to $n$ arranged in a line. In each round, some people are removed according to a local rule: a person survives only if their label is not strictly smaller than at least one of their current neighbors.
CF 104065K - Pattern Matching in A Minor ``Low Space''
We are given two strings: a pattern string s and a text string t. The task is to count how many starting positions in t produce an occurrence of s as a contiguous substring. Overlaps are allowed, so every valid match contributes to the answer independently.
CF 104065J - Middle Race
We are playing a repeated three-way selection game. In each round, three numbers A, B, and C are given, representing three items. One item is taken by us, one by BoBo, and one by oBoB, so every round is just a permutation of these three values assigned to the three players.
CF 104065I - Mental Abuse To Humans
We are working on a universe of integers labeled from 0 to n−1, and we want to choose a subset A of these elements. However, not every subset is valid. There are two independent types of restrictions. The first restriction fixes membership of up to m special positions.
CF 104065H - Life is Hard and Undecidable, but...
We are asked to construct an initial configuration in Conway’s Game of Life on an infinite grid, but with the restriction that all live cells must lie within positive coordinates bounded by 300.
CF 104065F - Infinite Strife
Each weapon sits at a fixed point in the plane and is assigned an integer parameter that effectively chooses one of several evenly spaced directions.
CF 104065E - Hammer to Fall
We are given a weighted undirected graph of cities connected by roads, where each city initially contains some number of residents.
CF 104065B - Call Me Call Me
Let $F = mathrm{MUX}(f,g,h)$ denote the Boolean function defined by selecting $g$ when $f=1$ and selecting $h$ when $f=0$, so that $$F = (f wedge g) vee (neg f wedge h).
CF 104065D - Gambler's Ruin
We are given a collection of gamblers, each of whom carries two pieces of information: a probability estimate $pi$ that the home team BU wins, and a stake size $ci$.
CF 104065A - Ban or Pick, What's the Trick
Two teams each control a separate pool of heroes. Every hero has a positive value representing how useful it is for that team. The game then runs a long alternating sequence of actions.