QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #78569 | #5528. Least Annoying Constructive Problem | znstz | WA | 2ms | 3392kb | C++14 | 677b | 2023-02-19 15:57:39 | 2023-02-19 15:57:40 |
Due to the privacy settings of the submitter, you are not allowed to view this code.
详细
Test #1:
score: 100
Accepted
time: 2ms
memory: 3392kb
input:
3
output:
1 2 2 3 1 3
result:
ok Correct
Test #2:
score: 0
Accepted
time: 0ms
memory: 3384kb
input:
4
output:
1 2 3 4 2 3 1 4 1 3 2 4
result:
ok Correct
Test #3:
score: -100
Wrong Answer
time: 0ms
memory: 3352kb
input:
5
output:
1 2 4 5 2 3 3 4 1 5 1 3 3 5 2 4 1 4 2 5
result:
wrong answer Every consecutive n-1 edges have to form a tree, false for 3