QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#668815 | #7880. Streak Manipulation | nowed | WA | 1ms | 3764kb | C++23 | 1.1kb | 2024-10-23 16:06:24 | 2024-10-23 16:06:26 |
Judging History
answer
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, x, y) for (int i = x; i <= y; i++)
using namespace std;
const int N = 2e5 + 5;
int n, m, k;
string s;
int dp[N][6][2];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> m >> k;
cin >> s;
vector<int> pre(n + 1);
rep(i, 1, n) pre[i] = pre[i - 1] + (s[i - 1] == '0');
auto check = [&](int x) {
if (x == 0) return true;
rep(i, 0, n) rep(j, 0, k) dp[i][j][0] = dp[i][j][1] = 1e9;
dp[0][0][0] = 0;
rep(i, 1, n) rep(j, 0, k) {
if (i >= x && j >= 1) dp[i][j][1] = dp[i - x][j - 1][0] + pre[i] - pre[i - x];
dp[i][j][0] = min(dp[i - 1][j][0], dp[i - 1][j][1]);
}
return min(dp[n][k][0], dp[n][k][1]) <= m;
};
int l = 0, r = 2e5;
while (l < r) {
int mid = (l + r + 1) >> 1;
if (check(mid)) l = mid;
else r = mid - 1;
}
if (l) cout << l;
else cout << "-1";
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3540kb
input:
8 3 2 10110110
output:
3
result:
ok 1 number(s): "3"
Test #2:
score: 0
Accepted
time: 0ms
memory: 3596kb
input:
12 3 3 100100010011
output:
2
result:
ok 1 number(s): "2"
Test #3:
score: 0
Accepted
time: 0ms
memory: 3764kb
input:
4 4 4 0000
output:
-1
result:
ok 1 number(s): "-1"
Test #4:
score: 0
Accepted
time: 1ms
memory: 3556kb
input:
1000 200 5 0001001000101001110010011001101010110101101100010100111110111111010010001100100111100101011100011101011001110010111100100100011001010011000100011111010110100001101110101001110000001000111010000111110100111101100110011010011111000111101001010011000111010111010100101111100000100001011001010...
output:
99
result:
ok 1 number(s): "99"
Test #5:
score: 0
Accepted
time: 1ms
memory: 3584kb
input:
1000 200 5 0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...
output:
40
result:
ok 1 number(s): "40"
Test #6:
score: -100
Wrong Answer
time: 1ms
memory: 3624kb
input:
1000 200 5 1111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111...
output:
199
result:
wrong answer 1st numbers differ - expected: '-1', found: '199'