ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 |
---|---|---|---|---|---|---|---|---|
#151448 | #2683. Tourist Reform | Capricornus | 0 | 326ms | 7236kb | C++ | 959b | 2022-07-27 19:26:36 |
#151447 | #2681. How Many Paths? | yinlang | 15 | 286ms | 41288kb | C++11 | 960b | 2022-07-27 19:26:28 |
#151446 | #2682. Reachability from the Capital | 142857Harry | 0 | 8ms | 3688kb | C++ | 566b | 2022-07-27 19:26:13 |
#151445 | #2681. How Many Paths? | Maxson | 0 | 0ms | 0kb | C++ | 2.0kb | 2022-07-27 19:25:13 |
#151444 | #2681. How Many Paths? | legohu | 35 | 1230ms | 25036kb | C++11 | 1.4kb | 2022-07-27 19:24:56 |
#151443 | #2683. Tourist Reform | 18112606231 | 0 | 21ms | 6152kb | C++11 | 2.1kb | 2022-07-27 19:24:09 |
#151442 | #2683. Tourist Reform | Capricornus | Compile Error | / | / | C++ | 986b | 2022-07-27 19:23:41 |
#151441 | #2681. How Many Paths? | WDNMD | 50 | 3158ms | 18052kb | C++11 | 1.4kb | 2022-07-27 19:23:31 |
#151440 | #1. A+B Problem | switch | 100 | 0ms | 1200kb | C++ | 122b | 2022-07-27 19:21:58 |
#151439 | #2681. How Many Paths? | legohu | 35 | 1604ms | 26972kb | C++11 | 1.4kb | 2022-07-27 19:20:57 |