QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#734051 | #7880. Streak Manipulation | XiaoYang3 | WA | 3ms | 3976kb | C++23 | 1.5kb | 2024-11-10 23:26:20 | 2024-11-10 23:26:20 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<ll, int>;
const int N = 2e6 + 5;
const ll P = 1e9 + 7;
ll m, n, q, k;
// dp[i][j][2]前i个字符的4有j个mid的需要的最小值,1表示连续的
/// 0 dp[i][j][0]=dp[i][j]
string s;
bool ck(int mid) {
vector<vector<vector<int>>> dp(
n + 2, vector<vector<int>>(k + 2, vector<int>(2, 1e9)));
dp[0][0][0] = 0;
vector<int> pre(n + 2);
for (int i = 1; i <= n; i++) {
pre[i] += pre[i - 1];
if (s[i] == '1') {
pre[i]++;
}
for (int j = 0; j <= k; j++) {
dp[i][j][0] = min(dp[i - 1][j][0], dp[i - 1][j][1]);
dp[i][j][1] = min(dp[i - 1][j][1], dp[i - 1][j][0]);
if (i >= mid && j >= 1) {
dp[i][j][1] =
min(dp[i - mid][j - 1][0] + pre[i] - pre[mid], dp[i][j][1]);
}
}
}
if (dp[n][k][0] <= m || dp[n][k][1] <= m) {
return 1;
}
return 0;
}
void solve() {
cin >> n >> m >> k;
int l = 1, r = n;
cin >> s;
s = ' ' + s;
while (l <= r) {
int mid = l + r >> 1;
if (ck(mid)) {
l = mid + 1;
} else {
r = mid - 1;
}
}
cout << (l - 1 == 0 ? -1 : l - 1);
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int _ = 1;
// cin >> _;
while (_--) {
solve();
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3620kb
input:
8 3 2 10110110
output:
3
result:
ok 1 number(s): "3"
Test #2:
score: 0
Accepted
time: 0ms
memory: 3624kb
input:
12 3 3 100100010011
output:
2
result:
ok 1 number(s): "2"
Test #3:
score: 0
Accepted
time: 0ms
memory: 3616kb
input:
4 4 4 0000
output:
-1
result:
ok 1 number(s): "-1"
Test #4:
score: -100
Wrong Answer
time: 3ms
memory: 3976kb
input:
1000 200 5 0001001000101001110010011001101010110101101100010100111110111111010010001100100111100101011100011101011001110010111100100100011001010011000100011111010110100001101110101001110000001000111010000111110100111101100110011010011111000111101001010011000111010111010100101111100000100001011001010...
output:
36
result:
wrong answer 1st numbers differ - expected: '99', found: '36'