QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#84288 | #5528. Least Annoying Constructive Problem | wlxhkk | WA | 2ms | 3524kb | C++14 | 185b | 2023-03-06 09:20:14 | 2023-03-06 09:20:18 |
Due to the privacy settings of the submitter, you are not allowed to view this code.
詳細信息
Test #1:
score: 100
Accepted
time: 2ms
memory: 3476kb
input:
3
output:
1 2 1 3 2 3
result:
ok Correct
Test #2:
score: 0
Accepted
time: 2ms
memory: 3392kb
input:
4
output:
1 2 2 3 1 4 1 3 2 4 3 4
result:
ok Correct
Test #3:
score: 0
Accepted
time: 1ms
memory: 3524kb
input:
5
output:
1 2 2 3 3 4 1 5 1 3 2 4 2 5 1 4 3 5 4 5
result:
ok Correct
Test #4:
score: -100
Wrong Answer
time: 2ms
memory: 3396kb
input:
6
output:
1 2 2 3 3 4 4 5 1 6 1 3 2 4 3 5 2 6 1 4 2 5 3 6 1 5 4 6 5 6
result:
wrong answer Every consecutive n-1 edges have to form a tree, false for 7