Private submission
Private submission won't be visible to other users and
won't be taken into consideration in ranks.
Disqualify submission
Your submission will be disqualified. Operation
is not reversible.
Hidden submission
Public submission
Click here to view source code.

Source code of every submission to this problem
in this contest is public.
Help

: submissions
Shortest Paths

ID DATE PROBLEMRESULT TIME MEM LANG
15925040 2015-12-23 12:21:09 Shortest Paths accepted 0.03 9.7M

CPP14

15857165 2015-12-13 23:19:00 Shortest Paths accepted 0.01 9.7M

CPP14

15857138 2015-12-13 23:08:32 Shortest Paths wrong answer 0.00 9.7M

CPP14

15857102 2015-12-13 22:55:03 Shortest Paths wrong answer 0.00 9.6M

CPP14

15856897 2015-12-13 21:52:54 Shortest Paths time limit exceeded - 8.5M

CPP14

15856893 2015-12-13 21:51:41 Shortest Paths time limit exceeded - 9.5M

CPP14

15856888 2015-12-13 21:50:45 Shortest Paths wrong answer 0.00 9.5M

CPP14

15854784 2015-12-13 16:35:49 Shortest Paths time limit exceeded - 9.5M

CPP14

15854562 2015-12-13 16:09:53 Shortest Paths time limit exceeded - 9.5M

CPP14

15843673 2015-12-12 00:43:41 Shortest Paths time limit exceeded - 9.5M

CPP14

15843594 2015-12-12 00:16:38 Shortest Paths time limit exceeded - 9.7M

CPP14

15843539 2015-12-11 23:49:50 Shortest Paths time limit exceeded - 9.7M

CPP14

15843535 2015-12-11 23:47:20 Shortest Paths wrong answer 0.00 9.6M

CPP14

15843529 2015-12-11 23:44:20 Shortest Paths runtime error (SIGSEGV) 0.00 9.3M

CPP14

15843523 2015-12-11 23:41:31 Shortest Paths runtime error (SIGSEGV) 0.00 9.4M

CPP14

15843088 2015-12-11 21:23:03 Shortest Paths compilation error - -

CPP

15843086 2015-12-11 21:22:18 Shortest Paths time limit exceeded - 7.7M

CPP14

15833022 2015-12-10 21:02:24 Shortest Paths time limit exceeded - 6.5M

CPP14

15830882 2015-12-10 16:22:55 Shortest Paths time limit exceeded - 49M

CPP14

15825934 2015-12-09 23:39:42 Shortest Paths time limit exceeded - 49M

CPP14

code...
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.