The 17-th Beihang University Collegiate Programming Contest (BCPC 2022) - Preliminary
10 problems from The 17-th Beihang University Collegiate Programming Contest (BCPC 2022) - Preliminary (contest 104068), difficulty -. 8/10 solutions verified against sample I/O.
The 17-th Beihang University Collegiate Programming Contest (BCPC 2022) - Preliminary
Special | 10 problems | 8/10 verified | Difficulty - | 10m 17s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | \u75af\u72c2\u661f\u671f\u56db\uff0cV \u6211 50\uff01 | 52s | ✓ | |||
| B | \u6700\u5927\u5dee\u503c | 53s | ✓ | |||
| C | \u5c0f\u6c34\u736d\u7684 Codeforces Rating | 53s | ✓ | |||
| D | \u6cfd\u745e\u62c9 | 43s | ✓ | |||
| F | Toxel \u4e0e Villages: Landcircles | 53s | ✓ | |||
| H | Toxel \u4e0e\u5b9d\u53ef\u68a6\u5bf9\u6218\u7279\u8bad | 1m 34s | ||||
| I | \u70e4\u571f\u8c46 | 49s | ✓ | |||
| K | \u5f02\u6216\u6700\u5927\u503c | 49s | ✓ | |||
| L | \u9003\u8dd1\u8def\u7ebf | 48s | ✓ | |||
| M | \u5b9d\u53ef\u68a6\u4e0e\u6bd2\u7624 Toxel | 2m 3s |
CF 104068M - 宝可梦与毒瘤 Toxel
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 104068L - 逃跑路线
We are given a connected undirected graph where each vertex represents a room. Every room has a rotary dial that starts at some value and must end at a target value, both in the range from 1 to k, with wraparound increment behavior.
CF 104068K - 异或最大值
We are given a sequence of non-negative integers indexed from 1 to n. We need to count how many index pairs (l, r) with l ≤ r satisfy a combined condition involving both the values in the array and the maximum element in the subarray between them.
CF 104068H - Toxel 与宝可梦对战特训
Let $Gamma = (alpha0,ldots,alpha{t-1})$, $Gamma' = (alpha'0,ldots,alpha'{t'-1})$, and $Gamma'' = (alpha''0,ldots,alpha''{t''-1})$.
CF 104068I - 烤土豆
A sequence of potatoes arrives over time. Each potato has an arrival timestamp, and once it enters the machine its “overcooked value” grows linearly with time. At any moment, we are allowed to pull out all potatoes currently inside the machine in one action.
CF 104068D - 泽瑞拉
We are given a deck defined by two parameters: card values from 1 to n and suits from 1 to m. Every pair of a value and a suit corresponds to a unique card, so the deck contains n·m distinct cards.
CF 104068F - Toxel 与 Villages: Landcircles
We are given a set of $n$ labeled vertices that must become the leaves of a tree. We are allowed to add extra vertices, but those extra vertices are indistinguishable from each other and every such added vertex must have degree exactly 3 in the final tree.
CF 104068B - 最大差值
We are given a multiset of digits, each digit from 1 to 9, with a total of $n+m$ digits. From these digits we must build two numbers: one with exactly $n$ digits and another with exactly $m$ digits.
CF 104068C - 小水獭的 Codeforces Rating
We start with an initial rating value and a sequence of events. Each event has an associated parameter $si$. For any event we choose to participate in, our rating changes according to a nonlinear formula that depends on the current rating $r$ and the event value $si$.