QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#272330 | #7880. Streak Manipulation | ucup-team1001# | WA | 1ms | 5516kb | C++20 | 1.9kb | 2023-12-02 16:55:19 | 2023-12-02 16:55:20 |
Judging History
answer
//#pragma clang diagnostic push
//#pragma ide diagnostic ignored "misc-no-recursion"
#include<bits/stdc++.h>
using namespace std;
int v[200005];
//int dp[200005];
int n;
//inline bool check(int k, int m, int start, int ans) {
// if (ans == 0)return true;
// for (int i = start; i + ans - 1 < n; ++i) {
// if (m >= v[i + ans] - v[i]) {
// if (k == 1)return true;
// if (check(k - 1, m - (v[i + ans] - v[i]), dp[i + ans] + 1, ans))return true;
// }
// }
// return false;
//};
int m, k;
string s;
long long dp[200005][6];
inline bool check(int ans) {
if (ans == 0)return true;
dp[0][1] = v[ans] - v[0];
for (int i = 1; i + ans - 1 < n; ++i) {
dp[i][1] = v[i + ans] - v[i];
}
for (int j = 2; j <= k; ++j) {
dp[0][j] = 0x3f3f3f3f;
for (int i = 1; i + ans - 1 < n; ++i) {
dp[i][j] = dp[i - 1][j];
if (s[i - 1] == '0' && i - ans - 1 >= 0) {
dp[i][j] = min(dp[i][j], dp[i - ans - 1][j - 1] + v[i + ans] - v[i]);
}
}
}
return dp[n - ans][k] <= m;
};
inline int find() {
int l = 0, r = n / k + 1;
while (l + 1 < r) {
int mid = (l + r) / 2;
if (check(mid)) {
l = mid;
} else {
r = mid;
}
}
return l;
};
int main() {
cin.tie(nullptr)->sync_with_stdio(false);
cin >> n >> m >> k;
cin >> s;
for (int i = 0; i < n; ++i) {
v[i + 1] = v[i] + (s[i] == '0');
}
// dp[n] = n;
// for (int i = n - 1; i >= 0; --i) {
// if (s[i] == '0') {
// dp[i] = i;
// } else {
// dp[i] = dp[i + 1];
// }
// }
// for(int i=0;i<n;++i){
// cout<<check(check, k, m, 0, i);
// }
int ans = find();
if (ans == 0)ans--;
cout << ans << endl;
}
//11 11 3
//00000001000
//#pragma clang diagnostic pop
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3416kb
input:
8 3 2 10110110
output:
3
result:
ok 1 number(s): "3"
Test #2:
score: 0
Accepted
time: 0ms
memory: 3536kb
input:
12 3 3 100100010011
output:
2
result:
ok 1 number(s): "2"
Test #3:
score: 0
Accepted
time: 1ms
memory: 5500kb
input:
4 4 4 0000
output:
-1
result:
ok 1 number(s): "-1"
Test #4:
score: -100
Wrong Answer
time: 1ms
memory: 5516kb
input:
1000 200 5 0001001000101001110010011001101010110101101100010100111110111111010010001100100111100101011100011101011001110010111100100100011001010011000100011111010110100001101110101001110000001000111010000111110100111101100110011010011111000111101001010011000111010111010100101111100000100001011001010...
output:
98
result:
wrong answer 1st numbers differ - expected: '99', found: '98'