QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#756307 | #9570. Binary Tree | ucup-team4412 | ML | 1ms | 13836kb | C++23 | 4.1kb | 2024-11-16 19:49:43 | 2024-11-16 19:49:44 |
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: 13836kb
input:
2 5 0 0 1 5 2 4 0 0 0 0 2 0 2 0 2 0 0 2
output:
? 1 3 ? 3 4 ! 3 ? 1 2 ! 2
result:
ok OK (2 test cases)
Test #2:
score: -100
Memory Limit Exceeded
input:
5555 8 2 0 8 6 0 0 3 0 0 0 7 0 0 0 5 4 2 0 0 8 0 0 1 4 2 0 0 0 7 8 0 0 3 0 6 0 0 1 2 8 5 8 0 0 1 7 0 0 0 0 4 2 0 0 6 0 0 1 0 5 4 5 3 1 0 0 0 0 0 0 2 0 8 0 0 0 0 5 6 0 0 1 4 2 0 3 8 0 0 1 0 5 3 0 5 1 0 0 0 0 4 0 2 0 5 5 0 0 0 0 0 3 0 2 4 0 2 3 3 0 1 0 0 0 1 2 2 0 0 0 2 3 2 3 0 0 0 0 2 10 2 8 9 7 0 0 ...
output:
? 6 8 ? 4 5 ? 4 3 ! 4 ? 3 5 ? 4 1 ? 3 2 ! 2 ? 8 3 ? 2 4 ? 8 6 ! 8 ? 4 2 ? 2 3 ! 2 ? 6 5 ? 8 3 ! 8 ? 1 5 ? 5 4 ! 5 ? 4 2 ? 4 3 ! 3 ? 3 2 ! 1 ? 1 2 ! 2 ? 3 2 ! 2 ? 7 9 ? 4 7 ? 7 5 ! 7 ? 1 2 ! 1 ? 7 3 ? 1 2 ? 7 9 ! 9 ? 10 3 ? 6 8 ? 4 2 ! 4 ? 3 9 ? 7 1 ? 9 2 ! 2 ? 2 1 ! 1 ? 1 5 ? 6 3 ? 3 2