QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#129175 | #2425. The Collection Game | dong_liu | 0 | 21ms | 3788kb | C++20 | 1.5kb | 2023-07-22 04:35:47 | 2023-07-22 04:35:49 |
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: 0
Wrong Answer
time: 0ms
memory: 3756kb
input:
4 50 2 0 0 1 1 2 0 0 1 1
output:
946149565 1 2 946149565 3 4 547293220 946149565 2 3 547293220 946149565 1 2 946149565 3 4 547293220 946149565 2 3 547293220 345685428 0 1 2 3
result:
points 0.0 points 0.0 Not correct
Subtask #2:
score: 0
Wrong Answer
Test #2:
score: 0
Wrong Answer
time: 1ms
memory: 3692kb
input:
10 5000 5 0 0 0 0 0 4 1 1 1 0 5 0 0 0 0 0 4 1 1 1 0 5 0 0 0 0 0 4 1 1 1 0 5 0 0 0 0 0 4 1 1 1 0 5 0 0 0 0 0 4 1 1 1 0
output:
946149565 1 2 946149565 3 4 946149565 5 6 946149565 7 8 946149565 9 10 547293220 946149565 2 3 946149565 4 5 946149565 6 7 946149565 8 9 547293220 946149565 1 2 946149565 3 4 946149565 5 6 946149565 7 8 946149565 9 10 547293220 946149565 2 3 946149565 4 5 946149565 6 7 946149565 8 9 547293220 946149...
result:
points 0.0 points 0.0 Not correct
Subtask #3:
score: 0
Wrong Answer
Test #10:
score: 0
Wrong Answer
time: 21ms
memory: 3788kb
input:
500 1000 250 0 0 0 1 0 0 1 0 0 1 0 1 0 0 1 1 0 0 1 1 1 0 1 1 1 0 1 0 0 1 1 0 1 0 0 0 0 1 0 0 1 0 1 0 0 1 0 1 0 0 1 0 1 1 1 0 0 1 1 0 1 1 1 0 0 1 0 0 1 1 0 0 1 1 0 1 0 0 1 1 0 0 0 0 0 1 0 0 0 1 0 0 0 0 1 0 1 1 1 0 0 1 1 0 0 1 0 0 0 1 1 1 0 0 0 0 1 0 1 1 1 1 0 0 0 1 1 0 0 1 1 0 0 0 1 1 0 1 1 1 0 0 1 0...
output:
946149565 1 2 946149565 3 4 946149565 5 6 946149565 7 8 946149565 9 10 946149565 11 12 946149565 13 14 946149565 15 16 946149565 17 18 946149565 19 20 946149565 21 22 946149565 23 24 946149565 25 26 946149565 27 28 946149565 29 30 946149565 31 32 946149565 33 34 946149565 35 36 946149565 37 38 94614...
result:
points 0.0 points 0.0 Not correct
Subtask #4:
score: 0
Wrong Answer
Test #15:
score: 0
Wrong Answer
time: 0ms
memory: 3772kb
input:
10 5000 5 1 1 1 1 1 4 1 1 1 1 5 1 1 1 1 1 4 1 1 1 1 5 1 1 1 1 1 4 1 1 1 1 5 1 1 1 1 1 4 1 1 1 1 5 1 1 1 1 1 4 1 1 1 1
output:
946149565 1 2 946149565 3 4 946149565 5 6 946149565 7 8 946149565 9 10 547293220 946149565 2 3 946149565 4 5 946149565 6 7 946149565 8 9 547293220 946149565 1 2 946149565 3 4 946149565 5 6 946149565 7 8 946149565 9 10 547293220 946149565 2 3 946149565 4 5 946149565 6 7 946149565 8 9 547293220 946149...
result:
points 0.0 points 0.0 Not correct
Subtask #5:
score: 0
Skipped
Dependency #4:
0%
Subtask #6:
score: 0
Skipped
Dependency #4:
0%
Subtask #7:
score: 0
Skipped
Dependency #2:
0%
Subtask #8:
score: 0
Skipped
Dependency #4:
0%
Subtask #9:
score: 0
Skipped
Dependency #3:
0%
Subtask #10:
score: 0
Skipped
Dependency #8:
0%
Subtask #11:
score: 0
Skipped
Dependency #9:
0%
Subtask #12:
score: 0
Skipped
Dependency #10:
0%
Subtask #13:
score: 0
Skipped
Dependency #1:
0%