QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#111883 | #5512. Stone Arranging 2 | ZhaoZiLong | 0 | 10ms | 3448kb | C++17 | 692b | 2023-06-09 05:24:15 | 2023-06-09 05:24:16 |
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: 3372kb
input:
1 1
output:
1
result:
ok single line: '1'
Test #2:
score: 0
Accepted
time: 2ms
memory: 3384kb
input:
2 1 1
output:
1 1
result:
ok 2 lines
Test #3:
score: 0
Accepted
time: 1ms
memory: 3376kb
input:
3 1 1 1
output:
1 1 1
result:
ok 3 lines
Test #4:
score: 0
Accepted
time: 7ms
memory: 3448kb
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: 3320kb
input:
1 2
output:
2
result:
ok single line: '2'
Test #6:
score: 0
Accepted
time: 0ms
memory: 3328kb
input:
2 2 2
output:
2 2
result:
ok 2 lines
Test #7:
score: 0
Accepted
time: 2ms
memory: 3432kb
input:
3 2 2 2
output:
2 2 2
result:
ok 3 lines
Test #8:
score: 0
Accepted
time: 5ms
memory: 3432kb
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: 10ms
memory: 3348kb
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: 3352kb
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 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 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 2nd lines differ - expected: '2', found: '1'
Subtask #2:
score: 0
Time Limit Exceeded
Test #29:
score: 0
Time Limit Exceeded
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:
Subtask #3:
score: 0
Skipped
Dependency #1:
0%