| Problems | AC | Note |
|---|---|---|
| A. Tender Carpenter | ○ | |
| B. Outstanding Impressionist | ○ | |
| C. Bewitching Stargazer | ○ | |
| D. Refined Product Optimality | ⊕ | 交换 |
| E. Resourceful Caterpillar Sequence | ⊕ | game、树上计数 |
| F. Earnest Matrix Complement | ||
| G. Naive String Splits | ||
| H. Delicate Anti-monotonous Operations | ||
| I1. Affectionate Arrays (Easy Version) | ||
| I2. Affectionate Arrays (Hard Version) |
| Problems | AC | Note |
|---|---|---|
| A. MEX Destruction | ○ | |
| B. pspspsps | ○ | |
| C. MEX Cycle | ○ | 构造 |
| D. Shift + Esc | ○ | DP |
| E. Broken Queries | ⊕ | 交互、二分 |
| F. MEX OR Mania | ⊕ | 启发式合并 |
| Problems | AC | Note |
|---|---|---|
| A. Kevin and Combination Lock | ○ | |
| B. Kevin and Permutation | ○ | |
| C. Kevin and Binary Strings | ○ | |
| D. Kevin and Competition Memories | ○ | |
| E. Kevin and Bipartite Graph | ⊕ | 二分图、构造 |
| F. Kevin and Math Class | ⊕ | 笛卡尔树、树形 DP |
| G. Kevin and Matrices | ||
| H. Kevin and Strange Operation | ||
| I1. Kevin and Puzzle (Easy Version) | ||
| I2. Kevin and Puzzle (Hard Version) |
| Problems | AC |
|---|---|
| A. Game of Division | ○ |
| B. Paint a Strip | ○ |
| C. Ordered Permutations | ○ |
| D. Non Prime Tree | ⊕ |
| E. Control of Randomness | ⊕ |
| F. Number of Cubes |
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 |
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 |
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. 地牢谜题：三个怪人 |