| 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 |
| 364390 |
20005 |
0/1 Knapsack Problem (Design Strategies for Computer Algorithms) |
B08201047 |
Wrong Answer (score: 50) |
*
|
963 B |
2020/09/07 16:48:50 |
| 364381 |
20005 |
0/1 Knapsack Problem (Design Strategies for Computer Algorithms) |
B08201047 |
Time Limit Exceeded (score: 90) |
*
|
656 B |
2020/09/06 16:16:48 |
| 364380 |
20005 |
0/1 Knapsack Problem (Design Strategies for Computer Algorithms) |
B08201047 |
Time Limit Exceeded (score: 90) |
*
|
679 B |
2020/09/06 16:13:51 |
| 363679 |
20005 |
0/1 Knapsack Problem (Design Strategies for Computer Algorithms) |
B08201047 |
Memory Limit Exceeded (score: 50) |
*
|
774 B |
2020/08/09 20:36:24 |
| 363674 |
20005 |
0/1 Knapsack Problem (Design Strategies for Computer Algorithms) |
B08201047 |
Time Limit Exceeded (score: 0) |
*
|
420 B |
2020/08/09 16:24:59 |
| 363670 |
20000 |
Longest Common Subsequence (Design Strategies for Computer Algorithms) |
B08201047 |
Accepted (3.4 s, 445 MB) |
*
|
2 KB |
2020/08/09 10:08:23 |
| 363669 |
20000 |
Longest Common Subsequence (Design Strategies for Computer Algorithms) |
B08201047 |
Runtime Error (score: 65) |
*
|
2 KB |
2020/08/09 10:07:56 |
| 363668 |
20000 |
Longest Common Subsequence (Design Strategies for Computer Algorithms) |
B08201047 |
Wrong Answer (score: 90) |
*
|
2 KB |
2020/08/08 22:12:58 |
| 363667 |
20000 |
Longest Common Subsequence (Design Strategies for Computer Algorithms) |
B08201047 |
Wrong Answer (score: 90) |
*
|
2 KB |
2020/08/08 22:10:37 |
| 363666 |
20000 |
Longest Common Subsequence (Design Strategies for Computer Algorithms) |
B08201047 |
Runtime Error (score: 40) |
*
|
2 KB |
2020/08/08 22:02:29 |
| 363665 |
20000 |
Longest Common Subsequence (Design Strategies for Computer Algorithms) |
B08201047 |
Wrong Answer (score: 80) |
*
|
2 KB |
2020/08/08 21:41:26 |
| 363664 |
20000 |
Longest Common Subsequence (Design Strategies for Computer Algorithms) |
B08201047 |
Compilation Error |
*
|
2 KB |
2020/08/08 21:40:21 |
| 363663 |
20000 |
Longest Common Subsequence (Design Strategies for Computer Algorithms) |
B08201047 |
Compilation Error |
*
|
2 KB |
2020/08/08 21:39:25 |
| 363662 |
20000 |
Longest Common Subsequence (Design Strategies for Computer Algorithms) |
B08201047 |
Runtime Error (score: 45) |
*
|
2 KB |
2020/08/08 21:35:02 |
| 363661 |
20000 |
Longest Common Subsequence (Design Strategies for Computer Algorithms) |
B08201047 |
Runtime Error (score: 45) |
*
|
2 KB |
2020/08/08 21:33:26 |
| 363660 |
20000 |
Longest Common Subsequence (Design Strategies for Computer Algorithms) |
B08201047 |
Runtime Error (score: 40) |
*
|
2 KB |
2020/08/08 21:31:21 |
