The 16-th Beihang University Collegiate Programming Contest (BCPC 2021) - Final
9 problems from The 16-th Beihang University Collegiate Programming Contest (BCPC 2021) - Final (contest 103478), difficulty -. 9/9 solutions verified against sample I/O.
The 16-th Beihang University Collegiate Programming Contest (BCPC 2021) - Final
Special | 9 problems | 9/9 verified | Difficulty - | 7m 44s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | \u76ae\u5361\u4e18\u4e0e Codeforces | 45s | ✓ | |||
| B | Serval \u7684\u5143\u7d20\u5468\u671f\u8868 | 48s | ✓ | |||
| C | Popcount Game | 47s | ✓ | |||
| D | \u4e0d\u52a8\u6570\u7ec4 | 47s | ✓ | |||
| E | \u6700\u540e\u7684\u8f7b\u8bed | 53s | ✓ | |||
| F | \u9b54\u6cd5\u5c11\u5973\u83ab\u5361\u7684\u8bde\u751f | 52s | ✓ | |||
| G | Serval \u7684\u6570\u5b66\u8bfe\u5802 | 49s | ✓ | |||
| H | \u83ab\u5361\u4e0e\u963f\u62c9\u5fb7\u5927\u9646 | 1m 8s | ✓ | |||
| I | \u76ae\u5361\u4e18\u4e0e PCPC \u96c6\u8bad\u961f | 55s | ✓ |
CF 103478H - 莫卡与阿拉德大陆
We are given several circles drawn on an infinite plane. These circles interact only in a very structured way: any two circles are either completely separate, one fully contains the other, or they just touch.
CF 103478I - 皮卡丘与 PCPC 集训队
We are given a sequence of integers that is claimed to be generated by a linear recurrence with modular reduction. The sequence starts from a known value and evolves using fixed parameters $a$ and $b$, but the modulus $p$ is unknown.
CF 103478G - Serval 的数学课堂
We are given an array $A$ of length $n$. For every subarray of length at least three, we first compute a modified average: we remove the minimum and maximum element of that subarray and then take the average of what remains.
CF 103478F - 魔法少女莫卡的诞生
We are given a permutation of length $2n$, meaning it contains every integer from $1$ to $2n$ exactly once. We are allowed to perform swaps of adjacent positions, exchanging the values at positions $i$ and $i+1$. The target condition is not global sorting.
CF 103478E - 最后的轻语
We are given a fixed word s and another string t. A student repeatedly tries to type s, but his typing process is not continuous in a clean way.
CF 103478D - 不动数组
We are asked to construct a very special integer array of length $n$. The array $a$ uses indices from $0$ to $n-1$, and we also define another array $cnt$ of the same length where $cnt[i]$ is the number of times the value $i$ appears in $a$.
CF 103478B - Serval 的元素周期表
We are given a single uppercase string representing a “word” built from letters A to Z. The task is to determine whether this word can be segmented completely into a sequence of chemical element symbols, but only using a restricted set: the first 20 elements of the…
CF 103478C - Popcount Game
We are given a universe of integers from 0 up to $2^n - 1$. From this universe, a game is played starting at the number $x = 0$. Two players alternate moves, and each move consists of choosing a new value $y$ from the same universe and replacing $x$ with it.
CF 103478A - 皮卡丘与 Codeforces
We are given multiple Codeforces accounts, each starting with its own rating value. Over time, a sequence of contests happens, and each contest contributes a fixed rating change. For every contest, we must choose exactly one account to participate.