QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #464526 | #7321. Hamiltonian $k$-vertex-connected Graph | Urd | WA | 0ms | 3676kb | C++17 | 948b | 2024-07-06 11:30:45 | 2024-07-06 11:30:45 |
Due to the privacy settings of the submitter, you are not allowed to view this code.
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3600kb
input:
4 2
output:
4 1 3 1 4 2 3 2 4 1 3 2 4
result:
ok ok
Test #2:
score: -100
Wrong Answer
time: 0ms
memory: 3676kb
input:
3 1
output:
2 1 2 3 2 1 2 3
result:
wrong answer jury has better solution with edges -1, while participant uses 2 edges.