2022 China Collegiate Programming Contest (CCPC) Guilin Site

13 problems from 2022 China Collegiate Programming Contest (CCPC) Guilin Site (contest 104008), difficulty -. 12/13 solutions verified against sample I/O.

13 items

2022 China Collegiate Programming Contest (CCPC) Guilin Site

Special | 13 problems | 12/13 verified | Difficulty - | 13m 45s

#	Problem	Time	✓
A	Lily	43s	✓
B	Code With No Forces	2m 2s	✓
C	Array Concatenation	45s	✓
D	Alice's Dolls	1m 2s	✓
E	Draw a triangle	42s	✓
F	Union of Circular Sectors	47s	✓
G	Group Homework	1m 20s	✓
H	Hysteretic Racing	59s	✓
I	Invincible Hotwheels	51s	✓
J	Permutation Puzzle	54s	✓
K	Barrel Theory	56s	✓
L	Largest Unique Wins	1m 58s
M	Youth Finale	46s	✓

Practice › Codeforces Solutions › 2022 China Collegiate Programming Contest (CCPC) Guilin Site ›

CF 104008L - Largest Unique Wins

The graph $P8 times P8$ is the standard $8 times 8$ rectangular grid graph. Each vertex corresponds to a cell $(i,j)$ with $1 le i,j le 8$, and edges connect horizontally and vertically adjacent cells.

Practice › Codeforces Solutions › 2022 China Collegiate Programming Contest (CCPC) Guilin Site ›

CF 104008M - Youth Finale

We are given a permutation of size $n$, and we repeatedly apply two operations to it. After each operation, we are asked to compute how many swaps Bubble Sort would perform if it were run from scratch on the current permutation.

Practice › Codeforces Solutions › 2022 China Collegiate Programming Contest (CCPC) Guilin Site ›

CF 104008K - Barrel Theory

We are asked to split a single wooden bar of total integer length $m$ into exactly $n$ positive integer pieces. After cutting, we look at two quantities of the resulting multiset of lengths. The first quantity is the “capacity”, defined as the smallest piece length.

Practice › Codeforces Solutions › 2022 China Collegiate Programming Contest (CCPC) Guilin Site ›

CF 104008J - Permutation Puzzle

We are given a partially filled permutation of size $n$. Some positions already contain fixed values from 1 to $n$, and the remaining positions are empty and must be assigned the unused numbers so that the final array becomes a valid permutation.

Practice › Codeforces Solutions › 2022 China Collegiate Programming Contest (CCPC) Guilin Site ›

CF 104008G - Group Homework

Let the vertices of $P8 times P8$ be the lattice points $$V = {(i,j) mid 1 le i,j le 8},$$ with edges between vertices that differ by $1$ in exactly one coordinate.

Practice › Codeforces Solutions › 2022 China Collegiate Programming Contest (CCPC) Guilin Site ›

CF 104008H - Hysteretic Racing

We are given a circular track made of $n$ cells. Each cell has a difficulty value $di$. A race starts at a chosen cell $s$, and a fixed amount of time $t$ is allowed. The racer moves forward cell by cell in circular order.

Practice › Codeforces Solutions › 2022 China Collegiate Programming Contest (CCPC) Guilin Site ›

CF 104008I - Invincible Hotwheels

We are given a collection of distinct lowercase strings. Each string can be thought of as a label. We are interested in nested substring relationships between triples of different strings.

Practice › Codeforces Solutions › 2022 China Collegiate Programming Contest (CCPC) Guilin Site ›

CF 104008D - Alice's Dolls

Each trial in this process produces either a “special” doll or a “normal” one. A special doll appears with probability $p = frac{a}{b}$, and Cirno repeats independent trials until she has collected exactly $n$ special dolls.

Practice › Codeforces Solutions › 2022 China Collegiate Programming Contest (CCPC) Guilin Site ›

CF 104008F - Union of Circular Sectors

We are given several geometric regions in the plane. Each region is a circular sector: a portion of a disk defined by a center point, a radius (implicitly given by distance from the center to two boundary points), and an angular span between two rays starting at the center.

Practice › Codeforces Solutions › 2022 China Collegiate Programming Contest (CCPC) Guilin Site ›

CF 104008B - Code With No Forces

Let the vertices of $P8 times P8$ be the lattice points $$V = {(i,j) mid 1 le i,j le 8},$$ with edges between vertices that differ by $1$ in exactly one coordinate.

Practice › Codeforces Solutions › 2022 China Collegiate Programming Contest (CCPC) Guilin Site ›

CF 104008E - Draw a triangle

We are given two distinct lattice points in the plane, and we must choose a third lattice point such that the triangle formed by all three points has strictly positive area while that area is as small as possible.

Practice › Codeforces Solutions › 2022 China Collegiate Programming Contest (CCPC) Guilin Site ›

CF 104008C - Array Concatenation

We start with an array and are allowed to repeatedly transform it exactly $m$ times. Each transformation replaces the current array with a new one formed in one of two ways: either we duplicate the array and append it to itself, or we take a reversed copy and place it in front…

Practice › Codeforces Solutions › 2022 China Collegiate Programming Contest (CCPC) Guilin Site ›

CF 104008A - Lily

We are given a one-dimensional strip of cells. Each cell is either empty or contains a lily, represented by a character string where L means a lily is already planted and . means the cell is empty soil.