The 16-th Beihang University Collegiate Programming Contest (BCPC 2021) - Preliminary
12 problems from The 16-th Beihang University Collegiate Programming Contest (BCPC 2021) - Preliminary (contest 103448), difficulty -. 11/12 solutions verified against sample I/O.
The 16-th Beihang University Collegiate Programming Contest (BCPC 2021) - Preliminary
Special | 12 problems | 11/12 verified | Difficulty - | 9m 51s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | \u83ab\u5361\u4e0e MCPC | 49s | ✓ | |||
| B | bb \u53bb\u98df\u5802 | 40s | ✓ | |||
| C | \u62b5\u5fa1\u963f\u8349 | 55s | ✓ | |||
| D | \u76ae\u5361\u4e18\u4e0e\u5b9d\u53ef\u68a6\u5bf9\u6218\u6a21\u62df\u5668 | 50s | ✓ | |||
| E | \u5723\u83ab\u5361\u9020\u9898\u7684\u4e03\u5929 | 42s | ✓ | |||
| F | PotasHub Copylot | 48s | ✓ | |||
| G | Serval \u7684\u5b57\u7b26\u4e32 | 59s | ✓ | |||
| H | \u72c2\u4e71 | 58s | ✓ | |||
| I | Serval \u7684\u76f8\u5bf9\u8bba | 31s | ||||
| J | \u6570\u636e\u91cd\u547d\u540d | 48s | ✓ | |||
| K | \u76ae\u5361\u4e18\u4e0e Minimum Spanning Tree-I | 54s | ✓ | |||
| L | \u76ae\u5361\u4e18\u4e0e Minimum Spanning Tree-II | 57s | ✓ |
CF 103448L - 皮卡丘与 Minimum Spanning Tree-II
We are given a complete directed graph on $n$ vertices, but most edges are not explicitly listed. For every ordered pair $(u, v)$, there is always an edge from $u$ to $v$.
CF 103448K - 皮卡丘与 Minimum Spanning Tree-I
We are given a graph with $n$ vertices where every pair of vertices is connected by an edge. This is not a standard complete graph with arbitrary weights: most edges follow a simple rule based on vertex weights, while a smaller subset of edges comes with explicitly given costs…
CF 103448J - 数据重命名
We are given a list of files arranged in a vertical list, initially sorted by their current filenames. Each file has an original name from a range and a target new name from another range.
CF 103448H - 狂乱
We are given a collection of combat units, each described by an attack value and a health value. One unit is chosen as the initial “active” unit.
CF 103448I - Serval 的相对论
Working
CF 103448G - Serval 的字符串
We are given a reference string $S$, and then many query strings $Ti$. For each query string, we imagine building an infinite string by repeating $Ti$ forever.
CF 103448E - 圣莫卡造题的七天
We are given an undirected graph where each node carries a non-negative integer value. The graph structure tells us which nodes can interact, and the values evolve through an operation applied along any chosen path.
CF 103448F - PotasHub Copylot
We are given a sequence of length $n$, but it is not an arbitrary sequence. It is a permutation of $1$ through $n$, so every value is distinct and each value appears exactly once.
CF 103448D - 皮卡丘与宝可梦对战模拟器
We are given a set of Pokémon, each fully described by the same structured data used in the main series games: level, base stats, individual values, effort values, and four moves with fixed power and type.
CF 103448B - bb 去食堂
We are given a rectangular building on a 2D plane, aligned with the coordinate axes. Each canteen is represented as a single point. For every canteen, we want to compute its shortest Euclidean distance to any point on the rectangle, including its interior boundary and corners.
CF 103448C - 抵御阿草
We are given an array of length $2^n$, where the initial values are fixed as $ai = i$. So we start with a perfectly ordered sequence of integers from $0$ to $2^n - 1$. The process then repeatedly reduces the array size in $n$ rounds.
CF 103448A - 莫卡与 MCPC
Each query gives a single integer status code produced when a user tries to access a service. For every such code, the system must decide whether the request succeeds or fails.