QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#350899 | #6515. Path Planning | GuanYunchang | WA | 15ms | 3608kb | C++20 | 1.8kb | 2024-03-11 09:33:50 | 2024-03-11 09:33:52 |
Due to the privacy settings of the submitter, you are not allowed to view this code.
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 3608kb
input:
2 2 3 1 2 4 3 0 5 1 5 1 3 0 4 2
output:
3 5
result:
ok 2 number(s): "3 5"
Test #2:
score: -100
Wrong Answer
time: 15ms
memory: 3492kb
input:
10000 2 9 4 0 3 5 2 7 16 11 12 9 13 14 17 10 8 15 1 6 4 8 19 23 22 13 29 4 17 26 30 6 25 3 15 24 18 14 12 8 7 9 27 5 0 10 11 16 31 20 2 28 1 21 1 6 3 2 0 1 4 5 2 3 4 2 0 3 5 1 5 1 4 0 3 2 1 1 3 1 0 2 8 10 9 50 8 0 41 57 60 30 23 65 64 21 36 12 10 5 58 19 38 67 71 52 45 17 77 4 59 51 22 25 56 49 79 2...
output:
9 2 6 3 5 3 15 13 5 9 7 8 6 11 7 4 6 7 17 13 11 9 6 3 6 7 7 2 12 5 19 6 13 3 7 7 9 2 1 6 6 10 8 5 4 5 2 5 7 13 6 13 2 10 3 7 9 8 5 11 4 8 8 5 8 4 7 7 7 8 8 6 6 8 4 8 7 13 3 3 7 7 5 3 10 5 12 9 4 16 7 9 5 10 9 7 4 10 2 8 4 8 10 10 6 4 10 6 7 5 9 4 12 11 3 5 4 5 7 4 8 4 12 6 5 6 12 6 14 3 8 11 3 9 12 ...
result:
wrong answer 7th numbers differ - expected: '14', found: '15'