QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #423021 | #5528. Least Annoying Constructive Problem | ucup-team864# | WA | 0ms | 3708kb | C++23 | 690b | 2024-05-27 20:50:38 | 2024-05-27 20:50:39 |
Due to the privacy settings of the submitter, you are not allowed to view this code.
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3708kb
input:
3
output:
2 3 1 3 1 2
result:
ok Correct
Test #2:
score: 0
Accepted
time: 0ms
memory: 3584kb
input:
4
output:
1 4 2 3 2 4 1 3 3 4 1 2
result:
ok Correct
Test #3:
score: -100
Wrong Answer
time: 0ms
memory: 3648kb
input:
5
output:
2 5 3 4 1 3 4 5 1 5 2 4 1 2 3 5 1 4 2 3
result:
wrong answer Every consecutive n-1 edges have to form a tree, false for 1