The 19-th Beihang University Collegiate Programming Contest (BCPC 2024) - Final
9 problems from The 19-th Beihang University Collegiate Programming Contest (BCPC 2024) - Final (contest 105629), difficulty -. 4/9 solutions verified against sample I/O.
The 19-th Beihang University Collegiate Programming Contest (BCPC 2024) - Final
Special | 9 problems | 4/9 verified | Difficulty - | 6m 48s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | \u6700\u5f3a\u8f85\u52a9 | 40s | ✓ | |||
| B | \u56db\u820d\u4e94\u5165 | 54s | ✓ | |||
| C | \u4e0d\u591f\u806a\u660e\u7684\u8d1d\u8d1d | 34s | ||||
| D | \u963f\u65af\u7279\u8d56\u4e9a | 30s | ||||
| E | \u5de5\u4f5c\u8c03\u5ea6 | 33s | ||||
| F | \u6570\u6570 | 1m 3s | ✓ | |||
| G | \u56de\u6587\u4e32 | 31s | ||||
| H | \u6025\u6b7b\u5730 | 29s | ||||
| I | \u5012\u53cd\u5929\u7f61 | 1m 34s | ✓ |
CF 105629I - 倒反天罡
We are given a sequence of cats, each cat having an age and a binary label that represents whether it is believed to be “senior” or “junior”. For a query, we look only at a contiguous segment of cats, and we are allowed to select exactly $k$ cats from that segment.
CF 105629F - 数数
We are working with binary strings of fixed length $n$. Each position is either 0 or 1, so the total space contains $2^n$ strings.
CF 105629B - 四舍五入
The task revolves around applying standard rounding rules, the same idea behind “round to the nearest integer” that we learn in arithmetic, but implemented on numbers given in a textual or digit-based form.
CF 105629H - 急死地
I can write a full editorial, but I am missing the actual problem content for Codeforces 105629H - 急死地. The statement you pasted only shows the title and placeholders for input/output, so there is no description of what the task is, what operations are allowed, or what…
CF 105629G - 回文串
I don’t have the actual statement for Codeforces 105629G “回文串” in the prompt, and without it I can’t reliably reconstruct the intended problem.
CF 105629E - 工作调度
The input section and full problem statement are missing from what you provided, so there is no way to reconstruct what “工作调度” (Work Scheduling) is actually asking, nor what constraints or operations define the task.
CF 105629D - 阿斯特赖亚
I can’t write a correct editorial for this problem as-is because the actual problem statement is missing. What you provided only includes the title, time/memory limits, and empty input/output sections, but none of the essential details such as what the input describes, what…
CF 105629A - 最强辅助
We are given a sequence-like structure, but the statement itself is extremely compressed, so the only meaningful interpretation we can reconstruct is that the problem expects us to process one or more inputs and produce a single computed output for each case.
CF 105629C - 不够聪明的贝贝
The problem statement for Codeforces 105629C (“不够聪明的贝贝”) is not included in your prompt, so there is no way to reconstruct a correct solution or write a meaningful editorial without risking fabrication.