problem_id stringlengths 6 6 | language stringclasses 2 values | original_status stringclasses 3 values | original_src stringlengths 19 243k | changed_src stringlengths 19 243k | change stringclasses 3 values | i1 int64 0 8.44k | i2 int64 0 8.44k | j1 int64 0 8.44k | j2 int64 0 8.44k | error stringclasses 270 values | stderr stringlengths 0 226k |
|---|---|---|---|---|---|---|---|---|---|---|---|
p03074 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int n, k, i, bi, hs = 0, max;
string s;
vector<int> w;
cin >> n >> k >> s;
if (s[0] == '0')
w.push_back(0);
i = 0;
while (i < n) {
bi = i;
while (i < n && s[i + 1] == s[i])
i++;
w.push_back(i - bi + 1);
i++;
}
if (s[n - 1] == '0')
w.push_back(0);
if (w.size() <= k * 2 + 1) {
cout << n << endl;
return 0;
}
for (i = 0; i < k * 2 + 1; i++)
hs += w[i];
max = hs;
for (i = 0; i + k * 2 + 2 < w.size(); i += 2) {
hs += w[i + k * 2 + 1] + w[i + k * 2 + 2] - w[i * 2] - w[i * 2 + 1];
if (max < hs)
max = hs;
}
cout << max << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int n, k, i, bi, hs = 0, max;
string s;
vector<int> w;
cin >> n >> k >> s;
if (s[0] == '0')
w.push_back(0);
i = 0;
while (i < n) {
bi = i;
while (i < n && s[i + 1] == s[i])
i++;
w.push_back(i - bi + 1);
i++;
}
if (s[n - 1] == '0')
w.push_back(0);
if (w.size() <= k * 2 + 1) {
cout << n << endl;
return 0;
}
for (i = 0; i < k * 2 + 1; i++)
hs += w[i];
max = hs;
for (i = 0; i + k * 2 + 2 < w.size(); i += 2) {
hs += w[i + k * 2 + 1] + w[i + k * 2 + 2] - w[i] - w[i + 1];
if (max < hs)
max = hs;
}
cout << max << endl;
return 0;
} | replace | 30 | 31 | 30 | 31 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repo(i, n) for (int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define mod 1000000007
#define pi acos(-1.0)
const ll INF = 1LL << 61;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
ll jou(ll N, ll P) {
if (P == 0)
return 1;
if (P % 2 == 0) {
ll t = jou(N, P / 2);
return t * t % mod;
}
return (N * jou(N, P - 1)) % mod;
} // jou(n,mod-2)で逆元
// intの最大値2147483647 ≒ 2×10^9
// long longの最大値9223372036854775807 ≒ 9×10^18
//'大文字'+=32; で小文字に
// cout << fixed << setprecision (20); 小数点以下2０桁まで
// 実行時間制約2秒では２×10^8回くらいまで計算できる
int main() {
int n, k;
string s;
cin >> n >> k >> s;
bool stz = false;
bool goz = false;
vector<int> p = {};
rep(i, n) {
if (i == 0 && s[i] == '0')
stz = true;
if (i == 0 && s[i] == '1')
p.pb(i);
if (i - 1 >= 0 && s[i - 1] == '0' && s[i] == '1')
p.pb(i);
if (i + 1 < n && s[i] == '1' && s[i + 1] == '0')
p.pb(i);
if (i == n - 1 && s[i] == '1')
p.pb(i);
if (i == n - 1 && s[i] == '0')
goz = true;
}
int m = p.size();
if (m == 0) {
cout << n << endl;
return 0;
}
int zr = m / 2 - 1;
if (stz)
zr++;
if (goz)
zr++;
if (zr <= k) {
cout << n << endl;
return 0;
}
int ans = 0;
if (stz)
ans = max(ans, p[2 * k - 1] + 1);
if (goz)
ans = max(ans, n - 1 - p[m - 2 * k] + 1);
rep(i, m) {
if (2 * i + 2 * k + 1 >= n)
break;
ans = max(ans, p[2 * i + 2 * k + 1] - p[2 * i] + 1);
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repo(i, n) for (int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define mod 1000000007
#define pi acos(-1.0)
const ll INF = 1LL << 61;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
ll jou(ll N, ll P) {
if (P == 0)
return 1;
if (P % 2 == 0) {
ll t = jou(N, P / 2);
return t * t % mod;
}
return (N * jou(N, P - 1)) % mod;
} // jou(n,mod-2)で逆元
// intの最大値2147483647 ≒ 2×10^9
// long longの最大値9223372036854775807 ≒ 9×10^18
//'大文字'+=32; で小文字に
// cout << fixed << setprecision (20); 小数点以下2０桁まで
// 実行時間制約2秒では２×10^8回くらいまで計算できる
int main() {
int n, k;
string s;
cin >> n >> k >> s;
bool stz = false;
bool goz = false;
vector<int> p = {};
rep(i, n) {
if (i == 0 && s[i] == '0')
stz = true;
if (i == 0 && s[i] == '1')
p.pb(i);
if (i - 1 >= 0 && s[i - 1] == '0' && s[i] == '1')
p.pb(i);
if (i + 1 < n && s[i] == '1' && s[i + 1] == '0')
p.pb(i);
if (i == n - 1 && s[i] == '1')
p.pb(i);
if (i == n - 1 && s[i] == '0')
goz = true;
}
int m = p.size();
if (m == 0) {
cout << n << endl;
return 0;
}
int zr = m / 2 - 1;
if (stz)
zr++;
if (goz)
zr++;
if (zr <= k) {
cout << n << endl;
return 0;
}
int ans = 0;
if (stz)
ans = max(ans, p[2 * k - 1] + 1);
if (goz)
ans = max(ans, n - 1 - p[m - 2 * k] + 1);
rep(i, m) {
if (2 * i + 2 * k + 1 >= m)
break;
ans = max(ans, p[2 * i + 2 * k + 1] - p[2 * i] + 1);
}
cout << ans << endl;
}
| replace | 79 | 80 | 79 | 80 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define INF 999999999999999999
#define rep(i, m, n) for (lli i = m; i < n; i++)
#define rrep(i, m, n) for (lli i = m - 1; i >= n; i--)
#define pb(n) push_back(n)
#define UE(N) N.erase(unique(N.begin(), N.end()), N.end());
#define Sort(n) sort(n.begin(), n.end())
#define Rev(n) reverse(n.begin(), n.end())
#define Out(S) cout << S << endl
#define NeOut(S) cout << S
#define HpOut(S) cout << setprecision(25) << S << endl
#define Vec(K, L, N, S) vector<L> K(N, S)
#define DV(K, L, N, M, S) vector<vector<L>> K(N, vector<L>(M, S))
#define TV(K, L, N, M, R, S) \
vector<vector<vector<L>>> K(N, vector<vector<L>>(M, vector<L>(R, S)))
#define pint pair<lli, lli>
#define paf(L, R) pair<L, R>
#define mod 1000000007
#define MAX 51000000
#define ALL(a) a.begin(), a.end()
#define chmax(a, b) a = (((a) < (b)) ? (b) : (a))
#define chmin(a, b) a = (((a) > (b)) ? (b) : (a))
int main() {
lli A, B, C, D, E, F, N, M, K, L, X, Y, Z, H, W, sum = 0, num = 0, flag = 0;
string S, T;
cin >> N >> K >> S;
Vec(P, lli, 1, 0);
if (S[0] == '1')
flag = 1;
else {
P.pb(0);
num++;
}
rep(i, 0, N) {
if (flag) {
if (S[i] == '1')
P[num]++;
else {
flag = 0;
num++;
P.pb(0);
P[num]++;
}
} else {
if (S[i] == '0')
P[num]++;
else {
flag = 1;
num++;
P.pb(0);
P[num]++;
}
}
}
M = P.size();
Vec(Q, lli, M, 0);
Q[0] = P[0];
rep(i, 1, M) Q[i] = P[i] + Q[i - 1];
if (2 * K < M)
sum = Q[2 * K];
else
sum = Q[M - 1];
int l = 1;
int r = 2 * K + 2;
while (l < r && r < M) {
sum = max(sum, Q[r] - Q[l]);
// cout << l << " " << r << endl;
l += 2;
r += 2;
if (r > M - 1)
r = M - 1;
// Out(sum);
}
sum = max(sum, Q[M - 1] - Q[M - 1 - 2 * K]);
Out(sum);
}
| #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define INF 999999999999999999
#define rep(i, m, n) for (lli i = m; i < n; i++)
#define rrep(i, m, n) for (lli i = m - 1; i >= n; i--)
#define pb(n) push_back(n)
#define UE(N) N.erase(unique(N.begin(), N.end()), N.end());
#define Sort(n) sort(n.begin(), n.end())
#define Rev(n) reverse(n.begin(), n.end())
#define Out(S) cout << S << endl
#define NeOut(S) cout << S
#define HpOut(S) cout << setprecision(25) << S << endl
#define Vec(K, L, N, S) vector<L> K(N, S)
#define DV(K, L, N, M, S) vector<vector<L>> K(N, vector<L>(M, S))
#define TV(K, L, N, M, R, S) \
vector<vector<vector<L>>> K(N, vector<vector<L>>(M, vector<L>(R, S)))
#define pint pair<lli, lli>
#define paf(L, R) pair<L, R>
#define mod 1000000007
#define MAX 51000000
#define ALL(a) a.begin(), a.end()
#define chmax(a, b) a = (((a) < (b)) ? (b) : (a))
#define chmin(a, b) a = (((a) > (b)) ? (b) : (a))
int main() {
lli A, B, C, D, E, F, N, M, K, L, X, Y, Z, H, W, sum = 0, num = 0, flag = 0;
string S, T;
cin >> N >> K >> S;
Vec(P, lli, 1, 0);
if (S[0] == '1')
flag = 1;
else {
P.pb(0);
num++;
}
rep(i, 0, N) {
if (flag) {
if (S[i] == '1')
P[num]++;
else {
flag = 0;
num++;
P.pb(0);
P[num]++;
}
} else {
if (S[i] == '0')
P[num]++;
else {
flag = 1;
num++;
P.pb(0);
P[num]++;
}
}
}
M = P.size();
Vec(Q, lli, M, 0);
Q[0] = P[0];
rep(i, 1, M) Q[i] = P[i] + Q[i - 1];
if (2 * K < M)
sum = Q[2 * K];
else
sum = Q[M - 1];
int l = 1;
int r = 2 * K + 2;
while (l < r && r < M) {
sum = max(sum, Q[r] - Q[l]);
// cout << l << " " << r << endl;
l += 2;
r += 2;
if (r > M - 1)
r = M - 1;
// Out(sum);
}
if (2 * K < M)
sum = max(sum, Q[M - 1] - Q[M - 1 - 2 * K]);
Out(sum);
}
| replace | 76 | 77 | 76 | 78 | 0 | |
p03074 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> Nums;
int now = 1;
int cnt = 0;
for (int i = 0; i < n; i++) {
if (s[i] == (char)('0' + now)) {
cnt++;
} else {
Nums.push_back(cnt);
now = 1 - now;
cnt = 1;
}
}
if (cnt != 0) {
Nums.push_back(cnt);
}
if (Nums.size() % 2 == 0) {
Nums.push_back(0);
}
vector<int> cum(Nums.size() + 1);
for (int i = 0; i < (int)cum.size(); i++) {
cum[i + 1] = cum[i] + Nums[i];
}
// 1 0 1 0 1 0 1
// 0 1 3 5 8 10 14
int Add = 2 * k + 1;
int ans = 0;
for (int i = 0; i < (int)Nums.size(); i += 2) {
int left = i;
int right = min(i + Add, (int)Nums.size());
int tmp = cum[right] - cum[left];
ans = max(tmp, ans);
}
cout << ans;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> Nums;
int now = 1;
int cnt = 0;
for (int i = 0; i < n; i++) {
if (s[i] == (char)('0' + now)) {
cnt++;
} else {
Nums.push_back(cnt);
now = 1 - now;
cnt = 1;
}
}
if (cnt != 0) {
Nums.push_back(cnt);
}
if (Nums.size() % 2 == 0) {
Nums.push_back(0);
}
vector<int> cum(Nums.size() + 1);
for (int i = 0; i < (int)Nums.size(); i++) {
cum[i + 1] = cum[i] + Nums[i];
}
// 1 0 1 0 1 0 1
// 0 1 3 5 8 10 14
int Add = 2 * k + 1;
int ans = 0;
for (int i = 0; i < (int)Nums.size(); i += 2) {
int left = i;
int right = min(i + Add, (int)Nums.size());
int tmp = cum[right] - cum[left];
ans = max(tmp, ans);
}
cout << ans;
return 0;
}
| replace | 31 | 32 | 31 | 32 | 0 | |
p03074 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
#include <vector>
int main(void) {
int tmp, n, k;
char s[100001];
std::vector<int> v0;
std::vector<int> v1;
scanf("%d %d\n", &n, &k);
scanf("%s", s);
char *tmp1, *tmp2;
int m = 0;
tmp1 = s;
v1.push_back(0);
while (*tmp1 != '\0') {
tmp2 = tmp1;
tmp1 += strspn(tmp1, "0");
tmp = tmp1 - tmp2;
v0.push_back(tmp);
tmp2 = tmp1;
tmp1 += strspn(tmp1, "1");
tmp = tmp1 - tmp2;
v1.push_back(tmp);
m++;
}
tmp = v1[0];
int i = 0;
for (; i < k; i++) {
tmp += v0[i] + v1[i + 1];
}
int ans = tmp;
for (; i < m; i++) {
tmp = tmp - v0[i - k] - v1[i - k] + v0[i] + v1[i + 1];
if (tmp > ans)
ans = tmp;
}
printf("%d\n", ans);
return 0;
}
| #include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
#include <vector>
int main(void) {
int tmp, n, k;
char s[100001];
std::vector<int> v0;
std::vector<int> v1;
scanf("%d %d\n", &n, &k);
scanf("%s", s);
char *tmp1, *tmp2;
int m = 0;
tmp1 = s;
v1.push_back(0);
while (*tmp1 != '\0') {
tmp2 = tmp1;
tmp1 += strspn(tmp1, "0");
tmp = tmp1 - tmp2;
v0.push_back(tmp);
tmp2 = tmp1;
tmp1 += strspn(tmp1, "1");
tmp = tmp1 - tmp2;
v1.push_back(tmp);
m++;
}
tmp = v1[0];
int i = 0;
for (; i < std::min(k, m); i++) {
tmp += v0[i] + v1[i + 1];
}
int ans = tmp;
for (; i < m; i++) {
tmp = tmp - v0[i - k] - v1[i - k] + v0[i] + v1[i + 1];
if (tmp > ans)
ans = tmp;
}
printf("%d\n", ans);
return 0;
}
| replace | 35 | 36 | 35 | 36 | 0 | |
p03074 | C++ | Runtime Error | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> cum_sum;
cum_sum.push_back(0);
int counter = 0;
char tmp_char = S[0];
if (tmp_char == '0')
cum_sum.push_back(0);
for (int i = 0; i < N; i++) {
if (tmp_char == S[i]) {
counter++;
if (i == (N - 1))
cum_sum.push_back(cum_sum.back() + counter);
} else {
cum_sum.push_back(cum_sum.back() + counter);
counter = 1;
tmp_char = S[i];
if (i == (N - 1))
cum_sum.push_back(cum_sum.back() + 1);
// cout << S[i] << endl;
}
// cout << cum_sum.back() << endl;
}
if (S[N - 1] == '0')
cum_sum.push_back(cum_sum.back());
// for (int i = 0; i != cum_sum.size(); ++i) {
// cout << cum_sum[i] << endl;
// }
int max_1 = 0;
counter = 0;
if (K == 0) {
for (int i = 0; i < N; i++) {
if (S[i] == '1')
counter++;
else {
max_1 = max(max_1, counter);
counter = 0;
}
}
max_1 = max(max_1, counter);
cout << max_1 << endl;
return 0;
}
int ans = 1;
for (int i = 0; i + (2 * K + 1) < cum_sum.size(); i = (i + 2)) {
ans = max(ans, cum_sum[(2 * K + 1) + i] - cum_sum[i]);
}
for (int i = cum_sum.size(); i - (2 * K + 1) < 0; i = (i - 2)) {
ans = max(ans, cum_sum[i] - cum_sum[i - (2 * K + 1)]);
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> cum_sum;
cum_sum.push_back(0);
int counter = 0;
char tmp_char = S[0];
if (tmp_char == '0')
cum_sum.push_back(0);
for (int i = 0; i < N; i++) {
if (tmp_char == S[i]) {
counter++;
if (i == (N - 1))
cum_sum.push_back(cum_sum.back() + counter);
} else {
cum_sum.push_back(cum_sum.back() + counter);
counter = 1;
tmp_char = S[i];
if (i == (N - 1))
cum_sum.push_back(cum_sum.back() + 1);
// cout << S[i] << endl;
}
// cout << cum_sum.back() << endl;
}
if (S[N - 1] == '0')
cum_sum.push_back(cum_sum.back());
// for (int i = 0; i != cum_sum.size(); ++i) {
// cout << cum_sum[i] << endl;
// }
int max_1 = 0;
counter = 0;
if (K == 0) {
for (int i = 0; i < N; i++) {
if (S[i] == '1')
counter++;
else {
max_1 = max(max_1, counter);
counter = 0;
}
}
max_1 = max(max_1, counter);
cout << max_1 << endl;
return 0;
}
int ans = 1;
int ind = 0;
for (int i = 0; i < cum_sum.size(); i += 2) {
ind = min((2 * K + 1) + i, int(cum_sum.size()) - 1);
ans = max(ans, cum_sum[ind] - cum_sum[i]);
}
cout << ans << endl;
return 0;
} | replace | 62 | 67 | 62 | 66 | 0 | |
p03074 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, k;
int ans = 0;
int block[100000] = {0};
string str;
cin >> n >> k;
cin >> str;
int pattern = 1;
int cnt = 0;
int index = 0;
for (int i = 0; i < (int)str.size(); i++) {
switch (pattern) {
case 1:
if (str[i] == '0') {
block[index] = cnt;
index++;
cnt = 1;
pattern = 0;
} else {
cnt++;
}
break;
case 0:
if (str[i] == '1') {
block[index] = cnt;
index++;
cnt = 1;
pattern = 1;
} else {
cnt++;
}
break;
}
}
block[index] = cnt;
int black = 0;
int white = 0;
for (int i = 0; i < k + 1; i++) {
black += block[i * 2];
}
for (int i = 0; i < k; i++) {
white += block[i * 2 + 1];
}
int lblack = 0, rblack = k * 2;
int lwhite = 1, rwhite = k * 2 - 1;
ans = max(ans, black + white);
while (rblack <= index) {
black += block[rblack + 2];
black -= block[lblack];
white += block[rwhite + 2];
white -= block[lwhite];
ans = max(ans, black + white);
rblack += 2;
lblack += 2;
rwhite += 2;
lwhite += 2;
}
cout << ans << endl;
return (0);
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, k;
int ans = 0;
int block[1000005] = {0};
string str;
cin >> n >> k;
cin >> str;
int pattern = 1;
int cnt = 0;
int index = 0;
for (int i = 0; i < (int)str.size(); i++) {
switch (pattern) {
case 1:
if (str[i] == '0') {
block[index] = cnt;
index++;
cnt = 1;
pattern = 0;
} else {
cnt++;
}
break;
case 0:
if (str[i] == '1') {
block[index] = cnt;
index++;
cnt = 1;
pattern = 1;
} else {
cnt++;
}
break;
}
}
block[index] = cnt;
int black = 0;
int white = 0;
for (int i = 0; i < k + 1; i++) {
black += block[i * 2];
}
for (int i = 0; i < k; i++) {
white += block[i * 2 + 1];
}
int lblack = 0, rblack = k * 2;
int lwhite = 1, rwhite = k * 2 - 1;
ans = max(ans, black + white);
while (rblack <= index) {
black += block[rblack + 2];
black -= block[lblack];
white += block[rwhite + 2];
white -= block[lwhite];
ans = max(ans, black + white);
rblack += 2;
lblack += 2;
rwhite += 2;
lwhite += 2;
}
cout << ans << endl;
return (0);
} | replace | 7 | 8 | 7 | 8 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string s;
cin >> s;
vector<int> num;
if (s[0] == '0')
num.push_back(0);
for (int left = 0; left < N;) {
int right = left;
while (right < N && s[right] == s[left]) {
right++;
}
num.push_back(right - left);
left = right;
} // 連続した数を尺取りで記録
if (s.back() == '1')
s.push_back('0');
vector<int> sum(num.size() + 1, 0);
for (int i = 0; i <= num.size(); i++) {
sum[i + 1] = sum[i] + num[i];
} // 累積和
/*
for(int i=0;i<sum.size();i++){
cout << sum[i] << endl;
}
*/
int ans = 0;
for (int left = 0; left < sum.size(); left += 2) {
int right = left + 2 * K + 1;
// cout << right << endl;
if (right >= sum.size())
right = sum.size() - 1;
ans = max(ans, sum[right] - sum[left]);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string s;
cin >> s;
vector<int> num;
if (s[0] == '0')
num.push_back(0);
for (int left = 0; left < N;) {
int right = left;
while (right < N && s[right] == s[left]) {
right++;
}
num.push_back(right - left);
left = right;
} // 連続した数を尺取りで記録
if (s.back() == '1')
s.push_back('0');
vector<int> sum(num.size() + 1, 0);
for (int i = 0; i < num.size(); i++) {
sum[i + 1] = sum[i] + num[i];
} // 累積和
/*
for(int i=0;i<sum.size();i++){
cout << sum[i] << endl;
}
*/
int ans = 0;
for (int left = 0; left < sum.size(); left += 2) {
int right = left + 2 * K + 1;
// cout << right << endl;
if (right >= sum.size())
right = sum.size() - 1;
ans = max(ans, sum[right] - sum[left]);
}
cout << ans << endl;
} | replace | 24 | 25 | 24 | 25 | 0 | |
p03074 | C++ | Runtime Error | #include <iostream>
#include <numeric>
#include <vector>
using namespace std;
static const int N = 100000;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
string s;
cin >> n >> k;
cin >> s;
vector<int> v(100100);
int vidx = 2;
for (int i = 0; i < n; i++) {
if (s[i] - '0' == vidx % 2) {
v[vidx]++;
} else {
vidx++;
v[vidx]++;
}
}
int maxlen = -1;
for (int i = 1; i < vidx + 10; i += 2) {
int nowlen = 0;
for (int j = 0; j < k * 2 + 1; j++) {
nowlen += v[i + j];
}
maxlen = max(nowlen, maxlen);
}
cout << maxlen << endl;
return 0;
}
| #include <iostream>
#include <numeric>
#include <vector>
using namespace std;
static const int N = 100000;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
string s;
cin >> n >> k;
cin >> s;
vector<int> v(2 * N);
int vidx = 2;
for (int i = 0; i < n; i++) {
if (s[i] - '0' == vidx % 2) {
v[vidx]++;
} else {
vidx++;
v[vidx]++;
}
}
int maxlen = -1;
for (int i = 1; i < vidx + 10; i += 2) {
int nowlen = 0;
for (int j = 0; j < k * 2 + 1; j++) {
nowlen += v[i + j];
}
maxlen = max(nowlen, maxlen);
}
cout << maxlen << endl;
return 0;
}
| replace | 17 | 18 | 17 | 18 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<pair<char, int>> HF;
char now = S[0];
int count = 1;
for (int i = 1; i < N; i++) {
char pre = now;
now = S[i];
if (pre == now)
count++;
else {
HF.push_back(make_pair(pre, count));
count = 1;
}
}
HF.push_back(make_pair(S[N - 1], count));
// for(int i = 0; i < HF.size(); i++){
// std::cout << i << ": (" << HF.at(i).first << ", " << HF.at(i).second <<
// ")"<< std::endl;
// }
// std::cout << "HF.size() " << HF.size() << std::endl;
// std::cout << "HF.size()-2*K " << HF.size()-2*K << std::endl;
int ans = 0;
bool check = true;
for (int i = 0; i <= HF.size() - 2 * K + 1; i++) {
// std::cout << "i: "<< i << std::endl;
check = false;
int temp = 0;
if (HF.at(i).first == '1') {
temp += HF.at(i).second;
i++;
// std::cout <<"HF.size()-2*K+1 " << HF.size()-2*K+1 << std::endl;
if (i + 2 * K > HF.size() + 1) {
ans = max(ans, temp);
break;
}
};
for (int j = i; j < 2 * K - 1 + i; j++) {
// std::cout << "j: " << j << std::endl;
temp += HF.at(j).second;
}
if (2 * K - 1 + i < HF.size())
temp += HF.at(2 * K - 1 + i).second;
ans = max(ans, temp);
}
if (check) {
for (int i = 0; i < HF.size(); i++)
ans += HF.at(i).second;
}
std::cout << ans << std::endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<pair<char, int>> HF;
char now = S[0];
int count = 1;
for (int i = 1; i < N; i++) {
char pre = now;
now = S[i];
if (pre == now)
count++;
else {
HF.push_back(make_pair(pre, count));
count = 1;
}
}
HF.push_back(make_pair(S[N - 1], count));
// for(int i = 0; i < HF.size(); i++){
// std::cout << i << ": (" << HF.at(i).first << ", " << HF.at(i).second <<
// ")"<< std::endl;
// }
// std::cout << "HF.size() " << HF.size() << std::endl;
// std::cout << "HF.size()-2*K " << HF.size()-2*K << std::endl;
int ans = 0;
bool check = true;
for (int i = 0; i + 2 * K <= HF.size() + 1; i++) {
// std::cout << "i: "<< i << std::endl;
check = false;
int temp = 0;
if (HF.at(i).first == '1') {
temp += HF.at(i).second;
i++;
// std::cout <<"HF.size()-2*K+1 " << HF.size()-2*K+1 << std::endl;
if (i + 2 * K > HF.size() + 1) {
ans = max(ans, temp);
break;
}
};
for (int j = i; j < 2 * K - 1 + i; j++) {
// std::cout << "j: " << j << std::endl;
temp += HF.at(j).second;
}
if (2 * K - 1 + i < HF.size())
temp += HF.at(2 * K - 1 + i).second;
ans = max(ans, temp);
}
if (check) {
for (int i = 0; i < HF.size(); i++)
ans += HF.at(i).second;
}
std::cout << ans << std::endl;
} | replace | 31 | 32 | 31 | 32 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define MEM(a, b) memset(a, (b), sizeof(a))
#define FORN(i, a, n) for (int i = a; i < n; i++)
#define FRON(i, a, n) for (int i = a; i > n; i--)
#define FOR(i, n) for (int i = 0; i < n; i++)
#define FRO(i, a) for (int i = a; i > -1; i--)
#define mp make_pair
#define pb push_back
#define INF 1000000010
#define MOD 1000000007 // 998244353
#define PI 3.141592653589793238462643383279502884197169399375105820974945
#define FASTIO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
typedef long long ll;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef vector<string> vs;
typedef vector<vi> vii;
// debugging output in cerr
#define n_l '\n'
#define debug(...) \
cerr << "[" << #__VA_ARGS__ << "]: "; \
cerr << to_string(__VA_ARGS__) << endl
template <typename T, size_t N> int SIZE(const T (&t)[N]) { return N; }
template <typename T> int SIZE(const T &t) { return t.size(); }
string to_string(const string s, int x1 = 0, int x2 = 1e9) {
return '"' + ((x1 < s.size()) ? s.substr(x1, x2 - x1 + 1) : "") + '"';
}
string to_string(const char *s) { return to_string((string)s); }
string to_string(const bool b) { return (b ? "true" : "false"); }
string to_string(const char c) { return string({c}); }
template <size_t N>
string to_string(const bitset<N> &b, int x1 = 0, int x2 = 1e9) {
string t = "";
for (int __iii__ = min(x1, SIZE(b)), __jjj__ = min(x2, SIZE(b) - 1);
__iii__ <= __jjj__; ++__iii__) {
t += b[__iii__] + '0';
}
return '"' + t + '"';
}
template <typename A, typename... C>
string to_string(const A(&v), int x1 = 0, int x2 = 1e9, C... coords);
int l_v_l_v_l = 0, t_a_b_s = 0;
template <typename A, typename B> string to_string(const pair<A, B> &p) {
l_v_l_v_l++;
string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
l_v_l_v_l--;
return res;
}
template <typename A, typename... C>
string to_string(const A(&v), int x1, int x2, C... coords) {
int rnk = rank<A>::value;
string tab(t_a_b_s, ' ');
string res = "";
bool first = true;
if (l_v_l_v_l == 0)
res += n_l;
res += tab + "[";
x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v));
auto l = begin(v);
advance(l, x1);
auto r = l;
advance(r, (x2 - x1) + (x2 < SIZE(v)));
for (auto e = l; e != r; e = next(e)) {
if (!first) {
res += ", ";
}
first = false;
l_v_l_v_l++;
if (e != l) {
if (rnk > 1) {
res += n_l;
t_a_b_s = l_v_l_v_l;
};
} else {
t_a_b_s = 0;
}
res += to_string(*e, coords...);
l_v_l_v_l--;
}
res += "]";
if (l_v_l_v_l == 0)
res += n_l;
return res;
}
void debugm() { ; }
template <typename Heads, typename... Tails> void debugm(Heads H, Tails... T) {
cerr << to_string(H) << " | ";
debugm(T...);
}
#define debugm(...) \
cerr << "[" << #__VA_ARGS__ << "]: "; \
debugm(__VA_ARGS__); \
cerr << endl
double round(double num, int dec) {
return std::round(num * pow(10, dec)) / pow(10, dec);
}
vector<string> split(string s, char delim) {
replace(s.begin(), s.end(), delim, ' ');
stringstream ss(s);
string buf;
vector<string> v;
while (ss >> buf)
v.push_back(buf);
return v;
}
template <typename T, int size> int siz(T (&)[size]) { return size; }
long long POW(long long base, long long exp) {
long long res = 1;
while (exp > 0) {
if (exp % 2 == 1) {
res = (res * base) % MOD;
}
exp = exp >> 1;
base = (base * base) % MOD;
}
return res;
}
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
if (n == 1) {
cout << 1;
return 0;
}
vi zero;
vi one;
bool end = false;
if (s[0] == '0' && s[n - 1] == '0') {
one.pb(0);
end = true;
} else if (s[0] == '0' && s[n - 1] == '1') {
one.pb(0);
} else if (s[0] == '1' && s[n - 1] == '0') {
end = true;
}
int count = 1;
for (int i = 1; i < n; i++) {
if (s[i] != s[i - 1]) {
if (s[i - 1] == '0') {
zero.pb(count);
} else {
one.pb(count);
}
count = 0;
}
count++;
}
if (s[n - 1] == '0') {
zero.pb(count);
} else {
one.pb(count);
}
if (end) {
one.pb(0);
}
debug(zero);
debug(one);
int temp = 0;
// zero sliding window
for (int i = 0; i < k; i++) {
temp += zero[i];
}
// ones sliding window
for (int i = 0; i < k + 1; i++) {
temp += one[i];
}
int ans = 0;
ans = max(temp, ans);
// continue window
for (int i = k; i < zero.size(); i++) {
temp -= zero[i - k];
temp += zero[i];
temp -= one[i - k];
temp += one[i + 1];
ans = max(temp, ans);
debug(temp);
}
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
#define MEM(a, b) memset(a, (b), sizeof(a))
#define FORN(i, a, n) for (int i = a; i < n; i++)
#define FRON(i, a, n) for (int i = a; i > n; i--)
#define FOR(i, n) for (int i = 0; i < n; i++)
#define FRO(i, a) for (int i = a; i > -1; i--)
#define mp make_pair
#define pb push_back
#define INF 1000000010
#define MOD 1000000007 // 998244353
#define PI 3.141592653589793238462643383279502884197169399375105820974945
#define FASTIO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
typedef long long ll;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef vector<string> vs;
typedef vector<vi> vii;
// debugging output in cerr
#define n_l '\n'
#define debug(...) \
cerr << "[" << #__VA_ARGS__ << "]: "; \
cerr << to_string(__VA_ARGS__) << endl
template <typename T, size_t N> int SIZE(const T (&t)[N]) { return N; }
template <typename T> int SIZE(const T &t) { return t.size(); }
string to_string(const string s, int x1 = 0, int x2 = 1e9) {
return '"' + ((x1 < s.size()) ? s.substr(x1, x2 - x1 + 1) : "") + '"';
}
string to_string(const char *s) { return to_string((string)s); }
string to_string(const bool b) { return (b ? "true" : "false"); }
string to_string(const char c) { return string({c}); }
template <size_t N>
string to_string(const bitset<N> &b, int x1 = 0, int x2 = 1e9) {
string t = "";
for (int __iii__ = min(x1, SIZE(b)), __jjj__ = min(x2, SIZE(b) - 1);
__iii__ <= __jjj__; ++__iii__) {
t += b[__iii__] + '0';
}
return '"' + t + '"';
}
template <typename A, typename... C>
string to_string(const A(&v), int x1 = 0, int x2 = 1e9, C... coords);
int l_v_l_v_l = 0, t_a_b_s = 0;
template <typename A, typename B> string to_string(const pair<A, B> &p) {
l_v_l_v_l++;
string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
l_v_l_v_l--;
return res;
}
template <typename A, typename... C>
string to_string(const A(&v), int x1, int x2, C... coords) {
int rnk = rank<A>::value;
string tab(t_a_b_s, ' ');
string res = "";
bool first = true;
if (l_v_l_v_l == 0)
res += n_l;
res += tab + "[";
x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v));
auto l = begin(v);
advance(l, x1);
auto r = l;
advance(r, (x2 - x1) + (x2 < SIZE(v)));
for (auto e = l; e != r; e = next(e)) {
if (!first) {
res += ", ";
}
first = false;
l_v_l_v_l++;
if (e != l) {
if (rnk > 1) {
res += n_l;
t_a_b_s = l_v_l_v_l;
};
} else {
t_a_b_s = 0;
}
res += to_string(*e, coords...);
l_v_l_v_l--;
}
res += "]";
if (l_v_l_v_l == 0)
res += n_l;
return res;
}
void debugm() { ; }
template <typename Heads, typename... Tails> void debugm(Heads H, Tails... T) {
cerr << to_string(H) << " | ";
debugm(T...);
}
#define debugm(...) \
cerr << "[" << #__VA_ARGS__ << "]: "; \
debugm(__VA_ARGS__); \
cerr << endl
double round(double num, int dec) {
return std::round(num * pow(10, dec)) / pow(10, dec);
}
vector<string> split(string s, char delim) {
replace(s.begin(), s.end(), delim, ' ');
stringstream ss(s);
string buf;
vector<string> v;
while (ss >> buf)
v.push_back(buf);
return v;
}
template <typename T, int size> int siz(T (&)[size]) { return size; }
long long POW(long long base, long long exp) {
long long res = 1;
while (exp > 0) {
if (exp % 2 == 1) {
res = (res * base) % MOD;
}
exp = exp >> 1;
base = (base * base) % MOD;
}
return res;
}
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
if (n == 1) {
cout << 1;
return 0;
}
vi zero;
vi one;
bool end = false;
if (s[0] == '0' && s[n - 1] == '0') {
one.pb(0);
end = true;
} else if (s[0] == '0' && s[n - 1] == '1') {
one.pb(0);
} else if (s[0] == '1' && s[n - 1] == '0') {
end = true;
}
int count = 1;
for (int i = 1; i < n; i++) {
if (s[i] != s[i - 1]) {
if (s[i - 1] == '0') {
zero.pb(count);
} else {
one.pb(count);
}
count = 0;
}
count++;
}
if (s[n - 1] == '0') {
zero.pb(count);
} else {
one.pb(count);
}
if (end) {
one.pb(0);
}
debug(zero);
debug(one);
int len = zero.size();
k = min(k, len);
int temp = 0;
// zero sliding window
for (int i = 0; i < k; i++) {
temp += zero[i];
}
// ones sliding window
for (int i = 0; i < k + 1; i++) {
temp += one[i];
}
int ans = 0;
ans = max(temp, ans);
// continue window
for (int i = k; i < zero.size(); i++) {
temp -= zero[i - k];
temp += zero[i];
temp -= one[i - k];
temp += one[i + 1];
ans = max(temp, ans);
debug(temp);
}
cout << ans;
} | insert | 167 | 167 | 167 | 169 | 0 | [zero]:
[3, 1]
[one]:
[0, 1, 0]
[temp]: 2
|
p03074 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string s;
cin >> s;
int c = 1;
int acc = 0;
vector<int> r;
for (int i = 0; i < N; ++i) {
if (s[i] == '0' + c) {
++acc;
if (i == N - 1)
r.push_back(acc);
} else {
c = 1 - c;
r.push_back(acc);
acc = 1;
}
}
if (r.size() % 2 == 0)
r.push_back(0);
int count = 0;
for (int i = 0; i < K; i++) {
count += r[i * 2] + r[i * 2 + 1];
}
count += r[2 * K];
int m = count;
for (int i = 0; 2 * (i + K) < r.size() - 2; ++i) {
count = count + r[2 * (i + K) + 1] + r[2 * (i + K) + 2] - r[2 * i] -
r[2 * i + 1];
if (count > m)
m = count;
}
cout << m << endl;
}
| #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string s;
cin >> s;
int c = 1;
int acc = 0;
vector<int> r;
for (int i = 0; i < N; ++i) {
if (s[i] == '0' + c) {
++acc;
if (i == N - 1)
r.push_back(acc);
} else {
c = 1 - c;
r.push_back(acc);
acc = 1;
}
}
if (r.size() % 2 == 0)
r.push_back(0);
if (K >= (r.size() - 1) / 2) {
int count = 0;
for (auto e : r) {
count += e;
}
cout << count << endl;
return 0;
}
int count = 0;
for (int i = 0; i < K; i++) {
count += r[i * 2] + r[i * 2 + 1];
}
count += r[2 * K];
int m = count;
for (int i = 0; 2 * (i + K) < r.size() - 2; ++i) {
count = count + r[2 * (i + K) + 1] + r[2 * (i + K) + 2] - r[2 * i] -
r[2 * i + 1];
if (count > m)
m = count;
}
cout << m << endl;
}
| insert | 28 | 28 | 28 | 37 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vvvi = vector<vector<vector<int>>>;
using mii = map<int, int>;
using msi = map<string, int>;
using pii = pair<int, int>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
string s;
cin >> s;
vi v;
// 1, 0, ... , 1の数を記録する
if (s[0] == '0')
v.push_back(0);
REP(i, s.size()) {
int j = i;
while (j < s.size() && s[i] == s[j])
++j; // 同じ数を圧縮するため数える
v.push_back(j - i);
i = j - 1;
}
if (s.back() == '0')
v.push_back(0);
vi sums((int)v.size() + 1, 0);
REP(i, v.size() + 1)
sums[i + 1] = sums[i] + v[i]; // sum[0] が 0 だと端を特別扱いしなくて良い．
int ans = 0;
for (int left = 0; left < sums.size(); left += 2) {
int right = left + 2 * k + 1;
if (right >= sums.size())
right = (int)sums.size() - 1;
ans = max(ans, sums[right] - sums[left]);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vvvi = vector<vector<vector<int>>>;
using mii = map<int, int>;
using msi = map<string, int>;
using pii = pair<int, int>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
string s;
cin >> s;
vi v;
// 1, 0, ... , 1の数を記録する
if (s[0] == '0')
v.push_back(0);
REP(i, s.size()) {
int j = i;
while (j < s.size() && s[i] == s[j])
++j; // 同じ数を圧縮するため数える
v.push_back(j - i);
i = j - 1;
}
if (s.back() == '0')
v.push_back(0);
vi sums((int)v.size() + 1, 0);
REP(i, v.size())
sums[i + 1] = sums[i] + v[i]; // sum[0] が 0 だと端を特別扱いしなくて良い．
int ans = 0;
for (int left = 0; left < sums.size(); left += 2) {
int right = left + 2 * k + 1;
if (right >= sums.size())
right = (int)sums.size() - 1;
ans = max(ans, sums[right] - sums[left]);
}
cout << ans << endl;
return 0;
}
| replace | 37 | 38 | 37 | 38 | 0 | |
p03074 | C++ | Runtime Error | #include <cstdio>
char s[300000];
int t[300000];
int main(void) {
int n, k;
scanf("%d%d", &n, &k);
k = 2 * k + 1;
scanf("%s", s);
char last = '0';
int j = 2;
for (int i = 0; i < n; i++) {
if (s[i] == last) {
t[j]++;
} else {
t[++j] = 1;
last = s[i];
}
}
++j;
j += 2 * k + 10;
for (int i = 0; i < j; i++) {
/* printf("%d ", t[i]); */
t[i + 1] += t[i];
}
/* printf("\n"); */
int m = 0;
for (int i = 0; i + k < j; i += 2) {
if (m < t[i + k] - t[i])
m = t[i + k] - t[i];
}
printf("%d\n", m);
}
| #include <cstdio>
char s[200000];
int t[500000];
int main(void) {
int n, k;
scanf("%d%d", &n, &k);
k = 2 * k + 1;
scanf("%s", s);
char last = '0';
int j = 2;
for (int i = 0; i < n; i++) {
if (s[i] == last) {
t[j]++;
} else {
t[++j] = 1;
last = s[i];
}
}
++j;
j += 2 * k + 10;
for (int i = 0; i < j; i++) {
/* printf("%d ", t[i]); */
t[i + 1] += t[i];
}
/* printf("\n"); */
int m = 0;
for (int i = 0; i + k < j; i += 2) {
if (m < t[i + k] - t[i])
m = t[i + k] - t[i];
}
printf("%d\n", m);
}
| replace | 2 | 4 | 2 | 4 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i, s, n) for (int i = s; i < n; i++)
#define NUM 2520
#define INF (1LL << 50)
#define DEBUG 0
#define mp(a, b) make_pair(a, b)
#define SORT(V) sort(V.begin(), V.end())
#define PI (3.141592653589794)
#define TO_STRING(VariableName) #VariableName
#define LOG(x) \
if (DEBUG) \
cout << TO_STRING(x) << "=" << x << " " << endl;
#define LOG2(x, y) \
if (DEBUG) \
cout << TO_STRING(x) << "=" << x << " " << TO_STRING(y) << "=" << y << endl;
#define LOG3(x, y, z) \
if (DEBUG) \
cout << TO_STRING(x) << "=" << x << " " << TO_STRING(y) << "=" << y << " " \
<< TO_STRING(z) << "=" << z << endl;
#define LOG4(w, x, y, z) \
if (DEBUG) \
cout << TO_STRING(w) << "=" << w << " " << TO_STRING(x) << "=" << x << " " \
<< TO_STRING(y) << "=" << y << " " << TO_STRING(z) << "=" << z \
<< endl;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
void func(long long N, long long K, std::string S) {
vector<lli> d;
if (S[0] == '0')
d.push_back(0);
lli now = 0;
lli nex = 1;
while (now < N && nex < N) {
if (S[now] != S[nex]) {
d.push_back(nex - now);
now = nex;
}
nex++;
}
d.push_back(nex - now);
if (S[N - 1] == '0')
d.push_back(0);
lli ans = 0;
lli sum = 0;
REP(i, 0, 2 * K + 1) { sum += d[i]; }
chmax(ans, sum);
for (lli i = 2 * K + 1; i < d.size(); i += 2) {
LOG2(ans, sum);
sum -= d[i - 2 * K - 1];
sum -= d[i - 2 * K];
sum += d[i];
sum += d[i + 1];
chmax(ans, sum);
}
cout << ans << endl;
}
int main() {
// cout << fixed << setprecision(5);
long long N;
scanf("%lld", &N);
long long K;
scanf("%lld", &K);
std::string S;
std::cin >> S;
func(N, K, S);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i, s, n) for (int i = s; i < n; i++)
#define NUM 2520
#define INF (1LL << 50)
#define DEBUG 0
#define mp(a, b) make_pair(a, b)
#define SORT(V) sort(V.begin(), V.end())
#define PI (3.141592653589794)
#define TO_STRING(VariableName) #VariableName
#define LOG(x) \
if (DEBUG) \
cout << TO_STRING(x) << "=" << x << " " << endl;
#define LOG2(x, y) \
if (DEBUG) \
cout << TO_STRING(x) << "=" << x << " " << TO_STRING(y) << "=" << y << endl;
#define LOG3(x, y, z) \
if (DEBUG) \
cout << TO_STRING(x) << "=" << x << " " << TO_STRING(y) << "=" << y << " " \
<< TO_STRING(z) << "=" << z << endl;
#define LOG4(w, x, y, z) \
if (DEBUG) \
cout << TO_STRING(w) << "=" << w << " " << TO_STRING(x) << "=" << x << " " \
<< TO_STRING(y) << "=" << y << " " << TO_STRING(z) << "=" << z \
<< endl;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
void func(long long N, long long K, std::string S) {
vector<lli> d;
if (S[0] == '0')
d.push_back(0);
lli now = 0;
lli nex = 1;
while (now < N && nex < N) {
if (S[now] != S[nex]) {
d.push_back(nex - now);
now = nex;
}
nex++;
}
d.push_back(nex - now);
if (S[N - 1] == '0')
d.push_back(0);
lli ans = 0;
lli sum = 0;
REP(i, 0, min((int)(2 * K + 1), (int)d.size())) { sum += d[i]; }
chmax(ans, sum);
for (lli i = 2 * K + 1; i < d.size(); i += 2) {
LOG2(ans, sum);
sum -= d[i - 2 * K - 1];
sum -= d[i - 2 * K];
sum += d[i];
sum += d[i + 1];
chmax(ans, sum);
}
cout << ans << endl;
}
int main() {
// cout << fixed << setprecision(5);
long long N;
scanf("%lld", &N);
long long K;
scanf("%lld", &K);
std::string S;
std::cin >> S;
func(N, K, S);
return 0;
}
| replace | 64 | 65 | 64 | 65 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> nums;
int now = 1;
int count = 0;
for (int i = 0; i < n; i++) {
if (s[i] == ('0' + now))
count++;
else {
nums.push_back(count);
now = 1 - now;
count = 1;
}
}
if (count != 0)
nums.push_back(count);
if (nums.size() % 2 == 0)
nums.push_back(0);
int add = 2 * k + 1;
vector<int> sum(nums.size() + 1);
for (int i = 0; i < sum.size(); i++) {
sum[i + 1] = sum[i] + nums[i];
}
int ans = 0;
for (int i = 0; i < nums.size(); i += 2) {
int left = i;
int right = min(i + add, (int)nums.size());
int tmp = sum[right] - sum[left];
ans = max(tmp, ans);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> nums;
int now = 1;
int count = 0;
for (int i = 0; i < n; i++) {
if (s[i] == ('0' + now))
count++;
else {
nums.push_back(count);
now = 1 - now;
count = 1;
}
}
if (count != 0)
nums.push_back(count);
if (nums.size() % 2 == 0)
nums.push_back(0);
int add = 2 * k + 1;
vector<int> sum(nums.size() + 1);
for (int i = 0; i < nums.size(); i++) {
sum[i + 1] = sum[i] + nums[i];
}
int ans = 0;
for (int i = 0; i < nums.size(); i += 2) {
int left = i;
int right = min(i + add, (int)nums.size());
int tmp = sum[right] - sum[left];
ans = max(tmp, ans);
}
cout << ans << endl;
return 0;
} | replace | 31 | 32 | 31 | 32 | 0 | |
p03074 | C++ | Runtime Error | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
string s;
cin >> n >> k;
cin >> s;
vector<int> size(n + k + 1, 0);
int c = 0;
int group_num = 0;
bool is_zero_first = s[0] == '0';
bool is_zero_group = is_zero_first;
for (int i = 0; i < n; i++) {
if ((is_zero_group && s[i] == '1') || (!is_zero_group && s[i] == '0')) {
size[group_num] = c;
is_zero_group = !is_zero_group;
c = 0;
group_num++;
}
c++;
if (i == (n - 1)) {
size[group_num] = c;
group_num++;
}
}
int max_sum = 0;
for (int i = 0; i < group_num; i += 2) {
int sum = 0;
int init;
if (is_zero_first) {
init = i - 1;
} else {
init = i;
}
for (int j = init; j < (init + 2 * k + 1); j++) {
if (j < 0) {
continue;
}
sum += size[j];
}
if (sum > max_sum) {
max_sum = sum;
}
}
cout << max_sum << endl;
return 0;
} | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
string s;
cin >> n >> k;
cin >> s;
vector<int> size(n + 2 * k + 1, 0);
int c = 0;
int group_num = 0;
bool is_zero_first = s[0] == '0';
bool is_zero_group = is_zero_first;
for (int i = 0; i < n; i++) {
if ((is_zero_group && s[i] == '1') || (!is_zero_group && s[i] == '0')) {
size[group_num] = c;
is_zero_group = !is_zero_group;
c = 0;
group_num++;
}
c++;
if (i == (n - 1)) {
size[group_num] = c;
group_num++;
}
}
int max_sum = 0;
for (int i = 0; i < group_num; i += 2) {
int sum = 0;
int init;
if (is_zero_first) {
init = i - 1;
} else {
init = i;
}
for (int j = init; j < (init + 2 * k + 1); j++) {
if (j < 0) {
continue;
}
sum += size[j];
}
if (sum > max_sum) {
max_sum = sum;
}
}
cout << max_sum << endl;
return 0;
} | replace | 12 | 13 | 12 | 13 | 0 | |
p03074 | C++ | Runtime Error | #include <iostream>
using namespace std;
char input[10010];
int main() {
input[0] = '1';
int n, k;
cin >> n >> k;
cin >> &input[1];
char *start, *cur;
start = cur = input;
int max = 0;
while (*cur) {
while (*cur && *cur == '1')
cur++;
if (!k)
break;
while (*cur && *cur == '0')
cur++;
k--;
}
max = cur - start - 1;
while (*cur) {
while (*start == '1')
start++;
while (*start == '0')
start++;
while (*cur && *cur == '0')
cur++;
while (*cur && *cur == '1')
cur++;
if (max < cur - start)
max = cur - start;
}
cout << max << endl;
} | #include <iostream>
using namespace std;
char input[100010];
int main() {
input[0] = '1';
int n, k;
cin >> n >> k;
cin >> &input[1];
char *start, *cur;
start = cur = input;
int max = 0;
while (*cur) {
while (*cur && *cur == '1')
cur++;
if (!k)
break;
while (*cur && *cur == '0')
cur++;
k--;
}
max = cur - start - 1;
while (*cur) {
while (*start == '1')
start++;
while (*start == '0')
start++;
while (*cur && *cur == '0')
cur++;
while (*cur && *cur == '1')
cur++;
if (max < cur - start)
max = cur - start;
}
cout << max << endl;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p03074 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
string s;
cin >> n >> k;
cin >> s;
vector<int> on, ze;
char m = s[0];
int num_m = 0;
if (s[0] == '0')
on.push_back(0);
for (int i = 0; i < n; i++) {
if (s[i] == m) {
num_m++;
} else {
if (m == '0')
ze.push_back(num_m);
else
on.push_back(num_m);
m = s[i];
num_m = 1;
}
if (i == n - 1) {
if (m == '0')
ze.push_back(num_m);
else
on.push_back(num_m);
}
}
if (ze.at(ze.size() - 1) == 1)
on.push_back(0);
int ans = 0;
if (on.size() <= k + 1)
k = on.size() - 1;
for (int i = 0; i < on.size() - k; i++) {
int ansd = 0;
for (int j = 0; j < k + 1; j++) {
ansd += on.at(i + j);
}
for (int j = 0; j < k; j++) {
ansd += ze.at(i + j);
}
ans = max(ansd, ans);
}
cout << ans << endl;
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
string s;
cin >> n >> k;
cin >> s;
vector<int> on, ze;
char m = s[0];
int num_m = 0;
if (s[0] == '0')
on.push_back(0);
for (int i = 0; i < n; i++) {
if (s[i] == m) {
num_m++;
} else {
if (m == '0')
ze.push_back(num_m);
else
on.push_back(num_m);
m = s[i];
num_m = 1;
}
if (i == n - 1) {
if (m == '0')
ze.push_back(num_m);
else
on.push_back(num_m);
}
}
if (on.size() == ze.size())
on.push_back(0);
int ans = 0;
if (on.size() <= k + 1)
k = on.size() - 1;
for (int i = 0; i < on.size() - k; i++) {
int ansd = 0;
for (int j = 0; j < k + 1; j++) {
ansd += on.at(i + j);
}
for (int j = 0; j < k; j++) {
ansd += ze.at(i + j);
}
ans = max(ansd, ans);
}
cout << ans << endl;
} | replace | 47 | 48 | 47 | 48 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, b) FOR(i, 0, b)
#define RFOR(i, a, b) for (int i = a - 1; i >= b; i--)
#define RREP(i, a) RFOR(i, a, 0)
#define REPALL(i, v) for (int i = 0; i < v.size(); i++)
#define RREPALL(i, v) for (int i = v.size() - 1; i >= 0; i--)
#define SORT(v) sort(v.begin(), v.end())
#define MIN_ELEMENT(v) min_element(v.begin(), v.end())
#define MAX_ELEMENT(v) max_element(v.begin(), v.end())
#define COUNT(v, n) count(v.begin(), v.end(), n);
void YES(bool flag) { cout << (flag ? "YES" : "NO") << endl; }
void Yes(bool flag) { cout << (flag ? "Yes" : "No") << endl; }
void yes(bool flag) { cout << (flag ? "yes" : "no") << endl; }
typedef long long ll;
typedef unsigned long long ull;
const int INF = 1e7;
const ll MOD = 1e9 + 7;
vector<int> states;
// 偶数番目(0,2,,)は直立、奇数番目(1,3,,)は逆立ち
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
bool is_stand = true;
int idx = 1;
states.push_back(0);
states.push_back(0);
REP(i, n) {
if (s[i] == '0') {
if (is_stand) {
states[idx]++;
} else {
states.push_back(1);
idx++;
is_stand = true;
}
} else {
if (is_stand) {
states.push_back(1);
idx++;
is_stand = false;
} else {
states[idx]++;
}
}
}
REP(i, 100) states.push_back(0);
vector<int> scc;
int fscc = 0;
REP(i, k * 2 + 1) { fscc += states[i]; }
scc.push_back(fscc);
int size = states.size();
idx = 0;
for (int i = k * 2 + 1; i < size; i += 2, idx++) {
scc.push_back(scc[idx] - states[i - k * 2 - 1] - states[i - k * 2 - 0] +
states[i] + states[i + 1]);
}
cout << *MAX_ELEMENT(scc) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, b) FOR(i, 0, b)
#define RFOR(i, a, b) for (int i = a - 1; i >= b; i--)
#define RREP(i, a) RFOR(i, a, 0)
#define REPALL(i, v) for (int i = 0; i < v.size(); i++)
#define RREPALL(i, v) for (int i = v.size() - 1; i >= 0; i--)
#define SORT(v) sort(v.begin(), v.end())
#define MIN_ELEMENT(v) min_element(v.begin(), v.end())
#define MAX_ELEMENT(v) max_element(v.begin(), v.end())
#define COUNT(v, n) count(v.begin(), v.end(), n);
void YES(bool flag) { cout << (flag ? "YES" : "NO") << endl; }
void Yes(bool flag) { cout << (flag ? "Yes" : "No") << endl; }
void yes(bool flag) { cout << (flag ? "yes" : "no") << endl; }
typedef long long ll;
typedef unsigned long long ull;
const int INF = 1e7;
const ll MOD = 1e9 + 7;
vector<int> states;
// 偶数番目(0,2,,)は直立、奇数番目(1,3,,)は逆立ち
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
bool is_stand = true;
int idx = 1;
states.push_back(0);
states.push_back(0);
REP(i, n) {
if (s[i] == '0') {
if (is_stand) {
states[idx]++;
} else {
states.push_back(1);
idx++;
is_stand = true;
}
} else {
if (is_stand) {
states.push_back(1);
idx++;
is_stand = false;
} else {
states[idx]++;
}
}
}
REP(i, k * 2 + 2) states.push_back(0);
vector<int> scc;
int fscc = 0;
REP(i, k * 2 + 1) { fscc += states[i]; }
scc.push_back(fscc);
int size = states.size();
idx = 0;
for (int i = k * 2 + 1; i < size; i += 2, idx++) {
scc.push_back(scc[idx] - states[i - k * 2 - 1] - states[i - k * 2 - 0] +
states[i] + states[i + 1]);
}
cout << *MAX_ELEMENT(scc) << endl;
return 0;
}
| replace | 52 | 53 | 52 | 53 | 0 | |
p03074 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
scanf("%d %d", &n, &k);
string s;
cin >> s;
vector<int> s_array;
s_array.push_back(0);
char num = '1';
for (int i = 0; i < n; i++) {
if ((char)s[i] != num) {
s_array.push_back(1);
num = (num == '0' ? '1' : '0');
} else {
s_array.back()++;
}
}
if (num == '0')
s_array.push_back(0);
int result = 0, sum = 0;
for (int i = 0; i < n; i += 2) {
if (i == 0) {
sum += s_array[i];
} else if (i <= k * 2) {
sum += (s_array[i - 1] + s_array[i]);
} else {
sum -= (s_array[i - k * 2 - 2] + s_array[i - k * 2 - 1]);
sum += (s_array[i - 1] + s_array[i]);
}
result = max(result, sum);
}
cout << result << endl;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
scanf("%d %d", &n, &k);
string s;
cin >> s;
vector<int> s_array;
s_array.push_back(0);
char num = '1';
for (int i = 0; i < n; i++) {
if ((char)s[i] != num) {
s_array.push_back(1);
num = (num == '0' ? '1' : '0');
} else {
s_array.back()++;
}
}
if (num == '0')
s_array.push_back(0);
int result = 0, sum = 0;
for (int i = 0; i < s_array.size(); i += 2) {
if (i == 0) {
sum += s_array[i];
} else if (i <= k * 2) {
sum += (s_array[i - 1] + s_array[i]);
} else {
sum -= (s_array[i - k * 2 - 2] + s_array[i - k * 2 - 1]);
sum += (s_array[i - 1] + s_array[i]);
}
result = max(result, sum);
}
cout << result << endl;
}
| replace | 25 | 26 | 25 | 26 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int main() {
int N, K;
cin >> N >> K;
string s;
cin >> s;
vector<int> S;
char current = s[0];
if (current == '0') {
S.push_back(0);
}
int num = 0;
REP(i, N) {
if (current == s[i]) {
num++;
} else {
S.push_back(num);
num = 1;
current = s[i];
}
}
S.push_back(num);
if (S.size() % 2 == 0) {
S.push_back(0);
}
if (S.size() <= 2 * K + 1) {
cout << N << endl;
} else {
int ans = 0;
for (int i = 0; i < S.size(); i += 2) {
int cur = 0;
FOR(j, i, i + 2 * K + 1) { cur += S[j]; }
ans = max(ans, cur);
}
cout << ans << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int main() {
int N, K;
cin >> N >> K;
string s;
cin >> s;
vector<int> S;
char current = s[0];
if (current == '0') {
S.push_back(0);
}
int num = 0;
REP(i, N) {
if (current == s[i]) {
num++;
} else {
S.push_back(num);
num = 1;
current = s[i];
}
}
S.push_back(num);
if (S.size() % 2 == 0) {
S.push_back(0);
}
if (S.size() <= 2 * K + 1) {
cout << N << endl;
} else {
int ans = 0;
for (int i = 0; i < S.size() - 2 * K; i += 2) {
int cur = 0;
FOR(j, i, i + 2 * K + 1) { cur += S[j]; }
ans = max(ans, cur);
}
cout << ans << endl;
}
return 0;
} | replace | 40 | 41 | 40 | 41 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string s;
int n, k, c = 0;
vector<int> a;
cin >> n >> k >> s;
rep(i, n) {
int j = i;
while (s[j + 1] == s[j] && j + 1 < n)
j++;
a.push_back(j - i + 1);
i = j;
}
reverse(a.begin(), a.end());
if (s[0] == '0')
a.push_back(0);
reverse(a.begin(), a.end());
if (s[n - 1] == '0')
a.push_back(0);
vector<int> b(a.size() - 1);
rep(i, a.size()) b[i + 1] = b[i] + a[i];
for (int i = 0; i < a.size(); i += 2) {
int left = i;
int right = min(i + 2 * k + 1, (int)a.size()); // 累積和としての左右
c = max(c, b[right] - b[left]);
}
cout << c << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string s;
int n, k, c = 0;
vector<int> a;
cin >> n >> k >> s;
rep(i, n) {
int j = i;
while (s[j + 1] == s[j] && j + 1 < n)
j++;
a.push_back(j - i + 1);
i = j;
}
reverse(a.begin(), a.end());
if (s[0] == '0')
a.push_back(0);
reverse(a.begin(), a.end());
if (s[n - 1] == '0')
a.push_back(0);
vector<int> b(a.size() + 1);
rep(i, a.size()) b[i + 1] = b[i] + a[i];
for (int i = 0; i < a.size(); i += 2) {
int left = i;
int right = min(i + 2 * k + 1, (int)a.size()); // 累積和としての左右
c = max(c, b[right] - b[left]);
}
cout << c << endl;
} | replace | 21 | 22 | 21 | 22 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
#define itn int
#define REP(i, n) for (int i = 0; i < n; i++)
#define IREP(i, n) for (int i = n - 1; i >= 0; i--)
#define REPEACH(i, k) for (auto &i : k)
#define all(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
signed main() {
int n, k;
string s;
cin >> n >> k >> s;
vector<int> a(n);
int now = 0;
bool is_one = false;
int max = 0;
REP(i, n) {
if (i == 0 && s[i] == '0') {
is_one = false;
now++;
a[0] = i;
} else if (s[i] == '1' && !is_one) {
a[now] = i;
is_one = true;
} else if (s[i] == '1') {
continue;
} else if (s[i] == '0' && is_one) {
if (k >= now) {
if (i - a[now - k] > max) {
max = i - a[now - k];
}
}
now++;
is_one = false;
}
}
if (now <= k) {
cout << s.size() << endl;
return 0;
}
if (s.size() - a[now - k] > max) {
max = s.size() - a[now - k];
}
cout << max << endl;
} | #include <bits/stdc++.h>
#define itn int
#define REP(i, n) for (int i = 0; i < n; i++)
#define IREP(i, n) for (int i = n - 1; i >= 0; i--)
#define REPEACH(i, k) for (auto &i : k)
#define all(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
signed main() {
int n, k;
string s;
cin >> n >> k >> s;
vector<int> a(n);
int now = 0;
bool is_one = false;
int max = 0;
REP(i, n) {
if (i == 0 && s[i] == '0') {
is_one = false;
now++;
a[0] = i;
} else if (s[i] == '1' && !is_one) {
a[now] = i;
is_one = true;
} else if (s[i] == '1') {
continue;
} else if (s[i] == '0' && is_one) {
if (k <= now) {
if (i - a[now - k] > max) {
max = i - a[now - k];
}
}
now++;
is_one = false;
}
}
if (now <= k) {
cout << s.size() << endl;
return 0;
}
if (s.size() - a[now - k] > max) {
max = s.size() - a[now - k];
}
cout << max << endl;
} | replace | 31 | 32 | 31 | 32 | 0 | |
p03074 | C++ | Runtime Error | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(vec) vec.begin(), vec.end()
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
const ll mod = 1e9 + 7;
const int inf = 1 << 30;
int main() {
int n, k;
cin >> n >> k;
string t;
cin >> t;
vector<int> a(0);
int cnt = 0;
rep(i, n) {
if (t[i] == t[i + 1])
cnt++;
else {
a.push_back(cnt + 1);
cnt = 0;
}
}
int l = a.size();
vector<ll> s(l + 1);
s[0] = 0;
rep(i, l) s[i + 1] = s[i] + a[i];
if (t[0] == '1') {
ll ans = 0;
rep(i, l) {
if (i % 2 == 0) {
if (i + 2 * k + 1 <= l)
chmax(ans, s[i + 2 * k + 1] - s[i]);
else
chmax(ans, s[l] - s[i]);
}
}
cout << ans << endl;
} else {
ll ans = s[2 * k] - s[0];
rep(i, l) {
if (i % 2 == 1) {
if (i + 2 * k + 1 <= l)
chmax(ans, s[i + 2 * k + 1] - s[i]);
else
chmax(ans, s[l] - s[i]);
}
}
cout << ans << endl;
}
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(vec) vec.begin(), vec.end()
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
const ll mod = 1e9 + 7;
const int inf = 1 << 30;
int main() {
int n, k;
cin >> n >> k;
string t;
cin >> t;
vector<int> a(0);
int cnt = 0;
rep(i, n) {
if (t[i] == t[i + 1])
cnt++;
else {
a.push_back(cnt + 1);
cnt = 0;
}
}
int l = a.size();
vector<ll> s(l + 1);
s[0] = 0;
rep(i, l) s[i + 1] = s[i] + a[i];
if (t[0] == '1') {
ll ans = 0;
rep(i, l) {
if (i % 2 == 0) {
if (i + 2 * k + 1 <= l)
chmax(ans, s[i + 2 * k + 1] - s[i]);
else
chmax(ans, s[l] - s[i]);
}
}
cout << ans << endl;
} else {
ll ans = 2 * k <= l ? s[2 * k] - s[0] : s[l] - s[0];
rep(i, l) {
if (i % 2 == 1) {
if (i + 2 * k + 1 <= l)
chmax(ans, s[i + 2 * k + 1] - s[i]);
else
chmax(ans, s[l] - s[i]);
}
}
cout << ans << endl;
}
} | replace | 56 | 57 | 56 | 57 | 0 | |
p03074 | C++ | Runtime Error | /*{{{*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define REP(I, N) for (int I = 0; I < (N); ++I)
#define REPP(I, A, B) for (int I = (A); I < (B); ++I)
#define FOR(I, A, B) for (int I = (A); I <= (B); ++I)
#define FORS(I, S) for (int I = 0; S[I]; ++I)
#define RS(X) scanf("%s", (X))
#define SORT_UNIQUE(c) \
(sort(c.begin(), c.end()), \
c.resize(distance(c.begin(), unique(c.begin(), c.end()))))
#define GET_POS(c, x) (lower_bound(c.begin(), c.end(), x) - c.begin())
#define CASET \
int ___T; \
scanf("%d", &___T); \
for (int cs = 1; cs <= ___T; cs++)
#define MP make_pair
#define PB push_back
#define MS0(X) memset((X), 0, sizeof((X)))
#define MS1(X) memset((X), -1, sizeof((X)))
#define LEN(X) strlen(X)
#define F first
#define S second
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef long double LD;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<PII> VPII;
typedef pair<LL, LL> PLL;
typedef vector<PLL> VPLL;
template <class T> void _R(T &x) { cin >> x; }
void _R(int &x) { scanf("%d", &x); }
void _R(LL &x) { scanf("%lld", &x); }
void _R(double &x) { scanf("%lf", &x); }
void _R(char &x) { scanf(" %c", &x); }
void _R(char *x) { scanf("%s", x); }
void R() {}
template <class T, class... U> void R(T &head, U &...tail) {
_R(head);
R(tail...);
}
template <class T> void _W(const T &x) { cout << x; }
void _W(const int &x) { printf("%d", x); }
void _W(const LL &x) { printf("%lld", x); }
void _W(const double &x) { printf("%.16f", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
template <class T, class U> void _W(const pair<T, U> &x) {
_W(x.F);
putchar(' ');
_W(x.S);
}
template <class T> void _W(const vector<T> &x) {
for (auto i = x.begin(); i != x.end(); _W(*i++))
if (i != x.cbegin())
putchar(' ');
}
void W() {}
template <class T, class... U> void W(const T &head, const U &...tail) {
_W(head);
putchar(sizeof...(tail) ? ' ' : '\n');
W(tail...);
}
#ifdef HOME
#define DEBUG(...) \
{ \
printf("# "); \
printf(__VA_ARGS__); \
puts(""); \
}
#else
#define DEBUG(...)
#endif
int MOD = 1e9 + 7;
void ADD(LL &x, LL v) {
x = (x + v) % MOD;
if (x < 0)
x += MOD;
}
/*}}}*/
const int SIZE = 1e6 + 10;
int main() {
int n, k;
R(n, k);
string s;
R(s);
VPII AA;
for (int i = 0, j; i < SZ(s); i = j) {
for (j = i + 1; j < SZ(s) && s[j] == s[i]; j++)
;
AA.PB({s[i] - '0', j - i});
}
int ll = 0;
int now = 0, an = 0;
REP(i, n) {
now += AA[i].S;
if (AA[i].F == 0)
k--;
while (k < 0) {
if (AA[ll].F == 0)
k++;
now -= AA[ll].S;
ll++;
}
an = max(an, now);
}
W(an);
return 0;
}
| /*{{{*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define REP(I, N) for (int I = 0; I < (N); ++I)
#define REPP(I, A, B) for (int I = (A); I < (B); ++I)
#define FOR(I, A, B) for (int I = (A); I <= (B); ++I)
#define FORS(I, S) for (int I = 0; S[I]; ++I)
#define RS(X) scanf("%s", (X))
#define SORT_UNIQUE(c) \
(sort(c.begin(), c.end()), \
c.resize(distance(c.begin(), unique(c.begin(), c.end()))))
#define GET_POS(c, x) (lower_bound(c.begin(), c.end(), x) - c.begin())
#define CASET \
int ___T; \
scanf("%d", &___T); \
for (int cs = 1; cs <= ___T; cs++)
#define MP make_pair
#define PB push_back
#define MS0(X) memset((X), 0, sizeof((X)))
#define MS1(X) memset((X), -1, sizeof((X)))
#define LEN(X) strlen(X)
#define F first
#define S second
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef long double LD;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<PII> VPII;
typedef pair<LL, LL> PLL;
typedef vector<PLL> VPLL;
template <class T> void _R(T &x) { cin >> x; }
void _R(int &x) { scanf("%d", &x); }
void _R(LL &x) { scanf("%lld", &x); }
void _R(double &x) { scanf("%lf", &x); }
void _R(char &x) { scanf(" %c", &x); }
void _R(char *x) { scanf("%s", x); }
void R() {}
template <class T, class... U> void R(T &head, U &...tail) {
_R(head);
R(tail...);
}
template <class T> void _W(const T &x) { cout << x; }
void _W(const int &x) { printf("%d", x); }
void _W(const LL &x) { printf("%lld", x); }
void _W(const double &x) { printf("%.16f", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
template <class T, class U> void _W(const pair<T, U> &x) {
_W(x.F);
putchar(' ');
_W(x.S);
}
template <class T> void _W(const vector<T> &x) {
for (auto i = x.begin(); i != x.end(); _W(*i++))
if (i != x.cbegin())
putchar(' ');
}
void W() {}
template <class T, class... U> void W(const T &head, const U &...tail) {
_W(head);
putchar(sizeof...(tail) ? ' ' : '\n');
W(tail...);
}
#ifdef HOME
#define DEBUG(...) \
{ \
printf("# "); \
printf(__VA_ARGS__); \
puts(""); \
}
#else
#define DEBUG(...)
#endif
int MOD = 1e9 + 7;
void ADD(LL &x, LL v) {
x = (x + v) % MOD;
if (x < 0)
x += MOD;
}
/*}}}*/
const int SIZE = 1e6 + 10;
int main() {
int n, k;
R(n, k);
string s;
R(s);
VPII AA;
for (int i = 0, j; i < SZ(s); i = j) {
for (j = i + 1; j < SZ(s) && s[j] == s[i]; j++)
;
AA.PB({s[i] - '0', j - i});
}
int ll = 0;
int now = 0, an = 0;
REP(i, SZ(AA)) {
now += AA[i].S;
if (AA[i].F == 0)
k--;
while (k < 0) {
if (AA[ll].F == 0)
k++;
now -= AA[ll].S;
ll++;
}
an = max(an, now);
}
W(an);
return 0;
}
| replace | 112 | 113 | 112 | 113 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, st, n) for (int i = st; i < n; ++i)
using pii = pair<int, int>;
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define inf (int)1e9 + 7
#define eb emplace_back
template <typename T> void out(vector<T> v) {
rep(i, v.size()) cout << v[i] << " ";
cout << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
string s;
cin >> n >> k >> s;
vector<int> Nums;
int now = 1; // 今見ているかず
int cnt = 0; // nowがいくつ並んでいるか
for (int i = 0; i < n; ++i) {
if (s[i] == (char)('0' + now))
cnt++;
else {
Nums.eb(cnt);
now = 1 - now; // 0, 1 切り替え
cnt = 1; // 新しいのをカウントし始める
}
}
if (cnt != 0)
Nums.push_back(cnt);
// 1 - 0 - 1 - 0 - 1
// 0で終わってたら
if (Nums.size() % 2 == 0)
Nums.eb(0);
int Add = 2 * k + 1;
int ans = 0;
// 累積和を作る
vector<int> sum(Nums.size() + 1);
for (int i = 0; i < sum.size(); ++i) {
sum[i + 1] = sum[i] + Nums[i];
}
// 1 - 0 - 1...の1から始めるので偶数番目だけ見る
for (int i = 0; i < Nums.size(); i += 2) {
// 次のleft, rightを計算する[left, right)
int left = i;
int right = min(i + Add, (int)Nums.size());
int tmp = sum[right] - sum[left];
chmax(ans, tmp);
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, st, n) for (int i = st; i < n; ++i)
using pii = pair<int, int>;
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define inf (int)1e9 + 7
#define eb emplace_back
template <typename T> void out(vector<T> v) {
rep(i, v.size()) cout << v[i] << " ";
cout << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
string s;
cin >> n >> k >> s;
vector<int> Nums;
int now = 1; // 今見ているかず
int cnt = 0; // nowがいくつ並んでいるか
for (int i = 0; i < n; ++i) {
if (s[i] == (char)('0' + now))
cnt++;
else {
Nums.eb(cnt);
now = 1 - now; // 0, 1 切り替え
cnt = 1; // 新しいのをカウントし始める
}
}
if (cnt != 0)
Nums.push_back(cnt);
// 1 - 0 - 1 - 0 - 1
// 0で終わってたら
if (Nums.size() % 2 == 0)
Nums.eb(0);
int Add = 2 * k + 1;
int ans = 0;
// 累積和を作る
vector<int> sum(Nums.size() + 1);
for (int i = 0; i < Nums.size(); ++i) {
sum[i + 1] = sum[i] + Nums[i];
}
// 1 - 0 - 1...の1から始めるので偶数番目だけ見る
for (int i = 0; i < Nums.size(); i += 2) {
// 次のleft, rightを計算する[left, right)
int left = i;
int right = min(i + Add, (int)Nums.size());
int tmp = sum[right] - sum[left];
chmax(ans, tmp);
}
cout << ans << endl;
}
| replace | 44 | 45 | 44 | 45 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, st, n) for (int i = st; i < n; ++i)
using pii = pair<int, int>;
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define inf (int)1e9 + 7
#define eb emplace_back
template <typename T> void out(vector<T> v) {
rep(i, v.size()) cout << v[i] << " ";
cout << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
string s;
cin >> n >> k >> s;
vector<int> Nums;
int now = 1; // 今見ているかず
int cnt = 0; // nowがいくつ並んでいるか
for (int i = 0; i < n; ++i) {
if (s[i] == (char)('0' + now))
cnt++;
else {
Nums.eb(cnt);
now = 1 - now; // 0, 1 切り替え
cnt = 1; // 新しいのをカウントし始める
}
}
if (cnt != 0)
Nums.push_back(cnt);
// 1 - 0 - 1 - 0 - 1
// 0で終わってたら
if (Nums.size() % 2 == 0)
Nums.eb(0);
int Add = 2 * k + 1;
int ans = 0;
// 1 - 0 - 1...の1から始めるので偶数番目だけ見る
for (int i = 0; i < Nums.size(); i += 2) {
int tmp = 0;
int left = i;
int right = i + Add;
for (int j = left; j < right; ++j) {
tmp += Nums[j];
}
chmax(ans, tmp);
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, st, n) for (int i = st; i < n; ++i)
using pii = pair<int, int>;
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define inf (int)1e9 + 7
#define eb emplace_back
template <typename T> void out(vector<T> v) {
rep(i, v.size()) cout << v[i] << " ";
cout << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
string s;
cin >> n >> k >> s;
vector<int> Nums;
int now = 1; // 今見ているかず
int cnt = 0; // nowがいくつ並んでいるか
for (int i = 0; i < n; ++i) {
if (s[i] == (char)('0' + now))
cnt++;
else {
Nums.eb(cnt);
now = 1 - now; // 0, 1 切り替え
cnt = 1; // 新しいのをカウントし始める
}
}
if (cnt != 0)
Nums.push_back(cnt);
// 1 - 0 - 1 - 0 - 1
// 0で終わってたら
if (Nums.size() % 2 == 0)
Nums.eb(0);
int Add = 2 * k + 1;
int ans = 0;
// 1 - 0 - 1...の1から始めるので偶数番目だけ見る
for (int i = 0; i < Nums.size(); i += 2) {
int tmp = 0;
int left = i;
int right = min(i + Add, (int)Nums.size());
for (int j = left; j < right; ++j) {
tmp += Nums[j];
}
chmax(ans, tmp);
}
cout << ans << endl;
}
| replace | 45 | 46 | 45 | 46 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, st, n) for (int i = st; i < n; ++i)
using pii = pair<int, int>;
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define inf (int)1e9 + 7
#define eb emplace_back
template <typename T> void out(vector<T> v) {
rep(i, v.size()) cout << v[i] << " ";
cout << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
string s;
cin >> n >> k >> s;
vector<ll> v;
v.push_back(0);
// k = 1 -> 2個跨げる
// k = 2 -> 4個跨げる
ll c = 0;
int now = 0;
while (1) {
while (s[now] == '0') {
c++;
now++;
if (now == s.size())
break;
}
v.eb(c);
if (now == s.size())
break;
c = 0;
while (s[now] == '1') {
c++;
now++;
if (now == s.size())
break;
}
v.eb(c);
if (now == s.size())
break;
c = 0;
}
if (s[s.size() - 1] == '0')
v.eb(0);
// out(v);
ll ans = v[0];
rrep(i, 1, k * 2 + 1) ans += v[i];
c = 0;
int f = k * 2 + 1, b = 0;
if (f >= v.size()) {
cout << ans << endl;
return 0;
}
ll max_tmp = 0;
ll tmp = 0;
while (1) {
tmp += v[f];
f++;
if (f == v.size())
break;
tmp += v[f];
f++;
tmp -= v[b];
b++;
tmp -= v[b];
b++;
chmax(max_tmp, tmp);
// cout << tmp << endl;
if (f == v.size())
break;
}
cout << ans + max_tmp << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, st, n) for (int i = st; i < n; ++i)
using pii = pair<int, int>;
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define inf (int)1e9 + 7
#define eb emplace_back
template <typename T> void out(vector<T> v) {
rep(i, v.size()) cout << v[i] << " ";
cout << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
string s;
cin >> n >> k >> s;
vector<ll> v;
v.push_back(0);
// k = 1 -> 2個跨げる
// k = 2 -> 4個跨げる
ll c = 0;
int now = 0;
while (1) {
while (s[now] == '0') {
c++;
now++;
if (now == s.size())
break;
}
v.eb(c);
if (now == s.size())
break;
c = 0;
while (s[now] == '1') {
c++;
now++;
if (now == s.size())
break;
}
v.eb(c);
if (now == s.size())
break;
c = 0;
}
if (s[s.size() - 1] == '0')
v.eb(0);
// out(v);
ll ans = v[0];
rrep(i, 1, k * 2 + 1) {
ans += v[i];
if (i == v.size() - 1)
break;
}
c = 0;
int f = k * 2 + 1, b = 0;
if (f >= v.size()) {
cout << ans << endl;
return 0;
}
ll max_tmp = 0;
ll tmp = 0;
while (1) {
tmp += v[f];
f++;
if (f == v.size())
break;
tmp += v[f];
f++;
tmp -= v[b];
b++;
tmp -= v[b];
b++;
chmax(max_tmp, tmp);
// cout << tmp << endl;
if (f == v.size())
break;
}
cout << ans + max_tmp << endl;
}
| replace | 53 | 54 | 53 | 58 | 0 | |
p03074 | C++ | Runtime Error | /*Function Template*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
ll fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll Len(ll n) {
ll s = 0;
while (n != 0)
s++, n /= 10;
return s;
}
ll Sint(ll n) {
ll m = 0, s = 0, a = n;
while (a != 0)
s++, a /= 10;
for (ll i = s - 1; i >= 0; i--)
m += n / ((ll)pow(10, i)) - (n / ((ll)pow(10, i + 1))) * 10;
return m;
}
ll Svec(vector<ll> v) {
ll n = 0;
for (ll i = 0; i < v.size(); i++)
n += v[i];
return n;
}
ll GCD(ll a, ll b) {
ll r, tmp;
/*自然数 a > b を確認・入替*/
if (a < b) {
tmp = a, a = b, b = tmp;
}
/*ユークリッドの互除法*/
r = a % b;
while (r != 0) {
a = b, b = r, r = a % b;
}
return b;
}
ll LCM(ll a, ll b) {
ll c = a, d = b, r, tmp;
/*自然数 a > b を確認・入替*/
if (a < b) {
tmp = a, a = b, b = tmp;
}
/*ユークリッドの互除法*/
r = a % b;
while (r != 0) {
a = b, b = r, r = a % b;
}
return c / b * d;
}
ll Factorial(ll n) {
ll m = 1;
while (n >= 1)
m *= n, n--;
return m;
}
vector<pair<char, ll>> runlength(string s, vector<pair<char, ll>> p) {
ll x = 1;
if (s.size() == 1) {
p.push_back(pair<char, ll>(s[0], 1));
return p;
}
for (ll i = 0; i < s.size() - 1; i++) {
if (s[i] == s[i + 1]) {
x++;
if (i == s.size() - 2) {
p.push_back(pair<char, ll>(s[i], x));
}
} else {
p.push_back(pair<char, ll>(s[i], x));
x = 1;
if (i == s.size() - 2) {
p.push_back(pair<char, ll>(s[s.size() - 1], x));
}
}
}
return p;
}
ll COM(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
const int MAX_N = 100010;
vector<bool> sieve_of_eratosthenes() {
vector<bool> isPrime(MAX_N + 1, true);
for (int i = 2; i <= MAX_N; i++) {
if (isPrime[i]) {
for (int j = 2 * i; j <= MAX_N; j += i) {
isPrime[j] = false;
}
}
}
return isPrime;
}
/*↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓*/
int main() {
IOS;
ll n, k;
cin >> n >> k;
string s;
cin >> s;
vector<ll> nums;
if (s[0] == '0')
nums.push_back(0);
for (ll i = 0; i < s.size();) {
ll j = i;
while (j < s.size() && s[i] == s[j])
j++;
nums.push_back(j - i);
i = j;
}
if (s.back() == '0')
nums.push_back(0);
vector<ll> sums(nums.size(), 0);
rep(i, nums.size()) sums[i + 1] = sums[i] + nums[i];
ll res = 0;
for (ll left = 0; left < sums.size(); left += 2) {
ll right = left + k * 2 + 1;
if (right >= sums.size())
right = (ll)sums.size() - 1;
res = max(res, sums[right] - sums[left]);
}
cout << res << endl;
}
| /*Function Template*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
ll fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll Len(ll n) {
ll s = 0;
while (n != 0)
s++, n /= 10;
return s;
}
ll Sint(ll n) {
ll m = 0, s = 0, a = n;
while (a != 0)
s++, a /= 10;
for (ll i = s - 1; i >= 0; i--)
m += n / ((ll)pow(10, i)) - (n / ((ll)pow(10, i + 1))) * 10;
return m;
}
ll Svec(vector<ll> v) {
ll n = 0;
for (ll i = 0; i < v.size(); i++)
n += v[i];
return n;
}
ll GCD(ll a, ll b) {
ll r, tmp;
/*自然数 a > b を確認・入替*/
if (a < b) {
tmp = a, a = b, b = tmp;
}
/*ユークリッドの互除法*/
r = a % b;
while (r != 0) {
a = b, b = r, r = a % b;
}
return b;
}
ll LCM(ll a, ll b) {
ll c = a, d = b, r, tmp;
/*自然数 a > b を確認・入替*/
if (a < b) {
tmp = a, a = b, b = tmp;
}
/*ユークリッドの互除法*/
r = a % b;
while (r != 0) {
a = b, b = r, r = a % b;
}
return c / b * d;
}
ll Factorial(ll n) {
ll m = 1;
while (n >= 1)
m *= n, n--;
return m;
}
vector<pair<char, ll>> runlength(string s, vector<pair<char, ll>> p) {
ll x = 1;
if (s.size() == 1) {
p.push_back(pair<char, ll>(s[0], 1));
return p;
}
for (ll i = 0; i < s.size() - 1; i++) {
if (s[i] == s[i + 1]) {
x++;
if (i == s.size() - 2) {
p.push_back(pair<char, ll>(s[i], x));
}
} else {
p.push_back(pair<char, ll>(s[i], x));
x = 1;
if (i == s.size() - 2) {
p.push_back(pair<char, ll>(s[s.size() - 1], x));
}
}
}
return p;
}
ll COM(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
const int MAX_N = 100010;
vector<bool> sieve_of_eratosthenes() {
vector<bool> isPrime(MAX_N + 1, true);
for (int i = 2; i <= MAX_N; i++) {
if (isPrime[i]) {
for (int j = 2 * i; j <= MAX_N; j += i) {
isPrime[j] = false;
}
}
}
return isPrime;
}
/*↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓*/
int main() {
IOS;
ll n, k;
cin >> n >> k;
string s;
cin >> s;
vector<ll> nums;
if (s[0] == '0')
nums.push_back(0);
for (ll i = 0; i < s.size();) {
ll j = i;
while (j < s.size() && s[i] == s[j])
j++;
nums.push_back(j - i);
i = j;
}
if (s.back() == '0')
nums.push_back(0);
vector<ll> sums(nums.size() + 1, 0);
rep(i, nums.size()) sums[i + 1] = sums[i] + nums[i];
ll res = 0;
for (ll left = 0; left < sums.size(); left += 2) {
ll right = left + k * 2 + 1;
if (right >= sums.size())
right = (ll)sums.size() - 1;
res = max(res, sums[right] - sums[left]);
}
cout << res << endl;
}
| replace | 146 | 147 | 146 | 147 | -6 | free(): invalid pointer
|
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
bool one_start = (S.at(0) == '1');
vector<int> arr(100000);
int idx = 0;
char pre = '1';
if (S.at(0) == '0') { // 0スタートだった
idx++;
arr.at(0) = 0; // 1が0個あることにする
pre = '0';
}
for (int i = 0; i < S.size(); i++) {
if (pre == S.at(i)) {
arr.at(idx)++;
} else {
idx++;
arr.at(idx)++;
}
pre = S.at(i);
}
int max_lensum = 0;
for (int i = 0; i < arr.size(); i = i + 2) {
int lensum = accumulate(arr.begin() + i, arr.begin() + i + 2 * K + 1, 0);
if (lensum > max_lensum)
max_lensum = lensum;
if (i != 0 && arr.at(i) == 0)
break;
}
cout << max_lensum << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
bool one_start = (S.at(0) == '1');
vector<int> arr(1000000);
int idx = 0;
char pre = '1';
if (S.at(0) == '0') { // 0スタートだった
idx++;
arr.at(0) = 0; // 1が0個あることにする
pre = '0';
}
for (int i = 0; i < S.size(); i++) {
if (pre == S.at(i)) {
arr.at(idx)++;
} else {
idx++;
arr.at(idx)++;
}
pre = S.at(i);
}
int max_lensum = 0;
for (int i = 0; i < arr.size(); i = i + 2) {
int lensum = accumulate(arr.begin() + i, arr.begin() + i + 2 * K + 1, 0);
if (lensum > max_lensum)
max_lensum = lensum;
if (i != 0 && arr.at(i) == 0)
break;
}
cout << max_lensum << endl;
}
| replace | 10 | 11 | 10 | 11 | 0 | |
p03074 | C++ | Runtime Error | #include <algorithm>
#include <fstream>
#include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
typedef long long ll;
int main() {
std::ifstream in("input.txt");
std::cin.rdbuf(in.rdbuf());
ll N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> numbers;
ll now = 1;
ll count = 0;
for (ll i = 0; i < N; i++) {
if (S[i] == (char)('0' + now)) {
count++;
} else {
numbers.push_back(count);
now = 1 - now;
count = 1;
}
}
if (count != 0) {
numbers.push_back(count);
}
// 1-0-1-0-1
if (numbers.size() % 2 == 0) {
numbers.push_back(0);
}
ll ans = 0;
ll add = 2 * K + 1;
for (ll i = 0; i < numbers.size(); i += 2) {
ll sum = 0;
ll left = i;
ll right = min(i + add, (ll)numbers.size());
for (ll j = left; j < right; j++) {
sum += numbers[j];
}
ans = max(ans, sum);
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <fstream>
#include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
typedef long long ll;
int main() {
ll N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> numbers;
ll now = 1;
ll count = 0;
for (ll i = 0; i < N; i++) {
if (S[i] == (char)('0' + now)) {
count++;
} else {
numbers.push_back(count);
now = 1 - now;
count = 1;
}
}
if (count != 0) {
numbers.push_back(count);
}
// 1-0-1-0-1
if (numbers.size() % 2 == 0) {
numbers.push_back(0);
}
ll ans = 0;
ll add = 2 * K + 1;
for (ll i = 0; i < numbers.size(); i += 2) {
ll sum = 0;
ll left = i;
ll right = min(i + add, (ll)numbers.size());
for (ll j = left; j < right; j++) {
sum += numbers[j];
}
ans = max(ans, sum);
}
cout << ans << endl;
return 0;
}
| delete | 16 | 19 | 16 | 16 | -11 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
static const ll MAX = 1000000000000000;
static const int NIL = -1;
using namespace std;
const long double EPS = 0.0000000001;
const long double PI = (acos(-1));
const ll MOD = 1e9 + 7;
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
int main() {
int n, k, count = 0, sum = 0, ans = -1;
cin >> n >> k;
string s;
cin >> s;
vector<int> l, r;
s += 'a';
rep(i, n) {
if (s[i] == '1')
count++;
else {
if (l.size() != 0)
r.push_back(l[l.size() - 1] + count);
while (s[i + 1] == '0') {
count++;
i++;
}
l.push_back(count + 1);
count = 0;
}
}
r.push_back(l[l.size() - 1] + count);
/*
rep(i,l.size()) cout << l[i] << " " ;
cout << endl;
rep(i,r.size()) cout << r[i] << " ";
cout << endl;
*/
if (r.size() == 0 || r.size() <= k) {
cout << n;
return 0;
}
for (int i = r.size() - 1; i >= k - 1; i--) {
sum = 0;
rep(j, k) {
if (j == 0)
sum += r[i];
else
sum += l[i - j];
}
ans = max(ans, sum);
}
cout << ans;
}
| #include <bits/stdc++.h>
#define ll long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
static const ll MAX = 1000000000000000;
static const int NIL = -1;
using namespace std;
const long double EPS = 0.0000000001;
const long double PI = (acos(-1));
const ll MOD = 1e9 + 7;
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
int main() {
int n, k, count = 0, sum = 0, ans = -1;
cin >> n >> k;
string s;
cin >> s;
vector<int> l, r;
s += 'a';
rep(i, n) {
if (s[i] == '1')
count++;
else {
if (l.size() != 0)
r.push_back(l[l.size() - 1] + count);
while (s[i + 1] == '0') {
count++;
i++;
}
l.push_back(count + 1);
count = 0;
}
}
if (count == n) {
cout << n;
return 0;
}
r.push_back(l[l.size() - 1] + count);
/*
rep(i,l.size()) cout << l[i] << " " ;
cout << endl;
rep(i,r.size()) cout << r[i] << " ";
cout << endl;
*/
if (r.size() == 0 || r.size() <= k) {
cout << n;
return 0;
}
for (int i = r.size() - 1; i >= k - 1; i--) {
sum = 0;
rep(j, k) {
if (j == 0)
sum += r[i];
else
sum += l[i - j];
}
ans = max(ans, sum);
}
cout << ans;
}
| insert | 36 | 36 | 36 | 40 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
const int N = 1e5 + 5, M = 1e9 + 7;
const ull base = 13331;
const double Pi = acos(-1.0);
const ll C = 299792458;
char a[N];
struct node {
int x, v;
} h[N];
int main() {
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int tot = 0;
int l = 1, r = 1;
for (l = 1, r = 1; r <= n && l <= n; r++) {
if (a[r] == a[l])
continue;
else {
h[++tot].x = a[l] - '0';
h[tot].v = r - l;
l = r;
}
}
h[++tot].x = a[l] - '0';
h[tot].v = r - l;
int sum = 0;
int ans = 0;
for (int i = 1; i <= 2 * k; i++) {
sum += h[i].v;
}
if (h[2 * k].x == 0)
ans = max(ans, sum + h[2 * k + 1].v);
else
ans = max(ans, sum);
for (l = 2, r = 2 * k + 1; r + 1 <= n; l++, r++) {
sum -= h[l - 1].v;
sum += h[r].v;
if (h[r].x == 0) {
ans = max(ans, sum + h[r + 1].v);
} else
ans = max(ans, sum);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
const int N = 1e6 + 5, M = 1e9 + 7;
const ull base = 13331;
const double Pi = acos(-1.0);
const ll C = 299792458;
char a[N];
struct node {
int x, v;
} h[N];
int main() {
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int tot = 0;
int l = 1, r = 1;
for (l = 1, r = 1; r <= n && l <= n; r++) {
if (a[r] == a[l])
continue;
else {
h[++tot].x = a[l] - '0';
h[tot].v = r - l;
l = r;
}
}
h[++tot].x = a[l] - '0';
h[tot].v = r - l;
int sum = 0;
int ans = 0;
for (int i = 1; i <= 2 * k; i++) {
sum += h[i].v;
}
if (h[2 * k].x == 0)
ans = max(ans, sum + h[2 * k + 1].v);
else
ans = max(ans, sum);
for (l = 2, r = 2 * k + 1; r + 1 <= n; l++, r++) {
sum -= h[l - 1].v;
sum += h[r].v;
if (h[r].x == 0) {
ans = max(ans, sum + h[r + 1].v);
} else
ans = max(ans, sum);
}
cout << ans << endl;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
const ll MOD = 1000000007;
const ll nmax = 8;
const ll INF = 1e9;
bool graph[nmax][nmax];
vector<vector<ll>> dist = vector<vector<ll>>(nmax, vector<ll>(nmax, INF));
void warshall_floyd(ll n) {
for (size_t i = 0; i < n; i++) {
for (size_t j = 0; j < n; j++) {
for (size_t k = 0; k < n; k++) {
dist[j][k] = min(dist[j][k], dist[j][i] + dist[i][k]);
}
}
}
}
class UnionFind {
public:
vector<ll> Parent;
UnionFind(ll N) { Parent = vector<ll>(N, -1); }
ll find(ll A) {
if (Parent[A] < 0)
return A;
return Parent[A] = find(Parent[A]);
}
ll size(ll A) { return -Parent[find(A)]; }
bool Union(ll A, ll B) {
A = find(A);
B = find(B);
if (A == B) {
return false;
}
if (size(A) < size(B))
swap(A, B);
Parent[A] += Parent[B];
Parent[B] = A;
return true;
}
};
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b;
}
ll mulMod(ll a, ll b) { return (((a % MOD) * (b % MOD)) % MOD); }
ll powMod(ll a, ll p) {
if (p == 0) {
return 1;
} else if (p % 2 == 0) {
ll half = powMod(a, p / 2);
return mulMod(half, half);
} else {
return mulMod(powMod(a, p - 1), a);
}
}
void solve(long long N, long long K, string S) {
vector<ll> map;
bool isZero;
bool firstZero;
if (S[0] == '0') {
isZero = true;
firstZero = true;
map.push_back(0);
} else {
isZero = false;
firstZero = false;
}
int cnt = 0;
for (int i = 0; i < N; i++) {
if (isZero) {
if (S[i] == '1') {
map.push_back(cnt);
cnt = 0;
isZero = false;
}
} else {
if (S[i] == '0') {
map.push_back(cnt);
cnt = 0;
isZero = true;
}
}
cnt++;
}
if (cnt != 0)
map.push_back(cnt);
if (map.size() % 2 == 0)
map.push_back(0);
int limit = 2 * K + 1;
int ans = 0;
for (int i = 0; i < map.size(); i += 2) {
int tmp = 0;
int left = i;
int right = min(i + limit, (int)map.size());
for (int j = i; j < i + limit; j++) {
tmp += map[j];
}
ans = max(tmp, ans);
}
cout << ans << endl;
}
int main() {
long long N;
scanf("%lld", &N);
long long K;
scanf("%lld", &K);
string S;
cin >> S;
solve(N, K, S);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
const ll MOD = 1000000007;
const ll nmax = 8;
const ll INF = 1e9;
bool graph[nmax][nmax];
vector<vector<ll>> dist = vector<vector<ll>>(nmax, vector<ll>(nmax, INF));
void warshall_floyd(ll n) {
for (size_t i = 0; i < n; i++) {
for (size_t j = 0; j < n; j++) {
for (size_t k = 0; k < n; k++) {
dist[j][k] = min(dist[j][k], dist[j][i] + dist[i][k]);
}
}
}
}
class UnionFind {
public:
vector<ll> Parent;
UnionFind(ll N) { Parent = vector<ll>(N, -1); }
ll find(ll A) {
if (Parent[A] < 0)
return A;
return Parent[A] = find(Parent[A]);
}
ll size(ll A) { return -Parent[find(A)]; }
bool Union(ll A, ll B) {
A = find(A);
B = find(B);
if (A == B) {
return false;
}
if (size(A) < size(B))
swap(A, B);
Parent[A] += Parent[B];
Parent[B] = A;
return true;
}
};
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b;
}
ll mulMod(ll a, ll b) { return (((a % MOD) * (b % MOD)) % MOD); }
ll powMod(ll a, ll p) {
if (p == 0) {
return 1;
} else if (p % 2 == 0) {
ll half = powMod(a, p / 2);
return mulMod(half, half);
} else {
return mulMod(powMod(a, p - 1), a);
}
}
void solve(long long N, long long K, string S) {
vector<ll> map;
bool isZero;
bool firstZero;
if (S[0] == '0') {
isZero = true;
firstZero = true;
map.push_back(0);
} else {
isZero = false;
firstZero = false;
}
int cnt = 0;
for (int i = 0; i < N; i++) {
if (isZero) {
if (S[i] == '1') {
map.push_back(cnt);
cnt = 0;
isZero = false;
}
} else {
if (S[i] == '0') {
map.push_back(cnt);
cnt = 0;
isZero = true;
}
}
cnt++;
}
if (cnt != 0)
map.push_back(cnt);
if (map.size() % 2 == 0)
map.push_back(0);
int limit = 2 * K + 1;
int ans = 0;
for (int i = 0; i < map.size(); i += 2) {
int tmp = 0;
int left = i;
int right = min(i + limit, (int)map.size());
for (int j = i; j < right; j++) {
tmp += map[j];
}
ans = max(tmp, ans);
}
cout << ans << endl;
}
int main() {
long long N;
scanf("%lld", &N);
long long K;
scanf("%lld", &K);
string S;
cin >> S;
solve(N, K, S);
return 0;
}
| replace | 117 | 118 | 117 | 118 | 0 | |
p03074 | C++ | Runtime Error |
#include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <float.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
// #include<assert.h>
#include <random>
using namespace std;
#define int long long
#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807LL
#define I64_MAX2 1223372036854775807LL
#define INF I64_MAX2
#define MOD 1000000007
// #define MOD 998244353
#define MEM_SIZE 10000
#define DEBUG_OUT true
#define ALL(x) (x).begin(), (x).end()
template <typename T> void DEBUG(T e) {
if (DEBUG_OUT == false)
return;
std::cout << e << " ";
}
template <typename T> void DEBUG(const std::vector<T> &v) {
if (DEBUG_OUT == false)
return;
for (const auto &e : v) {
std::cout << e << " ";
}
std::cout << std::endl;
}
template <typename T> void DEBUG(const std::vector<std::vector<T>> &vv) {
if (DEBUG_OUT == false)
return;
for (const auto &v : vv) {
DEBUG(v);
}
}
template <class T, class... Ts> void DEBUG(T d, Ts... e) {
if (DEBUG_OUT == false)
return;
DEBUG(d);
DEBUG(e...);
}
template <class T> void corner(bool flg, T hoge) {
if (flg) {
cout << hoge << endl;
abort();
}
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
return a > b && (a = b, true);
}
void solve(void) {
int N, K;
cin >> N >> K;
string str;
cin >> str;
vector<pair<int, int>> vp;
vp.emplace_back(-1, 0);
for (int i = 0; i < str.size(); i++) {
int X = str[i] - '0';
if (i == 0) {
vp.emplace_back(X, 1);
continue;
}
if (vp.back().first == X) {
vp.back().second++;
} else {
vp.emplace_back(X, 1);
}
}
for (int i = 0; i < vp.size(); i++) {
vp[i + 1].second += vp[i].second;
}
int res = 0;
for (int i = 1; i <= vp.size() - 1; i++) {
int P = -1;
if (vp[i].first == 0) {
P = i + 2 * K - 1;
} else {
P = i + 2 * K;
}
if (P >= vp.size())
P = (int)vp.size() - 1;
chmax(res, vp[P].second - vp[i - 1].second);
}
// for (auto &&i : vp)
// {
// cout<<i.first<<" "<<i.second<<endl;
// }
cout << res << endl;
return;
}
int32_t main(int32_t argc, const char *argv[]) {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
std::cout << std::fixed;
std::cout << std::setprecision(11);
solve();
return 0;
}
|
#include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <float.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
// #include<assert.h>
#include <random>
using namespace std;
#define int long long
#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807LL
#define I64_MAX2 1223372036854775807LL
#define INF I64_MAX2
#define MOD 1000000007
// #define MOD 998244353
#define MEM_SIZE 10000
#define DEBUG_OUT true
#define ALL(x) (x).begin(), (x).end()
template <typename T> void DEBUG(T e) {
if (DEBUG_OUT == false)
return;
std::cout << e << " ";
}
template <typename T> void DEBUG(const std::vector<T> &v) {
if (DEBUG_OUT == false)
return;
for (const auto &e : v) {
std::cout << e << " ";
}
std::cout << std::endl;
}
template <typename T> void DEBUG(const std::vector<std::vector<T>> &vv) {
if (DEBUG_OUT == false)
return;
for (const auto &v : vv) {
DEBUG(v);
}
}
template <class T, class... Ts> void DEBUG(T d, Ts... e) {
if (DEBUG_OUT == false)
return;
DEBUG(d);
DEBUG(e...);
}
template <class T> void corner(bool flg, T hoge) {
if (flg) {
cout << hoge << endl;
abort();
}
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
return a > b && (a = b, true);
}
void solve(void) {
int N, K;
cin >> N >> K;
string str;
cin >> str;
vector<pair<int, int>> vp;
vp.emplace_back(-1, 0);
for (int i = 0; i < str.size(); i++) {
int X = str[i] - '0';
if (i == 0) {
vp.emplace_back(X, 1);
continue;
}
if (vp.back().first == X) {
vp.back().second++;
} else {
vp.emplace_back(X, 1);
}
}
for (int i = 0; i < vp.size() - 1; i++) {
vp[i + 1].second += vp[i].second;
}
int res = 0;
for (int i = 1; i <= vp.size() - 1; i++) {
int P = -1;
if (vp[i].first == 0) {
P = i + 2 * K - 1;
} else {
P = i + 2 * K;
}
if (P >= vp.size())
P = (int)vp.size() - 1;
chmax(res, vp[P].second - vp[i - 1].second);
}
// for (auto &&i : vp)
// {
// cout<<i.first<<" "<<i.second<<endl;
// }
cout << res << endl;
return;
}
int32_t main(int32_t argc, const char *argv[]) {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
std::cout << std::fixed;
std::cout << std::setprecision(11);
solve();
return 0;
}
| replace | 99 | 100 | 99 | 100 | 0 | |
p03074 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <float.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
#define int long long
#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807LL
#define I64_MAX2 1223372036854775807LL
#define INF I64_MAX2
#define MOD 1000000007
// #define MOD 998244353
#define MEM_SIZE 10000
#define DEBUG_OUT true
#define ALL(x) (x).begin(), (x).end()
template <typename T> void DEBUG(T e) {
if (DEBUG_OUT == false)
return;
std::cout << e << " ";
}
template <typename T> void DEBUG(const std::vector<T> &v) {
if (DEBUG_OUT == false)
return;
for (const auto &e : v) {
std::cout << e << " ";
}
std::cout << std::endl;
}
template <typename T> void DEBUG(const std::vector<std::vector<T>> &vv) {
if (DEBUG_OUT == false)
return;
for (const auto &v : vv) {
DEBUG(v);
}
}
template <class T, class... Ts> void DEBUG(T d, Ts... e) {
if (DEBUG_OUT == false)
return;
DEBUG(d);
DEBUG(e...);
}
template <class T> void corner(bool flg, T hoge) {
if (flg) {
cout << hoge << endl;
abort();
}
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
return a > b && (a = b, true);
}
void solve(void) {
int N, K;
cin >> N;
cin >> K;
vector<pair<int, int>> vp;
vp.emplace_back(-1, 0);
for (int i = 0; i < N; i++) {
char X;
cin >> X;
int x = X - '0';
if (vp.empty() || vp.back().first != x) {
vp.push_back(make_pair(x, 1));
} else {
vp.back().second++;
}
}
for (int i = 0; i < N - 1; i++) {
vp[i + 1].second += vp[i].second;
}
// for (int i = 0; i < vp.size(); i++)
// {
// cout<<vp[i].first<<" "<<vp[i].second<<endl;
// }
int ANS = 0;
for (int i = 1; i <= (int)vp.size() - 1; i++) {
int l = i;
int r;
if (vp[i].first == 1) {
r = l + 2 * K;
} else {
r = l + 2 * (K)-1;
}
l--;
if (r >= vp.size())
r = (int)vp.size() - 1;
if (l >= vp.size())
l = (int)vp.size() - 1;
chmax(ANS, vp[r].second - vp[l].second);
}
cout << ANS << endl;
return;
}
int32_t main(int32_t argc, const char *argv[]) {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
std::cout << std::fixed;
std::cout << std::setprecision(11);
solve();
return 0;
}
| #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <float.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
#define int long long
#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807LL
#define I64_MAX2 1223372036854775807LL
#define INF I64_MAX2
#define MOD 1000000007
// #define MOD 998244353
#define MEM_SIZE 10000
#define DEBUG_OUT true
#define ALL(x) (x).begin(), (x).end()
template <typename T> void DEBUG(T e) {
if (DEBUG_OUT == false)
return;
std::cout << e << " ";
}
template <typename T> void DEBUG(const std::vector<T> &v) {
if (DEBUG_OUT == false)
return;
for (const auto &e : v) {
std::cout << e << " ";
}
std::cout << std::endl;
}
template <typename T> void DEBUG(const std::vector<std::vector<T>> &vv) {
if (DEBUG_OUT == false)
return;
for (const auto &v : vv) {
DEBUG(v);
}
}
template <class T, class... Ts> void DEBUG(T d, Ts... e) {
if (DEBUG_OUT == false)
return;
DEBUG(d);
DEBUG(e...);
}
template <class T> void corner(bool flg, T hoge) {
if (flg) {
cout << hoge << endl;
abort();
}
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
return a > b && (a = b, true);
}
void solve(void) {
int N, K;
cin >> N;
cin >> K;
vector<pair<int, int>> vp;
vp.emplace_back(-1, 0);
for (int i = 0; i < N; i++) {
char X;
cin >> X;
int x = X - '0';
if (vp.empty() || vp.back().first != x) {
vp.push_back(make_pair(x, 1));
} else {
vp.back().second++;
}
}
for (int i = 0; i < vp.size(); i++) {
vp[i + 1].second += vp[i].second;
}
// for (int i = 0; i < vp.size(); i++)
// {
// cout<<vp[i].first<<" "<<vp[i].second<<endl;
// }
int ANS = 0;
for (int i = 1; i <= (int)vp.size() - 1; i++) {
int l = i;
int r;
if (vp[i].first == 1) {
r = l + 2 * K;
} else {
r = l + 2 * (K)-1;
}
l--;
if (r >= vp.size())
r = (int)vp.size() - 1;
if (l >= vp.size())
l = (int)vp.size() - 1;
chmax(ANS, vp[r].second - vp[l].second);
}
cout << ANS << endl;
return;
}
int32_t main(int32_t argc, const char *argv[]) {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
std::cout << std::fixed;
std::cout << std::setprecision(11);
solve();
return 0;
}
| replace | 98 | 99 | 98 | 99 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define all(v) v.begin(), v.end()
#define mod 1000000007
//'A' = 65, 'Z' = 90, 'a' = 97, 'z' = 122
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> t;
int now = 1;
int cnt = 0;
rep(i, 0, n) {
if (s[i] == (char)(now + '0'))
cnt++;
else {
t.push_back(cnt);
now = 1 - now;
cnt = 1;
}
}
t.push_back(cnt);
if ((int)t.size() % 2 == 0)
t.push_back(0);
int ans = 0;
int len = t.size();
for (int i = 0; i < len; i += 2) {
int left = i;
int right = left + 2 * k;
int tmp = 0;
for (int j = left; j <= right; j++) {
tmp += t[j];
}
ans = max(ans, tmp);
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define all(v) v.begin(), v.end()
#define mod 1000000007
//'A' = 65, 'Z' = 90, 'a' = 97, 'z' = 122
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> t;
int now = 1;
int cnt = 0;
rep(i, 0, n) {
if (s[i] == (char)(now + '0'))
cnt++;
else {
t.push_back(cnt);
now = 1 - now;
cnt = 1;
}
}
t.push_back(cnt);
if ((int)t.size() % 2 == 0)
t.push_back(0);
int ans = 0;
int len = t.size();
for (int i = 0; i < len; i += 2) {
int left = i;
int right = min(left + 2 * k, len - 1);
int tmp = 0;
for (int j = left; j <= right; j++) {
tmp += t[j];
}
ans = max(ans, tmp);
}
cout << ans << endl;
return 0;
}
| replace | 34 | 35 | 34 | 35 | 0 | |
p03074 | C++ | Runtime Error | /*
* Matheus Oliveira
* 01:55:36 14/04/2019
* abc124d.cpp
*/
#include <bits/stdc++.h>
using namespace std;
#define EPS
#define INF
#define MAXN 100100
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define debug(x) printf("%s: %d\n", #x, x);
#define debugarr(x, ini, fim) \
printf("%s: ", #x); \
for (int i = ini; i <= fim; i++) \
printf("%d%c", x[i], (i == fim) ? '\n' : ' ');
typedef long long ll;
typedef pair<int, int> pii;
char inp[MAXN];
vector<pii> ilhas0, ilhas1;
int main() {
int n, k, ans, extra1, actual;
ans = 0;
scanf("%d %d", &n, &k);
getchar();
scanf("%s", inp);
int counter0 = 0, counter1 = 0;
for (int i = 0; i < n; i++) {
if (inp[i] == '1') {
if (counter0 > 0) {
ilhas0.pb(mp(counter0, counter1));
counter1 = 1;
} else
counter1++;
counter0 = 0;
} else
counter0++;
}
extra1 = 0;
if (counter0 > 0) {
ilhas0.pb(mp(counter0, counter1));
counter1 = 1;
} else
extra1 = counter1;
// for(int i = 0; i < ((int) ilhas0.size()); i++) {
// printf("%d 0's, %d 1's\n", ilhas0[i].first, ilhas0[i].second);
// }
if (k >= (int)ilhas0.size())
printf("%d\n", n);
else {
int p1, p2;
p1 = p2 = 0;
ans = 0;
actual = ilhas0[p1].first + ilhas0[p1].second;
if (p1 + 1 < ((int)ilhas0.size()))
actual += ilhas0[p1 + 1].second;
else
actual += extra1;
while (p1 < ((int)ilhas0.size())) {
// printf("p1: %d, p2: %d, actual: %d\n", p1, p2, actual);
if (p2 - p1 + 1 < k) {
p2++;
actual += ilhas0[p2].first; // + ilhas0[p1].second;
if (p2 + 1 < ((int)ilhas0.size()))
actual += ilhas0[p2 + 1].second;
else
actual += extra1;
ans = max(ans, actual);
} else {
ans = max(ans, actual);
actual -= ilhas0[p1].first + ilhas0[p1].second;
// if(p1 == ((int) ilhas0.size()) - 1) actual -= extra1;
p1++;
}
}
printf("%d\n", ans);
}
return 0;
}
| /*
* Matheus Oliveira
* 01:55:36 14/04/2019
* abc124d.cpp
*/
#include <bits/stdc++.h>
using namespace std;
#define EPS
#define INF
#define MAXN 100100
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define debug(x) printf("%s: %d\n", #x, x);
#define debugarr(x, ini, fim) \
printf("%s: ", #x); \
for (int i = ini; i <= fim; i++) \
printf("%d%c", x[i], (i == fim) ? '\n' : ' ');
typedef long long ll;
typedef pair<int, int> pii;
char inp[MAXN];
vector<pii> ilhas0, ilhas1;
int main() {
int n, k, ans, extra1, actual;
ans = 0;
scanf("%d %d", &n, &k);
getchar();
scanf("%s", inp);
int counter0 = 0, counter1 = 0;
for (int i = 0; i < n; i++) {
if (inp[i] == '1') {
if (counter0 > 0) {
ilhas0.pb(mp(counter0, counter1));
counter1 = 1;
} else
counter1++;
counter0 = 0;
} else
counter0++;
}
extra1 = 0;
if (counter0 > 0) {
ilhas0.pb(mp(counter0, counter1));
counter1 = 1;
} else
extra1 = counter1;
// for(int i = 0; i < ((int) ilhas0.size()); i++) {
// printf("%d 0's, %d 1's\n", ilhas0[i].first, ilhas0[i].second);
// }
if (k >= (int)ilhas0.size())
printf("%d\n", n);
else {
int p1, p2;
p1 = p2 = 0;
ans = 0;
actual = ilhas0[p1].first + ilhas0[p1].second;
if (p1 + 1 < ((int)ilhas0.size()))
actual += ilhas0[p1 + 1].second;
else
actual += extra1;
while (p1 < ((int)ilhas0.size())) {
// printf("p1: %d, p2: %d, actual: %d\n", p1, p2, actual);
if (p2 - p1 + 1 < k and p2 < ((int)ilhas0.size())) {
p2++;
actual += ilhas0[p2].first; // + ilhas0[p1].second;
if (p2 + 1 < ((int)ilhas0.size()))
actual += ilhas0[p2 + 1].second;
else
actual += extra1;
ans = max(ans, actual);
} else {
ans = max(ans, actual);
actual -= ilhas0[p1].first + ilhas0[p1].second;
// if(p1 == ((int) ilhas0.size()) - 1) actual -= extra1;
p1++;
}
}
printf("%d\n", ans);
}
return 0;
}
| replace | 76 | 77 | 76 | 77 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(false);
cout.precision(20);
}
} fast;
/* define */
#define FOR(I, X, Y) for (long long(I) = (X); (I) < (Y); (I)++)
#define REP(I, X, Y) for (long long(I) = (Y)-1; (I) >= (X); (I)--)
#define ALL(X) (X).begin(), (X).end()
#define pb push_back
#define COUNT(V, X) \
(upper_bound((V).begin(), (V).end(), X) - \
lower_bound((V).begin(), (V).end(), X))
#define debug(x) cerr << #x << ':' << x << endl;
#define DEBUG(v) \
cerr << #v << ':'; \
for (auto xXx : v) \
cerr << xXx << ' '; \
cerr << endl;
#define Yes(X) \
if (X) { \
cout << "Yes" << endl; \
} else { \
cout << "No" << endl; \
}
#define YES(X) \
if (X) { \
cout << "YES" << endl; \
} else { \
cout << "NO" << endl; \
}
#define ctoi(C) (C - '0')
#define pow2(x) ((long long)((long long)1 << x))
/* alias */
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vii = vector<vector<int>>;
using vl = vector<long long>;
using vll = vector<vector<long long>>;
using pi = pair<int, int>;
using pl = pair<long long, long long>;
template <typename T> using PQ = priority_queue<T>;
template <typename T> using minPQ = priority_queue<T, vector<T>, greater<T>>;
/* const */
const long long dx[] = {1, 0, -1, 0};
const long long dy[] = {0, 1, 0, -1};
const long long dx8[] = {1, 1, 0, -1, -1, -1, 0, 1};
const long long dy8[] = {0, 1, 1, 1, 0, -1, -1, -1};
const long long dx9[] = {1, 1, 0, -1, -1, -1, 0, 1, 0};
const long long dy9[] = {0, 1, 1, 1, 0, -1, -1, -1, 0};
const int INF = 1000000007;
const long long LINF = 1000000000000000007;
/* func */
template <typename T> inline bool chmin(T &a, const T &b) {
if (a > b)
a = b;
return a > b;
}
template <typename T> inline bool chmax(T &a, const T &b) {
if (a < b)
a = b;
return a < b;
}
long long max(long long x, int y) { return max(x, (long long)y); }
long long max(int x, long long y) { return max((long long)x, y); }
long long min(long long x, int y) { return min(x, (long long)y); }
long long min(int x, long long y) { return min((long long)x, y); }
/* liblary */
/* main */
signed main() {
ll N, K;
cin >> N >> K;
string S;
cin >> S;
S += 'p';
vl v;
for (int i = 0; i < N;) {
ll l = i;
while (i < N && S[i] == S[l]) {
i++;
}
ll r = i;
v.push_back(r - l);
}
FOR(i, 0, N - 1) v[i + 1] += v[i];
ll ans = 0;
if (S[0] == '0') {
FOR(i, 0, v.size()) {
ll tmp = v[max(min(v.size() - 1, i + 2 * K - (i % 2 ? 0 : 1)), 0)] -
(i ? v[i - 1] : 0);
chmax(ans, tmp);
}
} else {
FOR(i, 0, v.size()) {
ll tmp = v[max(min(v.size() - 1, i + 2 * K - (i % 2 ? 1 : 0)), 0)] -
(i ? v[i - 1] : 0);
chmax(ans, tmp);
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(false);
cout.precision(20);
}
} fast;
/* define */
#define FOR(I, X, Y) for (long long(I) = (X); (I) < (Y); (I)++)
#define REP(I, X, Y) for (long long(I) = (Y)-1; (I) >= (X); (I)--)
#define ALL(X) (X).begin(), (X).end()
#define pb push_back
#define COUNT(V, X) \
(upper_bound((V).begin(), (V).end(), X) - \
lower_bound((V).begin(), (V).end(), X))
#define debug(x) cerr << #x << ':' << x << endl;
#define DEBUG(v) \
cerr << #v << ':'; \
for (auto xXx : v) \
cerr << xXx << ' '; \
cerr << endl;
#define Yes(X) \
if (X) { \
cout << "Yes" << endl; \
} else { \
cout << "No" << endl; \
}
#define YES(X) \
if (X) { \
cout << "YES" << endl; \
} else { \
cout << "NO" << endl; \
}
#define ctoi(C) (C - '0')
#define pow2(x) ((long long)((long long)1 << x))
/* alias */
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vii = vector<vector<int>>;
using vl = vector<long long>;
using vll = vector<vector<long long>>;
using pi = pair<int, int>;
using pl = pair<long long, long long>;
template <typename T> using PQ = priority_queue<T>;
template <typename T> using minPQ = priority_queue<T, vector<T>, greater<T>>;
/* const */
const long long dx[] = {1, 0, -1, 0};
const long long dy[] = {0, 1, 0, -1};
const long long dx8[] = {1, 1, 0, -1, -1, -1, 0, 1};
const long long dy8[] = {0, 1, 1, 1, 0, -1, -1, -1};
const long long dx9[] = {1, 1, 0, -1, -1, -1, 0, 1, 0};
const long long dy9[] = {0, 1, 1, 1, 0, -1, -1, -1, 0};
const int INF = 1000000007;
const long long LINF = 1000000000000000007;
/* func */
template <typename T> inline bool chmin(T &a, const T &b) {
if (a > b)
a = b;
return a > b;
}
template <typename T> inline bool chmax(T &a, const T &b) {
if (a < b)
a = b;
return a < b;
}
long long max(long long x, int y) { return max(x, (long long)y); }
long long max(int x, long long y) { return max((long long)x, y); }
long long min(long long x, int y) { return min(x, (long long)y); }
long long min(int x, long long y) { return min((long long)x, y); }
/* liblary */
/* main */
signed main() {
ll N, K;
cin >> N >> K;
string S;
cin >> S;
S += 'p';
vl v;
for (int i = 0; i < N;) {
ll l = i;
while (i < N && S[i] == S[l]) {
i++;
}
ll r = i;
v.push_back(r - l);
}
FOR(i, 0, v.size() - 1) v[i + 1] += v[i];
ll ans = 0;
if (S[0] == '0') {
FOR(i, 0, v.size()) {
ll tmp = v[max(min(v.size() - 1, i + 2 * K - (i % 2 ? 0 : 1)), 0)] -
(i ? v[i - 1] : 0);
chmax(ans, tmp);
}
} else {
FOR(i, 0, v.size()) {
ll tmp = v[max(min(v.size() - 1, i + 2 * K - (i % 2 ? 1 : 0)), 0)] -
(i ? v[i - 1] : 0);
chmax(ans, tmp);
}
}
cout << ans << endl;
} | replace | 96 | 97 | 96 | 97 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> nums;
int tmp = 1;
int cnt = 0;
for (int i = 0; i < N; i++) {
if (S[i] == (char)('0' + tmp)) {
cnt++;
} else {
nums.push_back(cnt);
cnt = 1;
tmp = 1 - tmp;
}
}
if (cnt != 0)
nums.push_back(cnt);
if ((int)nums.size() % 2 == 0)
nums.push_back(0);
int maxNum = 0;
for (int i = 0; i < (int)nums.size(); i += 2) {
int tmp = 0;
for (int j = 0; j < K * 2 + 1; j++) {
tmp += (int)nums[i + j];
}
maxNum = max(maxNum, tmp);
}
cout << maxNum << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> nums;
int tmp = 1;
int cnt = 0;
for (int i = 0; i < N; i++) {
if (S[i] == (char)('0' + tmp)) {
cnt++;
} else {
nums.push_back(cnt);
cnt = 1;
tmp = 1 - tmp;
}
}
if (cnt != 0)
nums.push_back(cnt);
if ((int)nums.size() % 2 == 0)
nums.push_back(0);
int maxNum = 0;
for (int i = 0; i < (int)nums.size(); i += 2) {
int tmp = 0;
for (int j = 0; (j < K * 2 + 1) && (i + j < (int)nums.size()); j++) {
tmp += (int)nums[i + j];
}
maxNum = max(maxNum, tmp);
}
cout << maxNum << endl;
}
| replace | 31 | 32 | 31 | 32 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
int main() {
int n, k, sum = 0;
int ans = 0;
cin >> n >> k;
string s;
cin >> s;
vector<int> a;
int count = 1;
if (s[0] == '0')
a.push_back(0);
rep(i, n - 1) {
if (s[i] == s[i + 1])
count++;
else {
a.push_back(count);
count = 1;
}
}
a.push_back(count);
if (s[n - 1] == '0')
a.push_back(0);
if (a.size() == 1) {
cout << a[0] << endl;
return 0;
}
k = k * 2 + 1;
rep(i, k) sum += a[i];
ans = sum;
int l = 0;
int r = k;
rep(i, (a.size() - k) / 2) {
sum -= a[l];
l++;
sum -= a[l];
l++;
sum += a[r];
r++;
sum += a[r];
r++;
ans = max(sum, ans);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
int main() {
int n, k, sum = 0;
int ans = 0;
cin >> n >> k;
string s;
cin >> s;
vector<int> a;
int count = 1;
if (s[0] == '0')
a.push_back(0);
rep(i, n - 1) {
if (s[i] == s[i + 1])
count++;
else {
a.push_back(count);
count = 1;
}
}
a.push_back(count);
if (s[n - 1] == '0')
a.push_back(0);
if (a.size() == 1) {
cout << a[0] << endl;
return 0;
}
k = k * 2 + 1;
if (k >= a.size()) {
rep(i, a.size()) sum += a[i];
cout << sum << endl;
return 0;
}
rep(i, k) sum += a[i];
ans = sum;
int l = 0;
int r = k;
rep(i, (a.size() - k) / 2) {
sum -= a[l];
l++;
sum -= a[l];
l++;
sum += a[r];
r++;
sum += a[r];
r++;
ans = max(sum, ans);
}
cout << ans << endl;
return 0;
} | insert | 34 | 34 | 34 | 39 | 0 | |
p03074 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> Nums;
// 1-0-1-0-1-0を作りたい。
int now = 1;
int cnt = 0;
for (int i = 0; i < N; i++) {
if (S[i] == (char)('0' + now))
cnt++;
else {
Nums.push_back(cnt);
// ０と1を切り替える。
now = 1 - now;
cnt = 1;
}
}
// 最後が加えられてなかったら加える
if (cnt != 0)
Nums.push_back(cnt);
// 1-0-1-0のようにするには偶数にならないといけない。偶数じゃなかったら最後の0が足りてないってことだから0を足してあげる。
if (Nums.size() % 2 == 0)
Nums.push_back(0);
// 今回の見る範囲
int Add = 2 * K + 1;
// 事前に変化していく変数を用意する。
int left = 0;
int right = 0;
int tmp = 0; // leftからrightを含めないまでの合計
int ans = 0;
for (int i = 0; i < Nums.size(); i += 2) {
// 移動していくゴール地点を用意。
int Nextleft = i;
int Nextright = i + Add;
// ゴール地点に行くまで、左は減らしてみぎは足していく。
while (Nextleft > left) {
tmp -= Nums[left];
left++;
}
while (Nextright > right) {
tmp += Nums[right];
right++;
}
ans = max(ans, tmp);
}
cout << ans << endl;
return 0;
}
| #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> Nums;
// 1-0-1-0-1-0を作りたい。
int now = 1;
int cnt = 0;
for (int i = 0; i < N; i++) {
if (S[i] == (char)('0' + now))
cnt++;
else {
Nums.push_back(cnt);
// ０と1を切り替える。
now = 1 - now;
cnt = 1;
}
}
// 最後が加えられてなかったら加える
if (cnt != 0)
Nums.push_back(cnt);
// 1-0-1-0のようにするには偶数にならないといけない。偶数じゃなかったら最後の0が足りてないってことだから0を足してあげる。
if (Nums.size() % 2 == 0)
Nums.push_back(0);
// 今回の見る範囲
int Add = 2 * K + 1;
// 事前に変化していく変数を用意する。
int left = 0;
int right = 0;
int tmp = 0; // leftからrightを含めないまでの合計
int ans = 0;
for (int i = 0; i < Nums.size(); i += 2) {
// 移動していくゴール地点を用意。
int Nextleft = i;
int Nextright = min(i + Add, (int)Nums.size());
// ゴール地点に行くまで、左は減らしてみぎは足していく。
while (Nextleft > left) {
tmp -= Nums[left];
left++;
}
while (Nextright > right) {
tmp += Nums[right];
right++;
}
ans = max(ans, tmp);
}
cout << ans << endl;
return 0;
}
| replace | 47 | 48 | 47 | 48 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// types
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
typedef vector<ll> vll;
// macros
#define ALL(a) a.begin(), a.end()
#define SZ(a) ((int)a.size())
#define FI first
#define SE second
#define REP(i, n) for (int i = 0; i < ((int)n); i++)
#define REP1(i, n) for (int i = 1; i < ((int)n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define PB push_back
#define EB emplace_back
#define MP(a, b) make_pair(a, b)
#define SORT_UNIQUE(c) \
(sort(c.begin(), c.end()), \
c.resize(distance(c.begin(), unique(c.begin(), c.end()))))
#define GET_POS(c, x) (lower_bound(c.begin(), c.end(), x) - c.begin())
#define Decimal fixed << setprecision(20)
#define INF 1000000000
#define LLINF 1000000000000000000LL
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double eps = 1e-10;
const int MOD = 1e9 + 7;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n, k;
cin >> n >> k;
string s;
cin >> s;
vll v;
ll cnt = 1;
char p = s[0];
if (s[0] == '0')
v.push_back(0);
REP1(i, n) {
if (p != s[i]) {
v.push_back(cnt);
cnt = 1;
p = s[i];
} else
cnt++;
}
v.push_back(cnt);
if (s[n - 1] == '0')
v.push_back(0);
ll now = 0;
ll w_size = k * 2 + 1;
REP(i, w_size)
now += v[i];
ll ans = now;
for (int i = w_size; i + 1 < v.size(); i += 2) {
now += v[i] + v[i + 1] - (v[i - w_size] + v[i - w_size + 1]);
ans = max(ans, now);
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
// types
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
typedef vector<ll> vll;
// macros
#define ALL(a) a.begin(), a.end()
#define SZ(a) ((int)a.size())
#define FI first
#define SE second
#define REP(i, n) for (int i = 0; i < ((int)n); i++)
#define REP1(i, n) for (int i = 1; i < ((int)n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define PB push_back
#define EB emplace_back
#define MP(a, b) make_pair(a, b)
#define SORT_UNIQUE(c) \
(sort(c.begin(), c.end()), \
c.resize(distance(c.begin(), unique(c.begin(), c.end()))))
#define GET_POS(c, x) (lower_bound(c.begin(), c.end(), x) - c.begin())
#define Decimal fixed << setprecision(20)
#define INF 1000000000
#define LLINF 1000000000000000000LL
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double eps = 1e-10;
const int MOD = 1e9 + 7;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n, k;
cin >> n >> k;
string s;
cin >> s;
vll v;
ll cnt = 1;
char p = s[0];
if (s[0] == '0')
v.push_back(0);
REP1(i, n) {
if (p != s[i]) {
v.push_back(cnt);
cnt = 1;
p = s[i];
} else
cnt++;
}
v.push_back(cnt);
if (s[n - 1] == '0')
v.push_back(0);
ll now = 0;
ll w_size = min(ll(v.size()), k * 2 + 1);
REP(i, w_size)
now += v[i];
ll ans = now;
for (int i = w_size; i + 1 < v.size(); i += 2) {
now += v[i] + v[i + 1] - (v[i - w_size] + v[i - w_size + 1]);
ans = max(ans, now);
}
cout << ans << endl;
}
| replace | 66 | 67 | 66 | 67 | 0 | |
p03074 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
const int64_t cc = pow(10, 9) + 7;
int main() {
int64_t a, b, c, d;
std::cin >> a;
std::cin >> b;
std::string str;
std::cin >> str;
std::vector<int64_t> list;
std::vector<int64_t> zero_list;
char s = str[0];
c = 0;
for (int i = 0; i < str.size(); i++) {
if (s != str[i]) {
if (s == '1') {
list.push_back(c);
} else {
list.push_back(c * -1);
zero_list.push_back(list.size() - 1);
}
c = 0;
s = str[i];
}
c += 1;
}
if (s == '1') {
list.push_back(c);
} else {
list.push_back(c * -1);
zero_list.push_back(list.size() - 1);
}
int64_t start = 0;
int64_t finish = 0;
int64_t answer = 0;
if (!zero_list.empty()) {
for (int i = 0; i <= zero_list.size() - b; i++) {
int instance = 0;
if (i + b >= zero_list.size()) {
finish = list.size() - 1;
} else {
finish = zero_list[i + b] - 1;
}
// std::cout<< start << " " << finish <<"\n";
for (int r = start; r <= finish; r++) {
instance += abs(list[r]);
}
if (answer < instance) {
answer = instance;
}
start = zero_list[i] + 1;
}
} else {
answer = str.size();
}
std::cout << answer;
}
| #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
const int64_t cc = pow(10, 9) + 7;
int main() {
int64_t a, b, c, d;
std::cin >> a;
std::cin >> b;
std::string str;
std::cin >> str;
std::vector<int64_t> list;
std::vector<int64_t> zero_list;
char s = str[0];
c = 0;
for (int i = 0; i < str.size(); i++) {
if (s != str[i]) {
if (s == '1') {
list.push_back(c);
} else {
list.push_back(c * -1);
zero_list.push_back(list.size() - 1);
}
c = 0;
s = str[i];
}
c += 1;
}
if (s == '1') {
list.push_back(c);
} else {
list.push_back(c * -1);
zero_list.push_back(list.size() - 1);
}
int64_t start = 0;
int64_t finish = 0;
int64_t answer = 0;
if (!zero_list.empty() && b < zero_list.size()) {
for (int i = 0; i <= zero_list.size() - b; i++) {
int instance = 0;
if (i + b >= zero_list.size()) {
finish = list.size() - 1;
} else {
finish = zero_list[i + b] - 1;
}
// std::cout<< start << " " << finish <<"\n";
for (int r = start; r <= finish; r++) {
instance += abs(list[r]);
}
if (answer < instance) {
answer = instance;
}
start = zero_list[i] + 1;
}
} else {
answer = str.size();
}
std::cout << answer;
}
| replace | 53 | 54 | 53 | 54 | 0 | |
p03074 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(false);
int n, k, z = 0;
vector<int> a = {0};
string s;
cin >> n >> k >> s;
if (s[0] == '0')
a.push_back(0);
int l = 0;
for (int i = 1; i <= n; i++) {
if (s[i] != s[i - 1]) {
a.push_back(i - l);
l = i;
}
}
for (int i = 0; i < 100005; i++)
a.push_back(0);
for (int i = 1; i < a.size(); i++)
a[i] += a[i - 1];
for (int i = 1; i <= n + 1; i++) {
if (i % 2) {
z = max(z, a[i + k + k] - a[i - 1]);
}
}
cout << z;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(false);
int n, k, z = 0;
vector<int> a = {0};
string s;
cin >> n >> k >> s;
if (s[0] == '0')
a.push_back(0);
int l = 0;
for (int i = 1; i <= n; i++) {
if (s[i] != s[i - 1]) {
a.push_back(i - l);
l = i;
}
}
for (int i = 0; i < 300005; i++)
a.push_back(0);
for (int i = 1; i < a.size(); i++)
a[i] += a[i - 1];
for (int i = 1; i <= n + 1; i++) {
if (i % 2) {
z = max(z, a[i + k + k] - a[i - 1]);
}
}
cout << z;
}
| replace | 25 | 26 | 25 | 26 | 0 | |
p03074 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string.h>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> vec;
int now = 1;
int cnt = 0;
for (int i = 0; i < n; i++) {
if (s[i] == (char)('0' + now)) {
cnt++;
} else {
vec.push_back(cnt);
cnt = 1;
now ^= 1;
}
}
if (cnt > 0) {
vec.push_back(cnt);
}
if (vec.size() % 2 == 0) {
vec.push_back(0);
}
ll ans = 0;
int right = 0;
ll sum = 0;
for (int left = 0; left < n; left += 2) {
while (right < min(left + 2 * k + 1, (int)vec.size())) {
sum += vec[right];
++right;
}
ans = max(ans, sum);
if (right == left)
++right;
else
sum -= vec[left] + vec[left + 1];
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string.h>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> vec;
int now = 1;
int cnt = 0;
for (int i = 0; i < n; i++) {
if (s[i] == (char)('0' + now)) {
cnt++;
} else {
vec.push_back(cnt);
cnt = 1;
now ^= 1;
}
}
if (cnt > 0) {
vec.push_back(cnt);
}
if (vec.size() % 2 == 0) {
vec.push_back(0);
}
ll ans = 0;
int right = 0;
ll sum = 0;
for (int left = 0; left < vec.size(); left += 2) {
while (right < min(left + 2 * k + 1, (int)vec.size())) {
sum += vec[right];
++right;
}
ans = max(ans, sum);
if (right == left)
++right;
else
sum -= vec[left] + vec[left + 1];
}
cout << ans << endl;
return 0;
}
| replace | 45 | 46 | 45 | 46 | 0 | |
p03074 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i < (int)n; i++)
#define FOR(i, m, n) for (int i = (int)m; i < (int)n; i++)
#define REPvec(itr, mp) for (auto itr = mp.begin(); itr != mp.endl(); itr++)
#define REPe(e, mp) for (auto &e : mp)
#define all(x) x.begin(), x.end()
#define MOD 1000000007 // 1e9+7
using namespace std;
using ll = long long int;
using vecint = vector<int>;
using vecll = vector<ll>;
using vec2int = vector<vector<int>>;
using P = pair<int, int>;
////////////////////////////////////////////////
vec2int b(2, vecint(3, 0));
vec2int c(3, vecint(2, 0));
vec2int G(3, vecint(3, -1));
////////////////////////////////////////////////
int main() {
////////////////////////////////////////////////
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
////////////////////////////////////////////////
int n, k;
string s;
cin >> n >> k >> s;
vecint rec;
if (s[0] == '0')
rec.push_back(0);
REP(i, n) {
char c = s[i];
int tmp = 1;
// cout << i << endl;
while (i + 1 < n && c == s[i + 1]) {
tmp++;
i++;
}
rec.push_back(tmp);
}
if (s.back() == '0')
rec.push_back(0);
// REPe(e, rec) { cout << e << endl; }
int m = rec.size();
vecint sum(m + 1, 0);
REP(i, m) { sum[i + 1] = sum[i] + rec[i]; }
if (k >= m / 2) {
cout << n << endl;
return 0;
}
int ans = 0;
REP(i, m / 2) {
int l = 2 * i;
int r = l + 2 * k;
ans = max(ans, sum[r + 1] - sum[l]);
}
cout << ans << endl;
}
| #include <algorithm>
#include <climits>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i < (int)n; i++)
#define FOR(i, m, n) for (int i = (int)m; i < (int)n; i++)
#define REPvec(itr, mp) for (auto itr = mp.begin(); itr != mp.endl(); itr++)
#define REPe(e, mp) for (auto &e : mp)
#define all(x) x.begin(), x.end()
#define MOD 1000000007 // 1e9+7
using namespace std;
using ll = long long int;
using vecint = vector<int>;
using vecll = vector<ll>;
using vec2int = vector<vector<int>>;
using P = pair<int, int>;
////////////////////////////////////////////////
vec2int b(2, vecint(3, 0));
vec2int c(3, vecint(2, 0));
vec2int G(3, vecint(3, -1));
////////////////////////////////////////////////
int main() {
////////////////////////////////////////////////
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
////////////////////////////////////////////////
int n, k;
string s;
cin >> n >> k >> s;
vecint rec;
if (s[0] == '0')
rec.push_back(0);
REP(i, n) {
char c = s[i];
int tmp = 1;
// cout << i << endl;
while (i + 1 < n && c == s[i + 1]) {
tmp++;
i++;
}
rec.push_back(tmp);
}
if (s.back() == '0')
rec.push_back(0);
// REPe(e, rec) { cout << e << endl; }
int m = rec.size();
vecint sum(m + 1, 0);
REP(i, m) { sum[i + 1] = sum[i] + rec[i]; }
if (k >= m / 2) {
cout << n << endl;
return 0;
}
int ans = 0;
REP(i, m / 2) {
int l = 2 * i;
int r = l + 2 * k;
if (r >= m)
break;
ans = max(ans, sum[r + 1] - sum[l]);
}
cout << ans << endl;
}
| insert | 63 | 63 | 63 | 65 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> a;
a.push_back(0);
for (int i = 0; i < N;) {
int cnt = 0;
if (S[i] == '0') {
while (i < N && S[i] == '0') {
i++;
cnt--;
}
} else if (S[i] == '1') {
while (i < N && S[i] == '1') {
i++;
cnt++;
}
}
a.push_back(cnt);
}
int n = a.size();
vector<int> nNeg(n, 0);
for (int i = 0; i < n; i++) {
if (a[i] < 0)
nNeg[i]++;
if (i > 0)
nNeg[i] += nNeg[i - 1];
}
nNeg.push_back(1e9);
vector<int> suma(n, 0);
for (int i = 1; i <= n; i++) {
suma[i] = abs(a[i]);
suma[i] += suma[i - 1];
}
// for(int i=0; i<n; i++){
// cout << a[i] << " ";
// }cout << endl;
// for(int i=0; i<n; i++){
// cout << nNeg[i] << " ";
// }cout << endl;
int ans = 0;
for (int start = 1; start < n; start++) {
int end = upper_bound(nNeg.begin(), nNeg.end(), K + nNeg[start - 1]) -
nNeg.begin() - 1;
ans = max(ans, suma[end] - suma[start - 1]);
// cout << start << " " << end << " " << suma[end]-suma[start-1] << endl;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> a;
a.push_back(0);
for (int i = 0; i < N;) {
int cnt = 0;
if (S[i] == '0') {
while (i < N && S[i] == '0') {
i++;
cnt--;
}
} else if (S[i] == '1') {
while (i < N && S[i] == '1') {
i++;
cnt++;
}
}
a.push_back(cnt);
}
int n = a.size();
vector<int> nNeg(n, 0);
for (int i = 0; i < n; i++) {
if (a[i] < 0)
nNeg[i]++;
if (i > 0)
nNeg[i] += nNeg[i - 1];
}
nNeg.push_back(1e9);
vector<int> suma(n, 0);
for (int i = 0; i < n; i++) {
suma[i] = abs(a[i]);
suma[i] += suma[i - 1];
}
// for(int i=0; i<n; i++){
// cout << a[i] << " ";
// }cout << endl;
// for(int i=0; i<n; i++){
// cout << nNeg[i] << " ";
// }cout << endl;
int ans = 0;
for (int start = 1; start < n; start++) {
int end = upper_bound(nNeg.begin(), nNeg.end(), K + nNeg[start - 1]) -
nNeg.begin() - 1;
ans = max(ans, suma[end] - suma[start - 1]);
// cout << start << " " << end << " " << suma[end]-suma[start-1] << endl;
}
cout << ans << endl;
}
| replace | 37 | 38 | 37 | 38 | 0 | |
p03074 | C++ | Runtime Error | #include <algorithm>
#include <assert.h>
#include <chrono>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string.h>
#include <time.h>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#define rnd mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define ll long long
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define FIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define all(x) x.begin(), x.end()
#define PII pair<int, int>
#define N 100005
#define MOD 1000000007
#define INF 1000000000000000000
using namespace std;
int main() {
vector<int> v, bit;
int n, k, c, sum = 0, ans = 0;
cin >> n >> k;
string s;
cin >> s;
c = 1;
for (int i = 1; i < n; ++i) {
if (s[i] == s[i - 1]) {
c++;
} else {
v.push_back(c);
bit.push_back(s[i - 1] - '0');
c = 1;
}
}
if (c > 0) {
v.push_back(c);
bit.push_back(s.back() - '0');
}
int r = 0, cnt = 0;
for (int i = 0; i < (int)v.size(); ++i) {
while (r < n && cnt <= k) {
if (bit[r] == 0 && cnt == k)
break;
if (bit[r] == 0)
cnt++;
sum = sum + v[r];
r++;
}
// cout << i << ' ' << sum << "\n";
ans = max(ans, sum);
if (bit[i] == 0)
cnt--;
sum = sum - v[i];
}
cout << ans;
}
| #include <algorithm>
#include <assert.h>
#include <chrono>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string.h>
#include <time.h>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#define rnd mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define ll long long
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define FIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define all(x) x.begin(), x.end()
#define PII pair<int, int>
#define N 100005
#define MOD 1000000007
#define INF 1000000000000000000
using namespace std;
int main() {
vector<int> v, bit;
int n, k, c, sum = 0, ans = 0;
cin >> n >> k;
string s;
cin >> s;
c = 1;
for (int i = 1; i < n; ++i) {
if (s[i] == s[i - 1]) {
c++;
} else {
v.push_back(c);
bit.push_back(s[i - 1] - '0');
c = 1;
}
}
if (c > 0) {
v.push_back(c);
bit.push_back(s.back() - '0');
}
int r = 0, cnt = 0;
for (int i = 0; i < (int)v.size(); ++i) {
while (r < (int)v.size() && cnt <= k) {
if (bit[r] == 0 && cnt == k)
break;
if (bit[r] == 0)
cnt++;
sum = sum + v[r];
r++;
}
// cout << i << ' ' << sum << "\n";
ans = max(ans, sum);
if (bit[i] == 0)
cnt--;
sum = sum - v[i];
}
cout << ans;
}
| replace | 54 | 55 | 54 | 55 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LLINF = 1e18;
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define ANS(n) cout << (n) << endl
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define FORR(i, a, b) for (int i = (a); i >= (b); i--)
#define ALL(obj) (obj).begin(), (obj).end()
#define pii pair<int, int>
#define pb(a) push_back(a)
#define mp make_pair
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> cnt;
char last = s[0];
int tmp = 0;
FOR(i, 0, n) {
if (s[i] == last) {
tmp++;
} else {
cnt.pb(tmp);
tmp = 1;
}
last = s[i];
}
cnt.pb(tmp);
vector<int> cntRuiseki;
cntRuiseki.pb(0);
FOR(i, 0, n) { cntRuiseki.pb(cnt[i] + cntRuiseki[i]); }
int i;
if (s[0] == '0') {
i = 1;
} else {
i = 0;
}
int ans = 0;
while (i < (int)cnt.size()) {
tmp = cntRuiseki[min(i + k * 2 + 1, (int)cntRuiseki.size() - 1)] -
cntRuiseki[i];
/*FOR(j,0,k*2+1){
if(i+j >= (int)cnt.size())break;
tmp += cnt[i+j];
}*/
ans = max(ans, tmp);
i += 2;
}
if (s[0] == '0') {
i = 0;
} else {
i = 1;
}
while (i < (int)cnt.size()) {
tmp =
cntRuiseki[min(i + k * 2, (int)cntRuiseki.size() - 1)] - cntRuiseki[i];
/* FOR(j,0,k*2){
if(i+j >= (int)cnt.size())break;
tmp += cnt[i+j];
}*/
ans = max(ans, tmp);
i += 2;
}
// FOR(i,0,(int)cnt.size())ANS(cnt[i]);
ANS(ans);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LLINF = 1e18;
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define ANS(n) cout << (n) << endl
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define FORR(i, a, b) for (int i = (a); i >= (b); i--)
#define ALL(obj) (obj).begin(), (obj).end()
#define pii pair<int, int>
#define pb(a) push_back(a)
#define mp make_pair
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> cnt;
char last = s[0];
int tmp = 0;
FOR(i, 0, n) {
if (s[i] == last) {
tmp++;
} else {
cnt.pb(tmp);
tmp = 1;
}
last = s[i];
}
cnt.pb(tmp);
vector<int> cntRuiseki;
cntRuiseki.pb(0);
FOR(i, 0, (int)cnt.size()) { cntRuiseki.pb(cnt[i] + cntRuiseki[i]); }
int i;
if (s[0] == '0') {
i = 1;
} else {
i = 0;
}
int ans = 0;
while (i < (int)cnt.size()) {
tmp = cntRuiseki[min(i + k * 2 + 1, (int)cntRuiseki.size() - 1)] -
cntRuiseki[i];
/*FOR(j,0,k*2+1){
if(i+j >= (int)cnt.size())break;
tmp += cnt[i+j];
}*/
ans = max(ans, tmp);
i += 2;
}
if (s[0] == '0') {
i = 0;
} else {
i = 1;
}
while (i < (int)cnt.size()) {
tmp =
cntRuiseki[min(i + k * 2, (int)cntRuiseki.size() - 1)] - cntRuiseki[i];
/* FOR(j,0,k*2){
if(i+j >= (int)cnt.size())break;
tmp += cnt[i+j];
}*/
ans = max(ans, tmp);
i += 2;
}
// FOR(i,0,(int)cnt.size())ANS(cnt[i]);
ANS(ans);
return 0;
}
| replace | 43 | 44 | 43 | 44 | 0 | |
p03074 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <set>
#include <string>
#include <vector>
#define MOD 1000000007
using namespace std;
int main() {
int n, k;
string s;
cin >> n >> k;
cin >> s;
vector<int> Nums;
int now = 1;
int cnt = 0;
for (int i = 0; i < n; i++) {
if (s[i] == (char)('0' + now))
cnt++;
else {
Nums.push_back(cnt);
now = 1 - now;
cnt = 1;
}
}
if (cnt != 0)
Nums.push_back(cnt);
// 1-0-1-0-1-0-1が欲しい
// 1-0-1-0みたいなので終わってたら1を足したい
if (Nums.size() % 2 == 0)
Nums.push_back(0);
/*for(int i=0;i<n;i++){
cout << Nums[i];
}*/
int Add = 2 * k + 1;
int ans = 0;
int tmp = 0;
// 偶数番目だけ足したい
for (int i = 0; i < Nums.size(); i += 2) {
tmp = 0;
for (int j = i; j < i + Add; j++) {
tmp += Nums[j];
}
ans = max(ans, tmp);
}
cout << ans << endl;
} | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <set>
#include <string>
#include <vector>
#define MOD 1000000007
using namespace std;
int main() {
int n, k;
string s;
cin >> n >> k;
cin >> s;
vector<int> Nums;
int now = 1;
int cnt = 0;
for (int i = 0; i < n; i++) {
if (s[i] == (char)('0' + now))
cnt++;
else {
Nums.push_back(cnt);
now = 1 - now;
cnt = 1;
}
}
if (cnt != 0)
Nums.push_back(cnt);
// 1-0-1-0-1-0-1が欲しい
// 1-0-1-0みたいなので終わってたら1を足したい
if (Nums.size() % 2 == 0)
Nums.push_back(0);
/*for(int i=0;i<n;i++){
cout << Nums[i];
}*/
int Add = 2 * k + 1;
int ans = 0;
int tmp = 0;
// 偶数番目だけ足したい
for (int i = 0; i < Nums.size(); i += 2) {
tmp = 0;
int left = i;
int right = min(i + Add, (int)Nums.size());
for (int j = left; j < right; j++) {
tmp += Nums[j];
}
ans = max(ans, tmp);
}
cout << ans << endl;
} | replace | 48 | 49 | 48 | 53 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repp(i, a, b) for (int i = a; i <= (b); ++i)
#define repr(i, a, b) for (int i = a; i >= (b); --i)
typedef long long ll;
const int INF = 1001001001;
const ll LINF = 1001001001001001001ll;
const int MOD = 1e9 + 7;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> A(0);
char now = '1';
int cnt = 0;
rep(i, S.size()) {
if (now == S[i])
cnt++;
else {
A.pb(cnt);
now = S[i];
cnt = 1;
}
}
if (cnt != 0)
A.pb(cnt);
if (S[S.size() - 1] == '0')
A.pb(0);
// rep(i, A.size()) { cout << A[i] << endl; }
vector<int> sum(N + 1);
rep(i, N + 1) { sum[i + 1] = sum[i] + A[i]; }
int w = 2 * K + 1;
int temp = 0;
int ans = 0;
for (int i = 0; i < A.size(); i += 2) {
int l = i;
int r = min(i + w, (int)A.size());
temp = sum[r] - sum[l];
chmax(ans, temp);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repp(i, a, b) for (int i = a; i <= (b); ++i)
#define repr(i, a, b) for (int i = a; i >= (b); --i)
typedef long long ll;
const int INF = 1001001001;
const ll LINF = 1001001001001001001ll;
const int MOD = 1e9 + 7;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> A(0);
char now = '1';
int cnt = 0;
rep(i, S.size()) {
if (now == S[i])
cnt++;
else {
A.pb(cnt);
now = S[i];
cnt = 1;
}
}
if (cnt != 0)
A.pb(cnt);
if (S[S.size() - 1] == '0')
A.pb(0);
// rep(i, A.size()) { cout << A[i] << endl; }
vector<int> sum(N + 1);
rep(i, A.size()) { sum[i + 1] = sum[i] + A[i]; }
int w = 2 * K + 1;
int temp = 0;
int ans = 0;
for (int i = 0; i < A.size(); i += 2) {
int l = i;
int r = min(i + w, (int)A.size());
temp = sum[r] - sum[l];
chmax(ans, temp);
}
cout << ans << endl;
} | replace | 57 | 58 | 57 | 58 | 0 | |
p03074 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <type_traits>
#include <vector>
using namespace std;
#define INF (1ll << 60)
#define INFint (1 << 30)
#define MOD 1000000007
#define BOUND 27182818284
typedef long long ll;
typedef long long int lli;
typedef pair<ll, ll> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
template <class T> bool umax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool umin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
// gcd
template <typename T> T gcd(T a, T b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
// gcd array
int findGCD(int arr[], int n) {
int result = arr[0];
for (int i = 1; i < n; i++)
result = gcd(arr[i], result);
return result;
}
template <typename T> T lcm(T m, T n) {
// 引数に0がある場合は0を返す
if ((0 == m) || (0 == n))
return 0;
return ((m / gcd(m, n)) * n); // lcm = m * n / gcd(m,n)
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
fill((T *)array, (T *)(array + N), val);
}
int dx[5] = {1, 0, -1, 0};
int dy[5] = {0, 1, 0, -1};
// v.front() = -BOUND;
// v.back() = BOUND;
bool IsPrime(int num) {
if (num < 2)
return false;
else if (num == 2)
return true;
else if (num % 2 == 0)
return false; // 偶数はあらかじめ除く
double sqrtNum = sqrt(num);
for (int i = 3; i <= sqrtNum; i += 2) {
if (num % i == 0) {
// 素数ではない
return false;
}
}
// 素数である
return true;
}
int d[200040];
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
Fill(d, 0);
int dst = 0;
int re = 0;
if (S[0] == '1') {
re = 1;
} else if (S[0] == '0') {
re = 2;
}
char pre = 'Z';
rep(i, N) {
if (pre != S[i]) {
dst++;
d[dst]++;
pre = S[i];
} else {
d[dst]++;
}
}
int sum = 0;
if (re == 1) {
for (int i = 1; i <= 2 * K + 1; i++) {
sum += d[i];
}
int temp = sum;
for (int i = 2; i <= N; i += 2) {
temp = temp - d[i] - d[i - 1] + d[2 * K + i] + d[2 * K + i + 1];
// sum=max(sum,sum-d[i]-d[i-1]+d[2*K+i]+d[2*K+i+1]);
sum = max(sum, temp);
}
} else if (re == 2) {
int temp = 0;
for (int i = 1; i <= 2 * K; i++) {
sum += d[i];
}
temp = sum;
for (int i = 1; i <= N; i += 2) {
temp = temp - d[i] - d[i - 1] + d[2 * K + i] + d[2 * K + i + 1];
// sum=max(sum,sum-d[i]-d[i-1]+d[2*K+i]+d[2*K+i+1]);
sum = max(sum, temp);
}
}
cout << sum << endl;
return 0;
}
| #include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <type_traits>
#include <vector>
using namespace std;
#define INF (1ll << 60)
#define INFint (1 << 30)
#define MOD 1000000007
#define BOUND 27182818284
typedef long long ll;
typedef long long int lli;
typedef pair<ll, ll> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
template <class T> bool umax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool umin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
// gcd
template <typename T> T gcd(T a, T b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
// gcd array
int findGCD(int arr[], int n) {
int result = arr[0];
for (int i = 1; i < n; i++)
result = gcd(arr[i], result);
return result;
}
template <typename T> T lcm(T m, T n) {
// 引数に0がある場合は0を返す
if ((0 == m) || (0 == n))
return 0;
return ((m / gcd(m, n)) * n); // lcm = m * n / gcd(m,n)
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
fill((T *)array, (T *)(array + N), val);
}
int dx[5] = {1, 0, -1, 0};
int dy[5] = {0, 1, 0, -1};
// v.front() = -BOUND;
// v.back() = BOUND;
bool IsPrime(int num) {
if (num < 2)
return false;
else if (num == 2)
return true;
else if (num % 2 == 0)
return false; // 偶数はあらかじめ除く
double sqrtNum = sqrt(num);
for (int i = 3; i <= sqrtNum; i += 2) {
if (num % i == 0) {
// 素数ではない
return false;
}
}
// 素数である
return true;
}
int d[2000400];
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
Fill(d, 0);
int dst = 0;
int re = 0;
if (S[0] == '1') {
re = 1;
} else if (S[0] == '0') {
re = 2;
}
char pre = 'Z';
rep(i, N) {
if (pre != S[i]) {
dst++;
d[dst]++;
pre = S[i];
} else {
d[dst]++;
}
}
int sum = 0;
if (re == 1) {
for (int i = 1; i <= 2 * K + 1; i++) {
sum += d[i];
}
int temp = sum;
for (int i = 2; i <= N; i += 2) {
temp = temp - d[i] - d[i - 1] + d[2 * K + i] + d[2 * K + i + 1];
// sum=max(sum,sum-d[i]-d[i-1]+d[2*K+i]+d[2*K+i+1]);
sum = max(sum, temp);
}
} else if (re == 2) {
int temp = 0;
for (int i = 1; i <= 2 * K; i++) {
sum += d[i];
}
temp = sum;
for (int i = 1; i <= N; i += 2) {
temp = temp - d[i] - d[i - 1] + d[2 * K + i] + d[2 * K + i + 1];
// sum=max(sum,sum-d[i]-d[i-1]+d[2*K+i]+d[2*K+i+1]);
sum = max(sum, temp);
}
}
cout << sum << endl;
return 0;
}
| replace | 93 | 94 | 93 | 94 | 0 | |
p03074 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> Nums;
int now = 1; // 今見ている数
int cnt = 0; // nowがいくつ並んでいるか
for (int i = 0; i < N; i++) {
if (S[i] == (char)('0' + now))
cnt++;
else {
Nums.push_back(cnt);
now = 1 - now; // 0と1を切り替える時の計算 now ^= 1;
cnt = 1; // 新しいのをカウントし始める
}
}
if (cnt != 0)
Nums.push_back(cnt);
// 1-0-1-0-1-0-1って感じの配列が欲しい
// 1-0-1-0みたいに0で終わってたら、適当に１つ足す
if (Nums.size() % 2 == 0)
Nums.push_back(0);
int Add = 2 * K + 1;
// 累積和を作る
// 0 1 2 3 4 5 6
// 0 1 2 3 4 5
vector<int> sum(Nums.size() + 1);
for (int i = 0; i < sum.size(); i++) {
sum[i + 1] = sum[i] + Nums[i];
}
int ans = 0;
// 1-0-1...の1から始めるので、偶数番目だけ見る
for (int i = 0; i < Nums.size(); i += 2) {
// 次のleft, rightを計算する [left, right)
int left = i;
int right = min(i + Add, (int)Nums.size());
int tmp = sum[right] - sum[left];
ans = max(tmp, ans);
}
cout << ans << endl;
}
| #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> Nums;
int now = 1; // 今見ている数
int cnt = 0; // nowがいくつ並んでいるか
for (int i = 0; i < N; i++) {
if (S[i] == (char)('0' + now))
cnt++;
else {
Nums.push_back(cnt);
now = 1 - now; // 0と1を切り替える時の計算 now ^= 1;
cnt = 1; // 新しいのをカウントし始める
}
}
if (cnt != 0)
Nums.push_back(cnt);
// 1-0-1-0-1-0-1って感じの配列が欲しい
// 1-0-1-0みたいに0で終わってたら、適当に１つ足す
if (Nums.size() % 2 == 0)
Nums.push_back(0);
int Add = 2 * K + 1;
// 累積和を作る
// 0 1 2 3 4 5 6
// 0 1 2 3 4 5
vector<int> sum(Nums.size() + 1);
for (int i = 0; i < Nums.size(); i++) {
sum[i + 1] = sum[i] + Nums[i];
}
int ans = 0;
// 1-0-1...の1から始めるので、偶数番目だけ見る
for (int i = 0; i < Nums.size(); i += 2) {
// 次のleft, rightを計算する [left, right)
int left = i;
int right = min(i + Add, (int)Nums.size());
int tmp = sum[right] - sum[left];
ans = max(tmp, ans);
}
cout << ans << endl;
}
| replace | 39 | 40 | 39 | 40 | 0 | |
p03074 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> Nums;
int now = 1; // 今見ている数
int cnt = 0; // nowがいくつ並んでいるか
for (int i = 0; i < N; i++) {
if (S[i] == (char)('0' + now))
cnt++;
else {
Nums.push_back(cnt);
now = 1 - now; // 0と1を切り替える時の計算 now ^= 1;
cnt = 1; // 新しいのをカウントし始める
}
}
if (cnt != 0)
Nums.push_back(cnt);
// 1-0-1-0-1-0-1って感じの配列が欲しい
// 1-0-1-0みたいに0で終わってたら、適当に１つ足す
if (Nums.size() % 2 == 0)
Nums.push_back(0);
int Add = 2 * K + 1;
int ans = 0;
// 1-0-1...の1から始めるので、偶数番目だけ見る
for (int i = 0; i < Nums.size(); i += 2) {
int tmp = 0;
int left = i;
int right = i + Add;
for (int j = left; j < right; j++) {
tmp += Nums[j];
}
ans = max(tmp, ans);
}
cout << ans << endl;
}
| #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> Nums;
int now = 1; // 今見ている数
int cnt = 0; // nowがいくつ並んでいるか
for (int i = 0; i < N; i++) {
if (S[i] == (char)('0' + now))
cnt++;
else {
Nums.push_back(cnt);
now = 1 - now; // 0と1を切り替える時の計算 now ^= 1;
cnt = 1; // 新しいのをカウントし始める
}
}
if (cnt != 0)
Nums.push_back(cnt);
// 1-0-1-0-1-0-1って感じの配列が欲しい
// 1-0-1-0みたいに0で終わってたら、適当に１つ足す
if (Nums.size() % 2 == 0)
Nums.push_back(0);
int Add = 2 * K + 1;
int ans = 0;
// 1-0-1...の1から始めるので、偶数番目だけ見る
for (int i = 0; i < Nums.size(); i += 2) {
int tmp = 0;
int left = i;
int right = min(i + Add, (int)Nums.size());
for (int j = left; j < right; j++) {
tmp += Nums[j];
}
ans = max(tmp, ans);
}
cout << ans << endl;
}
| replace | 41 | 42 | 41 | 42 | 0 | |
p03074 | C++ | Runtime Error | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> a;
int b = (s[0] == '0' ? 0 : 1);
a.push_back(1);
for (int i = 1; i < n; ++i) {
if (s[i] == s[i - 1]) {
++a.back();
} else {
a.push_back(1);
}
}
int m = a.size();
for (int i = 1; i < n; ++i)
a[i] += a[i - 1];
int ans = 0;
for (int i = 0; i < m; ++i) {
if (b == 0) {
ans = max(ans, a[min(m - 1, i + 2 * k - 1)] - ((i > 0) ? a[i - 1] : 0));
} else {
ans = max(ans, a[min(m - 1, i + 2 * k)] - ((i > 0) ? a[i - 1] : 0));
}
b = 1 - b;
}
cout << ans << endl;
} | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> a;
int b = (s[0] == '0' ? 0 : 1);
a.push_back(1);
for (int i = 1; i < n; ++i) {
if (s[i] == s[i - 1]) {
++a.back();
} else {
a.push_back(1);
}
}
int m = a.size();
for (int i = 1; i < m; ++i)
a[i] += a[i - 1];
int ans = 0;
for (int i = 0; i < m; ++i) {
if (b == 0) {
ans = max(ans, a[min(m - 1, i + 2 * k - 1)] - ((i > 0) ? a[i - 1] : 0));
} else {
ans = max(ans, a[min(m - 1, i + 2 * k)] - ((i > 0) ? a[i - 1] : 0));
}
b = 1 - b;
}
cout << ans << endl;
} | replace | 24 | 25 | 24 | 25 | 0 | |
p03074 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
ll count = 1, ans = 0;
vector<ll> stand, handstand;
for (int i = 1; i < N; i++) {
if (S[i] != S[i - 1]) {
if (S[i - 1] == '1') {
handstand.push_back(count);
if (count > ans)
ans = count;
} else {
stand.push_back(count);
}
count = 1;
} else {
count++;
}
}
if (S[N - 1] == '1') {
handstand.push_back(count);
if (count > ans)
ans = count;
} else {
stand.push_back(count);
}
ll HS_size = handstand.size(), S_size = stand.size();
if (HS_size == 0 || S_size <= K) {
cout << N << endl;
return 0;
}
ll HS_count;
for (int i = 0; i < S_size; i++) {
HS_count = 0;
for (int j = i; j < i + K && j < S_size; j++) {
HS_count += stand[j];
if (j < HS_size)
HS_count += handstand[j];
if (S[0] == '0' && j == i && j != 0)
HS_count += handstand[j - 1];
if (S[0] == '1' && j == i + K - 1 && j + 1 < HS_size)
HS_count += handstand[j + 1];
}
if (HS_count > ans)
ans = HS_count;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
ll count = 1, ans = 0;
vector<ll> stand, handstand;
for (int i = 1; i < N; i++) {
if (S[i] != S[i - 1]) {
if (S[i - 1] == '1') {
handstand.push_back(count);
if (count > ans)
ans = count;
} else {
stand.push_back(count);
}
count = 1;
} else {
count++;
}
}
if (S[N - 1] == '1') {
handstand.push_back(count);
if (count > ans)
ans = count;
} else {
stand.push_back(count);
}
ll HS_size = handstand.size(), S_size = stand.size();
if (HS_size == 0 || S_size <= K) {
cout << N << endl;
return 0;
}
ll HS_count;
for (int i = 0; i < (S_size - K + 1); i++) {
HS_count = 0;
for (int j = i; j < i + K && j < S_size; j++) {
HS_count += stand[j];
if (j < HS_size)
HS_count += handstand[j];
if (S[0] == '0' && j == i && j != 0)
HS_count += handstand[j - 1];
if (S[0] == '1' && j == i + K - 1 && j + 1 < HS_size)
HS_count += handstand[j + 1];
}
if (HS_count > ans)
ans = HS_count;
}
cout << ans << endl;
}
| replace | 41 | 42 | 41 | 42 | TLE | |
p03074 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
int n, k, a[100005];
vector<int> v, av;
int main(void) {
scanf("%d %d", &n, &k);
for (int i = 1; i <= n; i++)
scanf("%1d", &a[i]);
if (a[1] == 0)
v.push_back(0);
int len = 0;
for (int i = 1; i <= n; i++) {
if (i > 1 && a[i] != a[i - 1]) {
v.push_back(len);
len = 1;
} else
len++;
}
v.push_back(len);
av.resize(v.size());
av[0] = 0;
for (int i = 0; i < v.size(); i++)
av[i + 1] = av[i] + v[i];
int ans = 0;
for (int i = 0; i < av.size(); i += 2) {
int ss = av[min((int)v.size(), i + 2 * k + 1)] - av[i];
ans = max(ans, ss);
}
printf("%d\n", ans);
} | #include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
int n, k, a[100005];
vector<int> v, av;
int main(void) {
scanf("%d %d", &n, &k);
for (int i = 1; i <= n; i++)
scanf("%1d", &a[i]);
if (a[1] == 0)
v.push_back(0);
int len = 0;
for (int i = 1; i <= n; i++) {
if (i > 1 && a[i] != a[i - 1]) {
v.push_back(len);
len = 1;
} else
len++;
}
v.push_back(len);
av.resize(v.size() + 1);
av[0] = 0;
for (int i = 0; i < v.size(); i++)
av[i + 1] = av[i] + v[i];
int ans = 0;
for (int i = 0; i < av.size(); i += 2) {
int ss = av[min((int)v.size(), i + 2 * k + 1)] - av[i];
ans = max(ans, ss);
}
printf("%d\n", ans);
} | replace | 23 | 24 | 23 | 24 | 0 | |
p03074 | C++ | Runtime Error | #include <algorithm>
#include <cstdint>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, s, t) for (int i = s; i < t; i++)
#define ALL(obj) obj.begin(), obj.end()
const int iINF = 1e9;
const long long llINF = 1e18;
const int MOD = 1e9 + 7;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <int MOD> struct ModInt {
long long val;
constexpr ModInt(long long v = 0) noexcept : val(v % MOD) {
if (val < 0)
val += MOD;
}
constexpr int getmod() { return MOD; }
constexpr ModInt operator-() const noexcept { return val ? MOD - val : 0; }
constexpr ModInt operator+(const ModInt &r) const noexcept {
return ModInt(*this) += r;
}
constexpr ModInt operator-(const ModInt &r) const noexcept {
return ModInt(*this) -= r;
}
constexpr ModInt operator*(const ModInt &r) const noexcept {
return ModInt(*this) *= r;
}
constexpr ModInt operator/(const ModInt &r) const noexcept {
return ModInt(*this) /= r;
}
constexpr ModInt &operator+=(const ModInt &r) noexcept {
val += r.val;
if (val >= MOD)
val -= MOD;
return *this;
}
constexpr ModInt &operator-=(const ModInt &r) noexcept {
val -= r.val;
if (val < 0)
val += MOD;
return *this;
}
constexpr ModInt &operator*=(const ModInt &r) noexcept {
val = val * r.val % MOD;
return *this;
}
constexpr ModInt &operator/=(const ModInt &r) noexcept {
long long a = r.val, b = MOD, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
val = val * u % MOD;
if (val < 0)
val += MOD;
return *this;
}
constexpr bool operator==(const ModInt &r) const noexcept {
return this->val == r.val;
}
constexpr bool operator!=(const ModInt &r) const noexcept {
return this->val != r.val;
}
friend constexpr ostream &operator<<(ostream &os,
const ModInt<MOD> &x) noexcept {
return os << x.val;
}
friend constexpr istream &operator>>(istream &is, ModInt<MOD> &x) noexcept {
return is >> x.val;
}
friend constexpr ModInt<MOD> modpow(const ModInt<MOD> &a,
long long n) noexcept {
if (n == 0)
return 1;
auto t = modpow(a, n / 2);
t = t * t;
if (n & 1)
t = t * a;
return t;
}
};
using mint = ModInt<MOD>;
long long modPow(long long x, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * x % mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
long long extGCD(long long a, long long b, long long &x, long long &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
long long d = extGCD(b, a % b, y, x);
y -= a / b * x;
return d;
}
long long gcd(long long a, long long b) {
if (b == 0) {
return a;
} else {
return gcd(b, a % b);
}
}
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
vector<pair<char, int>> rls(const string &s) {
int N = s.size();
vector<pair<char, int>> res;
int cnt = 1;
char tmp = s[0];
for (int i = 1; i < N; ++i) {
if (tmp == s[i]) {
cnt += 1;
} else {
res.push_back(make_pair(tmp, cnt));
cnt = 1;
tmp = s[i];
}
}
res.push_back(make_pair(tmp, cnt));
return res;
}
template <typename T> using Vec = vector<T>;
template <typename T> using VVec = vector<vector<T>>;
using LL = long long;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
int right = 0, ans = 0, cnt = 0, sum = 0;
auto s = rls(S);
REP(left, S.size()) {
while (right < N && (s[right].first == '1' || cnt + 1 <= K)) {
sum += s[right].second;
if (s[right].first == '1') {
++right;
} else {
cnt += 1;
++right;
}
}
ans = max(ans, sum);
if (right == left)
++right;
else if (s[left].first == '0') {
cnt -= 1;
}
sum -= s[left].second;
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <cstdint>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, s, t) for (int i = s; i < t; i++)
#define ALL(obj) obj.begin(), obj.end()
const int iINF = 1e9;
const long long llINF = 1e18;
const int MOD = 1e9 + 7;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <int MOD> struct ModInt {
long long val;
constexpr ModInt(long long v = 0) noexcept : val(v % MOD) {
if (val < 0)
val += MOD;
}
constexpr int getmod() { return MOD; }
constexpr ModInt operator-() const noexcept { return val ? MOD - val : 0; }
constexpr ModInt operator+(const ModInt &r) const noexcept {
return ModInt(*this) += r;
}
constexpr ModInt operator-(const ModInt &r) const noexcept {
return ModInt(*this) -= r;
}
constexpr ModInt operator*(const ModInt &r) const noexcept {
return ModInt(*this) *= r;
}
constexpr ModInt operator/(const ModInt &r) const noexcept {
return ModInt(*this) /= r;
}
constexpr ModInt &operator+=(const ModInt &r) noexcept {
val += r.val;
if (val >= MOD)
val -= MOD;
return *this;
}
constexpr ModInt &operator-=(const ModInt &r) noexcept {
val -= r.val;
if (val < 0)
val += MOD;
return *this;
}
constexpr ModInt &operator*=(const ModInt &r) noexcept {
val = val * r.val % MOD;
return *this;
}
constexpr ModInt &operator/=(const ModInt &r) noexcept {
long long a = r.val, b = MOD, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
val = val * u % MOD;
if (val < 0)
val += MOD;
return *this;
}
constexpr bool operator==(const ModInt &r) const noexcept {
return this->val == r.val;
}
constexpr bool operator!=(const ModInt &r) const noexcept {
return this->val != r.val;
}
friend constexpr ostream &operator<<(ostream &os,
const ModInt<MOD> &x) noexcept {
return os << x.val;
}
friend constexpr istream &operator>>(istream &is, ModInt<MOD> &x) noexcept {
return is >> x.val;
}
friend constexpr ModInt<MOD> modpow(const ModInt<MOD> &a,
long long n) noexcept {
if (n == 0)
return 1;
auto t = modpow(a, n / 2);
t = t * t;
if (n & 1)
t = t * a;
return t;
}
};
using mint = ModInt<MOD>;
long long modPow(long long x, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * x % mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
long long extGCD(long long a, long long b, long long &x, long long &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
long long d = extGCD(b, a % b, y, x);
y -= a / b * x;
return d;
}
long long gcd(long long a, long long b) {
if (b == 0) {
return a;
} else {
return gcd(b, a % b);
}
}
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
vector<pair<char, int>> rls(const string &s) {
int N = s.size();
vector<pair<char, int>> res;
int cnt = 1;
char tmp = s[0];
for (int i = 1; i < N; ++i) {
if (tmp == s[i]) {
cnt += 1;
} else {
res.push_back(make_pair(tmp, cnt));
cnt = 1;
tmp = s[i];
}
}
res.push_back(make_pair(tmp, cnt));
return res;
}
template <typename T> using Vec = vector<T>;
template <typename T> using VVec = vector<vector<T>>;
using LL = long long;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
int right = 0, ans = 0, cnt = 0, sum = 0;
auto s = rls(S);
N = s.size();
REP(left, N) {
while (right < N && (s[right].first == '1' || cnt + 1 <= K)) {
sum += s[right].second;
if (s[right].first == '1') {
++right;
} else {
cnt += 1;
++right;
}
}
ans = max(ans, sum);
if (right == left)
++right;
else if (s[left].first == '0') {
cnt -= 1;
}
sum -= s[left].second;
}
cout << ans << endl;
return 0;
} | replace | 177 | 178 | 177 | 179 | 0 | |
p03074 | C++ | Runtime Error | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define str to_string
#define endl "\n"
#define PI 3.141592653589
using namespace std;
using lint = long long;
template <class T> ostream &operator<<(ostream &o, const vector<T> &v) {
o << "{";
for (int i = 0; i < (int)v.size(); i++)
o << (i > 0 ? ", " : "") << v[i];
o << "}";
return o;
}
// AC(*'ω'*)AC(*'ω'*)AC(*'ω'*)AC(*'ω'*)AC(*'ω'*)AC(*'ω'*)AC
int main() {
vector<int> vec(0);
int n, k, tmp = 0, ans = 0;
cin >> n >> k;
string s;
cin >> s;
bool flag;
if (s[0] == '1')
flag = true;
else
flag = false;
for (int i = 0; i < n; i++) {
if (flag) {
if (s[i] == '1')
tmp++;
else {
vec.pb(tmp);
tmp = 1;
flag = false;
}
} else {
if (s[i] == '0')
tmp++;
else {
vec.pb(tmp);
tmp = 1;
flag = true;
}
}
}
vec.pb(tmp);
tmp = 0;
int sz = vec.size();
if (s[0] == '1') {
if (vec.size() / 2 <= k)
ans = n;
else {
for (int i = 0; i < 2 * k + 1; i++)
tmp += vec[i];
ans = max(ans, tmp);
int pt = 2 * k + 1;
while (pt + 1 < sz) {
tmp -= vec[pt - 2 * k - 1] + vec[pt - 2 * k];
tmp += vec[pt] + vec[pt + 1];
ans = max(ans, tmp);
pt += 2;
}
if (s[n - 1] == '0') {
tmp -= vec[pt - 2 * k - 1] + vec[pt - 2 * k];
tmp += vec[pt];
ans = max(ans, tmp);
}
}
} else {
if ((vec.size() + 1) / 2 <= k)
ans = n;
else {
for (int i = 0; i < 2 * k; i++)
tmp += vec[i];
ans = max(ans, tmp);
int pt = 2 * k;
bool fi = true;
while (pt + 1 < sz) {
if (fi) {
tmp -= vec[0];
fi = false;
} else {
tmp -= vec[pt - 2 * k] + vec[pt - 2 * k - 1];
}
tmp += vec[pt] + vec[pt + 1];
ans = max(ans, tmp);
pt += 2;
}
if (s[n - 1] == '0') {
tmp -= vec[pt - 2 * k] + vec[pt - 2 * k - 1];
tmp += vec[pt];
ans = max(ans, tmp);
}
}
}
cout << ans << endl;
}
| #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define str to_string
#define endl "\n"
#define PI 3.141592653589
using namespace std;
using lint = long long;
template <class T> ostream &operator<<(ostream &o, const vector<T> &v) {
o << "{";
for (int i = 0; i < (int)v.size(); i++)
o << (i > 0 ? ", " : "") << v[i];
o << "}";
return o;
}
// AC(*'ω'*)AC(*'ω'*)AC(*'ω'*)AC(*'ω'*)AC(*'ω'*)AC(*'ω'*)AC
int main() {
vector<int> vec(0);
int n, k, tmp = 0, ans = 0;
cin >> n >> k;
string s;
cin >> s;
bool flag;
if (s[0] == '1')
flag = true;
else
flag = false;
for (int i = 0; i < n; i++) {
if (flag) {
if (s[i] == '1')
tmp++;
else {
vec.pb(tmp);
tmp = 1;
flag = false;
}
} else {
if (s[i] == '0')
tmp++;
else {
vec.pb(tmp);
tmp = 1;
flag = true;
}
}
}
vec.pb(tmp);
tmp = 0;
int sz = vec.size();
if (s[0] == '1') {
if (vec.size() / 2 <= k)
ans = n;
else {
for (int i = 0; i < 2 * k + 1; i++)
tmp += vec[i];
ans = max(ans, tmp);
int pt = 2 * k + 1;
while (pt + 1 < sz) {
tmp -= vec[pt - 2 * k - 1] + vec[pt - 2 * k];
tmp += vec[pt] + vec[pt + 1];
ans = max(ans, tmp);
pt += 2;
}
if (s[n - 1] == '0') {
tmp -= vec[pt - 2 * k - 1] + vec[pt - 2 * k];
tmp += vec[pt];
ans = max(ans, tmp);
}
}
} else {
if ((vec.size() + 1) / 2 <= k)
ans = n;
else {
for (int i = 0; i < 2 * k; i++)
tmp += vec[i];
ans = max(ans, tmp);
int pt = 2 * k;
bool fi = true;
while (pt + 1 < sz) {
if (fi) {
tmp -= vec[0];
fi = false;
} else {
tmp -= vec[pt - 2 * k] + vec[pt - 2 * k - 1];
}
tmp += vec[pt] + vec[pt + 1];
ans = max(ans, tmp);
pt += 2;
}
if (s[n - 1] == '0') {
tmp -= vec[pt - 2 * k];
if (pt - 2 * k - 1 >= 0)
tmp -= vec[pt - 2 * k - 1];
tmp += vec[pt];
ans = max(ans, tmp);
}
}
}
cout << ans << endl;
}
| replace | 93 | 94 | 93 | 96 | -6 | /usr/include/c++/12/debug/vector:442:
In function:
std::debug::vector<_Tp, _Allocator>::reference std::debug::vector<_Tp,
_Allocator>::operator[](size_type) [with _Tp = int; _Allocator =
std::allocator<int>; reference = int&; size_type = long unsigned int]
Error: attempt to subscript container with out-of-bounds index -1, but
container only holds 3 elements.
Objects involved in the operation:
sequence "this" @ 0x7ffd0c114ce0 {
type = std::debug::vector<int, std::allocator<int> >;
}
|
p03074 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <vector>
using namespace std;
int N;
int K;
char hito[200000];
int renzoku[20000];
int kotae;
int kotae2;
int main() {
cin >> N >> K;
for (int i = 0; i < N; i++) {
cin >> hito[i];
}
for (int i = 0; i < N; i++) {
if (hito[i] == '1')
hito[i] = '0';
else
break;
}
for (int i = N - 1; i >= 0; i--) {
if (hito[i] == '1')
hito[i] = '0';
else
break;
}
char now = '0';
int now_num = 0;
int now_idx = 0;
for (int i = 0; i < N; i++) {
if (hito[i] == now) {
now_num++;
} else {
renzoku[now_idx] = now_num;
now_num = 1;
now_idx++;
if (now == '0')
now = '1';
else
now = '0';
}
}
renzoku[now_idx] = now_num;
if (now_idx < 2 * K - 1) {
cout << N << endl;
return 0;
} else {
kotae = 0;
for (int i = 0; i < 2 * K; i++) {
kotae += renzoku[i];
kotae2 = max(kotae2, kotae);
}
for (int i = 2 * K; i <= now_idx; i = i + 2) {
if (i == 2 * K) {
kotae += renzoku[i];
kotae += renzoku[i + 1];
kotae -= renzoku[i - 2 * K];
kotae2 = max(kotae2, kotae);
} else if (i == now_idx) {
kotae += renzoku[i];
kotae -= renzoku[i - 2 * K];
kotae -= renzoku[i - 2 * K - 1];
kotae2 = max(kotae2, kotae);
} else {
kotae += renzoku[i];
kotae += renzoku[i + 1];
kotae -= renzoku[i - 2 * K];
kotae -= renzoku[i - 2 * K - 1];
kotae2 = max(kotae2, kotae);
}
}
}
cout << kotae2 << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <vector>
using namespace std;
int N;
int K;
char hito[200000];
int renzoku[200000];
int kotae;
int kotae2;
int main() {
cin >> N >> K;
for (int i = 0; i < N; i++) {
cin >> hito[i];
}
for (int i = 0; i < N; i++) {
if (hito[i] == '1')
hito[i] = '0';
else
break;
}
for (int i = N - 1; i >= 0; i--) {
if (hito[i] == '1')
hito[i] = '0';
else
break;
}
char now = '0';
int now_num = 0;
int now_idx = 0;
for (int i = 0; i < N; i++) {
if (hito[i] == now) {
now_num++;
} else {
renzoku[now_idx] = now_num;
now_num = 1;
now_idx++;
if (now == '0')
now = '1';
else
now = '0';
}
}
renzoku[now_idx] = now_num;
if (now_idx < 2 * K - 1) {
cout << N << endl;
return 0;
} else {
kotae = 0;
for (int i = 0; i < 2 * K; i++) {
kotae += renzoku[i];
kotae2 = max(kotae2, kotae);
}
for (int i = 2 * K; i <= now_idx; i = i + 2) {
if (i == 2 * K) {
kotae += renzoku[i];
kotae += renzoku[i + 1];
kotae -= renzoku[i - 2 * K];
kotae2 = max(kotae2, kotae);
} else if (i == now_idx) {
kotae += renzoku[i];
kotae -= renzoku[i - 2 * K];
kotae -= renzoku[i - 2 * K - 1];
kotae2 = max(kotae2, kotae);
} else {
kotae += renzoku[i];
kotae += renzoku[i + 1];
kotae -= renzoku[i - 2 * K];
kotae -= renzoku[i - 2 * K - 1];
kotae2 = max(kotae2, kotae);
}
}
}
cout << kotae2 << endl;
return 0;
}
| replace | 14 | 15 | 14 | 15 | 0 | |
p03074 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> vec;
// 0,2,4,,番目に連続する1の個数を、1,3,5,,,番目に連続する0の個数をpush_backする
if (S[0] == '0') {
vec.push_back(0);
} // 最初の連続する1の個数は０
int head = 0;
while (head < N) {
// headは0(または１）の連続する個数を数えるためのスタート位置
int tail = head;
int cnt = 0;
while ((head + tail) < N && S[tail] == S[head]) {
tail++;
cnt++;
}
head = tail;
vec.push_back(cnt);
}
if (S.back() == '0') {
vec.push_back(0);
} // 最初と最後は1の個数で終わりたい
// このときのvecの長さは必ず奇数
vector<long long> sum((int)vec.size() + 1, 0);
for (int i = 0; i < vec.size(); i++) {
sum[i + 1] = sum[i] + vec[i];
}
long long ans = 0;
for (int start = 0; start < (int)vec.size(); start++) {
long long res = 0;
int j = start;
if (j % 2 == 0) { // vec[start]は１の個数
int goal = min((int)vec.size() - 1, j + 2 * K);
res = sum[goal + 1] - sum[j];
}
else {
// vec[start]は0の個数
int goal = min((int)vec.size() - 1, j + 2 * K - 1);
res = sum[goal + 1] - sum[j - 1];
}
ans = max(ans, res);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> vec;
// 0,2,4,,番目に連続する1の個数を、1,3,5,,,番目に連続する0の個数をpush_backする
if (S[0] == '0') {
vec.push_back(0);
} // 最初の連続する1の個数は０
int head = 0;
while (head < N) {
// headは0(または１）の連続する個数を数えるためのスタート位置
int tail = head;
int cnt = 0;
while (tail < N && S[tail] == S[head]) {
tail++;
cnt++;
}
head = tail;
vec.push_back(cnt);
}
if (S.back() == '0') {
vec.push_back(0);
} // 最初と最後は1の個数で終わりたい
// このときのvecの長さは必ず奇数
vector<long long> sum((int)vec.size() + 1, 0);
for (int i = 0; i < vec.size(); i++) {
sum[i + 1] = sum[i] + vec[i];
}
long long ans = 0;
for (int start = 0; start < (int)vec.size(); start++) {
long long res = 0;
int j = start;
if (j % 2 == 0) { // vec[start]は１の個数
int goal = min((int)vec.size() - 1, j + 2 * K);
res = sum[goal + 1] - sum[j];
}
else {
// vec[start]は0の個数
int goal = min((int)vec.size() - 1, j + 2 * K - 1);
res = sum[goal + 1] - sum[j - 1];
}
ans = max(ans, res);
}
cout << ans << endl;
return 0;
} | replace | 19 | 20 | 19 | 20 | TLE | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define INF 2147483647
#define INFF 9223372036854775807
#define ll long long
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, m, n) for (int i = m; i < n; i++)
#define ALL(N) (N.begin(), N.end())
#define de cout << "debug" << endl;
#define pb push_back
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> E, Z;
int es = 0, zs = 0;
if (S.size() == 1) {
cout << 1 << endl;
return 0;
} else if (S.size() == 2) {
cout << 2 << endl;
return 0;
}
if (S[0] == '0')
E.push_back(0);
REP(i, S.size() - 1) {
if (S[i] == '1') {
es++;
if (S[i + 1] == '0') {
E.push_back(es);
es = 0;
}
} else if (S[i] == '0') {
zs++;
if (S[i + 1] == '1') {
Z.push_back(zs);
zs = 0;
}
}
if (i == S.size() - 2) {
if (S[i + 1] == '1') {
es++;
E.push_back(es);
} else {
zs++;
Z.push_back(zs);
}
}
}
if (S[S.size() - 1] == '0')
E.push_back(0);
int sum = 0;
int maxv = 0;
REP(i, E.size() - K) {
REP(k, K) { sum += E[i + k] + Z[i + k]; }
sum += E[i + K];
maxv = max(maxv, sum);
sum = 0;
}
cout << maxv << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define INF 2147483647
#define INFF 9223372036854775807
#define ll long long
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, m, n) for (int i = m; i < n; i++)
#define ALL(N) (N.begin(), N.end())
#define de cout << "debug" << endl;
#define pb push_back
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> E, Z;
int es = 0, zs = 0;
if (S.size() == 1) {
cout << 1 << endl;
return 0;
} else if (S.size() == 2) {
cout << 2 << endl;
return 0;
}
if (S[0] == '0')
E.push_back(0);
REP(i, S.size() - 1) {
if (S[i] == '1') {
es++;
if (S[i + 1] == '0') {
E.push_back(es);
es = 0;
}
} else if (S[i] == '0') {
zs++;
if (S[i + 1] == '1') {
Z.push_back(zs);
zs = 0;
}
}
if (i == S.size() - 2) {
if (S[i + 1] == '1') {
es++;
E.push_back(es);
} else {
zs++;
Z.push_back(zs);
}
}
}
if (S[S.size() - 1] == '0')
E.push_back(0);
int sum = 0;
int maxv = 0;
if (Z.size() <= K) {
cout << N << endl;
return 0;
}
REP(i, E.size() - K) {
REP(k, K) { sum += E[i + k] + Z[i + k]; }
sum += E[i + K];
maxv = max(maxv, sum);
sum = 0;
}
cout << maxv << endl;
} | insert | 73 | 73 | 73 | 77 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, s, n) for (int i = s; i < (n); ++i)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
static const int INTINF = (2147483647);
static const ll LLINF = (9223372036854775807);
static const int MAX = 1e5 + 1;
static const ll MOD = 1e9 + 7;
namespace Printer {
void print(vector<int> v) {
rep(i, v.size()) {
if (i)
cout << " ";
cout << v[i];
}
cout << endl;
}
void print(vector<vector<int>> vv) {
rep(i, vv.size()) {
rep(j, vv[i].size()) {
if (j)
cout << " ";
cout << vv[i][j];
}
cout << endl;
}
}
void print(pair<int, int> p) {
cout << "(" << p.first << ", " << p.second << ")" << endl;
}
}; // namespace Printer
//--global--//
//----------//
vector<pair<char, int>> Ranlength(string str) {
vector<pair<char, int>> ranlength;
pair<char, int> f;
char lastChar;
int cnt = 0;
rep(i, str.size()) {
if (lastChar != str[i] || i == str.size()) {
if (i != 0) {
f = make_pair(lastChar, cnt);
ranlength.push_back(f);
}
lastChar = str[i];
cnt = 1;
} else {
cnt++;
}
}
f = make_pair(lastChar, cnt);
ranlength.push_back(f);
// rep(i, ranlength.size()){ // for debug
// cout << ranlength[i].first << ranlength[i].second << endl;
// }
return ranlength;
}
int main(int argc, const char *argv[]) {
// 提出時、消す----//
//--------------//
int n, k;
cin >> n >> k;
string str;
cin >> str;
vector<pair<char, int>> v;
v = Ranlength(str);
if (str[0] != '1') {
v.insert(v.begin(), make_pair(1, 0));
}
if (*str.end() != '1') {
v.insert(v.end(), make_pair(1, 0));
}
int zeroNum = 0;
for (pair<char, int> f : v) {
char ch = f.first;
if (ch == '0') {
zeroNum++;
}
}
int cnt = max(0, zeroNum - k) + 1;
// cout << cnt << endl;
int ans = 0;
rep(i, cnt) {
int start = i * 2;
int end = k * 2 + 1;
int tmp = 0;
rep(j, end) { tmp += v[j + start].second; }
ans = max(ans, tmp);
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, s, n) for (int i = s; i < (n); ++i)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
static const int INTINF = (2147483647);
static const ll LLINF = (9223372036854775807);
static const int MAX = 1e5 + 1;
static const ll MOD = 1e9 + 7;
namespace Printer {
void print(vector<int> v) {
rep(i, v.size()) {
if (i)
cout << " ";
cout << v[i];
}
cout << endl;
}
void print(vector<vector<int>> vv) {
rep(i, vv.size()) {
rep(j, vv[i].size()) {
if (j)
cout << " ";
cout << vv[i][j];
}
cout << endl;
}
}
void print(pair<int, int> p) {
cout << "(" << p.first << ", " << p.second << ")" << endl;
}
}; // namespace Printer
//--global--//
//----------//
vector<pair<char, int>> Ranlength(string str) {
vector<pair<char, int>> ranlength;
pair<char, int> f;
char lastChar;
int cnt = 0;
rep(i, str.size()) {
if (lastChar != str[i] || i == str.size()) {
if (i != 0) {
f = make_pair(lastChar, cnt);
ranlength.push_back(f);
}
lastChar = str[i];
cnt = 1;
} else {
cnt++;
}
}
f = make_pair(lastChar, cnt);
ranlength.push_back(f);
// rep(i, ranlength.size()){ // for debug
// cout << ranlength[i].first << ranlength[i].second << endl;
// }
return ranlength;
}
int main(int argc, const char *argv[]) {
// 提出時、消す----//
//--------------//
int n, k;
cin >> n >> k;
string str;
cin >> str;
vector<pair<char, int>> v;
v = Ranlength(str);
if (str[0] != '1') {
v.insert(v.begin(), make_pair(1, 0));
}
if (*str.end() != '1') {
v.insert(v.end(), make_pair(1, 0));
}
int zeroNum = 0;
for (pair<char, int> f : v) {
char ch = f.first;
if (ch == '0') {
zeroNum++;
}
}
int cnt = max(0, zeroNum - k) + 1;
// cout << cnt << endl;
int ans = 0;
rep(i, cnt) {
int start = i * 2;
int end = min(k, zeroNum) * 2 + 1;
int tmp = 0;
rep(j, end) { tmp += v[j + start].second; }
ans = max(ans, tmp);
}
cout << ans << endl;
return 0;
}
| replace | 103 | 104 | 103 | 104 | 0 | |
p03074 | C++ | Runtime Error |
#include <algorithm>
#include <bits/stdc++.h>
#include <deque>
#include <iomanip>
#include <limits>
#include <map>
#include <math.h>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
#define llMAX numeric_limits<long long>::max()
#define intMAX numeric_limits<int>::max()
#define ll long long
#define d_2 100000
#define d9_7 1000000007
int main(void) {
int k, n;
cin >> n >> k;
string s;
cin >> s;
vector<int> accum(n, 0);
accum[0] = s[0] - '0';
int num0 = 0;
int num1 = 0;
int nnn = 0;
rep(i, n) {
if (s[i] == '0') {
num0++;
} else {
num1++;
}
if (i < n - 1) {
if (s[i] == '0' && s[i + 1] == '1') {
nnn++;
}
}
}
// cout<<"a";
if (s[n - 1] == '0')
nnn++;
rep(i, n) {
if (s[i + 1] == '1') {
accum[i + 1] = accum[i] + 1;
} else {
accum[i + 1] = accum[i];
}
}
// kやたら多い場合
if (nnn <= k) {
cout << n << endl;
return 0;
}
// cout<<"b";
vector<int> accum1;
int cnt = 1;
rep(i, n - 1) {
if (s[i] == s[i + 1]) {
cnt++;
} else {
accum1.push_back(cnt);
cnt = 1;
}
}
// cout<<"c";
accum1.push_back(cnt);
int ini = s[0] - '0';
int size = accum1.size();
/*rep(i,size){
cout<<accum1[i]<<" ";
}
cout<<"ini "<<ini<<endl;*/
k--;
vector<int> accum2(size);
accum2[0] = accum1[0];
rep(i, size - 1) { accum2[i + 1] = accum1[i + 1] + accum2[i]; }
int rmax = accum2[min(ini + k * 2 + 1, size - 1)];
for (int now = ini + 2; now + k * 2 < size; now += 2) {
// cout<<rmax<<" r ";
rmax = max(rmax, accum2[min(now + k * 2 + 1, size - 1)] - accum2[now - 2]);
}
// cout<<endl;
cout << rmax << endl;
return 0;
} |
#include <algorithm>
#include <bits/stdc++.h>
#include <deque>
#include <iomanip>
#include <limits>
#include <map>
#include <math.h>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
#define llMAX numeric_limits<long long>::max()
#define intMAX numeric_limits<int>::max()
#define ll long long
#define d_2 100000
#define d9_7 1000000007
int main(void) {
int k, n;
cin >> n >> k;
string s;
cin >> s;
vector<int> accum(n, 0);
accum[0] = s[0] - '0';
int num0 = 0;
int num1 = 0;
int nnn = 0;
rep(i, n) {
if (s[i] == '0') {
num0++;
} else {
num1++;
}
if (i < n - 1) {
if (s[i] == '0' && s[i + 1] == '1') {
nnn++;
}
}
}
// cout<<"a";
if (s[n - 1] == '0')
nnn++;
// kやたら多い場合
if (nnn <= k) {
cout << n << endl;
return 0;
}
// cout<<"b";
vector<int> accum1;
int cnt = 1;
rep(i, n - 1) {
if (s[i] == s[i + 1]) {
cnt++;
} else {
accum1.push_back(cnt);
cnt = 1;
}
}
// cout<<"c";
accum1.push_back(cnt);
int ini = s[0] - '0';
int size = accum1.size();
/*rep(i,size){
cout<<accum1[i]<<" ";
}
cout<<"ini "<<ini<<endl;*/
k--;
vector<int> accum2(size);
accum2[0] = accum1[0];
rep(i, size - 1) { accum2[i + 1] = accum1[i + 1] + accum2[i]; }
int rmax = accum2[min(ini + k * 2 + 1, size - 1)];
for (int now = ini + 2; now + k * 2 < size; now += 2) {
// cout<<rmax<<" r ";
rmax = max(rmax, accum2[min(now + k * 2 + 1, size - 1)] - accum2[now - 2]);
}
// cout<<endl;
cout << rmax << endl;
return 0;
} | delete | 46 | 53 | 46 | 46 | 0 | |
p03074 | C++ | Runtime Error |
#include <algorithm>
#include <fstream>
#include <functional>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define rep(i, start, end) for (int i = (int)(start); i < (int)(end); i++)
#define charToInt(c) c - 'a'
int main(int argc, const char *argv[]) {
std::ifstream in("/Users/tolemy/Downloads/D/in/testcase_06");
std::cin.rdbuf(in.rdbuf());
int n, k;
cin >> n >> k;
string s;
cin >> s;
// ０、もしくは１が連続する区間の長さを管理
vector<int> ranges0;
vector<int> ranges1;
// 後述の計算を簡単にするため、ダミーの区間を追加
if (s[0] == '0') {
ranges1.push_back(0);
}
{
int i, j = 0;
for (i = 0, j = i + 1; j < s.length(); j++) {
if (s[i] != s[j]) {
if (s[i] == '0') {
ranges0.push_back(j - i);
} else {
ranges1.push_back(j - i);
}
i = j;
}
}
// 最後の区間を追加
if (s[s.length() - 1] == '0') {
ranges0.push_back(j - i);
} else {
ranges1.push_back(j - i);
}
}
// 後述の計算を簡単にするため、ダミーの区間を追加
if (s[n - 1] == '0') {
ranges1.push_back(0);
}
// 0の区間をk個含むように連続する区間を計算
// 0の区間を最大まで含むように合計するには
// 1の区間1,0の区間1,1の区間2,0の区間2,...,1の区間k,0の区間k,1の区間(k+1)
// の2k+1個の区間を合計するのが最大。
// ただし、sが0から始まる場合はの区間1が、0で終わる場合は1の区間(k+1)がない可能性があるため
// 最初と最後にダミーを追加する
// 先に最初の2k+1個の区間を計算しておく
long long int total = 0;
{
int i = 0;
int ubi = min(k, (int)ranges0.size());
for (i = 0; i < ubi; i++) {
total += ranges1[i];
total += ranges0[i];
}
total += ranges1[ubi];
}
// 0の区間の個数がk個以下の場合は全てを0に変えることができる
if ((int)ranges0.size() <= k) {
cout << total << endl;
return 0;
}
long long int total_max = total;
for (int i = 0; i < ranges0.size() - k; i++) {
// i=0の時、total = r1[0] + r0[0] + r1[1] + r0[1] + ... + r1[k-1] + r0[k-1]
// + r1[k] i=1の時、total = r1[1] + r0[1] + ... + r1[k-1] +
// r0[k-1] + r1[k] + r0[k] + r1[k+1]
// なので、次の和を計算するときは最初の２項を引いて最後の２項を足す
total -= ranges1[i];
total -= ranges0[i];
total += ranges0[i + k];
total += ranges1[i + k + 1];
if (total_max < total)
total_max = total;
}
cout << total_max << endl;
return 0;
}
|
#include <algorithm>
#include <fstream>
#include <functional>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define rep(i, start, end) for (int i = (int)(start); i < (int)(end); i++)
#define charToInt(c) c - 'a'
int main(int argc, const char *argv[]) {
int n, k;
cin >> n >> k;
string s;
cin >> s;
// ０、もしくは１が連続する区間の長さを管理
vector<int> ranges0;
vector<int> ranges1;
// 後述の計算を簡単にするため、ダミーの区間を追加
if (s[0] == '0') {
ranges1.push_back(0);
}
{
int i, j = 0;
for (i = 0, j = i + 1; j < s.length(); j++) {
if (s[i] != s[j]) {
if (s[i] == '0') {
ranges0.push_back(j - i);
} else {
ranges1.push_back(j - i);
}
i = j;
}
}
// 最後の区間を追加
if (s[s.length() - 1] == '0') {
ranges0.push_back(j - i);
} else {
ranges1.push_back(j - i);
}
}
// 後述の計算を簡単にするため、ダミーの区間を追加
if (s[n - 1] == '0') {
ranges1.push_back(0);
}
// 0の区間をk個含むように連続する区間を計算
// 0の区間を最大まで含むように合計するには
// 1の区間1,0の区間1,1の区間2,0の区間2,...,1の区間k,0の区間k,1の区間(k+1)
// の2k+1個の区間を合計するのが最大。
// ただし、sが0から始まる場合はの区間1が、0で終わる場合は1の区間(k+1)がない可能性があるため
// 最初と最後にダミーを追加する
// 先に最初の2k+1個の区間を計算しておく
long long int total = 0;
{
int i = 0;
int ubi = min(k, (int)ranges0.size());
for (i = 0; i < ubi; i++) {
total += ranges1[i];
total += ranges0[i];
}
total += ranges1[ubi];
}
// 0の区間の個数がk個以下の場合は全てを0に変えることができる
if ((int)ranges0.size() <= k) {
cout << total << endl;
return 0;
}
long long int total_max = total;
for (int i = 0; i < ranges0.size() - k; i++) {
// i=0の時、total = r1[0] + r0[0] + r1[1] + r0[1] + ... + r1[k-1] + r0[k-1]
// + r1[k] i=1の時、total = r1[1] + r0[1] + ... + r1[k-1] +
// r0[k-1] + r1[k] + r0[k] + r1[k+1]
// なので、次の和を計算するときは最初の２項を引いて最後の２項を足す
total -= ranges1[i];
total -= ranges0[i];
total += ranges0[i + k];
total += ranges1[i + k + 1];
if (total_max < total)
total_max = total;
}
cout << total_max << endl;
return 0;
}
| delete | 15 | 17 | 15 | 15 | -11 | |
p03074 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define endl "\n"
using namespace std;
using ll = long long;
const ll MOD = 1000000007LL; // = 10^9 + 7
const double PI = 3.14159265358979;
void solve() {
int n, k;
string s;
cin >> n >> k >> s;
vector<int> enc(1, 1);
for (int i = 1; i < n; ++i) {
if (s[i - 1] == s[i])
enc.back()++;
else
enc.emplace_back(1);
}
ll ans = 0;
bool startWithZero = (s[0] == '0');
for (int i = 0; i < enc.size(); ++i) {
ll score = enc[i];
int loop_num = (startWithZero == (i & 1)) ? k / 2 * 2 : (k - (k % 2 == 0));
// cout << "loop times " << loop_num << endl;
for (int j = 1; j <= loop_num; ++j) {
if (i - j >= 0)
score += enc[i - j];
if (i + j < enc.size())
score += enc[i + j];
}
ans = max(ans, score);
}
cout << ans;
}
int main() {
fastio;
solve();
return 0;
} | #include <bits/stdc++.h>
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define endl "\n"
using namespace std;
using ll = long long;
const ll MOD = 1000000007LL; // = 10^9 + 7
const double PI = 3.14159265358979;
void solve() {
int n, k;
string s;
cin >> n >> k >> s;
vector<int> enc(1, 1);
for (int i = 1; i < n; ++i) {
if (s[i - 1] == s[i])
enc.back()++;
else
enc.emplace_back(1);
}
ll ans = 0;
bool startWithZero = (s[0] == '0');
int start_i = startWithZero != (k & 1);
ll sum = 0;
if (start_i < enc.size())
sum += enc[start_i];
for (int i = 1; i <= k; ++i) {
if (start_i - i >= 0)
sum += enc[start_i - i];
if (start_i + i < enc.size())
sum += enc[start_i + i];
}
ans = max(ans, sum);
// cout << start_i << " : " << sum << endl;
for (int i = start_i + 2; i < enc.size(); i += 2) {
if (i - k - 2 >= 0)
sum -= enc[i - k - 2];
if (i - k - 1 >= 0)
sum -= enc[i - k - 1];
if (i + k - 1 < enc.size())
sum += enc[i + k - 1];
if (i + k - 0 < enc.size())
sum += enc[i + k];
// cout << i << " : " << sum << endl;
ans = max(ans, sum);
}
cout << ans;
}
int main() {
fastio;
solve();
return 0;
} | replace | 28 | 39 | 28 | 53 | TLE | |
p03074 | C++ | Time Limit Exceeded | #include <iostream>
#include <string>
#include <vector>
std::vector<int64_t> calc_seq(std::vector<int64_t> &xs) {
auto seq = std::vector<int64_t>{};
auto count = 1;
for (size_t i = 0; i < xs.size() - 1; i++) {
if (xs[i] == xs[i + 1]) {
count++;
} else {
seq.push_back(count);
count = 1;
}
}
seq.push_back(count);
return seq;
}
std::vector<int64_t> form_seq(std::vector<int64_t> &xs) {
auto seq = calc_seq(xs);
if (xs[0] == 0) {
seq.insert(begin(seq), 0);
}
if (seq.size() % 2 == 0) {
seq.push_back(0);
}
return seq;
}
int64_t sum(std::vector<int64_t> xs, int64_t i0, int64_t i1) {
auto val = 0LL;
for (auto i = i0; i <= i1; i++) {
val += xs[i];
}
return val;
}
void calc(int64_t n, int64_t k, std::vector<int64_t> &xs) {
auto seq = form_seq(xs);
auto m = seq.size();
auto i = 1LL;
if (i + 2 * k > m) {
std::cout << n;
return;
}
auto val = sum(seq, i - 1, i - 1 + 2 * k);
auto biggest = val;
i += 2;
while (i + 2 * k <= m) {
val += sum(seq, i - 1 + 2 * k - 1, i - 1 + 2 * k) -
sum(seq, i - 1 - 2, i - 1 - 1);
if (biggest < val) {
biggest = val;
}
i += 2;
}
std::cout << biggest;
}
int main() {
std::string s1, s2;
std::cin >> s1 >> s2;
auto n = stoi(s1);
auto k = stoi(s2);
std::string s3;
std::cin >> s3;
std::vector<int64_t> xs(n);
for (size_t i = 0; i < n; i++) {
xs[i] = stoi(s3.substr(i, 1));
}
calc(n, k, xs);
} | #include <iostream>
#include <string>
#include <vector>
std::vector<int64_t> calc_seq(std::vector<int64_t> &xs) {
auto seq = std::vector<int64_t>{};
auto count = 1;
for (size_t i = 0; i < xs.size() - 1; i++) {
if (xs[i] == xs[i + 1]) {
count++;
} else {
seq.push_back(count);
count = 1;
}
}
seq.push_back(count);
return seq;
}
std::vector<int64_t> form_seq(std::vector<int64_t> &xs) {
auto seq = calc_seq(xs);
if (xs[0] == 0) {
seq.insert(begin(seq), 0);
}
if (seq.size() % 2 == 0) {
seq.push_back(0);
}
return seq;
}
int64_t sum(std::vector<int64_t> xs, int64_t i0, int64_t i1) {
auto val = 0LL;
for (auto i = i0; i <= i1; i++) {
val += xs[i];
}
return val;
}
void calc(int64_t n, int64_t k, std::vector<int64_t> &xs) {
auto seq = form_seq(xs);
auto m = seq.size();
auto i = 1LL;
if (i + 2 * k > m) {
std::cout << n;
return;
}
auto val = sum(seq, i - 1, i - 1 + 2 * k);
auto biggest = val;
i += 2;
while (i + 2 * k <= m) {
val += seq[i - 1 + 2 * k - 1] + seq[i - 1 + 2 * k] - seq[i - 1 - 2] -
seq[i - 1 - 1];
if (biggest < val) {
biggest = val;
}
i += 2;
}
std::cout << biggest;
}
int main() {
std::string s1, s2;
std::cin >> s1 >> s2;
auto n = stoi(s1);
auto k = stoi(s2);
std::string s3;
std::cin >> s3;
std::vector<int64_t> xs(n);
for (size_t i = 0; i < n; i++) {
xs[i] = stoi(s3.substr(i, 1));
}
calc(n, k, xs);
} | replace | 50 | 52 | 50 | 52 | TLE | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int n, k;
string s;
P p[505];
int main(void) {
scanf("%d%d", &n, &k);
cin >> s;
int prev = (s[0] - '0');
int cnt = 0;
int sz = 0;
for (int i = 0; i < n; i++) {
if (prev != (s[i] - '0')) {
p[sz++] = P(prev, cnt);
cnt = 0;
}
cnt++;
prev = (s[i] - '0');
}
p[sz++] = P(prev, cnt);
int l = 0;
int zero = 0;
int sum = 0;
int ans = 0;
for (int i = 0; i < sz; i++) {
// printf("%d %d\n",p[i].first,p[i].second);
if (p[i].first == 0) {
zero++;
while (zero > k) {
sum -= p[l].second;
zero -= 1 - p[l].first;
l++;
}
}
sum += p[i].second;
ans = max(ans, sum);
}
printf("%d\n", ans);
return 0;
}
| #include <bits/stdc++.h>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int n, k;
string s;
P p[100005];
int main(void) {
scanf("%d%d", &n, &k);
cin >> s;
int prev = (s[0] - '0');
int cnt = 0;
int sz = 0;
for (int i = 0; i < n; i++) {
if (prev != (s[i] - '0')) {
p[sz++] = P(prev, cnt);
cnt = 0;
}
cnt++;
prev = (s[i] - '0');
}
p[sz++] = P(prev, cnt);
int l = 0;
int zero = 0;
int sum = 0;
int ans = 0;
for (int i = 0; i < sz; i++) {
// printf("%d %d\n",p[i].first,p[i].second);
if (p[i].first == 0) {
zero++;
while (zero > k) {
sum -= p[l].second;
zero -= 1 - p[l].first;
l++;
}
}
sum += p[i].second;
ans = max(ans, sum);
}
printf("%d\n", ans);
return 0;
}
| replace | 8 | 9 | 8 | 9 | 0 | |
p03074 | C++ | Runtime Error | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
string str;
cin >> N >> K >> str;
vector<int> vec;
if (str[0] == '0')
vec.push_back(0);
int cnt = 1;
for (int i = 1; i < N; i++) {
if (str[i - 1] == str[i]) {
cnt++;
} else {
vec.push_back(cnt);
cnt = 1;
}
}
vec.push_back(cnt);
auto M = (int)vec.size();
vector<int> S(M, 0);
for (int i = 0; i < M; i++)
S[i + 1] = S[i] + vec[i];
int ret = 0;
for (int i = 0; i < M; i += 2) {
ret = max(ret, S[min(M, i + 2 * K + 1)] - S[i]);
}
cout << ret << endl;
return 0;
} | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
string str;
cin >> N >> K >> str;
vector<int> vec;
if (str[0] == '0')
vec.push_back(0);
int cnt = 1;
for (int i = 1; i < N; i++) {
if (str[i - 1] == str[i]) {
cnt++;
} else {
vec.push_back(cnt);
cnt = 1;
}
}
vec.push_back(cnt);
auto M = (int)vec.size();
vector<int> S(M + 1, 0);
for (int i = 0; i < M; i++)
S[i + 1] = S[i] + vec[i];
int ret = 0;
for (int i = 0; i < M; i += 2) {
ret = max(ret, S[min(M, i + 2 * K + 1)] - S[i]);
}
cout << ret << endl;
return 0;
} | replace | 25 | 26 | 25 | 26 | 0 | |
p03074 | Python | Runtime Error | from itertools import groupby, accumulate
# 入力
N, K = map(int, input().split())
S = input()
# 連続する0または1の数に関する累積和
A = list(accumulate(len(list(seq)) for _, seq in groupby(S))) + [N]
m = 1 if S[0] == "0" else 0
# 累積和を用いて解を求める
ans = (
max(
A[2 * K - 1],
A[-1] - A[-(2 * K)],
max((a - b for a, b in zip(A[(2 * K + m) :: 2], ([0] + A)[m::2])), default=0),
)
if m < len(A)
else A[-1]
)
# 出力
print(ans)
| from itertools import groupby, accumulate
# 入力
N, K = map(int, input().split())
S = input()
# 連続する0または1の数に関する累積和
A = list(accumulate(len(list(seq)) for _, seq in groupby(S))) + [N]
m = 1 if S[0] == "0" else 0
# 累積和を用いて解を求める
ans = (
max(
A[min(2 * K - 1, len(A) - 1)],
A[-1] - A[max(-(2 * K), -len(A))],
max((a - b for a, b in zip(A[(2 * K + m) :: 2], ([0] + A)[m::2])), default=0),
)
if m < len(A)
else A[-1]
)
# 出力
print(ans)
| replace | 12 | 14 | 12 | 14 | 0 | |
p03074 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstdlib>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
template <class T> using V = vector<T>;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const long long INF = 1LL << 60;
const double pi = acos(-1);
using ll = long long;
using db = long double;
using st = string;
using ch = char;
using vll = V<ll>;
using vpll = V<pair<ll, ll>>;
using vst = V<st>;
using vdb = V<db>;
using vch = V<ch>;
using graph = V<V<int>>;
using pq = priority_queue<ll>;
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define bgn begin()
#define en end()
#define SORT(a) sort((a).bgn, (a).en)
#define REV(a) reverse((a).bgn, (a).en)
#define fi first
#define se second
#define sz size()
#define gcd(a, b) __gcd(a, b)
#define pb(a) push_back(a);
#define ALL(a) (a).begin(), (a).end()
ll Sum(ll n) {
ll m = 0;
while (n) {
m += n % 10;
n /= 10;
}
return m;
}
const int MAX = 510000;
// change
const int MOD = 998244353;
long long fac[MAX], finv[MAX], inv[MAX];
void Comuse() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
#define comuse Comuse()
ll combi(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll perm(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] % MOD) % MOD;
}
ll modpow(ll a, ll n, ll mod) {
ll ans = 1;
while (n > 0) {
if (n & 1) {
ans = ans * a % mod;
}
a = a * a % mod;
n >>= 1;
}
return ans;
}
ll modinv(ll a, ll mod) { return modpow(a, mod - 2, mod); }
ll modcombi(int n, int k, int mod) {
ll ans = 1;
for (ll i = n; i > n - k; i--) {
ans *= i;
ans %= mod;
}
for (ll i = 1; i <= k; i++) {
ans *= modinv(i, mod);
ans %= mod;
}
return ans;
}
ll lcm(ll a, ll b) {
ll n;
n = a / gcd(a, b) * b;
return n;
}
vll div(ll n) {
vll ret;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n) {
ret.push_back(n / i);
}
}
}
SORT(ret);
return (ret);
}
vector<bool> isprime(MAX + 100, true);
void primeuse() {
isprime[0] = false;
isprime[1] = false;
for (int i = 2; i < MAX + 50; i++) {
int up = sqrt(i) + 1;
for (int j = 2; j < up; j++) {
if (i % j == 0) {
isprime[i] = false;
}
}
}
}
void Solve();
const int MAX_N = 131072;
// segment tree
int NN;
int seg[MAX_N * 2 - 1];
void seguse() {
for (int i = 0; i < 2 * NN - 1; i++) {
seg[i] = INT_MAX;
}
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(20) << fixed;
Solve();
}
/****************************************\
| Thank you for viewing my code:) |
| Written by RedSpica a.k.a. RanseMirage |
| Twitter:@asakaakasaka |
\****************************************/
// segtreeの葉の先頭の添え字はN-1
void Solve() {
ll n, k;
cin >> n >> k;
vll A(1);
string s;
cin >> s;
if (s[0] == '0') {
A.push_back(0LL);
}
ll count = 1;
FOR(i, 1, n) {
if (s[i] != s[i - 1]) {
A.push_back(count);
count = 1;
} else {
count++;
}
}
A.push_back(count);
ll m = A.size();
FOR(i, 1, m) { A[i] += A[i - 1]; }
ll t = 50000;
while (t--) {
A.push_back(n);
}
ll ans = 0;
for (int i = 0; i < m; i += 2) {
chmax(ans, A[i + 2 * k + 1] - A[i]);
}
cout << ans << "\n";
} | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstdlib>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
template <class T> using V = vector<T>;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const long long INF = 1LL << 60;
const double pi = acos(-1);
using ll = long long;
using db = long double;
using st = string;
using ch = char;
using vll = V<ll>;
using vpll = V<pair<ll, ll>>;
using vst = V<st>;
using vdb = V<db>;
using vch = V<ch>;
using graph = V<V<int>>;
using pq = priority_queue<ll>;
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define bgn begin()
#define en end()
#define SORT(a) sort((a).bgn, (a).en)
#define REV(a) reverse((a).bgn, (a).en)
#define fi first
#define se second
#define sz size()
#define gcd(a, b) __gcd(a, b)
#define pb(a) push_back(a);
#define ALL(a) (a).begin(), (a).end()
ll Sum(ll n) {
ll m = 0;
while (n) {
m += n % 10;
n /= 10;
}
return m;
}
const int MAX = 510000;
// change
const int MOD = 998244353;
long long fac[MAX], finv[MAX], inv[MAX];
void Comuse() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
#define comuse Comuse()
ll combi(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll perm(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] % MOD) % MOD;
}
ll modpow(ll a, ll n, ll mod) {
ll ans = 1;
while (n > 0) {
if (n & 1) {
ans = ans * a % mod;
}
a = a * a % mod;
n >>= 1;
}
return ans;
}
ll modinv(ll a, ll mod) { return modpow(a, mod - 2, mod); }
ll modcombi(int n, int k, int mod) {
ll ans = 1;
for (ll i = n; i > n - k; i--) {
ans *= i;
ans %= mod;
}
for (ll i = 1; i <= k; i++) {
ans *= modinv(i, mod);
ans %= mod;
}
return ans;
}
ll lcm(ll a, ll b) {
ll n;
n = a / gcd(a, b) * b;
return n;
}
vll div(ll n) {
vll ret;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n) {
ret.push_back(n / i);
}
}
}
SORT(ret);
return (ret);
}
vector<bool> isprime(MAX + 100, true);
void primeuse() {
isprime[0] = false;
isprime[1] = false;
for (int i = 2; i < MAX + 50; i++) {
int up = sqrt(i) + 1;
for (int j = 2; j < up; j++) {
if (i % j == 0) {
isprime[i] = false;
}
}
}
}
void Solve();
const int MAX_N = 131072;
// segment tree
int NN;
int seg[MAX_N * 2 - 1];
void seguse() {
for (int i = 0; i < 2 * NN - 1; i++) {
seg[i] = INT_MAX;
}
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(20) << fixed;
Solve();
}
/****************************************\
| Thank you for viewing my code:) |
| Written by RedSpica a.k.a. RanseMirage |
| Twitter:@asakaakasaka |
\****************************************/
// segtreeの葉の先頭の添え字はN-1
void Solve() {
ll n, k;
cin >> n >> k;
vll A(1);
string s;
cin >> s;
if (s[0] == '0') {
A.push_back(0LL);
}
ll count = 1;
FOR(i, 1, n) {
if (s[i] != s[i - 1]) {
A.push_back(count);
count = 1;
} else {
count++;
}
}
A.push_back(count);
ll m = A.size();
FOR(i, 1, m) { A[i] += A[i - 1]; }
ll t = 500000;
while (t--) {
A.push_back(n);
}
ll ans = 0;
for (int i = 0; i < m; i += 2) {
chmax(ans, A[i + 2 * k + 1] - A[i]);
}
cout << ans << "\n";
} | replace | 222 | 223 | 222 | 223 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
const ll INF = (ll)1 << 60;
int main() {
int N, K;
string S;
cin >> N >> K;
cin >> S;
vector<int> Nums;
int now = 1;
int cnt = 0;
rep(i, N) {
if (S[i] == (char)('0') + now)
cnt++;
else {
Nums.push_back(cnt);
now = 1 - now;
cnt = 1;
}
}
if (cnt != 0)
Nums.push_back(cnt);
if (Nums.size() % 2 == 0)
Nums.push_back(0);
int Add = 2 * K + 1;
int ans = 0;
vector<int> sum(Nums.size() + 1);
rep(i, sum.size()) { sum[i + 1] = sum[i] + Nums[i]; }
for (int i = 0; i < (int)Nums.size(); i += 2) {
int left = i;
int right = min(i + Add, (int)Nums.size());
int tmp = sum[right] - sum[left];
ans = max(ans, tmp);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
const ll INF = (ll)1 << 60;
int main() {
int N, K;
string S;
cin >> N >> K;
cin >> S;
vector<int> Nums;
int now = 1;
int cnt = 0;
rep(i, N) {
if (S[i] == (char)('0') + now)
cnt++;
else {
Nums.push_back(cnt);
now = 1 - now;
cnt = 1;
}
}
if (cnt != 0)
Nums.push_back(cnt);
if (Nums.size() % 2 == 0)
Nums.push_back(0);
int Add = 2 * K + 1;
int ans = 0;
vector<int> sum(Nums.size() + 1);
rep(i, Nums.size()) { sum[i + 1] = sum[i] + Nums[i]; }
for (int i = 0; i < (int)Nums.size(); i += 2) {
int left = i;
int right = min(i + Add, (int)Nums.size());
int tmp = sum[right] - sum[left];
ans = max(ans, tmp);
}
cout << ans << endl;
return 0;
} | replace | 33 | 34 | 33 | 34 | 0 | |
p03074 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
#define INF (1e9)
int N, K;
int main() {
cin >> N >> K;
string S;
cin >> S;
vi change(0);
if (S[0] == '0')
change.push_back(0);
int last = 'x';
for (int i = 0; i < N; i++) {
if (S[i] == last)
continue;
change.push_back(i);
last = S[i];
}
change.push_back(N);
int ans = 0;
for (int i = 0; i < change.size(); i += 2) {
ans = max(ans, change[min(i + 2 * K + 1, N - 1)] - change[i]);
}
if (change.size() == 2)
ans = N;
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
#define INF (1e9)
int N, K;
int main() {
cin >> N >> K;
string S;
cin >> S;
vi change(0);
if (S[0] == '0')
change.push_back(0);
int last = 'x';
for (int i = 0; i < N; i++) {
if (S[i] == last)
continue;
change.push_back(i);
last = S[i];
}
change.push_back(N);
int ans = 0;
for (int i = 0; i < change.size(); i += 2) {
ans = max(ans,
change[min(i + 2 * K + 1, (int)(change.size() - 1))] - change[i]);
}
if (change.size() == 2)
ans = N;
cout << ans << endl;
return 0;
}
| replace | 36 | 37 | 36 | 38 | 0 | |
p03074 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int n, k;
string s;
cin >> n >> k >> s;
vector<int> Nums;
int now = 1;
int cnt = 0;
rep(i, n) {
if (s[i] == (char)('0' + now)) {
cnt++;
} else {
Nums.push_back(cnt);
now = 1 - now;
cnt = 1;
}
}
if (cnt != 0) {
Nums.push_back(cnt);
}
if (Nums.size() % 2 == 0) {
Nums.push_back(0);
}
int Add = 2 * k + 1;
vector<int> sum(Nums.size() + 1);
for (int i = 0; i < sum.size(); i++) {
sum[i + 1] = sum[i] + Nums[i];
}
int ans = 0;
for (int i = 0; i < Nums.size(); i += 2) {
int left = i;
int right = min(i + Add, (int)Nums.size());
int tmp = sum[right] - sum[left];
ans = max(tmp, ans);
}
cout << ans;
cout << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int n, k;
string s;
cin >> n >> k >> s;
vector<int> Nums;
int now = 1;
int cnt = 0;
rep(i, n) {
if (s[i] == (char)('0' + now)) {
cnt++;
} else {
Nums.push_back(cnt);
now = 1 - now;
cnt = 1;
}
}
if (cnt != 0) {
Nums.push_back(cnt);
}
if (Nums.size() % 2 == 0) {
Nums.push_back(0);
}
int Add = 2 * k + 1;
vector<int> sum(Nums.size() + 1);
for (int i = 0; i < Nums.size(); i++) {
sum[i + 1] = sum[i] + Nums[i];
}
int ans = 0;
for (int i = 0; i < Nums.size(); i += 2) {
int left = i;
int right = min(i + Add, (int)Nums.size());
int tmp = sum[right] - sum[left];
ans = max(tmp, ans);
}
cout << ans;
cout << endl;
return 0;
} | replace | 37 | 38 | 37 | 38 | 0 | |
p03074 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define exrep(i, a, b) for (ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
#define re0 return 0
const ll mod = 1000000007;
const ll INF = 1e16;
const ll MAX_N = 100010;
int main() {
ll n, k;
string s;
cin >> n >> k >> s;
vl v0, v1;
if (s[0] == '0') {
v1.pb(0);
}
ll cnt0 = 0, cnt1 = 0;
rep(i, n) {
if (i > 0 && s[i - 1] == '0' && s[i] == '1') {
v0.pb(cnt0);
cnt0 = 0;
} else if (i > 0 && s[i - 1] == '1' && s[i] == '0') {
v1.pb(cnt1);
cnt1 = 0;
}
if (s[i] == '0') {
cnt0++;
} else {
cnt1++;
}
}
if (s[n - 1] == '0') {
v0.pb(cnt0);
v1.pb(0);
} else {
v1.pb(cnt1);
}
if (k >= v0.size()) {
out(n);
re0;
}
ll m = v0.size();
vl rui0(m + 1); // rui0[i+1] : v0[i]までの和
vl rui1(m + 2); // rui1[i+1] : v1[i]までの和
rep(i, m) { rui0[i + 1] = rui0[i] + v0[i]; }
rep(i, m + 1) { rui1[i + 1] = rui1[i] + v1[i]; }
ll ans = 1;
rep(i, m) {
chmax(ans, (rui1[i + k + 1] - rui1[i]) + (rui0[i + k] - rui0[i]));
}
out(ans);
re0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define exrep(i, a, b) for (ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
#define re0 return 0
const ll mod = 1000000007;
const ll INF = 1e16;
const ll MAX_N = 100010;
int main() {
ll n, k;
string s;
cin >> n >> k >> s;
vl v0, v1;
if (s[0] == '0') {
v1.pb(0);
}
ll cnt0 = 0, cnt1 = 0;
rep(i, n) {
if (i > 0 && s[i - 1] == '0' && s[i] == '1') {
v0.pb(cnt0);
cnt0 = 0;
} else if (i > 0 && s[i - 1] == '1' && s[i] == '0') {
v1.pb(cnt1);
cnt1 = 0;
}
if (s[i] == '0') {
cnt0++;
} else {
cnt1++;
}
}
if (s[n - 1] == '0') {
v0.pb(cnt0);
v1.pb(0);
} else {
v1.pb(cnt1);
}
if (k >= v0.size()) {
out(n);
re0;
}
ll m = v0.size();
vl rui0(m + 1); // rui0[i+1] : v0[i]までの和
vl rui1(m + 2); // rui1[i+1] : v1[i]までの和
rep(i, m) { rui0[i + 1] = rui0[i] + v0[i]; }
rep(i, m + 1) { rui1[i + 1] = rui1[i] + v1[i]; }
ll ans = 1;
rep(i, m - k + 1) {
chmax(ans, (rui1[i + k + 1] - rui1[i]) + (rui0[i + k] - rui0[i]));
}
out(ans);
re0;
} | replace | 74 | 75 | 74 | 75 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define d(x) cerr << #x ":" << x << endl;
#define dd(x, y) cerr << "(" #x "," #y "):(" << x << "," << y << ")" << endl
#define rep(i, n) for (int i = (int)(0); i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define dump(v) \
cerr << #v ":[ "; \
for (auto macro_vi : v) { \
cerr << macro_vi << " "; \
} \
cerr << "]" << endl;
#define ddump(v) \
cerr << #v ":" << endl; \
for (auto macro_row : v) { \
cerr << "["; \
for (auto macro__vi : macro_row) { \
cerr << macro__vi << " "; \
} \
cerr << "]" << endl; \
}
using lint = long long;
const int INF = 1e9;
const lint LINF = 1e18;
const double EPS = 1e-10;
int main() {
lint N, K;
string S;
cin >> N >> K >> S;
N = S.size();
vector<lint> A(0);
lint cnt = 1;
if (S[0] == '0') {
A.push_back(0);
}
for (int i = 0; i < N - 1; i++) {
if (S[i + 1] == S[i]) {
cnt++;
} else {
A.push_back(cnt);
cnt = 1;
}
}
A.push_back(cnt);
// dump(A);
vector<lint> L(A.size() + 1);
rep(i, A.size()) L[i + 1] = L[i] + A[i];
lint ans = -1;
for (int left = 0; left < N; left += 2) {
int right = min(left + 2 * K + 1, N);
ans = max(ans, L[right] - L[left]);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define d(x) cerr << #x ":" << x << endl;
#define dd(x, y) cerr << "(" #x "," #y "):(" << x << "," << y << ")" << endl
#define rep(i, n) for (int i = (int)(0); i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define dump(v) \
cerr << #v ":[ "; \
for (auto macro_vi : v) { \
cerr << macro_vi << " "; \
} \
cerr << "]" << endl;
#define ddump(v) \
cerr << #v ":" << endl; \
for (auto macro_row : v) { \
cerr << "["; \
for (auto macro__vi : macro_row) { \
cerr << macro__vi << " "; \
} \
cerr << "]" << endl; \
}
using lint = long long;
const int INF = 1e9;
const lint LINF = 1e18;
const double EPS = 1e-10;
int main() {
lint N, K;
string S;
cin >> N >> K >> S;
N = S.size();
vector<lint> A(0);
lint cnt = 1;
if (S[0] == '0') {
A.push_back(0);
}
for (int i = 0; i < N - 1; i++) {
if (S[i + 1] == S[i]) {
cnt++;
} else {
A.push_back(cnt);
cnt = 1;
}
}
A.push_back(cnt);
// dump(A);
vector<lint> L(A.size() + 1);
rep(i, A.size()) L[i + 1] = L[i] + A[i];
lint ans = -1;
for (int left = 0; left < (lint)A.size(); left += 2) {
int right = min(left + 2 * K + 1, (lint)A.size());
ans = max(ans, L[right] - L[left]);
}
cout << ans << endl;
return 0;
} | replace | 56 | 58 | 56 | 58 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, K;
cin >> n >> K;
string s;
cin >> s;
vector<P> v;
for (char c : s) {
int tar = (c - '0');
if (v.empty()) {
v.emplace_back(tar, 1);
continue;
}
if (v.back().first == tar) {
v.back().second++;
} else {
v.emplace_back(tar, 1);
}
}
int sum = 0;
int cnt0 = 0;
int idx = 0;
int ans = 0;
for (int i = 0; i < n; i++) {
if (v[i].first == 0) {
cnt0++;
if (cnt0 > K) {
sum -= v[idx].second;
idx++;
if (v[idx - 1].first == 1) {
sum -= v[idx].second;
idx++;
}
cnt0--;
}
}
sum += v[i].second;
ans = max(ans, sum);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, K;
cin >> n >> K;
string s;
cin >> s;
vector<P> v;
for (char c : s) {
int tar = (c - '0');
if (v.empty()) {
v.emplace_back(tar, 1);
continue;
}
if (v.back().first == tar) {
v.back().second++;
} else {
v.emplace_back(tar, 1);
}
}
int sum = 0;
int cnt0 = 0;
int idx = 0;
int ans = 0;
for (int i = 0; i < v.size(); i++) {
if (v[i].first == 0) {
cnt0++;
if (cnt0 > K) {
sum -= v[idx].second;
idx++;
if (v[idx - 1].first == 1) {
sum -= v[idx].second;
idx++;
}
cnt0--;
}
}
sum += v[i].second;
ans = max(ans, sum);
}
cout << ans << endl;
return 0;
} | replace | 33 | 34 | 33 | 34 | 0 | |
p03074 | C++ | Runtime Error | #include <iostream>
#include <numeric>
#include <string>
#include <vector>
int main() {
int n, k;
std::cin >> n >> k;
std::string s;
std::cin >> s;
s += 'E';
std::vector<int> a;
int i = 0;
while (i < n) {
int x = 0;
while (s[i] == '1') {
x++;
i++;
}
a.push_back(x);
int y = 0;
while (s[i] == '0') {
y++;
i++;
}
a.push_back(y);
}
a.push_back(0);
k = std::min(n, k * 2 + 1);
int ans = 0;
for (i = 0; i <= n - k; i += 2) {
int x = std::accumulate(&a[i], &a[i + k], 0);
ans = std::max(ans, x);
}
std::cout << ans;
} | #include <iostream>
#include <numeric>
#include <string>
#include <vector>
int main() {
int n, k;
std::cin >> n >> k;
std::string s;
std::cin >> s;
s += 'E';
std::vector<int> a;
int i = 0;
while (i < n) {
int x = 0;
while (s[i] == '1') {
x++;
i++;
}
a.push_back(x);
int y = 0;
while (s[i] == '0') {
y++;
i++;
}
a.push_back(y);
}
a.push_back(0);
n = a.size();
k = std::min(n, k * 2 + 1);
int ans = 0;
for (i = 0; i <= n - k; i += 2) {
int x = std::accumulate(&a[i], &a[i + k], 0);
ans = std::max(ans, x);
}
std::cout << ans;
} | insert | 27 | 27 | 27 | 28 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, d, n) for (int i = (d); i < (n); ++i)
#define all(v) v.begin(), v.end()
using ll = long long;
using P = pair<char, int>;
int main() {
int n, k;
string s;
cin >> n >> k >> s;
vector<P> vp;
if (s[0] == '0') {
vp.emplace_back('1', 0);
}
vp.emplace_back(s[0], 1);
REP(i, 1, n) {
if (vp.back().first == s[i]) {
vp.back().second++;
} else {
vp.emplace_back(s[i], 1);
}
}
if (vp.back().first == '0') {
vp.emplace_back('1', 0);
}
int tmp = 0;
int l = k;
int idx = 0;
rep(i, vp.size()) {
tmp += vp[i].second;
if (vp[i].first == '0') {
l--;
}
if (l == 0) {
idx = i + 1;
tmp += vp[idx].second;
break;
}
}
int ans = tmp;
for (int i = idx + 1; i < vp.size() - 1; i += 2) {
tmp += vp[i].second + vp[i + 1].second;
tmp -= (vp[i - 2 * k - 1].second + vp[i - 2 * k].second);
ans = max(ans, tmp);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, d, n) for (int i = (d); i < (n); ++i)
#define all(v) v.begin(), v.end()
using ll = long long;
using P = pair<char, int>;
int main() {
int n, k;
string s;
cin >> n >> k >> s;
vector<P> vp;
if (s[0] == '0') {
vp.emplace_back('1', 0);
}
vp.emplace_back(s[0], 1);
REP(i, 1, n) {
if (vp.back().first == s[i]) {
vp.back().second++;
} else {
vp.emplace_back(s[i], 1);
}
}
if (vp.back().first == '0') {
vp.emplace_back('1', 0);
}
if (vp.size() / 2 <= k) {
cout << n << endl;
return 0;
}
int tmp = 0;
int l = k;
int idx = 0;
rep(i, vp.size()) {
tmp += vp[i].second;
if (vp[i].first == '0') {
l--;
}
if (l == 0) {
idx = i + 1;
tmp += vp[idx].second;
break;
}
}
int ans = tmp;
for (int i = idx + 1; i < vp.size() - 1; i += 2) {
tmp += vp[i].second + vp[i + 1].second;
tmp -= (vp[i - 2 * k - 1].second + vp[i - 2 * k].second);
ans = max(ans, tmp);
}
cout << ans << endl;
return 0;
} | insert | 30 | 30 | 30 | 35 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define For(i, n, k) for (ll i = (n); i < (k); i++)
ll n, k, ans = 0;
string s;
void Main() {
cin >> n >> k >> s;
vector<ll> bound;
bound.push_back(0);
For(i, 1, n) {
if (s.at(i - 1) != s.at(i)) {
bound.push_back(i);
}
}
ll l = bound.size();
For(i, 0, 100000) { bound.push_back(n); }
for (ll i = 0; i < l; i++) {
// cout<<ans<<endl;
if (s.at(bound.at(i)) == '0') {
ans = max(ans, bound.at(i + 2 * k) - bound.at(i));
} else {
ans = max(ans, bound.at(i + 2 * k + 1) - bound.at(i));
}
}
cout << ans << endl;
}
int main() {
Main();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define For(i, n, k) for (ll i = (n); i < (k); i++)
ll n, k, ans = 0;
string s;
void Main() {
cin >> n >> k >> s;
vector<ll> bound;
bound.push_back(0);
For(i, 1, n) {
if (s.at(i - 1) != s.at(i)) {
bound.push_back(i);
}
}
ll l = bound.size();
For(i, 0, 200000) { bound.push_back(n); }
for (ll i = 0; i < l; i++) {
// cout<<ans<<endl;
if (s.at(bound.at(i)) == '0') {
ans = max(ans, bound.at(i + 2 * k) - bound.at(i));
} else {
ans = max(ans, bound.at(i + 2 * k + 1) - bound.at(i));
}
}
cout << ans << endl;
}
int main() {
Main();
return 0;
}
| replace | 16 | 17 | 16 | 17 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
#define all(x) begin(x), end(x)
#define dbg(x) cerr << #x << " = " << x << endl
#define _ << ' ' <<
using namespace std;
using ll = long long;
using vi = vector<int>;
int n, k;
string s;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> k >> s;
vi v;
s += 'x';
int cnt = 0;
char p = s[0];
for (int i = 0; i <= n; ++i) {
if (s[i] != p)
v.push_back(cnt), cnt = 0;
cnt++;
p = s[i];
}
for (int i = 1; i < v.size(); ++i)
v[i] += v[i - 1];
int m = s[0] == '1';
int sol = 0;
for (int i = 0; i < n; ++i) {
int r = min((int)v.size() - 1, i + 2 * k - 1 + (m + i) % 2);
int s = v[r] - (i ? v[i - 1] : 0);
sol = max(sol, s);
}
cout << sol;
}
| #include <bits/stdc++.h>
#define all(x) begin(x), end(x)
#define dbg(x) cerr << #x << " = " << x << endl
#define _ << ' ' <<
using namespace std;
using ll = long long;
using vi = vector<int>;
int n, k;
string s;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> k >> s;
vi v;
s += 'x';
int cnt = 0;
char p = s[0];
for (int i = 0; i <= n; ++i) {
if (s[i] != p)
v.push_back(cnt), cnt = 0;
cnt++;
p = s[i];
}
for (int i = 1; i < v.size(); ++i)
v[i] += v[i - 1];
int m = s[0] == '1';
int sol = 0;
for (int i = 0; i < v.size(); ++i) {
int r = min((int)v.size() - 1, i + 2 * k - 1 + (m + i) % 2);
int s = v[r] - (i ? v[i - 1] : 0);
sol = max(sol, s);
}
cout << sol;
}
| replace | 31 | 32 | 31 | 32 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, m, n) for (int i = m; i < n; ++i)
#define rem(i, m, n) for (int i = m; i >= n; --i)
typedef long long ll;
#define mod 1000000007
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <class T> ll part(const T &s, int l, int r) { return s[r] - s[l]; };
int main() {
int N, K;
string S;
cin >> N >> K >> S;
if (N <= K) {
cout << N << endl;
return 0;
}
int cnt = 1;
vector<int> A;
rep(i, 0, 3) A.push_back(0);
if (S[0] == '0')
A.push_back(0);
rep(i, 1, N) {
if (S[i] == S[i - 1]) {
cnt++;
} else {
A.push_back(cnt);
cnt = 1;
}
}
if (cnt)
A.push_back(cnt);
rep(i, 0, 3) A.push_back(0);
vector<ll> sum(A.size() + 1);
for (int i = 0; i < A.size(); i++)
sum[i + 1] = sum[i] + A[i];
ll mx = 0;
K = 2 * K + 1;
rep(i, 0, A.size() - K + 1) {
int e = i + K;
if (e > sum.size())
e = sum.size();
ll a = part(sum, i, e);
if (i % 2 == 0) {
continue;
}
mx = max(mx, a);
}
if (S == "0")
mx = 1;
cout << mx << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, m, n) for (int i = m; i < n; ++i)
#define rem(i, m, n) for (int i = m; i >= n; --i)
typedef long long ll;
#define mod 1000000007
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <class T> ll part(const T &s, int l, int r) { return s[r] - s[l]; };
int main() {
int N, K;
string S;
cin >> N >> K >> S;
if (N <= K) {
cout << N << endl;
return 0;
}
int cnt = 1;
vector<int> A;
rep(i, 0, 3) A.push_back(0);
if (S[0] == '0')
A.push_back(0);
rep(i, 1, N) {
if (S[i] == S[i - 1]) {
cnt++;
} else {
A.push_back(cnt);
cnt = 1;
}
}
if (cnt)
A.push_back(cnt);
rep(i, 0, 3) A.push_back(0);
vector<ll> sum(A.size() + 1);
for (int i = 0; i < A.size(); i++)
sum[i + 1] = sum[i] + A[i];
ll mx = 0;
K = 2 * K + 1;
if (sum.size() <= K) {
cout << N << endl;
return 0;
}
rep(i, 0, A.size() - K + 1) {
int e = i + K;
if (e > sum.size())
e = sum.size();
ll a = part(sum, i, e);
if (i % 2 == 0) {
continue;
}
mx = max(mx, a);
}
if (S == "0")
mx = 1;
cout << mx << endl;
return 0;
}
| insert | 52 | 52 | 52 | 56 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int n, k;
string s;
cin >> n >> k >> s;
vector<int> a;
int x = 0;
rep(i, n) if (s[i] == '1') x++;
if (x == s.size()) {
cout << x << endl;
return 0;
}
if (s[0] == '0')
a.push_back(0);
int cnt = 1;
rep(i, n - 1) {
if (s[i] == s[i + 1])
cnt++;
else
a.push_back(cnt), cnt = 1;
}
if (s[n - 1] == s[n - 2])
a.push_back(cnt);
else
a.push_back(1);
if (s[n - 1] == '0')
a.push_back(0);
if (a.size() <= k) {
cout << x << endl;
return 0;
}
int cnt2 = 0;
rep(i, 2 * k + 1) cnt2 += a[i];
int ans = cnt2;
for (int i = 1; i < a.size() - 2 * k; i += 2) {
cnt2 -= a[i] + a[i - 1];
cnt2 += a[i + 2 * k] + a[i + 2 * k + 1];
ans = max(ans, cnt2);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int n, k;
string s;
cin >> n >> k >> s;
vector<int> a;
int x = 0;
rep(i, n) if (s[i] == '1') x++;
if (x == s.size()) {
cout << x << endl;
return 0;
}
if (s[0] == '0')
a.push_back(0);
int cnt = 1;
rep(i, n - 1) {
if (s[i] == s[i + 1])
cnt++;
else
a.push_back(cnt), cnt = 1;
}
if (s[n - 1] == s[n - 2])
a.push_back(cnt);
else
a.push_back(1);
if (s[n - 1] == '0')
a.push_back(0);
if (a.size() / 2 < k) {
cout << s.size() << endl;
return 0;
}
int cnt2 = 0;
rep(i, 2 * k + 1) cnt2 += a[i];
int ans = cnt2;
for (int i = 1; i < a.size() - 2 * k; i += 2) {
cnt2 -= a[i] + a[i - 1];
cnt2 += a[i + 2 * k] + a[i + 2 * k + 1];
ans = max(ans, cnt2);
}
cout << ans << endl;
return 0;
} | replace | 31 | 33 | 31 | 33 | 0 | |
p03074 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
constexpr ll inf = INT64_MAX / 4;
constexpr ll mod = 1000000007;
int main() {
int n, k;
string s;
cin >> n >> k >> s;
vector<pair<int, int>> h;
int d = 0;
char v = s[0];
for (int i = 0; i < n; i++) {
if (s[i] != v) {
h.emplace_back(v, d);
d = 0;
v = s[i];
}
d++;
}
if (d != 0)
h.emplace_back(v, d);
int ret = 0, l = 0, r = 0, c = k, maxr = 0;
for (int i = 0; i < k || h[r].first == '1'; r++) {
ret += h[r].second;
if (h[r].first == '0')
i++;
}
maxr = ret;
while (r != h.size()) {
ret -= h[l].second;
if (h[l].first == '0')
c--;
l++;
while (r < h.size() && (c < k || h[r].first == '1')) {
ret += h[r].second;
if (h[r].first == '0')
c++;
r++;
}
maxr = max(maxr, ret);
}
cout << maxr << endl;
} | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
constexpr ll inf = INT64_MAX / 4;
constexpr ll mod = 1000000007;
int main() {
int n, k;
string s;
cin >> n >> k >> s;
vector<pair<int, int>> h;
int d = 0;
char v = s[0];
for (int i = 0; i < n; i++) {
if (s[i] != v) {
h.emplace_back(v, d);
d = 0;
v = s[i];
}
d++;
}
if (d != 0)
h.emplace_back(v, d);
int ret = 0, l = 0, r = 0, c = k, maxr = 0;
for (int i = 0; r < h.size() && (i < k || h[r].first == '1'); r++) {
ret += h[r].second;
if (h[r].first == '0')
i++;
}
maxr = ret;
while (r != h.size()) {
ret -= h[l].second;
if (h[l].first == '0')
c--;
l++;
while (r < h.size() && (c < k || h[r].first == '1')) {
ret += h[r].second;
if (h[r].first == '0')
c++;
r++;
}
maxr = max(maxr, ret);
}
cout << maxr << endl;
} | replace | 40 | 41 | 40 | 41 | 0 | |
p03074 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define P pair<int, int>
using ll = int64_t;
using namespace std;
#define ketasuu(n) fixed << setprecision(n)
#define btoe(p) p.begin(), p.end()
#define etob(p) p.rbegin(), p.rend()
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<P> p;
int l = s.length(), b, e, pre = s[0], cnt = 0;
p.push_back({pre - '0', 1});
rep(i, l - 1) {
if (s[i + 1] == pre)
p[cnt].second++;
else {
p.push_back({s[i + 1] - '0', 1});
cnt++;
pre = s[i + 1];
}
}
b = s[0] - '0';
e = s[l - 1] - '0';
int ans = 0;
cnt++;
rep(i, cnt) {
if (p[i].first == 0) {
int x = min(2 * k, cnt - i);
int kari = 0;
for (int j = i; j < i + x; ++j) {
kari += p[j].second;
}
ans = max(ans, kari);
} else {
int x = min(2 * k + 1, cnt - i);
int kari = 0;
for (int j = i; j < i + x; ++j) {
kari += p[j].second;
}
ans = max(ans, kari);
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define P pair<int, int>
using ll = int64_t;
using namespace std;
#define ketasuu(n) fixed << setprecision(n)
#define btoe(p) p.begin(), p.end()
#define etob(p) p.rbegin(), p.rend()
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<P> p;
int l = s.length(), b, e, pre = s[0], cnt = 0;
p.push_back({pre - '0', 1});
rep(i, l - 1) {
if (s[i + 1] == pre)
p[cnt].second++;
else {
p.push_back({s[i + 1] - '0', 1});
cnt++;
pre = s[i + 1];
}
}
b = s[0] - '0';
e = s[l - 1] - '0';
int ans = 0;
cnt++;
rep(i, cnt) {
if (p[i].first == 0) {
int x = min(2 * k, cnt - i);
int kari = 0;
for (int j = i; j < i + x; ++j) {
kari += p[j].second;
}
ans = max(ans, kari);
} else {
int x = min(2 * k + 1, cnt - i);
int kari = 0;
for (int j = i; j < i + x; ++j) {
kari += p[j].second;
}
ans = max(ans, kari);
}
if (2 * k - 10 > cnt - i)
break;
}
cout << ans << endl;
return 0;
}
| insert | 46 | 46 | 46 | 48 | TLE | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
string s;
cin >> n >> k;
cin >> s;
vector<int> cnt;
cnt.push_back(0);
char prev = '1';
for (int i = 0; i < n; ++i) {
if (s[i] == prev)
++cnt.back();
else {
prev = s[i];
cnt.push_back(1);
}
}
if (prev == '0')
cnt.push_back(0);
int ans = 0, cur = 0;
if (cnt.size() <= 2 * k + 1) {
for (int x : cnt)
ans += x;
cout << ans << endl;
return 0;
}
for (int i = 0; i < 2 * k + 1; ++i)
cur += cnt[i];
ans = cur;
for (int j = 2; j + 2 * k < n; j += 2) {
cur -= cnt[j - 1] + cnt[j - 2];
cur += cnt[j + 2 * k - 1] + cnt[j + 2 * k];
ans = max(ans, cur);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
string s;
cin >> n >> k;
cin >> s;
vector<int> cnt;
cnt.push_back(0);
char prev = '1';
for (int i = 0; i < n; ++i) {
if (s[i] == prev)
++cnt.back();
else {
prev = s[i];
cnt.push_back(1);
}
}
if (prev == '0')
cnt.push_back(0);
int ans = 0, cur = 0;
if (cnt.size() <= 2 * k + 1) {
for (int x : cnt)
ans += x;
cout << ans << endl;
return 0;
}
for (int i = 0; i < 2 * k + 1; ++i)
cur += cnt[i];
ans = cur;
for (int j = 2; j + 2 * k < cnt.size(); j += 2) {
cur -= cnt[j - 1] + cnt[j - 2];
cur += cnt[j + 2 * k - 1] + cnt[j + 2 * k];
ans = max(ans, cur);
}
cout << ans << endl;
return 0;
} | replace | 33 | 34 | 33 | 34 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int INF = 1e9;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> a;
int cnt = 1;
bool flag;
if (s[0] == '1')
flag = true;
else
flag = false;
rep(i, s.size() - 1) {
if (flag) {
if (s[i + 1] == '0') {
flag = false;
a.push_back(cnt);
cnt = 1;
} else
cnt++;
} else {
if (s[i + 1] == '1') {
flag = true;
a.push_back(cnt);
cnt = 1;
} else
cnt++;
}
}
a.push_back(cnt);
if (s[n - 1] == '0')
a.push_back(0);
int cnt0 = 0;
int cnt1 = 0;
if (s[0] == '0') {
cnt1 = a.size() / 2;
cnt0 = cnt1 + a.size() % 2;
} else {
cnt0 = a.size() / 2;
cnt1 = cnt0 + a.size() % 2;
}
int sum = 0;
int ans = 0;
if (k >= cnt0)
rep(i, a.size()) ans += a[i];
if (s[0] == '0') {
int ind = 0;
rep(i, 2 * k) sum += a[i];
ans = max(ans, sum);
if (a.size() > 2 * k + 1)
sum += (a[2 * k] + a[2 * k + 1]);
else
sum += a[2 * k];
sum -= (a[ind]);
ans = max(ans, sum);
ind++;
while (ind + 2 * k + 2 <= a.size() - 1) {
sum += (a[ind + 2 * k + 1] + a[ind + 2 * k + 2]);
sum -= (a[ind] + a[ind + 1]);
ans = max(ans, sum);
ind += 2;
}
} else {
int ind = 0;
rep(i, 2 * k + 1) sum += a[i];
ans = max(ans, sum);
while (ind + 2 * k + 2 <= a.size() - 1) {
sum += a[ind + 2 * k + 1] + a[ind + 2 * k + 2];
sum -= (a[ind] + a[ind + 1]);
ans = max(ans, sum);
ind += 2;
}
}
// rep(i,a.size()) cout << a[i] << endl;
cout << ans << endl;
} | #include <bits/stdc++.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int INF = 1e9;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> a;
int cnt = 1;
bool flag;
if (s[0] == '1')
flag = true;
else
flag = false;
rep(i, s.size() - 1) {
if (flag) {
if (s[i + 1] == '0') {
flag = false;
a.push_back(cnt);
cnt = 1;
} else
cnt++;
} else {
if (s[i + 1] == '1') {
flag = true;
a.push_back(cnt);
cnt = 1;
} else
cnt++;
}
}
a.push_back(cnt);
if (s[n - 1] == '0')
a.push_back(0);
int cnt0 = 0;
int cnt1 = 0;
if (s[0] == '0') {
cnt1 = a.size() / 2;
cnt0 = cnt1 + a.size() % 2;
} else {
cnt0 = a.size() / 2;
cnt1 = cnt0 + a.size() % 2;
}
int sum = 0;
int ans = 0;
if (k >= cnt0) {
cout << n << endl;
return 0;
};
if (s[0] == '0') {
int ind = 0;
rep(i, 2 * k) sum += a[i];
ans = max(ans, sum);
if (a.size() > 2 * k + 1)
sum += (a[2 * k] + a[2 * k + 1]);
else
sum += a[2 * k];
sum -= (a[ind]);
ans = max(ans, sum);
ind++;
while (ind + 2 * k + 2 <= a.size() - 1) {
sum += (a[ind + 2 * k + 1] + a[ind + 2 * k + 2]);
sum -= (a[ind] + a[ind + 1]);
ans = max(ans, sum);
ind += 2;
}
} else {
int ind = 0;
rep(i, 2 * k + 1) sum += a[i];
ans = max(ans, sum);
while (ind + 2 * k + 2 <= a.size() - 1) {
sum += a[ind + 2 * k + 1] + a[ind + 2 * k + 2];
sum -= (a[ind] + a[ind + 1]);
ans = max(ans, sum);
ind += 2;
}
}
// rep(i,a.size()) cout << a[i] << endl;
cout << ans << endl;
} | replace | 54 | 56 | 54 | 58 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<ll, ll> l_l;
const int INF = 1001001000;
const int mINF = -1001001000;
const ll LINF = 1010010010010010000;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
int cnt = 0;
int now = 1;
vector<int> nums;
for (int i = 0; i < n; i++) {
if (s[i] == (char)('0' + now))
cnt++;
else {
nums.push_back(cnt);
cnt = 1;
now = 1 - now;
}
}
if (cnt != 0)
nums.push_back(cnt);
if (nums.size() % 2 == 0)
nums.push_back(0);
int right = 0;
int add = 2 * k + 1;
int ans = 0, tmp = 0;
vector<int> sum(nums.size() + 1);
for (int i = 0; i < n; i++) {
sum[i + 1] = sum[i] + nums[i];
}
for (int i = 0; i < nums.size(); i += 2) {
int left = i;
int right = min(left + add, (int)nums.size());
ans = max(ans, sum[right] - sum[left]);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<ll, ll> l_l;
const int INF = 1001001000;
const int mINF = -1001001000;
const ll LINF = 1010010010010010000;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
int cnt = 0;
int now = 1;
vector<int> nums;
for (int i = 0; i < n; i++) {
if (s[i] == (char)('0' + now))
cnt++;
else {
nums.push_back(cnt);
cnt = 1;
now = 1 - now;
}
}
if (cnt != 0)
nums.push_back(cnt);
if (nums.size() % 2 == 0)
nums.push_back(0);
int right = 0;
int add = 2 * k + 1;
int ans = 0, tmp = 0;
vector<int> sum(nums.size() + 1);
for (int i = 0; i < nums.size(); i++) {
sum[i + 1] = sum[i] + nums[i];
}
for (int i = 0; i < nums.size(); i += 2) {
int left = i;
int right = min(left + add, (int)nums.size());
ans = max(ans, sum[right] - sum[left]);
}
cout << ans << endl;
return 0;
} | replace | 34 | 35 | 34 | 35 | 0 | |
p03075 | Python | Runtime Error | def solve(string):
a, *_, e, k = map(int, string.split())
return "Yay!" if e - a <= k else ":("
if __name__ == "__main__":
print(solve(input()))
| def solve(string):
a, *_, e, k = map(int, string.split())
return "Yay!" if e - a <= k else ":("
if __name__ == "__main__":
print(solve("\n".join([input() for _ in range(6)])))
| replace | 6 | 7 | 6 | 7 | ValueError: not enough values to unpack (expected at least 3, got 1) | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03075/Python/s621656186.py", line 7, in <module>
print(solve(input()))
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03075/Python/s621656186.py", line 2, in solve
a, *_, e, k = map(int, string.split())
ValueError: not enough values to unpack (expected at least 3, got 1)
|
p03075 | C++ | Time Limit Exceeded | #include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int p[5];
int k;
for (int i = 0; i < 5; ++i)
cin >> p[i];
cin >> k;
string ans = "Yay!";
for (int i = 0; i < 6; ++i) {
for (int j = 0; j < 6; ++j) {
if (abs(p[i] - p[j]) > k)
ans = ":(";
}
}
cout << ans << endl;
}
| #include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int p[5];
int k;
for (int i = 0; i < 5; ++i)
cin >> p[i];
cin >> k;
if (abs(p[0] - p[4]) > k)
cout << ":(" << endl;
else
cout << "Yay!" << endl;
}
| replace | 13 | 22 | 13 | 17 | TLE | |
p03075 | C++ | Runtime Error | #include <cstring>
#include <iostream>
using namespace std;
int main() {
int num = 5;
int input[num], k;
for (int i = 0; i < num; i++) {
cin >> input[i];
}
cin >> k;
for (int i = 0; i < num; i++) {
for (int j = i + 1; j < num; j++) {
if (input[j] - input[i] > k) {
cout << ":(" << endl;
exit(1);
}
}
}
cout << "Yay!" << endl;
return 0;
}
| #include <cstring>
#include <iostream>
using namespace std;
int main() {
int num = 5;
int input[num], k;
for (int i = 0; i < num; i++) {
cin >> input[i];
}
cin >> k;
for (int i = 0; i < num; i++) {
for (int j = i + 1; j < num; j++) {
if (input[j] - input[i] > k) {
cout << ":(" << endl;
exit(0);
}
}
}
cout << "Yay!" << endl;
return 0;
}
| replace | 16 | 17 | 16 | 17 | 0 | |
p03075 | C++ | Runtime Error | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define bit(x) (1L << (x))
using ll = long long;
using namespace std;
template <typename T> vector<T> make_v(size_t a, T b) {
return vector<T>(a, b);
}
template <typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v(ts...))>(a, make_v(ts...));
}
int main() {
vector<int> a;
REP(i, 5) cin >> a[i];
int k;
cin >> k;
REP(i, 5) FOR(j, i + 1, 5) {
if (a[j] - a[i] > k) {
cout << ":(" << endl;
return 0;
}
}
cout << "Yay!" << endl;
return 0;
}
| #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define bit(x) (1L << (x))
using ll = long long;
using namespace std;
template <typename T> vector<T> make_v(size_t a, T b) {
return vector<T>(a, b);
}
template <typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v(ts...))>(a, make_v(ts...));
}
int main() {
vector<int> a(5);
REP(i, 5) cin >> a[i];
int k;
cin >> k;
REP(i, 5) FOR(j, i + 1, 5) {
if (a[j] - a[i] > k) {
cout << ":(" << endl;
return 0;
}
}
cout << "Yay!" << endl;
return 0;
}
| replace | 17 | 18 | 17 | 18 | -11 | |
p03075 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> code;
for (int i = 0; i < 5; i++) {
cin >> code.at(i);
}
int K;
cin >> K;
int dif;
for (int i = 0; i < 4; i++) {
for (int j = 1; j < 5; j++) {
dif = code.at(j) - code.at(i);
if (dif > K) {
cout << ":(" << endl;
return 0;
}
}
}
cout << "Yay!" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> code(5);
for (int i = 0; i < 5; i++) {
cin >> code.at(i);
}
int K;
cin >> K;
int dif;
for (int i = 0; i < 4; i++) {
for (int j = 1; j < 5; j++) {
dif = code.at(j) - code.at(i);
if (dif > K) {
cout << ":(" << endl;
return 0;
}
}
}
cout << "Yay!" << endl;
} | replace | 4 | 5 | 4 | 5 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 0) >= this->size() (which is 0)
|
p03075 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const unsigned int MOD = 1000000007;
#define ll long long
#define PI 3.1416
string day[] = {"SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"};
vector<string> v;
void dfs(string str, string t = "", int cnt = 0) {
if (cnt == 2) {
v.push_back(t);
return;
} else {
for (int i = 0; i < str.size(); i++) {
dfs(str, t + str[i], cnt + 1);
}
}
}
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
int a[5], k;
while (1) {
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
cin >> k;
int flag = 1;
for (int i = 0; i < 4; i++) {
for (int j = i + 1; j < 5; j++) {
if (abs(a[i] - a[j]) > k) {
cout << ":(" << endl;
flag = 0;
break;
}
}
}
if (flag)
cout << "Yay!" << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const unsigned int MOD = 1000000007;
#define ll long long
#define PI 3.1416
string day[] = {"SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"};
vector<string> v;
void dfs(string str, string t = "", int cnt = 0) {
if (cnt == 2) {
v.push_back(t);
return;
} else {
for (int i = 0; i < str.size(); i++) {
dfs(str, t + str[i], cnt + 1);
}
}
}
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
int a, b, c, d, e, k;
while (cin >> a >> b >> c >> d >> e >> k) {
(e - a) <= k ? cout << "Yay!" << endl : cout << ":(" << endl;
}
return 0;
}
| replace | 20 | 38 | 20 | 23 | TLE | |
p03075 | C++ | Runtime Error | #include <stdio.h>
int main(void) {
int num[6] = {0};
for (int i = 0; i < 6; i++) {
scanf("%d", num[i]);
getchar();
}
if (num[4] - num[0] > num[5]) {
printf(":(\n");
} else {
printf("Yay!\n");
}
return 0;
} | #include <stdio.h>
int main(void) {
int num[6] = {0};
for (int i = 0; i < 6; i++) {
scanf("%d", &num[i]);
getchar();
}
if (num[4] - num[0] > num[5]) {
printf(":(\n");
} else {
printf("Yay!\n");
}
return 0;
} | replace | 4 | 5 | 4 | 5 | -11 | |
p03075 | C++ | Time Limit Exceeded | #include <iostream>
#include <stdio.h>
using namespace std;
int main(void) {
int antennas[5];
int k;
for (int i = 0; i < 5; i++) {
scanf("%d", &antennas[i]);
}
scanf("%d", &k);
string ans = "Yay!";
for (int i = 1; i <= 5; i++) {
if (antennas[i] - antennas[i - 1] > k)
ans = ":(";
}
cout << ans << "\n";
return 0;
}
| #include <iostream>
#include <stdio.h>
using namespace std;
int main(void) {
int antennas[5];
int k;
for (int i = 0; i < 5; i++) {
scanf("%d", &antennas[i]);
}
scanf("%d", &k);
printf(antennas[4] - antennas[0] <= k ? "Yay!\n" : ":(\n");
return 0;
}
| replace | 11 | 17 | 11 | 12 | TLE | |
p03075 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> x;
int k;
for (int i = 0; i < 5; i++) {
cin >> x.at(i);
}
cin >> k;
sort(x.begin(), x.end());
if (x.at(4) - x.at(0) <= k) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> x(5);
int k;
for (int i = 0; i < 5; i++) {
cin >> x.at(i);
}
cin >> k;
sort(x.begin(), x.end());
if (x.at(4) - x.at(0) <= k) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
} | replace | 4 | 5 | 4 | 5 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 0) >= this->size() (which is 0)
|
p03075 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> a(5);
for (int i = 0; i < 5; i++) {
cin >> a.at(i);
}
sort(a.begin(), a.end());
int k;
cin >> k;
if ((a.at(5) - a.at(0)) <= k) {
cout << "Yey!" << endl;
} else {
cout << ":(" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> a(5);
for (int i = 0; i < 5; i++) {
cin >> a.at(i);
}
sort(a.begin(), a.end());
int k;
cin >> k;
if ((a.at(4) - a.at(0)) <= k) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
}
| replace | 10 | 12 | 10 | 12 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 5) >= this->size() (which is 5)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.