QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #163434 | #5528. Least Annoying Constructive Problem | HuangHanSheng | WA | 19ms | 9476kb | Python3 | 164b | 2023-09-04 05:01:13 | 2023-09-04 05:01:13 |
Due to the privacy settings of the submitter, you are not allowed to view this code.
详细
Test #1:
score: 100
Accepted
time: 19ms
memory: 9476kb
input:
3
output:
1 2 2 3 1 3
result:
ok Correct
Test #2:
score: -100
Wrong Answer
time: 13ms
memory: 9404kb
input:
4
output:
2 4 2 3 1 3 3 4 1 2 1 4
result:
wrong answer Every consecutive n-1 edges have to form a tree, false for 4