QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #800049 | #7321. Hamiltonian $k$-vertex-connected Graph | adam01 | WA | 0ms | 3688kb | C++17 | 757b | 2024-12-05 20:44:51 | 2024-12-05 20:44:51 |
Due to the privacy settings of the submitter, you are not allowed to view this code.
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3668kb
input:
4 2
output:
4 1 2 2 3 3 4 4 1 1 2 3 4
result:
ok ok
Test #2:
score: 0
Accepted
time: 0ms
memory: 3608kb
input:
3 1
output:
-1
result:
ok ok
Test #3:
score: 0
Accepted
time: 0ms
memory: 3680kb
input:
4 1
output:
-1
result:
ok ok
Test #4:
score: 0
Accepted
time: 0ms
memory: 3688kb
input:
4 2
output:
4 1 2 2 3 3 4 4 1 1 2 3 4
result:
ok ok
Test #5:
score: 0
Accepted
time: 0ms
memory: 3668kb
input:
5 1
output:
-1
result:
ok ok
Test #6:
score: 0
Accepted
time: 0ms
memory: 3688kb
input:
5 2
output:
5 1 2 2 3 3 4 4 5 5 1 1 2 3 4 5
result:
ok ok
Test #7:
score: -100
Wrong Answer
time: 0ms
memory: 3616kb
input:
5 3
output:
9 1 2 2 3 3 4 4 5 5 1 1 3 2 4 3 5 4 1 1 2 3 4 5
result:
wrong answer jury has better solution with edges 8, while participant uses 9 edges.