User

Recent Submission (all)

# Problem User Verdict Len Date Style
263086 20006 2-Dimensional Closest Pair Problem (Design Strategies for Computer Algorithms) B04902017 Accepted (1.4 s, 37 MB) * 5 KB 2019/01/10 19:03:52
263085 20006 2-Dimensional Closest Pair Problem (Design Strategies for Computer Algorithms) B04902017 Wrong Answer (score: 0) * 5 KB 2019/01/10 19:02:27
263083 20005 0/1 Knapsack Problem (Design Strategies for Computer Algorithms) B04902017 Time Limit Exceeded (score: 60) * 3 KB 2019/01/10 15:33:07
263082 20005 0/1 Knapsack Problem (Design Strategies for Computer Algorithms) B04902017 Time Limit Exceeded (score: 60) * 3 KB 2019/01/10 15:27:13
263081 20006 2-Dimensional Closest Pair Problem (Design Strategies for Computer Algorithms) B04902017 Accepted (1.5 s, 37 MB) * 5 KB 2019/01/10 15:10:58
263080 20006 2-Dimensional Closest Pair Problem (Design Strategies for Computer Algorithms) B04902017 Wrong Answer (score: 0) * 5 KB 2019/01/10 15:09:35
263079 20006 2-Dimensional Closest Pair Problem (Design Strategies for Computer Algorithms) B04902017 Accepted (1.0 s, 55 MB) * 9 KB 2019/01/10 14:59:28
263078 20006 2-Dimensional Closest Pair Problem (Design Strategies for Computer Algorithms) B04902017 Accepted (895 ms, 55 MB) * 9 KB 2019/01/10 14:58:34
263077 20006 2-Dimensional Closest Pair Problem (Design Strategies for Computer Algorithms) B04902017 Accepted (942 ms, 55 MB) * 9 KB 2019/01/10 14:56:39
263075 20006 2-Dimensional Closest Pair Problem (Design Strategies for Computer Algorithms) B04902017 Accepted (1.4 s, 37 MB) * 5 KB 2019/01/10 14:43:22
263074 20005 0/1 Knapsack Problem (Design Strategies for Computer Algorithms) B04902017 Output Limit Exceeded (score: 0) * 5 KB 2019/01/10 14:41:33
263072 20006 2-Dimensional Closest Pair Problem (Design Strategies for Computer Algorithms) B04902017 Wrong Answer (score: 0) * 5 KB 2019/01/10 14:36:28
263070 20006 2-Dimensional Closest Pair Problem (Design Strategies for Computer Algorithms) B04902017 Compilation Error * 5 KB 2019/01/10 14:35:08
263069 20006 2-Dimensional Closest Pair Problem (Design Strategies for Computer Algorithms) B04902017 Wrong Answer (score: 80) * 9 KB 2019/01/10 14:32:37
263068 20006 2-Dimensional Closest Pair Problem (Design Strategies for Computer Algorithms) B04902017 Wrong Answer (score: 40) * 5 KB 2019/01/10 14:13:21
263067 20006 2-Dimensional Closest Pair Problem (Design Strategies for Computer Algorithms) B04902017 Wrong Answer (score: 40) * 5 KB 2019/01/10 13:56:31
263066 20005 0/1 Knapsack Problem (Design Strategies for Computer Algorithms) B04902017 Time Limit Exceeded (score: 60) * 3 KB 2019/01/10 13:48:58
255801 20001 2-Dimensional Linear Programming (Design Strategies for Computer Algorithms) B04902017 Wrong Answer (score: 60) * 10 KB 2018/12/17 01:59:02
255694 20005 0/1 Knapsack Problem (Design Strategies for Computer Algorithms) B04902017 Memory Limit Exceeded (score: 90) * 6 KB 2018/12/17 00:02:51
255683 20005 0/1 Knapsack Problem (Design Strategies for Computer Algorithms) B04902017 Memory Limit Exceeded (score: 70) * 6 KB 2018/12/16 23:58:00