Submission

Update page each 60 seconds

# Problem User Verdict Len Date
343770 20005 0/1 Knapsack Problem (Design Strategies for Computer Algorithms) B08902143 Accepted (4.9 s, 19 MB) * 796 B 2019/12/13 00:27:25
343767 20005 0/1 Knapsack Problem (Design Strategies for Computer Algorithms) B08902143 Wrong Answer (score: 50) * 738 B 2019/12/13 00:22:28
343757 20005 0/1 Knapsack Problem (Design Strategies for Computer Algorithms) B08902143 Wrong Answer (score: 50) * 756 B 2019/12/13 00:04:06
343755 20005 0/1 Knapsack Problem (Design Strategies for Computer Algorithms) B08902143 Wrong Answer (score: 50) * 531 B 2019/12/13 00:00:38
343753 20005 0/1 Knapsack Problem (Design Strategies for Computer Algorithms) B08902143 Time Limit Exceeded (score: 90) * 446 B 2019/12/12 23:55:09
343744 20005 0/1 Knapsack Problem (Design Strategies for Computer Algorithms) B08902143 Time Limit Exceeded (score: 90) * 570 B 2019/12/12 23:47:10
343732 20005 0/1 Knapsack Problem (Design Strategies for Computer Algorithms) B08902143 Time Limit Exceeded (score: 70) * 510 B 2019/12/12 23:25:54
343729 20005 0/1 Knapsack Problem (Design Strategies for Computer Algorithms) B08902143 Time Limit Exceeded (score: 60) * 510 B 2019/12/12 23:24:01
343725 20005 0/1 Knapsack Problem (Design Strategies for Computer Algorithms) B08902143 Time Limit Exceeded (score: 60) * 463 B 2019/12/12 23:21:23
342074 20005 0/1 Knapsack Problem (Design Strategies for Computer Algorithms) R08922169 Time Limit Exceeded (score: 80) * 7 KB 2019/12/09 13:57:35
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
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
338493 20005 0/1 Knapsack Problem (Design Strategies for Computer Algorithms) B03203004 Accepted (6.9 s, 19 MB) * 4 KB 2019/12/05 03:04:07
338492 20005 0/1 Knapsack Problem (Design Strategies for Computer Algorithms) B03203004 Time Limit Exceeded (score: 90) * 785 B 2019/12/05 02:31:34
338489 20005 0/1 Knapsack Problem (Design Strategies for Computer Algorithms) B03203004 Time Limit Exceeded (score: 90) * 561 B 2019/12/05 01:55:26
338082 20005 0/1 Knapsack Problem (Design Strategies for Computer Algorithms) B03203004 Memory Limit Exceeded (score: 100) * 4 KB 2019/12/04 02:30:07