QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#326338 | #5512. Stone Arranging 2 | HuangHanSheng | 0 | 14ms | 3928kb | C++17 | 799b | 2024-02-12 21:58:22 | 2024-02-12 21:58:22 |
Due to the privacy settings of the submitter, you are not allowed to view this code.
詳細信息
Subtask #1:
score: 0
Wrong Answer
Test #1:
score: 25
Accepted
time: 0ms
memory: 3520kb
input:
1 1
output:
1
result:
ok single line: '1'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3724kb
input:
2 1 1
output:
1 1
result:
ok 2 lines
Test #3:
score: 0
Accepted
time: 0ms
memory: 3592kb
input:
3 1 1 1
output:
1 1 1
result:
ok 3 lines
Test #4:
score: 0
Accepted
time: 1ms
memory: 3600kb
input:
2000 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 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:
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 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 ...
result:
ok 2000 lines
Test #5:
score: 0
Accepted
time: 0ms
memory: 3572kb
input:
1 2
output:
2
result:
ok single line: '2'
Test #6:
score: 0
Accepted
time: 0ms
memory: 3596kb
input:
2 2 2
output:
2 2
result:
ok 2 lines
Test #7:
score: 0
Accepted
time: 0ms
memory: 3820kb
input:
3 2 2 2
output:
2 2 2
result:
ok 3 lines
Test #8:
score: 0
Accepted
time: 0ms
memory: 3612kb
input:
2000 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2...
output:
2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ...
result:
ok 2000 lines
Test #9:
score: 0
Accepted
time: 0ms
memory: 3552kb
input:
2000 334978097 334978097 334978097 334978097 334978097 334978097 334978097 334978097 334978097 334978097 334978097 334978097 334978097 334978097 334978097 334978097 334978097 334978097 334978097 334978097 334978097 334978097 334978097 334978097 334978097 334978097 334978097 334978097 334978097 33497...
output:
334978097 334978097 334978097 334978097 334978097 334978097 334978097 334978097 334978097 334978097 334978097 334978097 334978097 334978097 334978097 334978097 334978097 334978097 334978097 334978097 334978097 334978097 334978097 334978097 334978097 334978097 334978097 334978097 334978097 334978097 ...
result:
ok 2000 lines
Test #10:
score: -25
Wrong Answer
time: 1ms
memory: 3588kb
input:
2000 2 1 2 2 1 1 1 2 2 2 1 1 2 2 1 1 2 2 2 2 2 1 2 1 2 2 1 2 2 2 2 2 1 1 1 2 2 2 2 2 1 2 2 2 2 2 1 1 1 1 2 1 2 1 1 2 1 1 2 2 2 1 1 1 1 1 1 2 2 2 1 1 1 2 1 2 2 1 1 2 1 1 1 2 1 1 1 2 1 2 1 2 2 2 1 2 2 1 2 2 2 2 1 2 1 1 2 2 1 2 1 1 2 2 1 1 1 1 1 1 2 1 2 2 2 2 1 2 1 2 2 1 1 1 1 2 1 2 1 1 1 1 2 2 1 1 1 1...
output:
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 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 ...
result:
wrong answer 1st lines differ - expected: '2', found: '1'
Subtask #2:
score: 0
Time Limit Exceeded
Test #29:
score: 35
Accepted
time: 10ms
memory: 3880kb
input:
200000 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 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:
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 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 ...
result:
ok 200000 lines
Test #30:
score: 0
Accepted
time: 14ms
memory: 3928kb
input:
200000 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2...
output:
2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ...
result:
ok 200000 lines
Test #31:
score: -35
Time Limit Exceeded
input:
200000 2 1 1 2 2 2 2 2 1 1 1 1 2 2 2 1 1 1 2 1 2 2 2 1 1 2 1 1 2 1 2 2 1 2 1 2 1 2 1 2 2 1 1 1 2 1 1 2 2 1 2 1 2 2 2 2 2 1 2 2 2 2 1 1 1 1 1 1 2 1 1 2 2 2 1 1 1 2 2 2 1 2 1 2 2 2 1 1 1 1 1 2 1 1 1 1 1 1 1 2 2 2 2 1 1 2 1 2 2 1 1 2 1 1 1 2 2 2 2 2 2 2 2 2 2 2 2 1 2 1 2 2 1 1 2 1 1 1 1 2 2 1 2 2 1 1 2...
output:
result:
Subtask #3:
score: 0
Skipped
Dependency #1:
0%