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

Alison Marczewski: submissions

ID DATE PROBLEMRESULT TIME MEM LANG
12135846 2014-08-13 08:34:34 The Moronic Cowmpouter accepted 0.00 1.6M

C

12086928 2014-08-05 08:59:38 Minimum Step To One wrong answer 0.00 6.0M

C

11700366 2014-06-04 05:52:24 K-th Number time limit exceeded - 3.1M

C++

4.3.2

11012319 2014-02-06 00:28:39 Almost Shortest Path time limit exceeded - 178M

JAVA

11012309 2014-02-06 00:24:19 Almost Shortest Path time limit exceeded - 178M

JAVA

11011921 2014-02-05 22:34:43 Almost Shortest Path accepted 0.06 3.9M

C

10967469 2014-01-30 00:28:16 Electricity time limit exceeded - 178M

JAVA

10966985 2014-01-29 22:26:22 Electricity time limit exceeded - 178M

JAVA

10966949 2014-01-29 22:19:13 Electricity time limit exceeded - 178M

JAVA

10966944 2014-01-29 22:18:27 Electricity compilation error - -

JAVA

10966922 2014-01-29 22:15:01 Electricity compilation error - -

JAVA

10966811 2014-01-29 21:52:37 Electricity accepted 0.00 2.6M

CPP

10966798 2014-01-29 21:50:46 Electricity accepted 0.00 2.6M

CPP

10966795 2014-01-29 21:50:04 Electricity accepted 0.00 2.6M

CPP

10966729 2014-01-29 21:39:45 Electricity accepted 0.00 1.6M

C

7510807 2012-08-22 02:43:16 Almost Shortest Path accepted 0.05 3.8M

CPP

7445277 2012-08-11 05:27:12 Longest path in a tree time limit exceeded - 3.0M

C++

4.3.2

7445270 2012-08-11 05:21:39 Longest path in a tree time limit exceeded - 3.0M

C++

4.3.2

7445241 2012-08-11 05:11:34 Longest path in a tree time limit exceeded - 3.0M

C++

4.3.2

7445202 2012-08-11 04:58:00 Longest path in a tree wrong answer 0.01 3.0M

C++

4.3.2

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