QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#119972 | #5512. Stone Arranging 2 | giaminh8368 | 0 | 43ms | 20220kb | C++14 | 767b | 2023-07-06 09:15:57 | 2023-07-06 09:15:59 |
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: 1ms
memory: 3396kb
input:
1 1
output:
1
result:
ok single line: '1'
Test #2:
score: 0
Accepted
time: 1ms
memory: 3376kb
input:
2 1 1
output:
1 1
result:
ok 2 lines
Test #3:
score: 0
Accepted
time: 1ms
memory: 3396kb
input:
3 1 1 1
output:
1 1 1
result:
ok 3 lines
Test #4:
score: 0
Accepted
time: 0ms
memory: 3552kb
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: 1ms
memory: 3376kb
input:
1 2
output:
2
result:
ok single line: '2'
Test #6:
score: 0
Accepted
time: 1ms
memory: 3560kb
input:
2 2 2
output:
2 2
result:
ok 2 lines
Test #7:
score: 0
Accepted
time: 1ms
memory: 3400kb
input:
3 2 2 2
output:
2 2 2
result:
ok 3 lines
Test #8:
score: 0
Accepted
time: 1ms
memory: 3436kb
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: 1ms
memory: 3460kb
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: 0ms
memory: 3568kb
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:
2 2 1 1 2 2 2 1 1 1 2 2 1 1 2 2 1 1 1 1 1 2 1 2 1 1 2 1 1 1 1 1 2 2 2 1 1 1 1 1 2 1 1 1 1 1 2 2 2 2 1 2 1 2 2 1 2 2 1 1 1 2 2 2 2 2 2 1 1 1 2 2 2 1 2 1 1 2 2 1 2 2 2 1 2 2 2 1 2 1 2 1 1 1 2 1 1 2 1 1 1 1 2 1 2 2 1 1 2 1 2 2 1 1 2 2 2 2 2 2 1 2 1 1 1 1 2 1 2 1 1 2 2 2 2 1 2 1 2 2 2 2 1 1 2 2 2 2 2 1 ...
result:
wrong answer 3rd lines differ - expected: '2', found: '1'
Subtask #2:
score: 0
Wrong Answer
Test #29:
score: 35
Accepted
time: 16ms
memory: 4884kb
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: 16ms
memory: 4844kb
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
Wrong Answer
time: 43ms
memory: 20220kb
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:
2 2 2 1 1 1 1 1 2 2 2 2 1 1 1 2 2 2 1 2 1 1 1 2 2 1 2 2 1 2 1 1 2 1 2 1 2 1 2 1 1 2 2 2 1 2 2 1 1 2 1 2 1 1 1 1 1 2 1 1 1 1 2 2 2 2 2 2 1 2 2 1 1 1 2 2 2 1 1 1 2 1 2 1 1 1 2 2 2 2 2 1 2 2 2 2 2 2 2 1 1 1 1 2 2 1 2 1 1 2 2 1 2 2 2 1 1 1 1 1 1 1 1 1 1 1 1 2 1 2 1 1 2 2 1 2 2 2 2 1 1 2 1 1 2 2 1 1 2 2 ...
result:
wrong answer 4th lines differ - expected: '2', found: '1'
Subtask #3:
score: 0
Skipped
Dependency #1:
0%