QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#279444 | #7880. Streak Manipulation | zeemanz# | WA | 5ms | 12024kb | C++20 | 1.5kb | 2023-12-08 18:57:01 | 2023-12-08 18:57:03 |
Judging History
answer
#include <bits/stdc++.h>
#define ios std::ios::sync_with_stdio(0), std::cin.tie(0)
using namespace std;
using pii = pair<int, int>;
const int N = 2e5 + 5;
int n, m, k, dp[N][10], pre[N];
string s;
bool check(int x) {
vector<pii> es;
int zeros = 0;
for (int i = 1; i <= x; i++) {
if (s[i] == '0') { zeros++; }
}
es.push_back({x, zeros});
for (int i = 2; i <= n - x + 1; i++) {
int j = i + x - 1;
if (s[i - 1] == '0') zeros--;
if (s[j] == '0') zeros++;
es.push_back({j, zeros});
}
memset(dp, 0x3f, sizeof dp);
dp[0][0] = 0;
int last = 0;
for (int i = 1; i <= n; i++) {
pre[i] = last;
if (s[i] == '0') last = i - 1;
}
for (auto &[r, w] : es) {
int l = r - x + 1;
for (int j = 1; j <= k; j++) {
dp[r][j] = min(dp[r][j], dp[pre[l]][j - 1] + w);
}
for (int j = 1; j <= k; j++) { dp[r][j] = min(dp[r - 1][j], dp[r][j]); }
}
for (int i = 1; i <= n; i++) {
if (dp[i][k] <= m) { return true; }
}
return false;
}
void solve() {
cin >> n >> m >> k;
cin >> s;
s = ' ' + s;
int l = 1, r = n;
// check(3);
while (l < r) {
int m = (l + r + 1) >> 1;
if (check(m)) l = m;
else r = m - 1;
}
if (check(l)) cout << l << "\n";
else cout << "-1\n";
}
int main() {
ios;
int T = 1;
while (T--) solve();
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 3ms
memory: 11356kb
input:
8 3 2 10110110
output:
3
result:
ok 1 number(s): "3"
Test #2:
score: 0
Accepted
time: 3ms
memory: 11260kb
input:
12 3 3 100100010011
output:
2
result:
ok 1 number(s): "2"
Test #3:
score: 0
Accepted
time: 2ms
memory: 11828kb
input:
4 4 4 0000
output:
-1
result:
ok 1 number(s): "-1"
Test #4:
score: -100
Wrong Answer
time: 5ms
memory: 12024kb
input:
1000 200 5 0001001000101001110010011001101010110101101100010100111110111111010010001100100111100101011100011101011001110010111100100100011001010011000100011111010110100001101110101001110000001000111010000111110100111101100110011010011111000111101001010011000111010111010100101111100000100001011001010...
output:
97
result:
wrong answer 1st numbers differ - expected: '99', found: '97'