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 |
Educational Codeforces Round 169 (Rated for Div. 2)
| Problems | AC |
|---|---|
| A. Closest Point | ○ |
| B. Game with Doors | ○ |
| C. Splitting Items | ○ |
| D. Colored Portals | ○ |
| E. Not a Nim Problem | ⊕ |
| F. Make a Palindrome | |
| G. Substring Compression |
| Problems | AC |
|---|---|
| A. Dora’s Set | ○ |
| B. Index and Maximum Value | ○ |
| C. Dora and C++ | ○ |
| D. Iris and Game on the Tree | ○ |
| E. Iris and the Tree | ○ |
| F. Eri and Expanded Sets |
| Problems | AC |
|---|---|
| A. Turtle and Good Strings | ○ |
| B. Turtle and Piggy Are Playing a Game 2 | ○ |
| C. Turtle and Good Pairs | ○ |
| D1. Turtle and a MEX Problem (Easy Version) | ○ |
| D2. Turtle and a MEX Problem (Hard Version) | ⊕ |
| E1. Turtle and Inversions (Easy Version) | ⊕ |
| E2. Turtle and Inversions (Hard Version) | ⊕ |
| F. Turtle and Three Sequences |
| Problems | AC |
|---|---|
| 1001. 树异或价值 | ⊕ |
| 1002. 树上询问 | ⊕ |
| 1003. 黑洞合并 | ○ |
| 1004. 亡语 | |
| 1005. 怪物猎人 | ○ |
| 1006. 融合矿石 | |
| 1007. 小猫钓鱼 | ○ |
| 1008. 最佳选手 | |
| 1009. 长期素食 | |
| 1010. 收集签名 | |
| 1011. 地牢谜题：更高还是更低 | |
| 1012. 地牢谜题：三个怪人 |
| Problems | AC |
|---|---|
| A. Question Marks | ○ |
| B. Parity and Sum | ○ |
| C. Light Switches | ○ |
| D. Med-imize | ⊕ |
| E. Xor-Grid Problem | 待补 |
| F1. Dyn-scripted Robot (Easy Version) | ⊕ |
| F2. Dyn-scripted Robot (Hard Version) | ⊕ |
Pinely Round 4 (Div. 1 + Div. 2)
《i didnt know i needed a plush tree until now》
| Problems | AC |
|---|---|
| A. Maximize the Last Element | ○ |
| B. AND Reconstruction | ○ |
| C. Absolute Zero | ○ |
| D. Prime XOR Coloring | ○ |
| E. Coloring Game | ⊕ |
| F. Triangle Formation | |
| G. Grid Reset | |
| H. Prime Split Game | |
| I. Grid Game |
C：log 推柿子
D：正难则反，dp 补集
比赛链接
| Problems | AC |
|---|---|
| A. Diagonals | ○ |
| B1. Bouquet (Easy Version) | ○ |
| B2. Bouquet (Hard Version) | ○ |
| C. Squaring | ⊕ |
| D. Cases | ⊕ |
| E1. Let Me Teach You a Lesson (Easy Version) | |
| E2. Let Me Teach You a Lesson (Hard Version) |
| Problems | AC |
|---|---|
| A. Submission Bait | ○ |
| B. Array Craft | ○ |
| C. Mad MAD Sum | ○ |
| D. Grid Puzzle | ⊕ |
| E1. Catch the Mole(Easy Version) | |
| E2. Catch the Mole(Hard Version) | |
| F. Polygonal Segments |
最自闭的一集。
tbh 赛前一整天心理状态都不太好，压力也很大。稍微甩个锅吧。
出题人：I failed to find a Div2-A level proof. If you have a simpler proof please share it in the comments.
| Problems | AC |
|---|---|
| A. Split the Multiset | ○ |
| B. Make Majority | ○ |
| C. Increasing Sequence with Fixed OR | ○ |
| D. The Omnipotent Monster Killer | ⊕ |
| E. Range Minimum Sum | ⊕ |
| F. Heartbeat |