User

Recent Submission (all)

# Problem User Verdict Len Date Style
341616 20005 0/1 Knapsack Problem (Design Strategies for Computer Algorithms) B04902053 Time Limit Exceeded (score: 80) * 2 KB 2019/12/09 06:43:43
341615 20005 0/1 Knapsack Problem (Design Strategies for Computer Algorithms) B04902053 Time Limit Exceeded (score: 80) * 2 KB 2019/12/09 06:39:07
341614 20006 2-Dimensional Closest Pair Problem (Design Strategies for Computer Algorithms) B04902053 Runtime Error (score: 80) * 3 KB 2019/12/09 06:24:35
341613 20006 2-Dimensional Closest Pair Problem (Design Strategies for Computer Algorithms) B04902053 Runtime Error (score: 0) * 3 KB 2019/12/09 06:18:30
341612 20006 2-Dimensional Closest Pair Problem (Design Strategies for Computer Algorithms) B04902053 Runtime Error (score: 0) * 3 KB 2019/12/09 06:17:45
341597 20006 2-Dimensional Closest Pair Problem (Design Strategies for Computer Algorithms) B04902053 Time Limit Exceeded (score: 90) * 10 KB 2019/12/09 03:51:23
341596 20006 2-Dimensional Closest Pair Problem (Design Strategies for Computer Algorithms) B04902053 Compilation Error * 4 KB 2019/12/09 03:50:56
341595 20006 2-Dimensional Closest Pair Problem (Design Strategies for Computer Algorithms) B04902053 Runtime Error (score: 0) * 2 KB 2019/12/09 03:49:46
341594 20006 2-Dimensional Closest Pair Problem (Design Strategies for Computer Algorithms) B04902053 Compilation Error * 4 KB 2019/12/09 03:49:02
341582 20005 0/1 Knapsack Problem (Design Strategies for Computer Algorithms) B04902053 Memory Limit Exceeded (score: 70) * 2 KB 2019/12/09 02:34:31
341580 20005 0/1 Knapsack Problem (Design Strategies for Computer Algorithms) B04902053 Memory Limit Exceeded (score: 60) * 2 KB 2019/12/09 02:30:59
341577 20005 0/1 Knapsack Problem (Design Strategies for Computer Algorithms) B04902053 Memory Limit Exceeded (score: 70) * 2 KB 2019/12/09 02:28:54
341576 20005 0/1 Knapsack Problem (Design Strategies for Computer Algorithms) B04902053 Memory Limit Exceeded (score: 80) * 2 KB 2019/12/09 02:28:05
341572 20005 0/1 Knapsack Problem (Design Strategies for Computer Algorithms) B04902053 Memory Limit Exceeded (score: 80) * 2 KB 2019/12/09 02:20:41
341569 20005 0/1 Knapsack Problem (Design Strategies for Computer Algorithms) B04902053 Memory Limit Exceeded (score: 80) * 2 KB 2019/12/09 02:17:22
341568 20005 0/1 Knapsack Problem (Design Strategies for Computer Algorithms) B04902053 Memory Limit Exceeded (score: 70) * 3 KB 2019/12/09 02:10:33
341565 20005 0/1 Knapsack Problem (Design Strategies for Computer Algorithms) B04902053 Memory Limit Exceeded (score: 80) * 3 KB 2019/12/09 02:06:23
341521 20005 0/1 Knapsack Problem (Design Strategies for Computer Algorithms) B04902053 Accepted (3.7 s, 39 MB) * 2 KB 2019/12/09 00:48:46
318804 20000 Longest Common Subsequence (Design Strategies for Computer Algorithms) B04902053 Wrong Answer (score: 90) * 1 KB 2019/11/04 05:41:07
318803 20000 Longest Common Subsequence (Design Strategies for Computer Algorithms) B04902053 Time Limit Exceeded (score: 85) * 1 KB 2019/11/04 05:39:06