QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#231830 | #5446. 琪露诺的符卡交换 | GuanYunchang | 0 | 547ms | 5932kb | C++14 | 2.9kb | 2023-10-29 16:58:12 | 2023-10-29 16:58:12 |
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
Subtask #1:
score: 0
Time Limit Exceeded
Test #1:
score: 20
Accepted
time: 547ms
memory: 5932kb
input:
7 132 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 ...
output:
8646 2 1 1 2 3 1 1 3 3 2 2 3 4 1 1 4 4 2 2 4 4 3 3 4 5 1 1 5 5 2 2 5 5 3 3 5 5 4 4 5 6 1 1 6 6 2 2 6 6 3 3 6 6 4 4 6 6 5 5 6 7 1 1 7 7 2 2 7 7 3 3 7 7 4 4 7 7 5 5 7 7 6 6 7 8 1 1 8 8 2 2 8 8 3 3 8 8 4 4 8 8 5 5 8 8 6 6 8 8 7 7 8 9 1 1 9 9 2 2 9 9 3 3 9 9 4 4 9 9 5 5 9 9 6 6 9 9 7 7 9 9 8 8 9 10 1 1 ...
result:
ok your solution is correct.
Test #2:
score: 0
Accepted
time: 120ms
memory: 4280kb
input:
8 14 13 13 13 13 13 13 13 13 13 13 13 13 13 13 7 7 7 7 7 7 7 7 7 7 7 7 7 7 8 8 8 8 8 8 8 8 8 8 8 8 8 8 14 14 14 14 14 14 14 14 14 14 14 14 14 14 5 5 5 5 5 5 5 5 5 5 5 5 5 5 4 4 4 4 4 4 4 4 4 4 4 4 4 4 1 1 1 1 1 1 1 1 1 1 1 1 1 1 10 10 10 10 10 10 10 10 10 10 10 10 10 10 2 2 2 2 2 2 2 2 2 2 2 2 2 2 9...
output:
91 2 1 1 2 3 1 1 3 3 2 2 3 4 1 1 4 4 2 2 4 4 3 3 4 5 1 1 5 5 2 2 5 5 3 3 5 5 4 4 5 6 1 1 6 6 2 2 6 6 3 3 6 6 4 4 6 6 5 5 6 7 1 1 7 7 2 2 7 7 3 3 7 7 4 4 7 7 5 5 7 7 6 6 7 8 1 1 8 8 2 2 8 8 3 3 8 8 4 4 8 8 5 5 8 8 6 6 8 8 7 7 8 9 1 1 9 9 2 2 9 9 3 3 9 9 4 4 9 9 5 5 9 9 6 6 9 9 7 7 9 9 8 8 9 10 1 1 10...
result:
ok your solution is correct.
Test #3:
score: 0
Accepted
time: 215ms
memory: 4056kb
input:
4 82 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 1...
output:
3321 2 1 1 2 3 1 1 3 3 2 2 3 4 1 1 4 4 2 2 4 4 3 3 4 5 1 1 5 5 2 2 5 5 3 3 5 5 4 4 5 6 1 1 6 6 2 2 6 6 3 3 6 6 4 4 6 6 5 5 6 7 1 1 7 7 2 2 7 7 3 3 7 7 4 4 7 7 5 5 7 7 6 6 7 8 1 1 8 8 2 2 8 8 3 3 8 8 4 4 8 8 5 5 8 8 6 6 8 8 7 7 8 9 1 1 9 9 2 2 9 9 3 3 9 9 4 4 9 9 5 5 9 9 6 6 9 9 7 7 9 9 8 8 9 10 1 1 ...
result:
ok your solution is correct.
Test #4:
score: -20
Time Limit Exceeded
input:
8 3 1 1 1 3 3 3 2 2 2 3 1 1 1 3 3 3 2 2 2 1 1 11 5 5 5 5 5 5 5 5 5 5 5 3 3 3 3 3 3 3 3 3 3 3 1 1 1 1 1 1 1 1 1 1 1 9 9 9 9 9 9 9 9 9 9 9 4 4 4 4 4 4 4 4 4 4 4 11 11 11 11 11 11 11 11 11 11 11 2 2 2 2 2 2 2 2 2 2 2 6 6 6 6 6 6 6 6 6 6 6 8 8 8 8 8 8 8 8 8 8 8 10 10 10 10 10 10 10 10 10 10 10 7 7 7 7 7...
output:
result:
Subtask #2:
score: 0
Skipped
Dependency #1:
0%
Subtask #3:
score: 0
Skipped
Dependency #1:
0%