B08201047
Visitor Class 2
Accept
301Sub
NaExp
Na- ::ffff:223.136.230.157
- Last login 2021/01/25 03:05:07
仲恩好店
Recent Submission (all)
# | Problem | User | Verdict | Len | Date | Style | ||
---|---|---|---|---|---|---|---|---|
377925 | 20010 | Offline Range Maximum Query | B08201047 | Time Limit Exceeded (score: 45) | * | 2 KB | 2021/01/25 04:07:48 | |
377923 | 20010 | Offline Range Maximum Query | B08201047 | Runtime Error (score: 35) | * | 2 KB | 2021/01/25 03:48:23 | |
377922 | 20010 | Offline Range Maximum Query | B08201047 | Time Limit Exceeded (score: 50) | * | 2 KB | 2021/01/25 03:41:14 | |
377919 | 20010 | Offline Range Maximum Query | B08201047 | Runtime Error (score: 15) | * | 2 KB | 2021/01/25 03:05:25 | |
376281 | 50016 | 15-Puzzle | B08201047 | Accepted (71 ms, 256 KB) | C | 2 KB | 2021/01/08 03:41:22 | |
376280 | 50016 | 15-Puzzle | B08201047 | Wrong Answer (score: 20) | C | 2 KB | 2021/01/08 03:40:16 | |
376279 | 50015 | Words | B08201047 | Accepted (488 ms, 256 KB) | C | 865 B | 2021/01/08 03:05:40 | |
376221 | 50180 | Matrix Multiplication | B08201047 | Accepted (77 ms, 384 KB) | C | 2 KB | 2021/01/07 14:44:44 | |
376220 | 50180 | Matrix Multiplication | B08201047 | Runtime Error (score: 90) | C | 2 KB | 2021/01/07 14:42:37 | |
376219 | 50180 | Matrix Multiplication | B08201047 | Runtime Error (score: 90) | C | 2 KB | 2021/01/07 14:37:30 | |
376218 | 50180 | Matrix Multiplication | B08201047 | Runtime Error (score: 90) | C | 1 KB | 2021/01/07 14:29:31 | |
376217 | 50180 | Matrix Multiplication | B08201047 | Runtime Error (score: 20) | C | 921 B | 2021/01/07 14:25:32 | |
376216 | 50180 | Matrix Multiplication | B08201047 | Compilation Error | C | 901 B | 2021/01/07 14:24:50 | |
368241 | 94 | Tree Traversal | B08201047 | Accepted (93 ms, 6 MB) | C | 2 KB | 2020/10/21 12:57:45 | |
368240 | 50108 | Sequence to Binary Tree | B08201047 | Accepted (75 ms, 896 KB) | * | 1 KB | 2020/10/21 12:56:09 | |
368237 | 20005 | 0/1 Knapsack Problem (Design Strategies for Computer Algorithms) | B08201047 | Accepted (5.0 s, 39 MB) | * | 2 KB | 2020/10/21 12:54:16 | |
364464 | 20006 | 2-Dimensional Closest Pair Problem (Design Strategies for Computer Algorithms) | B08201047 | Accepted (915 ms, 49 MB) | * | 3 KB | 2020/09/09 22:34:26 | |
364451 | 20005 | 0/1 Knapsack Problem (Design Strategies for Computer Algorithms) | B08201047 | Accepted (4.7 s, 39 MB) | * | 1 KB | 2020/09/09 12:07:44 | |
364450 | 20005 | 0/1 Knapsack Problem (Design Strategies for Computer Algorithms) | B08201047 | Accepted (9.2 s, 39 MB) | * | 1 KB | 2020/09/09 12:03:26 | |
364449 | 20005 | 0/1 Knapsack Problem (Design Strategies for Computer Algorithms) | B08201047 | Wrong Answer (score: 70) | * | 1 KB | 2020/09/09 11:57:00 |