请登录
| 题号 | 状态 | 题目名称 | 标签 | 通过率 | |
|---|---|---|---|---|---|
| L12533 | [XJTUPC 2025] 9-Nine | 搜索 广度优先搜索 BFS 构造 |
|
||
| L12534 | [XJTUPC 2025] 奥日 | 树论 |
|
||
| L12535 | [XJTUPC 2025] 棱堡 | 计算几何 凸包 |
|
||
| L12536 | [XJTUPC 2025] 我永远喜欢希儿·芙乐艾 | 分块 差分 |
|
||
| L12537 | [XJTUPC 2025] 罗斯飞鸽 | 动态规划 DP |
|
||
| L12538 | [XJTUPC 2025] 泰拉构史 |
|
|||
| L12539 | [XJTUPC 2025] 结束乐队 | 线段树 二分 |
|
||
| L12540 | [XJTUPC 2025] 离散对数 | 数学 |
|
||
| L12541 | [APIO2025] Hack! | 大步小步算法 BSGS 构造 |
|
||
| L12542 | [APIO2025] Permutation Game | 博弈论 Ad-hoc 分类讨论 |
|
||
| L12543 | [APIO2025] Rotating Lines | 贪心 |
|
||
| L12544 | [UOI 2025] Boys and Girls |
|
|||
| L12545 | [UOI 2025] Partitioning into Three |
|
|||
| L12546 | [UOI 2025] Convex Array |
|
|||
| L12547 | [UOI 2025] Simple Subsequence |
|
|||
| L12548 | [UOI 2025] Manhattan Pairing |
|
|||
| L12549 | [UOI 2025] Gift for Anton | 构造 |
|
||
| L12550 | [UOI 2025] Reversal ABC |
|
|||
| L12551 | [UOI 2025] Simple Task |
|
|||
| L12552 | [UOI 2024] Points on a Line |
|