ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 |
---|---|---|---|---|---|---|---|---|
#214646 | #2376. 树与异或 | jsxheng | 40 | 3986ms | 92620kb | C++11 | 1.3kb | 2024-11-20 22:15:58 |
#214645 | #2477. 狸猫的数 | Super_Leo66 | 50 | 118ms | 157440kb | C++11 | 453b | 2024-11-20 22:09:47 |
#214643 | #2681. How Many Paths? | WZRYWZWY | 35 | 1364ms | 29696kb | C++11 | 1.5kb | 2024-11-20 21:56:38 |
#214642 | #2809. 去发现新的最小公约吧 | shiruiheng | 100 | 2712ms | 1196kb | C++11 | 1.6kb | 2024-11-20 21:47:17 |
#214641 | #2809. 去发现新的最小公约吧 | Invisible_H | 50 | 683ms | 1192kb | C++ | 3.1kb | 2024-11-20 21:44:21 |
#214640 | #2681. How Many Paths? | shiruiheng | 15 | 4213ms | 30800kb | C++11 | 2.4kb | 2024-11-20 21:39:08 |
#214639 | #2681. How Many Paths? | erican | 100 | 1837ms | 21660kb | C++11 | 2.4kb | 2024-11-20 21:36:49 |
#214638 | #2376. 树与异或 | Invisible_H | 10 | 25ms | 25748kb | C++11 | 4.2kb | 2024-11-20 21:35:26 |
#214637 | #2376. 树与异或 | Invisible_H | 0 | 21ms | 25748kb | C++11 | 4.2kb | 2024-11-20 21:32:13 |
#214636 | #2809. 去发现新的最小公约吧 | wanghanyu393 | 100 | 98ms | 1196kb | C++11 | 526b | 2024-11-20 21:31:19 |