题目 | 用户 | 结果 | 得分 | 语言 | 用时 | 内存 | 提交时间 |
---|---|---|---|---|---|---|---|
遵循指令之意★☆ | AAAAAAAAAA | 100 | C++ | 2.462 s | 8.31 MiB | 2025-07-03 14:01:53 | |
遵循指令之意★☆ | WWAWAAWAWW | 40 | C++ | 1.397 s | 14.85 MiB | 2025-07-03 13:47:42 | |
遵循指令之意★☆ | RRRRRRRRRR | 0 | C++ | 0.027 s | 3.68 MiB | 2025-07-03 13:47:06 | |
遵循指令之意★☆ | AAAAAAAAAA | 100 | C++ | 1.582 s | 8.41 MiB | 2025-07-03 13:06:21 | |
字符串查询☆ | AAAAAAAAAA | 100 | C++ | 0.033 s | 3.68 MiB | 2025-07-03 11:28:28 | |
字符串查询☆ | WWWWWWWWWW | 0 | C++ | 0.027 s | 3.69 MiB | 2025-07-03 11:23:26 | |
逆序列 二分优化 树状数组 线段树 组合数学 ★★ | RRRRRRRRRR | 0 | C++ | 0.025 s | 3.69 MiB | 2025-07-03 11:16:34 | |
遵循指令之意★☆ | AAAAAAAAAA | 100 | C++ | 1.585 s | 9.24 MiB | 2025-07-03 08:33:01 | |
遵循指令之意★☆ | WWAWAAWAWW | 40 | C++ | 1.316 s | 5.38 MiB | 2025-07-03 08:14:43 | |
[NOIP 2006]开心的金明 动态规划 NOIP/CSP 背包问题 01背包 ★ | AAAAAAAAAA | 100 | C++ | 0.033 s | 3.79 MiB | 2025-07-03 08:01:59 | |
[NOIP 2010冲刺二]宝物筛选 背包问题 多重背包 动态规划 单调队列 ★☆ | AAAAAAAAAA | 100 | C++ | 0.157 s | 4.34 MiB | 2025-07-03 07:47:38 | |
遵循指令之意★☆ | WWAWAAWAWW | 40 | C++ | 1.186 s | 6.64 MiB | 2025-07-02 22:29:55 | |
遵循指令之意★☆ | WAAAAAAAAA | 90 | C++ | 1.295 s | 6.67 MiB | 2025-07-02 22:29:35 | |
[NOIP 2010冲刺二]宝物筛选 背包问题 多重背包 动态规划 单调队列 ★☆ | AAAAAAAAAA | 100 | C++ | 0.336 s | 3.89 MiB | 2025-07-02 20:57:54 | |
遵循指令之意★☆ | AAAAAAAAAA | 100 | C++ | 1.620 s | 12.87 MiB | 2025-07-02 20:47:13 | |
遵循指令之意★☆ | EEEEEEEEEE | 0 | C++ | 1.406 s | 3.31 MiB | 2025-07-02 20:46:13 |