QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #163427 | #5528. Least Annoying Constructive Problem | HuangHanSheng | WA | 1ms | 3532kb | C++20 | 1.7kb | 2023-09-04 04:31:25 | 2023-09-04 04:31:26 |
Due to the privacy settings of the submitter, you are not allowed to view this code.
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3424kb
input:
3
output:
1 2 2 3 1 3
result:
ok Correct
Test #2:
score: -100
Wrong Answer
time: 1ms
memory: 3532kb
input:
4
output:
1 2 2 3 3 4 1 3 2 4 1 4
result:
wrong answer Every consecutive n-1 edges have to form a tree, false for 4