QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #510738 | #5199. Amazing Trick | HuangHanSheng | WA | 3ms | 3904kb | C++17 | 2.3kb | 2024-08-09 11:51:52 | 2024-08-09 11:51:52 |
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: 0ms
memory: 3904kb
input:
4 2 2 1 3 1 2 3 4 2 1 4 3 5 5 1 4 2 3
output:
Impossible Possible 3 1 2 2 3 1 Possible 4 3 1 2 4 3 1 2 Possible 3 1 2 5 4 3 5 4 1 2
result:
ok 3/4 are 'Possible' (4 test cases)
Test #2:
score: 0
Accepted
time: 0ms
memory: 3636kb
input:
50 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
output:
Impossible Impossible Impossible Impossible Impossible Impossible Impossible Impossible Impossible Impossible Impossible Impossible Impossible Impossible Impossible Impossible Impossible Impossible Impossible Impossible Impossible Impossible Impossible Impossible Impossible Impossible Impossible Imp...
result:
ok 0/50 are 'Possible' (50 test cases)
Test #3:
score: 0
Accepted
time: 0ms
memory: 3784kb
input:
25 2 2 1 2 2 1 2 2 1 2 1 2 2 2 1 2 1 2 2 1 2 2 1 2 2 1 2 2 1 2 2 2 1 2 2 1 2 1 2 2 1 2 2 2 1 2 2 1 2 2 1 2 1 2 2 1 2 2 1 2 2 2 1 2 2 1 2 2 1 2 2 1 2 2 1
output:
Impossible Impossible Impossible Possible 2 1 2 1 Impossible Possible 2 1 2 1 Possible 2 1 2 1 Possible 2 1 2 1 Possible 2 1 2 1 Possible 2 1 2 1 Impossible Impossible Possible 2 1 2 1 Possible 2 1 2 1 Impossible Impossible Impossible Possible 2 1 2 1 Possible 2 1 2 1 Possible 2 1 2 1 Impossible Imp...
result:
ok 11/25 are 'Possible' (25 test cases)
Test #4:
score: 0
Accepted
time: 0ms
memory: 3900kb
input:
16 3 3 2 1 3 3 1 2 3 3 1 2 3 2 3 1 3 3 1 2 3 2 1 3 3 2 3 1 3 3 2 1 3 3 1 2 3 2 1 3 3 1 2 3 3 1 3 2 3 3 1 2 3 3 1 2 3 3 2 1 3 2 1 3
output:
Impossible Possible 3 1 2 3 1 2 Possible 3 1 2 3 1 2 Possible 2 3 1 2 3 1 Possible 3 1 2 3 1 2 Impossible Possible 2 3 1 2 3 1 Impossible Possible 3 1 2 3 1 2 Impossible Possible 3 1 2 2 3 1 Impossible Possible 3 1 2 3 1 2 Possible 3 1 2 3 1 2 Impossible Impossible
result:
ok 9/16 are 'Possible' (16 test cases)
Test #5:
score: -100
Wrong Answer
time: 3ms
memory: 3888kb
input:
12 4 2 4 1 3 4 2 4 1 3 4 1 3 2 4 4 2 4 1 3 4 4 1 2 3 4 2 4 3 1 4 1 3 4 2 4 3 4 2 1 4 2 4 3 1 4 1 3 2 4 4 3 4 1 2 4 1 3 4 2
output:
Impossible Impossible Possible 2 1 4 3 2 4 1 3 Impossible Possible 4 1 2 3 3 4 1 2 Impossible Possible 3 1 4 2 2 3 4 1 Possible 2 1 4 3 3 4 2 1 Impossible Possible 2 1 4 3 2 4 1 3 Possible 2 1 4 3 4 3 2 1 Possible 3 1 4 2 2 3 4 1
result:
wrong answer solution exists, but was not found [n = 4] (test case 1)