The 17-th Beihang University Collegiate Programming Contest (BCPC 2022) - Final
9 problems from The 17-th Beihang University Collegiate Programming Contest (BCPC 2022) - Final (contest 104304), difficulty -. 9/9 solutions verified against sample I/O.
The 17-th Beihang University Collegiate Programming Contest (BCPC 2022) - Final
Special | 9 problems | 9/9 verified | Difficulty - | 9m 3s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | \u9664\u5947\u81f4\u80dc | 1m 9s | ✓ | |||
| B | \u5f02\u6216\u4e0e\u6700\u5927\u516c\u56e0\u6570 | 53s | ✓ | |||
| C | Toxel \u4e0e\u5b9d\u53ef\u68a6\u91ce\u9910 | 1m 23s | ✓ | |||
| D | Oshwiciqwq \u4e0e\u6c2a\u91d1\u624b\u6e38 | 58s | ✓ | |||
| E | \u533a\u95f4\u5339\u914d | 50s | ✓ | |||
| F | qaq | 56s | ✓ | |||
| G | Toxel \u4e0e\u4e8c\u7ef4\u56de\u6587\u4e32 | 57s | ✓ | |||
| H | Toxel \u4e0e\u5e15\u5e95\u4e9a\u5730\u533a | 49s | ✓ | |||
| I | Circle God | 1m 8s | ✓ |
CF 104304H - Toxel 与帕底亚地区
We are given a directed graph with possibly multiple edges between the same pair of vertices and also self loops. Each directed edge represents a single-step move between cities.
CF 104304I - Circle God
We are given a binary sequence arranged on a circle. Each position contains either 0 or 1, and indices wrap around so that position n−1 is adjacent to position 0.
CF 104304G - Toxel 与二维回文串
We are given a rectangular grid of lowercase letters. From this grid, we can choose any sub-rectangle by selecting a contiguous block of rows and a contiguous block of columns.
CF 104304F - qaq
We are given a string composed only of the characters q and a. We are allowed to insert exactly x additional characters, each of which can independently be either q or a, at arbitrary positions in the string.
CF 104304E - 区间匹配
We are given a collection of static segments on a number line, each segment having integer endpoints within a bounded universe up to $L$.
CF 104304D - Oshwiciqwq 与氪金手游
We are given a sequence of $n$ independent “draws”. In the $i$-th draw, we choose an integer score $xi$ uniformly from the range $[0, ai]$, where $ai < k$. After each draw, we maintain a running prefix sum of all chosen values.
CF 104304C - Toxel 与宝可梦野餐
We are asked to construct up to 20 distinct integer vectors in at most three dimensions. Each vector has non-negative coordinates up to 10^9. After constructing them, we look at the sum of all vectors.
CF 104304A - 除奇致胜
We are given a lineup of enemy units, each with an integer attack value. A special effect card removes every unit whose attack is odd after all modifications are applied. Before using this card, we are allowed to cast a collection of single-use spells.
CF 104304B - 异或与最大公因数
We are given two intervals of positive integers, one for a and one for b. We need to count how many pairs (a, b) can be formed such that a is chosen from the first interval and b from the second interval, and the pair satisfies a bitwise and arithmetic constraint: the XOR of a…