QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#155149 | #5575. Knight's Tour Redux | UESTC_Broforce (Linze Li, Shangrong Li, Zhitao Cheng) # | RE | 1ms | 3972kb | C++14 | 1.8kb | 2023-09-01 12:08:46 | 2023-09-01 12:08:47 |
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
Test #1:
score: 100
Accepted
time: 1ms
memory: 3708kb
input:
1
output:
POSSIBLE 1 1
result:
ok answer = 1
Test #2:
score: 0
Accepted
time: 1ms
memory: 3784kb
input:
2
output:
IMPOSSIBLE
result:
ok answer = 0
Test #3:
score: 0
Accepted
time: 1ms
memory: 3768kb
input:
3
output:
IMPOSSIBLE
result:
ok answer = 0
Test #4:
score: 0
Accepted
time: 1ms
memory: 3780kb
input:
4
output:
IMPOSSIBLE
result:
ok answer = 0
Test #5:
score: 0
Accepted
time: 1ms
memory: 3916kb
input:
5
output:
POSSIBLE 3 1 4 4 1 5 2 2 5 3
result:
ok answer = 1
Test #6:
score: 0
Accepted
time: 1ms
memory: 3964kb
input:
6
output:
POSSIBLE 1 1 4 2 5 5 2 6 3 3 6 4
result:
ok answer = 1
Test #7:
score: 0
Accepted
time: 1ms
memory: 3824kb
input:
7
output:
POSSIBLE 3 1 6 2 7 5 4 4 1 3 2 6 5 7
result:
ok answer = 1
Test #8:
score: 0
Accepted
time: 0ms
memory: 3972kb
input:
8
output:
POSSIBLE 1 1 4 2 7 3 8 6 5 5 2 4 3 7 6 8
result:
ok answer = 1
Test #9:
score: 0
Accepted
time: 1ms
memory: 3840kb
input:
9
output:
POSSIBLE 3 1 6 2 9 3 8 6 5 5 2 4 1 7 4 8 7 9
result:
ok answer = 1
Test #10:
score: 0
Accepted
time: 1ms
memory: 3784kb
input:
10
output:
POSSIBLE 1 1 4 2 7 3 10 4 9 7 6 6 3 5 2 8 5 9 8 10
result:
ok answer = 1
Test #11:
score: 0
Accepted
time: 1ms
memory: 3840kb
input:
11
output:
POSSIBLE 3 1 4 4 1 5 2 2 5 3 6 6 9 7 10 10 7 11 8 8 11 9
result:
ok answer = 1
Test #12:
score: 0
Accepted
time: 1ms
memory: 3760kb
input:
12
output:
POSSIBLE 1 1 4 2 5 5 2 6 3 3 6 4 7 7 10 8 11 11 8 12 9 9 12 10
result:
ok answer = 1
Test #13:
score: 0
Accepted
time: 1ms
memory: 3784kb
input:
13
output:
POSSIBLE 3 1 4 4 1 5 2 2 5 3 6 6 9 7 12 8 13 11 10 10 7 9 8 12 11 13
result:
ok answer = 1
Test #14:
score: 0
Accepted
time: 1ms
memory: 3916kb
input:
14
output:
POSSIBLE 1 1 4 2 5 5 2 6 3 3 6 4 7 7 10 8 13 9 14 12 11 11 8 10 9 13 12 14
result:
ok answer = 1
Test #15:
score: 0
Accepted
time: 0ms
memory: 3784kb
input:
15
output:
POSSIBLE 3 1 4 4 1 5 2 2 5 3 6 6 9 7 12 8 15 9 14 12 11 11 8 10 7 13 10 14 13 15
result:
ok answer = 1
Test #16:
score: 0
Accepted
time: 1ms
memory: 3836kb
input:
16
output:
POSSIBLE 1 1 4 2 5 5 2 6 3 3 6 4 7 7 10 8 13 9 16 10 15 13 12 12 9 11 8 14 11 15 14 16
result:
ok answer = 1
Test #17:
score: 0
Accepted
time: 1ms
memory: 3904kb
input:
17
output:
POSSIBLE 3 1 4 4 1 5 2 2 5 3 6 6 9 7 10 10 7 11 8 8 11 9 12 12 15 13 16 16 13 17 14 14 17 15
result:
ok answer = 1
Test #18:
score: 0
Accepted
time: 1ms
memory: 3916kb
input:
18
output:
POSSIBLE 1 1 4 2 5 5 2 6 3 3 6 4 7 7 10 8 11 11 8 12 9 9 12 10 13 13 16 14 17 17 14 18 15 15 18 16
result:
ok answer = 1
Test #19:
score: 0
Accepted
time: 0ms
memory: 3972kb
input:
19
output:
POSSIBLE 3 1 4 4 1 5 2 2 5 3 6 6 9 7 10 10 7 11 8 8 11 9 12 12 15 13 18 14 19 17 16 16 13 15 14 18 17 19
result:
ok answer = 1
Test #20:
score: 0
Accepted
time: 1ms
memory: 3904kb
input:
20
output:
POSSIBLE 1 1 4 2 5 5 2 6 3 3 6 4 7 7 10 8 11 11 8 12 9 9 12 10 13 13 16 14 19 15 20 18 17 17 14 16 15 19 18 20
result:
ok answer = 1
Test #21:
score: -100
Runtime Error
input:
99990