The 15-th Beihang University Collegiate Programming Contest (BCPC 2020) - Preliminary
6 problems from The 15-th Beihang University Collegiate Programming Contest (BCPC 2020) - Preliminary (contest 102888), difficulty -. 6/6 solutions verified against sample I/O.
The 15-th Beihang University Collegiate Programming Contest (BCPC 2020) - Preliminary
Special | 6 problems | 6/6 verified | Difficulty - | 8m 11s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| B | \u8fde\u63a5\u7f8e\u56fd | 2m 16s | ✓ | |||
| E | \u6e38\u620f\u5206\u7ec4 | 53s | ✓ | |||
| F | \u63a8\u7bb1\u5b50 | 49s | ✓ | |||
| G | easy segment problem | 46s | ✓ | |||
| H | \u8fd8\u539f\u795e\u4f5c | 2m 39s | ✓ | |||
| I | \u968f\u673a\u6e38\u8d70 | 48s | ✓ |
CF 102888B - 连接美国
We are given an undirected simple graph with (n) vertices and (m) edges. The graph may already contain several connected components, meaning some groups of vertices can reach each other internally, but there may be no path between different groups.
CF 102888I - 随机游走
We are given a bipartite graph (K{n,m}) where the first (n) vertices form one side and the next (m) vertices form the other side. Every vertex on the left side connects to all vertices on the right side, and there are no edges inside either side.
CF 102888H - 还原神作
We are given several test cases. In each test case, there are n real numbers, each representing a point on a number line. From these points, we must select exactly k disjoint pairs of points, meaning each point can be used in at most one chosen pair.
CF 102888G - easy segment problem
We are given a collection of line segments in the plane. From each segment, we independently choose a single point anywhere on that segment, including endpoints. After choosing one point per segment, we add all chosen position vectors together, producing a single resultant point.
CF 102888F - 推箱子
We are given a small grid, at most 15 by 15, containing empty cells, walls, a single person, exactly two boxes, and exactly two target cells. The person can move one step at a time in four directions. If the next cell is empty, the person simply walks there.