QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #84287 | #5528. Least Annoying Constructive Problem | wlxhkk | WA | 2ms | 3608kb | C++14 | 193b | 2023-03-06 09:18:59 | 2023-03-06 09:19:00 |
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: 3420kb
input:
3
output:
1 2 2 3 1 3
result:
ok Correct
Test #2:
score: 0
Accepted
time: 2ms
memory: 3508kb
input:
4
output:
1 2 2 3 1 4 1 3 2 4 3 4
result:
ok Correct
Test #3:
score: -100
Wrong Answer
time: 1ms
memory: 3608kb
input:
5
output:
1 2 2 3 3 4 4 5 1 3 2 4 3 5 1 4 2 5 1 5
result:
wrong answer Every consecutive n-1 edges have to form a tree, false for 7