| 题目编号 | 题目名称 | 文件名称 | 时间 | 空间 | 难度 | 评测方式 | 通过 | 提交 | 通过率 |
|---|---|---|---|---|---|---|---|---|---|
| 3873 | [USACO23 Jan Platinum] Mana Collection 动态规划 李超线段树 凸包 最短路 | falishouji |
5 s | 512 MiB | ★★★☆ | 简单对比 | 1 | 1 | 100% |
| 3872 | [USACO23 Feb Silver] Moo Route II BFS DFS 图论 | mooroutetwo |
1 s | 256 MiB | ★★☆ | 简单对比 | 1 | 1 | 100% |
| 3871 | [USACO23 Feb Bronze] Watching Mooloo 模拟 | kanmoo |
1 s | 256 MiB | ★ | 简单对比 | 1 | 1 | 100% |
| 3870 | [USACO23 Feb Bronze] Stamp Grid 模拟 | yinzhang |
1 s | 256 MiB | ★ | 简单对比 | 1 | 1 | 100% |
| 3869 | [USACO23 Feb Bronze] Hungry Cow 模拟 | jieniu |
1 s | 256 MiB | ★ | 简单对比 | 2 | 11 | 18.18% |
| 3868 | [USACO23 Feb Gold] Equal Sum Subarrays 排序 双指针扫描法 | dhzsz |
3 s | 256 MiB | ★★ | 简单对比 | 1 | 1 | 100% |
| 3867 | [USACO23 Feb Platinum] Problem Setting FWT 状态压缩 集合幂级数 | wentiji |
2 s | 256 MiB | ★★★ | 简单对比 | 1 | 1 | 100% |
| 3866 | [USACO23 Jan Platinum] Subtree Activation 树形DP | shujihuo |
2 s | 256 MiB | ★★★★ | 简单对比 | 0 | 0 | 0% |
| 3865 | [USACO23 Feb Silver] Bakery 二分答案 | bakery |
2 s | 256 MiB | ★★ | 简单对比 | 1 | 1 | 100% |
| 3864 | [USACO23 Jan Platinum] Tractor Paths 倍增法 贪心 线段树 | tuolapath |
4 s | 512 MiB | ★★★☆ | 简单对比 | 0 | 0 | 0% |
| 3863 | [USACO23 Jan Silver] Following Directions DFS | zunxun |
2 s | 256 MiB | ★★☆ | 简单对比 | 1 | 1 | 100% |
| 3862 | [USACO23 Jan Bronze] Moo Operations 思维 字符串 | moocaozuo |
1 s | 256 MiB | ★☆ | 简单对比 | 1 | 2 | 50% |
| 3861 | [USACO23 Jan Bronze] Air Cownditioning II DFS 枚举 | kongtiao |
1 s | 256 MiB | ★☆ | 简单对比 | 1 | 1 | 100% |
| 3860 | [USACO23 Jan Bronze] Leaders 贪心 | leaders |
1 s | 256 MiB | ★☆ | 简单对比 | 1 | 1 | 100% |
| 3859 | [USACO23 Jan Silver] Find and Replace 图论 | fars |
1 s | 256 MiB | ★★☆ | 简单对比 | 0 | 0 | 0% |
| 3858 | [USACO23 Jan Gold] Moo Route 思维 组合数学 | moorouteg |
1 s | 256 MiB | ★★★☆ | 简单对比 | 0 | 0 | 0% |
| 3857 | [USACO23 Jan Gold] Light Off 动态规划 | lightoffg |
4 s | 256 MiB | ★★★ | 简单对比 | 1 | 1 | 100% |
| 3856 | [USACO23 Jan Gold] Find and Replace 并查集 二叉树 线段树 | farg |
1 s | 256 MiB | ★★★ | 简单对比 | 1 | 1 | 100% |
| 3855 | [SCOI2011] 糖果 差分约束 拓扑排序 | tangguo |
1 s | 256 MiB | ★★☆ | 简单对比 | 6 | 10 | 60% |
| 3854 | [雅礼集训 2018 Day10] 贪玩蓝月 ST表 线段树分治 类背包 双端队列 栈 复杂度分析 | tanwan |
4 s | 512 MiB | ★★★☆ | 简单对比 | 4 | 4 | 100% |