The 15-th Beihang University Collegiate Programming Contest (BCPC 2020) - Final
5 problems from The 15-th Beihang University Collegiate Programming Contest (BCPC 2020) - Final (contest 102889), difficulty -. 5/5 solutions verified against sample I/O.
The 15-th Beihang University Collegiate Programming Contest (BCPC 2020) - Final
Special | 5 problems | 5/5 verified | Difficulty - | 6m 2s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| C | \u4ea6\u6216\u9a97\u5b50 | 47s | ✓ | |||
| D | \u6811\u4e0a\u8def\u5f84 | 50s | ✓ | |||
| F | woafrnraetns \u4e0e\u6b63\u6574\u6570 | 58s | ✓ | |||
| I | Poison AND^OR Affection | 2m 27s | ✓ | |||
| J | \u62ec\u53f7\u5e8f\u5217 | 1m | ✓ |
CF 102889F - woafrnraetns 与正整数
We are given a long sequence of positive integers. Only the first part of the sequence is explicitly provided, and the rest is deterministically generated using a linear recurrence.
CF 102889I - Poison AND^OR Affection
We are given a sequence of integers representing ratings collected over time. These ratings are already sorted in the order they were received.
CF 102889C - 亦或骗子
We are given an array and we are allowed to split it into contiguous segments by assigning each position to a segment label.
CF 102889J - 括号序列
We are given a balanced parentheses string of length (n), and then we process (m) range operations. Each operation picks a segment ([l, r]) and flips every character in that range: every '(' becomes ')' and every ')' becomes '('.
CF 102889D - 树上路径
We are given a line of trees labeled from 1 to n, and we always start at tree 1 and end at tree n. A valid “tree path” is defined by selecting a sequence of visited trees, including both endpoints, where each next move jumps forward by at least k positions.