Codeforces Round 989 (Div. 1 + Div. 2)
构造 Round
Rayan Programming Contest 2024 - Selection (Codeforces Round 989, Div. 1 + Div. 2)
| Problems | AC |
|---|---|
| A. King Keykhosrow’s Mystery | ○ |
| B. Rakhsh’s Revival | ○ |
| C. Trapped in the Witch’s Labyrinth | ○ |
| D. Darius’ Wisdom | ⊕ |
| E. Permutations Harmony | ⊕ |
| F1. Khayyam’s Royal Decree (Easy Version) | |
| F2. Khayyam’s Royal Decree (Hard Version) | |
| G1. Simurgh’s Watch (Easy Version) | |
| G2. Simurgh’s Watch (Hard Version) | |
| H. Rayan vs. Rayaneh |
| Problems | AC |
|---|---|
| A. Daily Cookie | ○ |
| B. Daily Cookie 2 | ○ |
| C. Kaiten Sushi | ○ |
| D. Keep Distance | ○ |
| E. Expansion Packs | ⊕ |
| F. Falling Bars | ○ |
| G. Tile Distance 3 |
The 2024 ICPC Asia Nanjing Regional Contest (The 3rd Universal Cup. Stage 16: Nanjing)
比赛链接
| Problems | AC | Note |
|---|---|---|
| A. Hey, Have You Seen My Kangaroo? | Medium-Hard | |
| B. Birthday Gift | ○ | |
| C. Topology | ⊕ | 拓扑序、组合数学 |
| D. Toe-Tac-Tics | Hard | |
| E. Left Shifting 3 | ○ | |
| F. Subway | ⊕ | |
| G. Binary Tree | ○ | |
| H. Border Jump 2 | Hard | |
| I. Bingo | ⊕ | min-max容斥 |
| J. Social Media | ○ | |
| K. Strips | ○ | |
| L. $P \oplus Q = R$ | Impossible | |
| M. Ordainer of Inexorable Judgment | Medium-Hard、计算几何 |
2024 China Collegiate Programming Contest (CCPC) Harbin Onsite (The 3rd Universal Cup. Stage 14: Harbin)
比赛链接
| Problems | AC | Note |
|---|---|---|
| A. Build a Computer | ⊕ | 构造、拆数位 |
| B. Concave Hull | ⊕ | 凹包 |
| C. Giving Directions in Harbin | ○ | |
| D. A Simple String Problem | 字符串、后缀数组、不可做 | |
| E. Marble Race | ⊕ | 可撤销背包、多项式 |
| F. 1D Galaxy | 不可做 | |
| G. Welcome to Join the Online Meeting! | ○ | |
| H. Subsequence Counting | 不可做 | |
| I. A Brand New Geometric Problem | DP、质因子分解 | |
| J. New Energy Vehicle | ○ | 铜牌题、贪心 |
| K. Farm Management | ○ | |
| L. A Game On Tree | ⊕ | 树上问题、期望、拆贡献 |
| M. Weird Ceiling | ○ |
Educational Codeforces Round 171 (Rated for Div. 2)
| Problems | AC |
|---|---|
| A. Perpendicular Segments | ○ |
| B. Black Cells | ○ |
| C. Action Figures | ○ |
| D. Sums of Segments | ○ |
| E. Best Subsequence | ○ |
| F. Bermart Ice Cream |
$T(n)=aT(\frac{n}{b})+O(n^d)$
上 DSA 用到了就从以前 Blog 上面扒到这里来继续用了（
The 2022 ICPC Asia Shenyang Regional Contest (The 1st Universal Cup, Stage 1: Shenyang)
这个题解怎么和 Claris 一个 slides 板子，给我看 ptsd 了（
| Problems | AC |
|---|---|
| A. Absolute Difference | 待补 |
| B. Binary Substrings | |
| C. Clamped Sequence | ○ |
| D. DRX vs. T1 | ○ |
| E. Graph Completing | ⊕ |
| F. Half Mixed | ⊕ |
| G. Meet in the Middle | 待补 |
| H. P-P-Palindrome | 待补 |
| I. Quartz Collection | ⊕ |
| J. Referee Without Red | |
| K. Security at Museums | |
| L. Tavern Chess | ○ |
| M. Vulpecula |
2023 Jiangsu Collegiate Programming Contest
2023 National Invitational of CCPC (Hunan)
The 13th Xiangtan Collegiate Programming Contest
| Problems | AC |
|---|---|
| A. Today’s Word | ○ |
| B. Honkai in TAIKULA | |
| C. GG and YY’s Game | |
| D. Star Rail | |
| E. LCM Plus GCD | ⊕ |
| F. Timaeus | ○ |
| G. Moving Boxes | |
| H. Neil’s Machine | ○ |
| I. Elevator | ○ |
| J. Similarity (Easy Version) | ○ |
| K. Similarity (Hard Version) | ○ |
| L. Architect | ○ |