QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #32168 | #27. The Battle for Wesnoth | flower# | 0 | 5ms | 3732kb | C++14 | 984b | 2022-05-18 00:03:43 | 2022-05-18 14:19:28 |
Due to the privacy settings of the submitter, you are not allowed to view this code.
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 0
Time Limit Exceeded
Test #1:
score: 10
Accepted
time: 4ms
memory: 3680kb
input:
1 30 11 1 2 3 4 5 6 7 8 9 10 11
output:
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
result:
ok Output is correct
Test #2:
score: 0
Accepted
time: 5ms
memory: 3704kb
input:
2 80 11 1 2 3 4 5 6 7 8 9 10 11
output:
1 2 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1
result:
ok Output is correct
Test #3:
score: 0
Accepted
time: 1ms
memory: 3684kb
input:
3 40 11 1 2 3 4 5 6 7 8 9 10 11
output:
1 3 3 1 3 1 3 1 3 1 3 1 3 1 3 1 3 1 3 1 3 1
result:
ok Output is correct
Test #4:
score: 0
Accepted
time: 3ms
memory: 3680kb
input:
4 50 11 1 2 3 4 5 6 7 8 9 10 11
output:
1 4 2 2 4 1 4 1 4 1 4 1 4 1 4 1 4 1 4 1 4 1
result:
ok Output is correct
Test #5:
score: 0
Accepted
time: 3ms
memory: 3712kb
input:
5 20 11 1 2 3 4 5 6 7 8 9 10 11
output:
1 5 2 2 5 1 5 1 5 1 5 1 5 1 5 1 5 1 5 1 5 1
result:
ok Output is correct
Test #6:
score: 0
Accepted
time: 1ms
memory: 3680kb
input:
6 70 11 1 2 3 4 5 6 7 8 9 10 11
output:
1 6 1 6 1 6 2 3 6 1 6 1 6 1 6 1 6 1 6 1 6 1
result:
ok Output is correct
Test #7:
score: 0
Accepted
time: 0ms
memory: 3732kb
input:
7 40 11 1 2 3 4 5 6 7 8 9 10 11
output:
1 7 1 7 3 2 7 1 7 1 7 1 7 1 7 1 7 1 7 1 7 1
result:
ok Output is correct
Test #8:
score: 0
Accepted
time: 3ms
memory: 3696kb
input:
8 51 11 1 2 3 4 5 6 7 8 9 10 11
output:
1 8 1 8 1 8 4 2 8 1 8 1 8 1 8 1 8 1 8 1 8 1
result:
ok Output is correct
Test #9:
score: 0
Accepted
time: 0ms
memory: 3712kb
input:
9 34 11 1 2 3 4 5 6 7 8 9 10 11
output:
1 9 1 9 3 3 4 2 9 1 9 1 9 1 9 1 9 1 9 1 9 1
result:
ok Output is correct
Test #10:
score: -10
Time Limit Exceeded
input:
10 1 100000 884878 751455 214308 292349 518777 621987 627497 913888 330915 676887 411803 309107 45478 905784 10996 847709 451664 824477 723026 472185 574143 254312 151912 964437 797786 350658 222631 852906 820189 19164 399894 42571 182177 533276 804359 273895 945080 658737 313612 236593 348856 74493...
output:
10 1 10 1 10 1 10 1 10 1 10 1 10 1 10 1 10 1 10 1 10 1 10 1 10 1 10 1 10 1 10 1 10 1 10 1 10 1 10 1 10 1 10 1 10 1 10 1 10 1 10 1 10 1 10 1 10 1 10 1 10 1 10 1 10 1 10 1 10 1 10 1 10 1 10 1 10 1 10 1 10 1 10 1 10 1 10 1 10 1 10 1 10 1 10 1 10 1 10 1 10 1 10 1 10 1 10 1 10 1 10 1 10 1 10 1 10 1 10 1 ...
result:
Subtask #2:
score: 0
Skipped
Dependency #1:
0%
Subtask #3:
score: 0
Skipped
Dependency #2:
0%
Subtask #4:
score: 0
Memory Limit Exceeded
Test #22:
score: 0
Memory Limit Exceeded
input:
100000 40 1 39935
output:
result:
Subtask #5:
score: 0
Skipped
Dependency #1:
0%
Subtask #6:
score: 0
Skipped
Dependency #1:
0%