problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9
values |
|---|---|---|---|---|---|---|---|
p03074 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> seq;
if (s[0] == '0')
seq.push_back(0);
for (int i = 0; i < s.size(); i++) {
int j = i;
while (j < s.size() && s[j] == s[i])
j++;
seq.push_back(j - i);
i = j;
}
if (s.back() == '0')
seq.push_back(0);
vector<int> sum((int)seq.size() + 1, 0);
for (int i = 0; i < seq.size(); i++) {
sum[i + 1] = sum[i] + seq[i];
}
int ans = 0;
for (int i = 0; i < sum.size(); i += 2) {
int tmp = i + 2 * k + 1;
if (tmp >= sum.size())
tmp = sum.size() - 1;
ans = max(ans, sum[tmp] - sum[i]);
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> seq;
if (s[0] == '0')
seq.push_back(0);
for (int i = 0; i < s.size();) {
int j = i;
while (j < s.size() && s[j] == s[i])
j++;
seq.push_back(j - i);
i = j;
}
if (s.back() == '0')
seq.push_back(0);
vector<int> sum((int)seq.size() + 1, 0);
for (int i = 0; i < seq.size(); i++) {
sum[i + 1] = sum[i] + seq[i];
}
int ans = 0;
for (int i = 0; i < sum.size(); i += 2) {
int tmp = i + 2 * k + 1;
if (tmp >= sum.size())
tmp = sum.size() - 1;
ans = max(ans, sum[tmp] - sum[i]);
}
cout << ans << endl;
}
| [
"control_flow.loop.for.update.change"
] | 885,132 | 885,133 | u515131769 | cpp |
p03074 | #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;
}
| [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 885,149 | 885,150 | u228295160 | cpp |
p03074 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <functional>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <bitset>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (auto i = a; i < b; i++)
#define all(_x) _x.begin(), _x.end()
#define r_sort(_x) sort(_x.begin(), _x.end(), std::greater<int>())
#define vec_cnt(_a, _n) (upper_bound(all(_a), _n) - lower_bound(all(_a), _n))
#define vec_unique(_a) _a.erase(std::unique(all(_a)), _a.end());
#define vvec vector<vector<ll>>
ll gcd(ll a, ll b) { return a % b == 0 ? b : gcd(b, a % b); }
ll lcm(ll a, ll b) { return (a / gcd(a, b)) * b; }
#define INF 1 << 30
const int mod = 1000000007;
ll power(ll x, ll p) {
ll a = 1;
while (p > 0) {
if (p % 2 == 0) {
x *= x;
p /= 2;
} else {
a *= x;
p--;
}
}
return a;
}
ll mpower(ll x, ll p) {
ll a = 1;
while (p > 0) {
if (p % 2 == 0) {
x = x * x % mod;
p /= 2;
} else {
a = a * x % mod;
p--;
}
}
return a;
}
ll c(ll n, ll k) {
ll a = 1;
rep(i, 1, k) {
a *= n - i + 1;
a /= i;
}
return a;
}
ll mc(ll n, ll m) {
ll k = 1, l = 1;
rep(i, n - m + 1, n + 1) k = k * i % mod;
rep(i, 1, m + 1) l = l * i % mod;
l = mpower(l, mod - 2);
return k * l % mod;
}
int main(void) {
int n, k, c = 1;
string s;
cin >> n >> k >> s;
s.push_back('2');
deque<int> l;
if (s[0] == '1')
l.push_back(0);
rep(i, 0, s.size() - 1) {
if (s[i] == s[i + 1]) {
c++;
} else {
l.push_back(c);
c = 1;
}
}
int sum = 0, ans = 0;
l.push_front(0);
l.push_back(0);
l.push_back(0);
rep(i, 0, min(2 * k + 1, (int)l.size())) { sum += l[i]; }
ans = sum;
for (int i = 2; i + 2 * k < (int)l.size() - 2; i += 2) {
sum += l[i + 2 * k] + l[i + 2 * k - 1] - l[i - 1] - l[i - 2];
ans = max(ans, sum);
}
printf("%d\n", ans);
return 0;
}
| #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <functional>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <bitset>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (auto i = a; i < b; i++)
#define all(_x) _x.begin(), _x.end()
#define r_sort(_x) sort(_x.begin(), _x.end(), std::greater<int>())
#define vec_cnt(_a, _n) (upper_bound(all(_a), _n) - lower_bound(all(_a), _n))
#define vec_unique(_a) _a.erase(std::unique(all(_a)), _a.end());
#define vvec vector<vector<ll>>
ll gcd(ll a, ll b) { return a % b == 0 ? b : gcd(b, a % b); }
ll lcm(ll a, ll b) { return (a / gcd(a, b)) * b; }
#define INF 1 << 30
const int mod = 1000000007;
ll power(ll x, ll p) {
ll a = 1;
while (p > 0) {
if (p % 2 == 0) {
x *= x;
p /= 2;
} else {
a *= x;
p--;
}
}
return a;
}
ll mpower(ll x, ll p) {
ll a = 1;
while (p > 0) {
if (p % 2 == 0) {
x = x * x % mod;
p /= 2;
} else {
a = a * x % mod;
p--;
}
}
return a;
}
ll c(ll n, ll k) {
ll a = 1;
rep(i, 1, k) {
a *= n - i + 1;
a /= i;
}
return a;
}
ll mc(ll n, ll m) {
ll k = 1, l = 1;
rep(i, n - m + 1, n + 1) k = k * i % mod;
rep(i, 1, m + 1) l = l * i % mod;
l = mpower(l, mod - 2);
return k * l % mod;
}
int main(void) {
int n, k, c = 1;
string s;
cin >> n >> k >> s;
s.push_back('2');
deque<int> l;
if (s[0] == '1')
l.push_back(0);
rep(i, 0, s.size() - 1) {
if (s[i] == s[i + 1]) {
c++;
} else {
l.push_back(c);
c = 1;
}
}
int sum = 0, ans = 0;
l.push_front(0);
l.push_back(0);
l.push_back(0);
rep(i, 0, min(2 * k + 1, (int)l.size())) { sum += l[i]; }
ans = sum;
for (int i = 2; i + 2 * k < (int)l.size() - 1; i += 2) {
sum += l[i + 2 * k] + l[i + 2 * k - 1] - l[i - 1] - l[i - 2];
ans = max(ans, sum);
}
printf("%d\n", ans);
return 0;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 885,154 | 885,155 | u128572736 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> VI;
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 (a > b) {
a = b;
return 1;
}
return 0;
}
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
char prev = '1';
vector<int> a;
int ctr = 0;
rep(i, s.size()) {
switch (s[i]) {
case '0':
if (prev == '1') {
a.push_back(ctr);
ctr = 0;
}
prev = '0';
ctr++;
break;
case '1':
if (prev == '0') {
a.push_back(ctr);
ctr = 0;
}
ctr++;
prev = '1';
break;
}
}
a.push_back(ctr);
if (s[s.size() - 1] == '0') {
a.push_back(0);
}
vector<int> b(a.size() + 1);
b[0] = 0;
rep(i, s.size()) { b[i + 1] = b[i] + a[i]; }
if (k * 2 + 1 >= b.size()) {
cout << n << endl;
exit(0);
}
int ans = 0;
rep(i, 2 * k + 1, b.size()) {
int p = b[i] - b[i - (2 * k + 1)];
chmax(ans, p);
i++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> VI;
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 (a > b) {
a = b;
return 1;
}
return 0;
}
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
char prev = '1';
vector<int> a;
int ctr = 0;
rep(i, s.size()) {
switch (s[i]) {
case '0':
if (prev == '1') {
a.push_back(ctr);
ctr = 0;
}
prev = '0';
ctr++;
break;
case '1':
if (prev == '0') {
a.push_back(ctr);
ctr = 0;
}
ctr++;
prev = '1';
break;
}
}
a.push_back(ctr);
if (s[s.size() - 1] == '0') {
a.push_back(0);
}
vector<int> b(a.size() + 1);
b[0] = 0;
rep(i, a.size()) { b[i + 1] = b[i] + a[i]; }
if (k * 2 + 1 >= b.size()) {
cout << n << endl;
exit(0);
}
int ans = 0;
rep(i, 2 * k + 1, b.size()) {
int p = b[i] - b[i - (2 * k + 1)];
chmax(ans, p);
i++;
}
cout << ans << endl;
} | [
"identifier.change",
"call.arguments.change"
] | 885,156 | 885,157 | u378702452 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = ll(1e12);
const ll mod = ll(1e9 + 7);
const double pi = acos(-1);
#define rep0(i, n) for (ll(i) = 0; (i) < (n); ++(i))
#define rrep0(i, n) for (ll(i) = (n)-1; (i) >= 0; --(i))
#define rep1(i, n) for (ll(i) = 1; (i) <= (n); ++(i))
#define rrep1(i, n) for (ll(i) = (n); (i) >= 1; --(i))
#define nfor(i, a, b) for (ll(i) = (a); (i) < (b); ++(i))
#define pf(x) cout << (x) << endl
#define all(x) (x).begin(), (x).end()
#define yes pf("Yes")
#define no pf("No")
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;
}
int dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
int dy[8] = {0, 1, 0, -1, 1, -1, 1, -1};
ll gcd(ll a, ll b) {
if (a < b)
swap(a, 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 factorial(ll n) {
ll ans = 1;
rep1(i, n) {
ans *= i;
ans %= mod;
}
return ans;
}
ll power(ll a, ll b) {
ll ans = 1;
a %= mod;
while (b) {
if (b & 1LL)
ans = ans * a % mod;
a = a * a % mod;
b >>= 1;
}
return ans % mod;
}
// modの値の確認をすること
int main() {
ll n, k;
string s;
cin >> n >> k >> s;
s.push_back('2');
vector<ll> c(0);
if (s[0] == '0')
c.push_back(0);
ll cnt = 1;
rep0(i, n) {
if (s[i] != s[i + 1]) {
c.push_back(cnt);
cnt = 1;
} else
++cnt;
}
if (s[s.size() - 1] == '0')
c.push_back(0);
rep0(i, c.size() - 1) c[i + 1] += c[i];
ll ans = 0;
rep0(i, max(ll(c.size() - k * 2), 1ll)) {
if (i + k * 2 < c.size())
chmax(ans, c[i + k * 2] - (i > 0 ? c[i - 1] : 0));
else
chmax(ans, c[c.size() - 1]);
++i;
}
pf(ans);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = ll(1e12);
const ll mod = ll(1e9 + 7);
const double pi = acos(-1);
#define rep0(i, n) for (ll(i) = 0; (i) < (n); ++(i))
#define rrep0(i, n) for (ll(i) = (n)-1; (i) >= 0; --(i))
#define rep1(i, n) for (ll(i) = 1; (i) <= (n); ++(i))
#define rrep1(i, n) for (ll(i) = (n); (i) >= 1; --(i))
#define nfor(i, a, b) for (ll(i) = (a); (i) < (b); ++(i))
#define pf(x) cout << (x) << endl
#define all(x) (x).begin(), (x).end()
#define yes pf("Yes")
#define no pf("No")
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;
}
int dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
int dy[8] = {0, 1, 0, -1, 1, -1, 1, -1};
ll gcd(ll a, ll b) {
if (a < b)
swap(a, 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 factorial(ll n) {
ll ans = 1;
rep1(i, n) {
ans *= i;
ans %= mod;
}
return ans;
}
ll power(ll a, ll b) {
ll ans = 1;
a %= mod;
while (b) {
if (b & 1LL)
ans = ans * a % mod;
a = a * a % mod;
b >>= 1;
}
return ans % mod;
}
// modの値の確認をすること
int main() {
ll n, k;
string s;
cin >> n >> k >> s;
s.push_back('2');
vector<ll> c(0);
if (s[0] == '0')
c.push_back(0);
ll cnt = 1;
rep0(i, n) {
if (s[i] != s[i + 1]) {
c.push_back(cnt);
cnt = 1;
} else
++cnt;
}
if (s[s.size() - 2] == '0')
c.push_back(0);
rep0(i, c.size() - 1) c[i + 1] += c[i];
ll ans = 0;
rep0(i, max(ll(c.size() - k * 2), 1ll)) {
if (i + k * 2 < c.size())
chmax(ans, c[i + k * 2] - (i > 0 ? c[i - 1] : 0));
else
chmax(ans, c[c.size() - 1]);
++i;
}
pf(ans);
return 0;
}
| [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 885,160 | 885,161 | u801513186 | cpp |
p03074 | #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 - k) {
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 - k + 1) {
int l = 2 * i;
int r = l + 2 * k;
ans = max(ans, sum[r + 1] - sum[l]);
}
cout << ans << endl;
}
| [
"expression.operation.binary.add"
] | 885,166 | 885,167 | u138062788 | cpp |
p03074 | #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 - k + 1) {
int l = 2 * i;
int r = l + 2 * k;
ans = max(ans, sum[r + 1] - sum[l]);
}
cout << ans << endl;
}
| [
"expression.operation.binary.add"
] | 885,168 | 885,167 | u138062788 | cpp |
p03074 | bool DBG = false;
// #pragma GCC optimize("Ofast")
// #pragma GCC
// target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
// #pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_dec_float.hpp>
//#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using ll = long long;
using ld = long double;
// using i128 = __int128_t;
// using bint = boost::multiprecision::cpp_int
// using d1024 = boost::multiprecision::number<mp::cpp_dec_float<1024>>;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define IFOR(i, a, b) for (int i = ((b)-1); i >= (a); --i)
#define RPT(i, a, b) for (int i = (a); i < ((a) + (b)); ++i)
#define IRPT(i, a, b) for (int i = ((a) + (b)-1); i >= (a); --i)
#define ALL(x) x.begin(), x.end()
#define RALL(x) x.rbegin(), x.rend()
#define fs first
#define sd second
#define couts(x) cout << (x) << (" ")
#define coutn(x) cout << (x) << ("\n")
#define ncouts(x) numout(x), outst[outst_N++] = ' '
#define ncoutn(x) numout(x), outst[outst_N++] = '\n'
#define scouts(x) strout(x), outst[outst_N++] = ' '
#define scoutn(x) strout(x), outst[outst_N++] = '\n'
#define dcouts(x) \
if (DBG) \
couts(x)
#define dcoutn(x) \
if (DBG) \
coutn(x)
#define endl "\n"
#define psb push_back
#define ppb pop_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define LBIT(x, a) (((x) >> (a)) & 1LL)
#define IBIT(x, a) (((x) >> (a)) & 1)
#define BCOUNT(x) (__builtin_popcount(x))
template <typename T>
std::istream &operator>>(std::istream &is, std::vector<T> &vec) {
for (auto &v : vec)
is >> v;
return is;
}
template <typename T1, typename T2>
std::istream &operator>>(std::istream &is, std::pair<T1, T2> &p) {
is >> p.first >> p.second;
return is;
}
template <typename T>
std::ostream &operator<<(std::ostream &os, const std::vector<T> &vec) {
os << "[";
for (auto v : vec)
os << v << ",";
os << "]";
return os;
}
template <typename T>
std::ostream &operator<<(std::ostream &os, const std::deque<T> &vec) {
os << "deque[";
for (auto v : vec)
os << v << ",";
os << "]";
return os;
}
template <typename T>
std::ostream &operator<<(std::ostream &os, const std::set<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ",";
os << "}";
return os;
}
template <typename T>
std::ostream &operator<<(std::ostream &os, const std::unordered_set<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ",";
os << "}";
return os;
}
template <typename T>
std::ostream &operator<<(std::ostream &os, const std::multiset<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ",";
os << "}";
return os;
}
template <typename T>
std::ostream &operator<<(std::ostream &os,
const std::unordered_multiset<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ",";
os << "}";
return os;
}
template <typename T1, typename T2>
std::ostream &operator<<(std::ostream &os, const std::pair<T1, T2> &pa) {
os << "(" << pa.first << "," << pa.second << ")";
return os;
}
template <typename TK, typename TV>
std::ostream &operator<<(std::ostream &os, const std::map<TK, TV> &mp) {
os << "{";
for (auto v : mp)
os << v.first << "=>" << v.second << ",";
os << "}";
return os;
}
template <typename TK, typename TV>
std::ostream &operator<<(std::ostream &os,
const std::unordered_map<TK, TV> &mp) {
os << "{";
for (auto v : mp)
os << v.first << "=>" << v.second << ",";
os << "}";
return os;
}
template <class T> using V = vector<T>;
template <class T> using V2 = V<V<T>>;
template <class T> using V3 = V<V2<T>>;
template <class T> using V4 = V<V3<T>>;
char outst[20'000'000];
int outst_N = 0;
char outst_tmp[200];
template <class NUM> void numout(NUM n) {
if (n < 0) {
n *= -1;
outst[outst_N++] = '-';
}
if (n == 0) {
outst[outst_N++] = '0';
return;
}
int cnt = 0;
while (n > 0) {
outst_tmp[cnt++] = '0' + (n % 10);
n /= 10;
}
IFOR(i, 0, cnt) { outst[outst_N++] = outst_tmp[i]; }
}
void strout(std::string s) {
for (auto x : s) {
outst[outst_N++] = x;
}
}
constexpr ll LINF = 1LL << 60;
constexpr int IINF = 1 << 28;
constexpr ll mod = 1'000'000'007;
void solve() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
int t = s[0] - '0', t0 = t;
V<int> a;
int cnt = 0;
FOR(i, 0, n) {
if (t != (s[i] - '0')) {
t ^= 1;
a.eb(cnt);
cnt = 0;
}
++cnt;
}
a.eb(cnt);
// coutn( a );
if (k > 0) {
int len = a.size();
int sum = 0;
int r = 0;
int ans = 0;
for (int l = 0; l < a.size(); l++) {
while (r < a.size() && r - l < len + ((l % 2) ^ t0)) {
sum += a[r];
++r;
}
ans = max(sum, ans); // coutn(sum);
sum -= a[l];
}
coutn(ans);
} else {
int ans = 0;
for (int i = !t0; i < a.size(); i += 2)
ans = max(ans, a[i]);
coutn(ans);
}
}
int main(void) {
// std::cout << std::fixed << std::setprecision(20);
cin.tie(0);
// ios::sync_with_stdio(false);
solve();
// printf("%s", outst);
return 0;
}
| bool DBG = false;
// #pragma GCC optimize("Ofast")
// #pragma GCC
// target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
// #pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_dec_float.hpp>
//#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using ll = long long;
using ld = long double;
// using i128 = __int128_t;
// using bint = boost::multiprecision::cpp_int
// using d1024 = boost::multiprecision::number<mp::cpp_dec_float<1024>>;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define IFOR(i, a, b) for (int i = ((b)-1); i >= (a); --i)
#define RPT(i, a, b) for (int i = (a); i < ((a) + (b)); ++i)
#define IRPT(i, a, b) for (int i = ((a) + (b)-1); i >= (a); --i)
#define ALL(x) x.begin(), x.end()
#define RALL(x) x.rbegin(), x.rend()
#define fs first
#define sd second
#define couts(x) cout << (x) << (" ")
#define coutn(x) cout << (x) << ("\n")
#define ncouts(x) numout(x), outst[outst_N++] = ' '
#define ncoutn(x) numout(x), outst[outst_N++] = '\n'
#define scouts(x) strout(x), outst[outst_N++] = ' '
#define scoutn(x) strout(x), outst[outst_N++] = '\n'
#define dcouts(x) \
if (DBG) \
couts(x)
#define dcoutn(x) \
if (DBG) \
coutn(x)
#define endl "\n"
#define psb push_back
#define ppb pop_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define LBIT(x, a) (((x) >> (a)) & 1LL)
#define IBIT(x, a) (((x) >> (a)) & 1)
#define BCOUNT(x) (__builtin_popcount(x))
template <typename T>
std::istream &operator>>(std::istream &is, std::vector<T> &vec) {
for (auto &v : vec)
is >> v;
return is;
}
template <typename T1, typename T2>
std::istream &operator>>(std::istream &is, std::pair<T1, T2> &p) {
is >> p.first >> p.second;
return is;
}
template <typename T>
std::ostream &operator<<(std::ostream &os, const std::vector<T> &vec) {
os << "[";
for (auto v : vec)
os << v << ",";
os << "]";
return os;
}
template <typename T>
std::ostream &operator<<(std::ostream &os, const std::deque<T> &vec) {
os << "deque[";
for (auto v : vec)
os << v << ",";
os << "]";
return os;
}
template <typename T>
std::ostream &operator<<(std::ostream &os, const std::set<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ",";
os << "}";
return os;
}
template <typename T>
std::ostream &operator<<(std::ostream &os, const std::unordered_set<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ",";
os << "}";
return os;
}
template <typename T>
std::ostream &operator<<(std::ostream &os, const std::multiset<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ",";
os << "}";
return os;
}
template <typename T>
std::ostream &operator<<(std::ostream &os,
const std::unordered_multiset<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ",";
os << "}";
return os;
}
template <typename T1, typename T2>
std::ostream &operator<<(std::ostream &os, const std::pair<T1, T2> &pa) {
os << "(" << pa.first << "," << pa.second << ")";
return os;
}
template <typename TK, typename TV>
std::ostream &operator<<(std::ostream &os, const std::map<TK, TV> &mp) {
os << "{";
for (auto v : mp)
os << v.first << "=>" << v.second << ",";
os << "}";
return os;
}
template <typename TK, typename TV>
std::ostream &operator<<(std::ostream &os,
const std::unordered_map<TK, TV> &mp) {
os << "{";
for (auto v : mp)
os << v.first << "=>" << v.second << ",";
os << "}";
return os;
}
template <class T> using V = vector<T>;
template <class T> using V2 = V<V<T>>;
template <class T> using V3 = V<V2<T>>;
template <class T> using V4 = V<V3<T>>;
char outst[20'000'000];
int outst_N = 0;
char outst_tmp[200];
template <class NUM> void numout(NUM n) {
if (n < 0) {
n *= -1;
outst[outst_N++] = '-';
}
if (n == 0) {
outst[outst_N++] = '0';
return;
}
int cnt = 0;
while (n > 0) {
outst_tmp[cnt++] = '0' + (n % 10);
n /= 10;
}
IFOR(i, 0, cnt) { outst[outst_N++] = outst_tmp[i]; }
}
void strout(std::string s) {
for (auto x : s) {
outst[outst_N++] = x;
}
}
constexpr ll LINF = 1LL << 60;
constexpr int IINF = 1 << 28;
constexpr ll mod = 1'000'000'007;
void solve() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
int t = s[0] - '0', t0 = t;
V<int> a;
int cnt = 0;
FOR(i, 0, n) {
if (t != (s[i] - '0')) {
t ^= 1;
a.eb(cnt);
cnt = 0;
}
++cnt;
}
a.eb(cnt);
// coutn( a );
if (k > 0) {
int len = 2 * k;
int sum = 0;
int r = 0;
int ans = 0;
for (int l = 0; l < a.size(); l++) {
while (r < a.size() && r - l < len + ((l % 2) ^ t0)) {
sum += a[r];
++r;
}
ans = max(sum, ans); // couts(l); couts(r); couts(t0);coutn(sum);
sum -= a[l];
}
coutn(ans);
} else {
int ans = 0;
for (int i = !t0; i < a.size(); i += 2)
ans = max(ans, a[i]);
coutn(ans);
}
}
int main(void) {
// std::cout << std::fixed << std::setprecision(20);
cin.tie(0);
// ios::sync_with_stdio(false);
solve();
// printf("%s", outst);
return 0;
}
| [
"call.arguments.change"
] | 885,179 | 885,180 | u952090000 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
typedef pair<int, int> P;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
ll n, k;
cin >> n >> k;
string s;
cin >> s;
vector<ll> zero;
vector<ll> one;
if (s[0] == '0') {
one.push_back(0);
}
char b = 'n';
ll num = 0;
rep(i, n) {
if (s[i] == b) {
num++;
} else if (b == '1') {
one.push_back(num);
num = 1;
} else if (b == '0') {
zero.push_back(num);
num = 1;
} else {
num = 1;
}
b = s[i];
}
if (s[n - 1] == '0') {
one.push_back(0);
zero.push_back(num);
} else {
one.push_back(num);
}
// cout << one.size() << endl;
// cout << zero.size() << endl;
ll ans = 0;
if (k >= zero.size()) {
rep(i, zero.size()) {
ans += one[i];
ans += zero[i];
}
ans += one[one.size() - 1];
cout << ans << endl;
} else {
ll res;
rep(i, k) {
ans += one[i];
ans += zero[i];
}
ans += zero[k];
res = ans;
rep(i, zero.size() - k) {
res -= one[i];
res -= zero[i];
res += one[k + i + 1];
res += zero[k + i];
ans = max(res, ans);
}
cout << ans << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
typedef pair<int, int> P;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
ll n, k;
cin >> n >> k;
string s;
cin >> s;
vector<ll> zero;
vector<ll> one;
if (s[0] == '0') {
one.push_back(0);
}
char b = 'n';
ll num = 0;
rep(i, n) {
if (s[i] == b) {
num++;
} else if (b == '1') {
one.push_back(num);
num = 1;
} else if (b == '0') {
zero.push_back(num);
num = 1;
} else {
num = 1;
}
b = s[i];
}
if (s[n - 1] == '0') {
one.push_back(0);
zero.push_back(num);
} else {
one.push_back(num);
}
// cout << one.size() << endl;
// cout << zero.size() << endl;
ll ans = 0;
if (k >= zero.size()) {
rep(i, zero.size()) {
ans += one[i];
ans += zero[i];
}
ans += one[one.size() - 1];
cout << ans << endl;
} else {
ll res;
rep(i, k) {
ans += one[i];
ans += zero[i];
}
ans += one[k];
res = ans;
rep(i, zero.size() - k) {
res -= one[i];
res -= zero[i];
res += one[k + i + 1];
res += zero[k + i];
ans = max(res, ans);
}
cout << ans << endl;
}
return 0;
} | [
"assignment.value.change",
"identifier.change"
] | 885,181 | 885,182 | u459930111 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
typedef pair<int, int> P;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
ll n, k;
cin >> n >> k;
string s;
cin >> s;
vector<ll> zero;
vector<ll> one;
if (s[0] == '0') {
one.push_back(0);
}
char b = 'n';
ll num = 0;
rep(i, n) {
if (s[i] == b) {
num++;
} else if (b == '1') {
one.push_back(num);
num = 1;
} else if (b == '0') {
zero.push_back(num);
num = 1;
} else {
num = 1;
}
b = s[i];
}
if (s[n - 1] == '0') {
one.push_back(0);
zero.push_back(num);
} else {
one.push_back(num);
}
// cout << one.size() << endl;
// cout << zero.size() << endl;
ll ans = 0;
if (k >= one.size()) {
rep(i, zero.size()) {
ans += one[i];
ans += zero[i];
}
ans += one[one.size() - 1];
cout << ans << endl;
} else {
ll res;
rep(i, k) {
ans += one[i];
ans += zero[i];
}
ans += zero[k];
res = ans;
rep(i, zero.size() - k) {
res -= one[i];
res -= zero[i];
res += one[k + i + 1];
res += zero[k + i];
ans = max(res, ans);
}
cout << ans << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
typedef pair<int, int> P;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
ll n, k;
cin >> n >> k;
string s;
cin >> s;
vector<ll> zero;
vector<ll> one;
if (s[0] == '0') {
one.push_back(0);
}
char b = 'n';
ll num = 0;
rep(i, n) {
if (s[i] == b) {
num++;
} else if (b == '1') {
one.push_back(num);
num = 1;
} else if (b == '0') {
zero.push_back(num);
num = 1;
} else {
num = 1;
}
b = s[i];
}
if (s[n - 1] == '0') {
one.push_back(0);
zero.push_back(num);
} else {
one.push_back(num);
}
// cout << one.size() << endl;
// cout << zero.size() << endl;
ll ans = 0;
if (k >= zero.size()) {
rep(i, zero.size()) {
ans += one[i];
ans += zero[i];
}
ans += one[one.size() - 1];
cout << ans << endl;
} else {
ll res;
rep(i, k) {
ans += one[i];
ans += zero[i];
}
ans += one[k];
res = ans;
rep(i, zero.size() - k) {
res -= one[i];
res -= zero[i];
res += one[k + i + 1];
res += zero[k + i];
ans = max(res, ans);
}
cout << ans << endl;
}
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 885,183 | 885,182 | u459930111 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
#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)
#define repr(i, n) for (int i = (int)n - 1; i >= 0; --i)
#define ALL(a) (a).begin(), (a).end()
using ll = long long;
// using Graph = vector<vector<int>>;
const ll MOD = 1e9 + 7;
const ll INF = 1e9;
const ll LINF = 1LL << 60;
int main() {
int n, k, start;
string s;
cin >> n >> k >> s;
if (s[0] == '0')
start = 0;
else
start = 1;
char f = s[0];
int cnt = 0;
vector<int> res;
rep(i, n) {
if (s[i] == f)
cnt++;
else {
res.push_back(cnt);
cnt = 1;
f = s[i];
}
}
res.push_back(cnt);
// rep(i, res.size()) cout << res[i] << endl;
int ans = 0;
if (start == 1) {
if (res.size() / 2 <= k) {
rep(i, res.size()) ans += res[i];
cout << ans << endl;
return 0;
}
for (int i = 0; i < res.size() - 2 * k; i += 2) {
int tmp = 0;
for (int j = i; j < i + 2 * k + 1; ++j)
tmp += res[j];
ans = max(ans, tmp);
}
int tmp = 0;
for (int j = res.size() - 1; j > res.size() - 2 * k; --j)
tmp += res[j];
ans = max(ans, tmp);
} else {
if ((res.size() + 1) / 2 <= k) {
rep(i, res.size()) ans += res[i];
cout << ans << endl;
return 0;
}
for (int i = 1; i <= res.size() - 1 - 2 * k; i += 2) {
int tmp = 0;
for (int j = i; j < (i + 2 * k + 1); ++j)
tmp += res[j];
ans = max(ans, tmp);
}
int tmp = 0;
for (int j = res.size() - 1; j > res.size() - 2 * k; --j)
tmp += res[j];
ans = max(ans, tmp);
tmp = 0;
for (int j = 0; j < 2 * k; ++j)
tmp += res[j];
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 < (int)n; ++i)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define repr(i, n) for (int i = (int)n - 1; i >= 0; --i)
#define ALL(a) (a).begin(), (a).end()
using ll = long long;
// using Graph = vector<vector<int>>;
const ll MOD = 1e9 + 7;
const ll INF = 1e9;
const ll LINF = 1LL << 60;
int main() {
int n, k, start;
string s;
cin >> n >> k >> s;
if (s[0] == '0')
start = 0;
else
start = 1;
char f = s[0];
int cnt = 0;
vector<int> res;
rep(i, n) {
if (s[i] == f)
cnt++;
else {
res.push_back(cnt);
cnt = 1;
f = s[i];
}
}
res.push_back(cnt);
// rep(i, res.size()) cout << res[i] << endl;
int ans = 0;
if (start == 1) {
if (res.size() / 2 <= k) {
rep(i, res.size()) ans += res[i];
cout << ans << endl;
return 0;
}
for (int i = 0; i < res.size() - 2 * k; i += 2) {
int tmp = 0;
for (int j = i; j < i + 2 * k + 1; ++j)
tmp += res[j];
ans = max(ans, tmp);
}
int tmp = 0;
for (int j = res.size() - 1; j >= res.size() - 2 * k; --j)
tmp += res[j];
ans = max(ans, tmp);
} else {
if ((res.size() + 1) / 2 <= k) {
rep(i, res.size()) ans += res[i];
cout << ans << endl;
return 0;
}
for (int i = 1; i <= res.size() - 1 - 2 * k; i += 2) {
int tmp = 0;
for (int j = i; j < (i + 2 * k + 1); ++j)
tmp += res[j];
ans = max(ans, tmp);
}
int tmp = 0;
for (int j = res.size() - 1; j >= res.size() - 2 * k; --j)
tmp += res[j];
ans = max(ans, tmp);
tmp = 0;
for (int j = 0; j < 2 * k; ++j)
tmp += res[j];
ans = max(ans, tmp);
}
cout << ans << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 885,190 | 885,189 | u207048881 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
#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)
#define repr(i, n) for (int i = (int)n - 1; i >= 0; --i)
#define ALL(a) (a).begin(), (a).end()
using ll = long long;
// using Graph = vector<vector<int>>;
const ll MOD = 1e9 + 7;
const ll INF = 1e9;
const ll LINF = 1LL << 60;
int main() {
int n, k, start;
string s;
cin >> n >> k >> s;
if (s[0] == '0')
start = 0;
else
start = 1;
char f = s[0];
int cnt = 0;
vector<int> res;
rep(i, n) {
if (s[i] == f)
cnt++;
else {
res.push_back(cnt);
cnt = 1;
f = s[i];
}
}
res.push_back(cnt);
// rep(i, res.size()) cout << res[i] << endl;
int ans = 0;
if (start == 1) {
if (res.size() / 2 <= k) {
rep(i, res.size()) ans += res[i];
cout << ans << endl;
return 0;
}
for (int i = 0; i < res.size() - 2 * k; i += 2) {
int tmp = 0;
for (int j = i; j < i + 2 * k + 1; ++j)
tmp += res[j];
ans = max(ans, tmp);
}
int tmp = 0;
for (int j = res.size() - 1; j > res.size() - 2 * k; --j)
tmp += res[j];
ans = max(ans, tmp);
} else {
if ((res.size() + 1) / 2 <= k) {
rep(i, res.size()) ans += res[i];
cout << ans << endl;
return 0;
}
for (int i = 1; i < res.size() - 1 - 2 * k; i += 2) {
int tmp = 0;
for (int j = i; j < (i + 2 * k + 1); ++j)
tmp += res[j];
ans = max(ans, tmp);
}
int tmp = 0;
for (int j = res.size() - 1; j > res.size() - 2 * k; --j)
tmp += res[j];
ans = max(ans, tmp);
tmp = 0;
for (int j = 0; j < 2 * k; ++j)
tmp += res[j];
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 < (int)n; ++i)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define repr(i, n) for (int i = (int)n - 1; i >= 0; --i)
#define ALL(a) (a).begin(), (a).end()
using ll = long long;
// using Graph = vector<vector<int>>;
const ll MOD = 1e9 + 7;
const ll INF = 1e9;
const ll LINF = 1LL << 60;
int main() {
int n, k, start;
string s;
cin >> n >> k >> s;
if (s[0] == '0')
start = 0;
else
start = 1;
char f = s[0];
int cnt = 0;
vector<int> res;
rep(i, n) {
if (s[i] == f)
cnt++;
else {
res.push_back(cnt);
cnt = 1;
f = s[i];
}
}
res.push_back(cnt);
// rep(i, res.size()) cout << res[i] << endl;
int ans = 0;
if (start == 1) {
if (res.size() / 2 <= k) {
rep(i, res.size()) ans += res[i];
cout << ans << endl;
return 0;
}
for (int i = 0; i < res.size() - 2 * k; i += 2) {
int tmp = 0;
for (int j = i; j < i + 2 * k + 1; ++j)
tmp += res[j];
ans = max(ans, tmp);
}
int tmp = 0;
for (int j = res.size() - 1; j >= res.size() - 2 * k; --j)
tmp += res[j];
ans = max(ans, tmp);
} else {
if ((res.size() + 1) / 2 <= k) {
rep(i, res.size()) ans += res[i];
cout << ans << endl;
return 0;
}
for (int i = 1; i <= res.size() - 1 - 2 * k; i += 2) {
int tmp = 0;
for (int j = i; j < (i + 2 * k + 1); ++j)
tmp += res[j];
ans = max(ans, tmp);
}
int tmp = 0;
for (int j = res.size() - 1; j >= res.size() - 2 * k; --j)
tmp += res[j];
ans = max(ans, tmp);
tmp = 0;
for (int j = 0; j < 2 * k; ++j)
tmp += res[j];
ans = max(ans, tmp);
}
cout << ans << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 885,191 | 885,189 | u207048881 | cpp |
p03074 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define ll long long
using namespace std;
int main(void) {
ll n, k;
cin >> n >> k;
string s;
cin >> s;
ll ans = 0;
vector<ll> check;
check.push_back(0);
for (ll i = 0; i < s.length(); i++) {
if (s[i] != s[i - 1] && i != 0) {
check.push_back(i);
}
}
ll len = s.length();
for (ll i = 0; i < check.size(); i++) {
ll a = check[i];
if (s[a] == '1') {
ll b = check[i + 2 * k + 1];
if (i + 2 * k + 1 > check.size())
ans = max(ans, len - a);
else
ans = max(ans, b - a);
} else if (s[a] == '0') {
ll b = check[i + 2 * k];
if (i + 2 * k > check.size())
ans = max(ans, len - a);
else
ans = max(ans, b - a);
}
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define ll long long
using namespace std;
int main(void) {
ll n, k;
cin >> n >> k;
string s;
cin >> s;
ll ans = 0;
vector<ll> check;
check.push_back(0);
for (ll i = 0; i < s.length(); i++) {
if (s[i] != s[i - 1] && i != 0) {
check.push_back(i);
}
}
ll len = s.length();
for (ll i = 0; i < check.size(); i++) {
ll a = check[i];
if (s[a] == '1') {
ll b = check[i + 2 * k + 1];
if (i + 2 * k + 1 >= check.size())
ans = max(ans, len - a);
else
ans = max(ans, b - a);
} else if (s[a] == '0') {
ll b = check[i + 2 * k];
if (i + 2 * k >= check.size())
ans = max(ans, len - a);
else
ans = max(ans, b - a);
}
}
cout << ans << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 885,197 | 885,198 | u157195505 | cpp |
p03074 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define ll long long
using namespace std;
int main(void) {
ll n, k;
cin >> n >> k;
string s;
cin >> s;
ll ans = 0;
vector<ll> check;
check.push_back(0);
for (ll i = 0; i < s.length(); i++) {
if (s[i] != s[i - 1] && i != 0) {
check.push_back(i);
}
}
ll len = s.length();
for (ll i = 0; i < check.size(); i++) {
ll a = check[i];
if (s[a] == '1') {
ll b = check[a + 2 * k + 1];
if (a + 2 * k + 1 > check.size())
ans = max(ans, len - a);
else
ans = max(ans, b - a);
} else if (s[a] == '0') {
ll b = check[a + 2 * k];
if (a + 2 * k > check.size())
ans = max(ans, len - a);
else
ans = max(ans, b - a);
}
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define ll long long
using namespace std;
int main(void) {
ll n, k;
cin >> n >> k;
string s;
cin >> s;
ll ans = 0;
vector<ll> check;
check.push_back(0);
for (ll i = 0; i < s.length(); i++) {
if (s[i] != s[i - 1] && i != 0) {
check.push_back(i);
}
}
ll len = s.length();
for (ll i = 0; i < check.size(); i++) {
ll a = check[i];
if (s[a] == '1') {
ll b = check[i + 2 * k + 1];
if (i + 2 * k + 1 >= check.size())
ans = max(ans, len - a);
else
ans = max(ans, b - a);
} else if (s[a] == '0') {
ll b = check[i + 2 * k];
if (i + 2 * k >= check.size())
ans = max(ans, len - a);
else
ans = max(ans, b - a);
}
}
cout << ans << endl;
return 0;
}
| [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"expression.operator.compare.change"
] | 885,199 | 885,198 | u157195505 | cpp |
p03074 | #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;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 885,202 | 885,203 | u298768617 | cpp |
p03074 | #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 < b.size(); i += 2) {
int left = i;
int right = min(i + 2 * k + 1, (int)b.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;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"identifier.change",
"control_flow.loop.for.condition.change"
] | 885,204 | 885,203 | u298768617 | cpp |
p03074 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
using Graph = vector<vector<int>>;
#define MOD 1000000007
#define MOD2 998244353
#define INF ((1 << 30) - 1)
#define LINF (1LL << 60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> r;
r.push_back(0);
for (int i = 1; i < n; i++) {
if (s[i] != s[i - 1])
r.push_back(i);
}
// rep(i, r.size()) cout << r[i] << endl;
int ans = 0;
int m = r.size();
rep(i, r.size()) {
int tmp, cnt;
if (s[i] == '0') {
if (2 * k + i > m - 1)
tmp = n;
else
tmp = r[2 * k + i];
cnt = tmp - r[i];
// cout << cnt << endl;
} else {
if (2 * k + i + 1 > m - 1)
tmp = n;
else
tmp = r[2 * k + i + 1];
cnt = tmp - r[i];
// cout << cnt << endl;
}
ans = max(ans, cnt);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
using Graph = vector<vector<int>>;
#define MOD 1000000007
#define MOD2 998244353
#define INF ((1 << 30) - 1)
#define LINF (1LL << 60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> r;
r.push_back(0);
for (int i = 1; i < n; i++) {
if (s[i] != s[i - 1])
r.push_back(i);
}
// rep(i, r.size()) cout << r[i] << endl;
int ans = 0;
int m = r.size();
// rep(i, m) cout << r[i] << " ";
// cout << endl;
rep(i, r.size()) {
int tmp, cnt;
if (s[r[i]] == '0') {
if (2 * k + i > m - 1)
tmp = n;
else
tmp = r[2 * k + i];
cnt = tmp - r[i];
// cout << cnt << endl;
} else {
if (2 * k + i + 1 > m - 1)
tmp = n;
else
tmp = r[2 * k + i + 1];
cnt = tmp - r[i];
// cout << cnt << endl;
}
ans = max(ans, cnt);
}
cout << ans << endl;
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 885,205 | 885,206 | u501163846 | cpp |
p03074 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
//#pragma GCC optimize("Ofast")
//#define _GLIBCXX_DEBUG
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
//#define int ll
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef vector<pair<int, int>> vpii;
typedef vector<vector<int>> vvi;
typedef vector<vector<char>> vvc;
typedef vector<vector<string>> vvs;
typedef vector<vector<ll>> vvll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define irep(it, stl) for (auto it = stl.begin(); it != stl.end(); it++)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define fin(ans) cout << (ans) << '\n'
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define floatprec(dig) fixed << setprecision(dig)
#define Sort(a) sort(a.begin(), a.end())
#define Rort(a) sort(a.rbegin(), a.rend())
#define MATHPI acos(-1)
#define itn int;
#define invar(typ, var) \
typ var; \
cin >> var;
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
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;
}
struct io {
io() {
ios::sync_with_stdio(false);
cin.tie(0);
}
};
const int INF = INT_MAX / 2;
const ll LLINF = 1LL << 60;
constexpr ll MOD = 1000000007;
const double EPS = 1e-9;
signed main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
string S;
cin >> S;
// 0か1のどちらかの連続になっていた...
vi ct;
int j = 0;
int acc = 0;
char prev = -1;
rep(i, S.size()) {
if (S[i] != prev) {
if (i == 0 && S[0] == '1') {
} else {
ct.push_back(acc);
}
prev = S[i];
acc = 0;
}
acc++;
}
ct.push_back(acc);
ct.push_back(0);
// next
N = ct.size();
acc = 0;
int klen = K * 2 + 1;
rep(i, min(N, klen)) { acc += ct[i]; }
if (N <= klen) {
fin(acc);
return 0;
}
int maxv = acc;
for (int i = 0; i < N - klen; i += 2) {
acc = acc - ct[i] - ct[i + 2] + ct[i + klen] + ct[i + klen + 1];
chmax(maxv, acc);
}
fin(maxv);
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
//#pragma GCC optimize("Ofast")
//#define _GLIBCXX_DEBUG
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
//#define int ll
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef vector<pair<int, int>> vpii;
typedef vector<vector<int>> vvi;
typedef vector<vector<char>> vvc;
typedef vector<vector<string>> vvs;
typedef vector<vector<ll>> vvll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define irep(it, stl) for (auto it = stl.begin(); it != stl.end(); it++)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define fin(ans) cout << (ans) << '\n'
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define floatprec(dig) fixed << setprecision(dig)
#define Sort(a) sort(a.begin(), a.end())
#define Rort(a) sort(a.rbegin(), a.rend())
#define MATHPI acos(-1)
#define itn int;
#define invar(typ, var) \
typ var; \
cin >> var;
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
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;
}
struct io {
io() {
ios::sync_with_stdio(false);
cin.tie(0);
}
};
const int INF = INT_MAX / 2;
const ll LLINF = 1LL << 60;
constexpr ll MOD = 1000000007;
const double EPS = 1e-9;
signed main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
string S;
cin >> S;
// 0か1のどちらかの連続になっていた...
vi ct;
int j = 0;
int acc = 0;
char prev = -1;
rep(i, S.size()) {
if (S[i] != prev) {
if (i == 0 && S[0] == '1') {
} else {
ct.push_back(acc);
}
prev = S[i];
acc = 0;
}
acc++;
}
ct.push_back(acc);
ct.push_back(0);
// next
N = ct.size();
acc = 0;
int klen = K * 2 + 1;
rep(i, min(N, klen)) { acc += ct[i]; }
if (N <= klen) {
fin(acc);
return 0;
}
int maxv = acc;
for (int i = 0; i < N - klen; i += 2) {
acc = acc - ct[i] - ct[i + 1] + ct[i + klen] + ct[i + klen + 1];
chmax(maxv, acc);
}
fin(maxv);
} | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 885,207 | 885,208 | u554843701 | cpp |
p03074 | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define lb long double
#define pb push_back
#define r first
#define l second
#define qwerty3 ->first
#define qwerty4 ->second
#define umap unordered_map
#define uset unordered_set
#define pii pair<int, int>
using namespace std;
const int N = 100005;
const int M = 1000000007;
const lb PI = acos(-1);
int n, k;
char x, y;
pair<int, int> a[N];
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
int i, cnt = 0, lg = 1;
cin >> n >> k;
cin >> x;
for (i = 2; i <= n; i++) {
cin >> y;
if (x == y)
++lg;
else {
if (x == '0')
a[++cnt] = {i - lg, i - 1};
lg = 1;
}
x = y;
}
if (y == '0')
a[++cnt] = {n - lg + 1, n};
if (cnt <= k) {
cout << n;
return 0;
}
int ans = 0;
for (i = 2; i < cnt - k + 1; i++)
ans = max(ans, a[i + k].l - 1 - a[i - 1].r - 1 + 1);
ans = max(ans, a[1 + k].l - 1);
ans = max(ans, n - a[cnt - k].r);
cout << ans;
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define lb long double
#define pb push_back
#define l first
#define r second
#define qwerty3 ->first
#define qwerty4 ->second
#define umap unordered_map
#define uset unordered_set
#define pii pair<int, int>
using namespace std;
const int N = 100005;
const int M = 1000000007;
const lb PI = acos(-1);
int n, k;
char x, y;
pair<int, int> a[N];
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
int i, cnt = 0, lg = 1;
cin >> n >> k;
cin >> x;
for (i = 2; i <= n; i++) {
cin >> y;
if (x == y)
++lg;
else {
if (x == '0')
a[++cnt] = {i - lg, i - 1};
lg = 1;
}
x = y;
}
if (y == '0')
a[++cnt] = {n - lg + 1, n};
if (cnt <= k) {
cout << n;
return 0;
}
int ans = 0;
for (i = 2; i < cnt - k + 1; i++)
ans = max(ans, a[i + k].l - 1 - (a[i - 1].r + 1) + 1);
ans = max(ans, a[1 + k].l - 1);
ans = max(ans, n - a[cnt - k].r);
cout << ans;
return 0;
}
| [
"call.arguments.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 885,214 | 885,215 | u916060970 | cpp |
p03074 | #include <bits/stdc++.h>
#define ll long long
#define pq priority_queue
using namespace std;
const ll INF = (ll)1e9;
const ll MOD = (ll)1e9 + 7;
const ll MAX = 510000;
vector<int> dx = {1, 0, -1, 0}, dy = {0, 1, 0, -1};
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() {
ll N, K, cnt = 0;
string S;
pair<ll, ll> P;
P.first = 1;
P.second = 0;
cin >> N >> K >> S;
vector<pair<ll, ll>> v;
if (S[0] == '0')
v.push_back(P);
for (ll i = 0; i < N; i++) {
pair<ll, ll> p;
ll cnt = 1;
if (S[i] == '0') {
while (i + 1 < N && S[i + 1] == '0') {
cnt++;
i++;
}
p.first = 0;
p.second = cnt;
} else {
while (i + 1 < N && S[i + 1] == '1') {
cnt++;
i++;
}
p.first = 1;
p.second = cnt;
}
v.push_back(p);
}
if (v[N - 1].first == 0)
v.push_back(P);
/*for(ll i=0;i<v.size();i++){
cout<<v[i].first<<" "<<v[i].second<<endl;
}*/
for (ll i = 1; i < v.size(); i++)
v[i].second += v[i - 1].second;
if (v.size() < K * 2) {
cout << v[v.size() - 1].second << endl;
return 0;
}
ll ans = v[K * 2].second;
for (ll i = K * 2 + 2; i < v.size(); i += 2) {
chmax(ans, v[i].second - v[i - K * 2 - 1].second);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define ll long long
#define pq priority_queue
using namespace std;
const ll INF = (ll)1e9;
const ll MOD = (ll)1e9 + 7;
const ll MAX = 510000;
vector<int> dx = {1, 0, -1, 0}, dy = {0, 1, 0, -1};
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() {
ll N, K, cnt = 0;
string S;
pair<ll, ll> P;
P.first = 1;
P.second = 0;
cin >> N >> K >> S;
vector<pair<ll, ll>> v;
if (S[0] == '0')
v.push_back(P);
for (ll i = 0; i < N; i++) {
pair<ll, ll> p;
ll cnt = 1;
if (S[i] == '0') {
while (i + 1 < N && S[i + 1] == '0') {
cnt++;
i++;
}
p.first = 0;
p.second = cnt;
} else {
while (i + 1 < N && S[i + 1] == '1') {
cnt++;
i++;
}
p.first = 1;
p.second = cnt;
}
v.push_back(p);
}
if (v[v.size() - 1].first == 0)
v.push_back(P);
for (ll i = 1; i < v.size(); i++)
v[i].second += v[i - 1].second;
if (v.size() < K * 2) {
cout << v[v.size() - 1].second << endl;
return 0;
}
ll ans = v[K * 2].second;
for (ll i = K * 2 + 2; i < v.size(); i += 2) {
chmax(ans, v[i].second - v[i - K * 2 - 1].second);
}
cout << ans << endl;
}
| [
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"call.add"
] | 885,222 | 885,223 | u937275419 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
ll a[100010];
int main() {
ll n, k;
cin >> n >> k;
string s;
cin >> s;
ll now = 1;
ll j = 0;
ll cnt = 0;
if (s[0] - '0' != 1) {
// cout << 2;
now = 1 - now;
a[0] = 0;
cnt = 1;
j = 1;
} else {
cnt++;
}
for (int i = 1; i < s.size(); i++) {
ll ch = s[i] - '0';
// cout <<ch << endl;
if (ch == now) {
cnt++;
} else {
now = 1 - now;
a[j] = cnt;
cnt = 1;
j++;
}
}
a[j] = cnt;
if (s[s.size() - 1] - '0' == 0) {
j++;
a[j] = 0;
}
// for(int i=0;i<=j;i++){
// cout << a[i]<<endl;
//}
k = min(k * 2 + 1, n);
ll ans = 0;
for (int i = 0; i + k - 1 <= j; i += 2) {
ll sum = 0;
for (int l = 0; l < k; l++) {
sum += a[l + i];
}
ans = max(sum, ans);
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
ll a[100010];
int main() {
ll n, k;
cin >> n >> k;
string s;
cin >> s;
ll now = 1;
ll j = 0;
ll cnt = 0;
if (s[0] - '0' != 1) {
// cout << 2;
now = 1 - now;
a[0] = 0;
cnt = 1;
j = 1;
} else {
cnt++;
}
for (int i = 1; i < s.size(); i++) {
ll ch = s[i] - '0';
// cout <<ch << endl;
if (ch == now) {
cnt++;
} else {
now = 1 - now;
a[j] = cnt;
cnt = 1;
j++;
}
}
a[j] = cnt;
if (s[s.size() - 1] - '0' == 0) {
j++;
a[j] = 0;
}
// for(int i=0;i<=j;i++){
// cout << a[i]<<endl;
//}
k = min(k * 2 + 1, j + 1);
ll ans = 0;
for (int i = 0; i + k - 1 <= j; i += 2) {
ll sum = 0;
for (int l = 0; l < k; l++) {
sum += a[l + i];
}
ans = max(sum, ans);
}
cout << ans;
return 0;
} | [
"assignment.value.change",
"call.arguments.change",
"assignment.change"
] | 885,227 | 885,228 | u166378830 | cpp |
p03074 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define pb push_back
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> a;
int res = 1;
s[n] = (s[n - 1] + 1) % 2;
if (s[0] == '0')
a.pb(0);
rep(i, n) {
if (s[i] == s[i + 1]) {
res++;
} else {
a.pb(res);
res = 1;
}
}
int ans = 0;
int res2 = 0;
int p = a.size() - 2 * k;
rep(i, max(p, 1)) {
rep(j, 2 * k) {
if (i + j < a.size())
res2 += a[i + j];
}
if (i % 2 == 0 && i + 2 * k < a.size())
res2 += a[i + 2 * k];
ans = max(ans, res2);
res2 = 0;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define pb push_back
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> a;
int res = 1;
s[n] = (s[n - 1] + 1) % 2;
if (s[0] == '0')
a.pb(0);
rep(i, n) {
if (s[i] == s[i + 1]) {
res++;
} else {
a.pb(res);
res = 1;
}
}
int ans = 0;
int res2 = 0;
int p = a.size() - 2 * k + 1;
rep(i, max(p, 1)) {
rep(j, 2 * k) {
if (i + j < a.size())
res2 += a[i + j];
}
if (i % 2 == 0 && i + 2 * k < a.size())
res2 += a[i + 2 * k];
ans = max(ans, res2);
res2 = 0;
}
cout << ans << endl;
} | [
"assignment.change"
] | 885,234 | 885,235 | u314917898 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const double PI = 3.14159265358979;
const ll INF = pow(10, 18);
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, n) FOR(i, 0, n)
string abc = "abcdefghijklmnopqrstuvwxyz";
string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int main() {
ll n, k;
cin >> n >> k;
string s;
cin >> s;
vl a(n + 5, 0);
ll j = 0;
if (s[0] == '0') {
j++;
}
a[j]++;
FOR(i, 1, n) {
if (s[i] == s[i - 1]) {
a[j]++;
} else {
j++;
a[j]++;
}
}
ll t = 0;
rep(i, 2 * k + 1) { t += a[i]; }
ll ans = t;
for (ll i = 0; 2 * k + i < n; i += 2) {
t -= a[i] + a[i + 1];
t += a[2 * k + 1 + i] + a[2 * k + 2 + i];
ans = max(ans, t);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const double PI = 3.14159265358979;
const ll INF = pow(10, 18);
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, n) FOR(i, 0, n)
string abc = "abcdefghijklmnopqrstuvwxyz";
string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int main() {
ll n, k;
cin >> n >> k;
string s;
cin >> s;
vl a(n + 2 * k + 5, 0);
ll j = 0;
if (s[0] == '0') {
j++;
}
a[j]++;
FOR(i, 1, n) {
if (s[i] == s[i - 1]) {
a[j]++;
} else {
j++;
a[j]++;
}
}
ll t = 0;
rep(i, 2 * k + 1) { t += a[i]; }
ll ans = t;
for (ll i = 0; 2 * k + i < n; i += 2) {
t -= a[i] + a[i + 1];
t += a[2 * k + 1 + i] + a[2 * k + 2 + i];
ans = max(ans, t);
}
cout << ans << endl;
} | [
"assignment.change"
] | 885,236 | 885,237 | u328811800 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, add = 1, ans = 0, now = 0;
cin >> N >> K;
string S;
cin >> S;
vector<int> sum;
bool zero;
if (S[0] == '0') {
zero = true;
} else {
zero = false;
}
for (int i = 1; i < N; i++) {
if (zero) {
if (S[i] == '0') {
add++;
} else {
sum.push_back(add);
zero = false;
add = 1;
}
} else {
if (S[i] == '0') {
sum.push_back(add);
add = 1;
zero = true;
} else {
add++;
}
}
}
sum.push_back(add);
if (S[0] == '0') {
for (int i = 0; i < min((int)sum.size(), 2 * K); i++) {
ans += sum[i];
}
for (int i = 1; i < min((int)sum.size(), 2 * K + 2); i++) {
now += sum[i];
}
ans = max(ans, now);
for (int i = 2 * K + 2; i < sum.size(); i++) {
if (i % 2 == 0) {
now = now - sum[i - 2 * K + 1] - sum[i - 2 * K] + sum[i];
} else {
now = now + sum[i];
}
ans = max(ans, now);
}
} else {
for (int i = 0; i < min((int)sum.size(), 1 + 2 * K); i++) {
ans += sum[i];
}
now = ans;
for (int i = 2 * K + 1; i < sum.size(); i++) {
if (i % 2 == 0) {
now = now + sum[i];
} else {
now = now - sum[i - 2 * K - 1] - sum[i - 2 * K] + sum[i];
}
ans = max(ans, now);
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, add = 1, ans = 0, now = 0;
cin >> N >> K;
string S;
cin >> S;
vector<int> sum;
bool zero;
if (S[0] == '0') {
zero = true;
} else {
zero = false;
}
for (int i = 1; i < N; i++) {
if (zero) {
if (S[i] == '0') {
add++;
} else {
sum.push_back(add);
zero = false;
add = 1;
}
} else {
if (S[i] == '0') {
sum.push_back(add);
add = 1;
zero = true;
} else {
add++;
}
}
}
sum.push_back(add);
if (S[0] == '0') {
for (int i = 0; i < min((int)sum.size(), 2 * K); i++) {
ans += sum[i];
}
for (int i = 1; i < min((int)sum.size(), 2 * K + 2); i++) {
now += sum[i];
}
ans = max(ans, now);
for (int i = 2 * K + 2; i < sum.size(); i++) {
if (i % 2 == 0) {
now = now - sum[i - 2 * K - 1] - sum[i - 2 * K] + sum[i];
} else {
now = now + sum[i];
}
ans = max(ans, now);
}
} else {
for (int i = 0; i < min((int)sum.size(), 1 + 2 * K); i++) {
ans += sum[i];
}
now = ans;
for (int i = 2 * K + 1; i < sum.size(); i++) {
if (i % 2 == 0) {
now = now + sum[i];
} else {
now = now - sum[i - 2 * K - 1] - sum[i - 2 * K] + sum[i];
}
ans = max(ans, now);
}
}
cout << ans << endl;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 885,241 | 885,242 | u926416331 | cpp |
p03074 | #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;
} | [
"expression.operation.binary.add"
] | 885,253 | 885,254 | u828388155 | cpp |
p03074 | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
int main(void) {
ll n, k;
cin >> n >> k;
string str;
cin >> str;
ll cnt = 0;
ll i = 0;
if (str[0] == '1')
cnt--;
while (i < n && cnt < k) {
if (str[i] == '1' && str[i + 1] == '0')
cnt++;
i++;
}
ll ans = i;
ll back_i = 0;
str = str + "0";
while (i < n) {
while (!(str[i] == '1' && str[i + 1] == '0') && i < n)
i++;
while (!(str[back_i] == '0' && str[back_i + 1] == '1') && back_i < n)
back_i++;
back_i++;
i++;
// cout << "back_i : " << back_i << " i : " << i << endl;
ans = max(ans, i - back_i);
}
cout << ans << endl;
return 0;
} | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
int main(void) {
ll n, k;
cin >> n >> k;
string str;
cin >> str;
ll cnt = 0;
ll i = 0;
if (str[0] == '1')
cnt--;
while (i < n && cnt < k) {
if (str[i] == '1' && str[i + 1] == '0')
cnt++;
i++;
}
ll ans = i;
ll back_i = 0;
str = str + "0";
while (i < n) {
while (!(str[i] == '1' && str[i + 1] == '0') && i < n - 1)
i++;
while (!(str[back_i] == '0' && str[back_i + 1] == '1') && back_i < n)
back_i++;
back_i++;
i++;
// cout << "back_i : " << back_i << " i : " << i << endl;
ans = max(ans, i - back_i);
}
cout << ans << endl;
return 0;
} | [
"control_flow.loop.condition.change"
] | 885,259 | 885,260 | u855186748 | cpp |
p03074 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define vi vector<int>
#define vivi vector<vi>
const int INF = int(1e9);
typedef long long int ll;
/* -- template -- */
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
int dp[100001];
dp[0] = 0;
bool zeroflg = false;
for (int i = 0; i < N; ++i) {
dp[i] = dp[((i - 1 < 0) ? 0 : i - 1)];
if (S[i] == '0' && !zeroflg) {
zeroflg = true;
++dp[i];
}
if (S[i] == '1') {
zeroflg = false;
}
}
int l = 0, r = 1;
int maxv = 1;
while (r < N) {
if (dp[r] - ((l - 1 < 0) ? 0 : dp[l - 1]) + ((S[l] == '0') ? 1 : 0) <= K) {
maxv = max(maxv, r - l + 1);
++r;
} else {
++l;
}
if (r == l)
++r;
}
cout << maxv << endl;
}
/*
5
1
00101
*/
| #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define vi vector<int>
#define vivi vector<vi>
const int INF = int(1e9);
typedef long long int ll;
/* -- template -- */
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
int dp[100001];
dp[0] = 0;
bool zeroflg = false;
for (int i = 0; i < N; ++i) {
dp[i] = dp[((i - 1 < 0) ? 0 : i - 1)];
if (S[i] == '0' && !zeroflg) {
zeroflg = true;
++dp[i];
}
if (S[i] == '1') {
zeroflg = false;
}
}
int l = 0, r = 1;
int maxv = 1;
while (r < N) {
if (dp[r] - ((l - 1 < 0) ? 0 : dp[l - 1]) +
((S[l] == '0' && l != 0) ? 1 : 0) <=
K) {
maxv = max(maxv, r - l + 1);
++r;
} else {
++l;
}
if (r == l)
++r;
}
cout << maxv << endl;
}
/*
5
1
00101
*/
| [
"control_flow.branch.if.condition.change"
] | 885,269 | 885,270 | u275488634 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
#define sz(x) int(x.size())
#define pii pair<int, int>
#define Task "abc"
#define For(i, a, b) for (int i = (a), _b = (b); i <= b; ++i)
#define Debug(X) cout << #X << " = " << X << '\n'
#define All(x) (x).begin(), (x).end()
#define mp make_pair
typedef unsigned long long ull;
typedef long long ll;
const int maxn = 1e5 + 10;
const int inf = 0x3f3f3f3f;
char s[maxn];
pair<int, int> sto[maxn];
int n, k, m;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// freopen(Task".inp", "r", stdin);
cin >> n >> k;
cin >> s + 1;
int l = 1, r = 1;
if (s[1] == '0')
sto[++m] = mp(1, 1);
for (; l <= n; ++l) {
if (s[l] == '0')
continue;
r = l;
while (r + 1 <= n && s[r + 1] == '1')
++r;
sto[++m] = mp(l, r);
l = r;
}
if (s[n] == '0')
sto[++m] = mp(n, n);
int ma = 0;
for (int i = 1; i <= n; ++i) {
ma = max(ma, sto[min(i + k, n)].second - sto[i].first + 1);
}
cout << ma;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define sz(x) int(x.size())
#define pii pair<int, int>
#define Task "abc"
#define For(i, a, b) for (int i = (a), _b = (b); i <= b; ++i)
#define Debug(X) cout << #X << " = " << X << '\n'
#define All(x) (x).begin(), (x).end()
#define mp make_pair
typedef unsigned long long ull;
typedef long long ll;
const int maxn = 1e5 + 10;
const int inf = 0x3f3f3f3f;
char s[maxn];
pair<int, int> sto[maxn];
int n, k, m;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// freopen(Task".inp", "r", stdin);
cin >> n >> k;
cin >> s + 1;
int l = 1, r = 1;
if (s[1] == '0')
sto[++m] = mp(1, 1);
for (; l <= n; ++l) {
if (s[l] == '0')
continue;
r = l;
while (r + 1 <= n && s[r + 1] == '1')
++r;
sto[++m] = mp(l, r);
l = r;
}
if (s[n] == '0')
sto[++m] = mp(n, n);
int ma = 0;
for (int i = 1; i <= m; ++i) {
ma = max(ma, sto[min(i + k, m)].second - sto[i].first + 1);
}
cout << ma;
return 0;
}
| [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 885,271 | 885,272 | u041117654 | cpp |
p03074 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPS(i, n) for (int i = 1; i <= (int)(n); i++)
using namespace std;
using ll = long long;
using ld = long double;
int main(void) {
int N, K;
cin >> N >> K;
string S;
cin >> S;
int A[N];
REP(i, N) { A[i] = S.at(i) - '0'; }
int block[N] = {};
for (int i = 1; i < N; i++) {
if (A[i] == A[i - 1]) {
block[i] = block[i - 1];
} else {
block[i] = block[i - 1] + 1;
}
}
int ans = 0, sentinel;
REP(i, N) {
if (A[i] == 0) {
sentinel = lower_bound(block, block + N, A[i] + K * 2) - block;
} else {
sentinel = lower_bound(block, block + N, A[i] + K * 2 + 1) - block;
}
ans = max(ans, sentinel - i);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPS(i, n) for (int i = 1; i <= (int)(n); i++)
using namespace std;
using ll = long long;
using ld = long double;
int main(void) {
int N, K;
cin >> N >> K;
string S;
cin >> S;
int A[N];
REP(i, N) { A[i] = S.at(i) - '0'; }
int block[N] = {};
for (int i = 1; i < N; i++) {
if (A[i] == A[i - 1]) {
block[i] = block[i - 1];
} else {
block[i] = block[i - 1] + 1;
}
}
int ans = 0, sentinel;
REP(i, N) {
if (A[i] == 0) {
sentinel = lower_bound(block, block + N, block[i] + K * 2) - block;
} else {
sentinel = lower_bound(block, block + N, block[i] + K * 2 + 1) - block;
}
ans = max(ans, sentinel - i);
}
cout << ans << endl;
} | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 885,273 | 885,274 | u986754154 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int n, k, count = 0;
string s;
vector<int> si, so;
cin >> n >> k >> s;
char c = s[0];
if (c == '0')
si.push_back(0);
rep(i, n) {
if (c == s[i]) {
count++;
} else {
if (c == '0')
so.push_back(count);
else
si.push_back(count);
count = 1;
c = s[i];
}
}
if (c == '0') {
so.push_back(count);
si.push_back(0);
} else
si.push_back(count);
int ss = so.size();
if (ss <= k) {
cout << n;
} else {
int sum = 0;
rep(i, k) sum += si[i] + so[i];
sum += si[k];
int ans = sum;
for (int i = k; i < ss; i++) {
sum += si[i] + so[i] - (si[i - k] + so[i - k]);
ans = max(ans, sum);
}
cout << ans;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int n, k, count = 0;
string s;
vector<int> si, so;
cin >> n >> k >> s;
char c = s[0];
if (c == '0')
si.push_back(0);
rep(i, n) {
if (c == s[i]) {
count++;
} else {
if (c == '0')
so.push_back(count);
else
si.push_back(count);
count = 1;
c = s[i];
}
}
if (c == '0') {
so.push_back(count);
si.push_back(0);
} else
si.push_back(count);
int ss = so.size();
if (ss <= k) {
cout << n;
} else {
int sum = 0;
rep(i, k) sum += si[i] + so[i];
sum += si[k];
int ans = sum;
for (int i = k; i < ss; i++) {
sum += si[i + 1] + so[i] - (si[i - k] + so[i - k]);
ans = max(ans, sum);
}
cout << ans;
}
return 0;
}
| [
"assignment.change"
] | 885,275 | 885,276 | u983711104 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int n, k, count = 0;
string s;
vector<int> si, so;
cin >> n >> k >> s;
char c = s[0];
if (c == '0')
si.push_back(0);
rep(i, n) {
if (c == s[i]) {
count++;
} else {
if (c == '0')
so.push_back(count);
else
si.push_back(count);
count = 1;
c = s[i];
}
}
if (c == '0') {
so.push_back(count);
si.push_back(0);
} else
si.push_back(count);
int ss = so.size();
if (ss <= k) {
cout << n;
} else {
int sum = 0;
rep(i, k) sum += si[i] + so[i];
sum += si[k];
int ans = sum;
for (int i = k; i < k; i++) {
sum += si[i] + so[i] - (si[i - k] + so[i - k]);
ans = max(ans, sum);
}
cout << ans;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int n, k, count = 0;
string s;
vector<int> si, so;
cin >> n >> k >> s;
char c = s[0];
if (c == '0')
si.push_back(0);
rep(i, n) {
if (c == s[i]) {
count++;
} else {
if (c == '0')
so.push_back(count);
else
si.push_back(count);
count = 1;
c = s[i];
}
}
if (c == '0') {
so.push_back(count);
si.push_back(0);
} else
si.push_back(count);
int ss = so.size();
if (ss <= k) {
cout << n;
} else {
int sum = 0;
rep(i, k) sum += si[i] + so[i];
sum += si[k];
int ans = sum;
for (int i = k; i < ss; i++) {
sum += si[i + 1] + so[i] - (si[i - k] + so[i - k]);
ans = max(ans, sum);
}
cout << ans;
}
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.change"
] | 885,277 | 885,276 | u983711104 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
s += '?';
int a[100000] = {0}, b[100000] = {0};
int j = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '0')
b[j]++;
else
a[j]++;
if (s[i] == '0' && s[i + 1] == '1')
j++;
}
if (k > j)
cout << n << endl;
else {
int sum = a[k];
for (int i = 0; i < k; i++) {
sum += a[i];
sum += b[i];
}
int l = 0, ans = sum;
for (int i = k; i < j; i++) {
sum -= a[l];
sum -= b[l];
l++;
sum += a[i + 1];
sum += b[i];
ans = max(ans, sum);
}
cout << ans << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
s += '?';
int a[100000] = {0}, b[100000] = {0};
int j = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '0')
b[j]++;
else
a[j]++;
if (s[i] == '0' && s[i + 1] == '1')
j++;
}
if (k > j)
cout << n << endl;
else {
int sum = a[k];
for (int i = 0; i < k; i++) {
sum += a[i];
sum += b[i];
}
int l = 0, ans = sum;
for (int i = k; i <= j; i++) {
sum -= a[l];
sum -= b[l];
l++;
sum += a[i + 1];
sum += b[i];
ans = max(ans, sum);
}
cout << ans << endl;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 885,278 | 885,279 | u294721290 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Pl = pair<ll, ll>;
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define REPD(i, n) for (ll i = (ll)n - 1; i >= 0; i--)
#define ALL(x) (x).begin(), (x).end()
#define FILLl(n, first_dimension_size, value) \
fill((ll *)n, (ll *)(n + first_dimension_size), value)
#define FILL(n, first_dimension_size, value) \
fill((int *)n, (int *)(n + first_dimension_size), value)
#define INF (1 << 29)
#define MOD 1000000007
// int dx[4] = {1,0,0,-1};
// int dy[4] = {0,1,-1,0};
int main() {
int n, k;
string s;
cin >> n >> k >> s;
vector<ll> zero, one;
zero.push_back(0);
one.push_back(0);
int old = 0;
s += '9';
for (int i = 0; i < n; i++) {
if (s[i] != s[i + 1]) {
if (s[i] == '0') {
zero.push_back(i - old + 1);
old = i + 1;
} else {
one.push_back(i - old + 1);
old = i + 1;
}
}
}
REP(i, zero.size()) if (i) zero[i] += zero[i - 1];
REP(i, one.size()) if (i) one[i] += one[i - 1];
ll res = 0;
if (s[0] == '0') {
for (int i = 0; i < zero.size(); i++) {
res = max(res, zero[min(i + k, (int)zero.size() - 1)] - zero[i] +
one[min(i + k + 1, (int)one.size() - 1)] -
one[max(0, i - 1)]);
}
} else {
for (int i = 0; i < zero.size(); i++) {
res = max(res, zero[min(i + k, (int)zero.size() - 1)] - zero[i] +
one[min(i + k + 1, (int)one.size() - 1)] -
one[min(i, (int)one.size())]);
}
}
cout << res << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Pl = pair<ll, ll>;
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define REPD(i, n) for (ll i = (ll)n - 1; i >= 0; i--)
#define ALL(x) (x).begin(), (x).end()
#define FILLl(n, first_dimension_size, value) \
fill((ll *)n, (ll *)(n + first_dimension_size), value)
#define FILL(n, first_dimension_size, value) \
fill((int *)n, (int *)(n + first_dimension_size), value)
#define INF (1 << 29)
#define MOD 1000000007
// int dx[4] = {1,0,0,-1};
// int dy[4] = {0,1,-1,0};
int main() {
int n, k;
string s;
cin >> n >> k >> s;
vector<ll> zero, one;
zero.push_back(0);
one.push_back(0);
int old = 0;
s += '9';
for (int i = 0; i < n; i++) {
if (s[i] != s[i + 1]) {
if (s[i] == '0') {
zero.push_back(i - old + 1);
old = i + 1;
} else {
one.push_back(i - old + 1);
old = i + 1;
}
}
}
REP(i, zero.size()) if (i) zero[i] += zero[i - 1];
REP(i, one.size()) if (i) one[i] += one[i - 1];
ll res = 0;
if (s[0] == '0') {
for (int i = 0; i < zero.size(); i++) {
res = max(res, zero[min(i + k, (int)zero.size() - 1)] - zero[i] +
one[min(i + k, (int)one.size() - 1)] -
one[max(0, i - 1)]);
}
} else {
for (int i = 0; i < zero.size(); i++) {
res = max(res, zero[min(i + k, (int)zero.size() - 1)] - zero[i] +
one[min(i + k + 1, (int)one.size() - 1)] -
one[min(i, (int)one.size())]);
}
}
cout << res << endl;
return 0;
}
| [
"call.arguments.change"
] | 885,280 | 885,281 | u204536668 | cpp |
p03074 | /* #region Head */
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll, ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vc<vc<T>>;
using vll = vc<ll>;
using vvll = vvc<ll>;
using vld = vc<ld>;
using vvld = vvc<ld>;
using vs = vc<string>;
using vvs = vvc<string>;
template <class T, class U> using um = unordered_map<T, U>;
template <class T> using pq = priority_queue<T>;
template <class T> using pqa = priority_queue<T, vc<T>, greater<T>>;
#define REP(i, m, n) for (ll i = (m), i##_len = (ll)(n); i < i##_len; ++(i))
#define REPM(i, m, n) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; ++(i))
#define REPR(i, m, n) for (ll i = (m), i##_min = (ll)(n); i >= i##_min; --(i))
#define REPD(i, m, n, d) \
for (ll i = (m), i##_len = (ll)(n); i < i##_len; i += (d))
#define REPMD(i, m, n, d) \
for (ll i = (m), i##_max = (ll)(n); i <= i##_max; i += (d))
#define REPI(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define ALL(x) begin(x), end(x)
#define SIZE(x) ((ll)(x).size())
#define PERM(c) \
sort(ALL(c)); \
for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))
#define UNIQ(v) v.erase(unique(ALL(v)), v.end());
#define endl '\n'
#define sqrt sqrtl
constexpr ll INF = 1'010'000'000'000'000'017LL;
constexpr ll MOD = 1'000'000'007LL; // 1e9 + 7
constexpr ld EPS = 1e-12;
constexpr ld PI = 3.14159265358979323846;
// vector 入力
template <typename T> istream &operator>>(istream &is, vc<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
// vector 出力 (for dump)
template <typename T> ostream &operator<<(ostream &os, vc<T> &vec) {
ll len = SIZE(vec);
os << "{";
for (int i = 0; i < len; i++)
os << vec[i] << (i == len - 1 ? "" : ", ");
os << "}";
return os;
}
// vector 出力 (inline)
template <typename T> ostream &operator>>(ostream &os, vc<T> &vec) {
ll len = SIZE(vec);
for (int i = 0; i < len; i++)
os << vec[i] << (i == len - 1 ? "\n" : " ");
return os;
}
// pair 入力
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &pair_var) {
is >> pair_var.first >> pair_var.second;
return is;
}
// pair 出力
template <typename T, typename U>
ostream &operator<<(ostream &os, pair<T, U> &pair_var) {
os << "(" << pair_var.first << ", " << pair_var.second << ")";
return os;
}
// map 出力
template <typename T, typename U>
ostream &operator<<(ostream &os, map<T, U> &map_var) {
os << "{";
REPI(itr, map_var) {
os << *itr;
itr++;
if (itr != map_var.end())
os << ", ";
itr--;
}
os << "}";
return os;
}
// um 出力
template <typename T, typename U>
ostream &operator<<(ostream &os, um<T, U> &map_var) {
os << "{";
REPI(itr, map_var) {
os << *itr;
auto itrcp = itr;
itrcp++;
if (itrcp != map_var.end())
os << ", ";
}
os << "}";
return os;
}
// set 出力
template <typename T> ostream &operator<<(ostream &os, set<T> &set_var) {
os << "{";
REPI(itr, set_var) {
os << *itr;
itr++;
if (itr != set_var.end())
os << ", ";
itr--;
}
os << "}";
return os;
}
// dump
#define DUMPOUT cerr
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&...tail) {
DUMPOUT << head;
if (sizeof...(Tail) > 0) {
DUMPOUT << ", ";
}
dump_func(move(tail)...);
}
// chmax (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>>
bool chmax(T &xmax, const U &x, Comp comp = {}) {
if (comp(xmax, x)) {
xmax = x;
return true;
}
return false;
}
// chmin (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>>
bool chmin(T &xmin, const U &x, Comp comp = {}) {
if (comp(x, xmin)) {
xmin = x;
return true;
}
return false;
}
// ローカル用
#define DEBUG_
#ifdef DEBUG_
#define DEB
#define dump(...) \
DUMPOUT << " " << string(#__VA_ARGS__) << ": " \
<< "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl \
<< " ", \
dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif
struct AtCoderInitialize {
static constexpr int IOS_PREC = 15;
static constexpr bool AUTOFLUSH = false;
AtCoderInitialize() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
cout << fixed << setprecision(IOS_PREC);
if (AUTOFLUSH)
cout << unitbuf;
}
} ATCODER_INITIALIZE;
string yes = "Yes", no = "No";
// string yes = "YES", no = "NO";
/* #endregion */
/**
Problem
*/
void solve() {
ll n, k;
cin >> n >> k;
string s;
cin >> s;
char chokuritsu = '0', sakadachi = '1';
// k 回の指示 → 2k+1 個の区間 (両端が1) or 2k 個の区間 (文字列の端＋1が端点)
// の長さの最大値が答え？
vll spans;
{
char prev = s[0];
ll len = 1;
REP(i, 1, n) {
if (s[i] == prev)
len++;
else {
if (prev == sakadachi)
spans.push_back(len);
else
spans.push_back(-len);
len = 1;
prev = s[i];
}
}
if (prev == sakadachi)
spans.push_back(len);
else
spans.push_back(-len);
}
// dump(spans);
ll spancnt = 0;
ll num = 0;
ll ret = 0;
REP(i, 0, SIZE(spans)) {
spancnt++;
num += abs(spans[i]);
if (spancnt <= 2 * k)
chmax(ret, num);
else if (spancnt == 2 * k + 1) {
if (spans[i] > 0) // 右端が逆立ち区間
{
chmax(ret, num);
} else // 右端が直立区間
{
spancnt--;
num -= abs(spans[i - (2 * k + 1)]);
chmax(ret, num);
}
} else // spancnt > 2 * k + 1
{
spancnt--;
num -= abs(spans[i - (2 * k + 1)]);
if (spans[i] > 0) // 右端が逆立ち区間
{
chmax(ret, num);
} else // 右端が直立区間
{
spancnt--;
num -= abs(spans[i - (2 * k + 1) + 1]);
chmax(ret, num);
}
}
}
cout << ret << endl;
}
/**
* エントリポイント．
* @return 0.
*/
int main() {
solve();
return 0;
}
| /* #region Head */
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll, ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vc<vc<T>>;
using vll = vc<ll>;
using vvll = vvc<ll>;
using vld = vc<ld>;
using vvld = vvc<ld>;
using vs = vc<string>;
using vvs = vvc<string>;
template <class T, class U> using um = unordered_map<T, U>;
template <class T> using pq = priority_queue<T>;
template <class T> using pqa = priority_queue<T, vc<T>, greater<T>>;
#define REP(i, m, n) for (ll i = (m), i##_len = (ll)(n); i < i##_len; ++(i))
#define REPM(i, m, n) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; ++(i))
#define REPR(i, m, n) for (ll i = (m), i##_min = (ll)(n); i >= i##_min; --(i))
#define REPD(i, m, n, d) \
for (ll i = (m), i##_len = (ll)(n); i < i##_len; i += (d))
#define REPMD(i, m, n, d) \
for (ll i = (m), i##_max = (ll)(n); i <= i##_max; i += (d))
#define REPI(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define ALL(x) begin(x), end(x)
#define SIZE(x) ((ll)(x).size())
#define PERM(c) \
sort(ALL(c)); \
for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))
#define UNIQ(v) v.erase(unique(ALL(v)), v.end());
#define endl '\n'
#define sqrt sqrtl
constexpr ll INF = 1'010'000'000'000'000'017LL;
constexpr ll MOD = 1'000'000'007LL; // 1e9 + 7
constexpr ld EPS = 1e-12;
constexpr ld PI = 3.14159265358979323846;
// vector 入力
template <typename T> istream &operator>>(istream &is, vc<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
// vector 出力 (for dump)
template <typename T> ostream &operator<<(ostream &os, vc<T> &vec) {
ll len = SIZE(vec);
os << "{";
for (int i = 0; i < len; i++)
os << vec[i] << (i == len - 1 ? "" : ", ");
os << "}";
return os;
}
// vector 出力 (inline)
template <typename T> ostream &operator>>(ostream &os, vc<T> &vec) {
ll len = SIZE(vec);
for (int i = 0; i < len; i++)
os << vec[i] << (i == len - 1 ? "\n" : " ");
return os;
}
// pair 入力
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &pair_var) {
is >> pair_var.first >> pair_var.second;
return is;
}
// pair 出力
template <typename T, typename U>
ostream &operator<<(ostream &os, pair<T, U> &pair_var) {
os << "(" << pair_var.first << ", " << pair_var.second << ")";
return os;
}
// map 出力
template <typename T, typename U>
ostream &operator<<(ostream &os, map<T, U> &map_var) {
os << "{";
REPI(itr, map_var) {
os << *itr;
itr++;
if (itr != map_var.end())
os << ", ";
itr--;
}
os << "}";
return os;
}
// um 出力
template <typename T, typename U>
ostream &operator<<(ostream &os, um<T, U> &map_var) {
os << "{";
REPI(itr, map_var) {
os << *itr;
auto itrcp = itr;
itrcp++;
if (itrcp != map_var.end())
os << ", ";
}
os << "}";
return os;
}
// set 出力
template <typename T> ostream &operator<<(ostream &os, set<T> &set_var) {
os << "{";
REPI(itr, set_var) {
os << *itr;
itr++;
if (itr != set_var.end())
os << ", ";
itr--;
}
os << "}";
return os;
}
// dump
#define DUMPOUT cerr
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&...tail) {
DUMPOUT << head;
if (sizeof...(Tail) > 0) {
DUMPOUT << ", ";
}
dump_func(move(tail)...);
}
// chmax (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>>
bool chmax(T &xmax, const U &x, Comp comp = {}) {
if (comp(xmax, x)) {
xmax = x;
return true;
}
return false;
}
// chmin (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>>
bool chmin(T &xmin, const U &x, Comp comp = {}) {
if (comp(x, xmin)) {
xmin = x;
return true;
}
return false;
}
// ローカル用
#define DEBUG_
#ifdef DEBUG_
#define DEB
#define dump(...) \
DUMPOUT << " " << string(#__VA_ARGS__) << ": " \
<< "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl \
<< " ", \
dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif
struct AtCoderInitialize {
static constexpr int IOS_PREC = 15;
static constexpr bool AUTOFLUSH = false;
AtCoderInitialize() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
cout << fixed << setprecision(IOS_PREC);
if (AUTOFLUSH)
cout << unitbuf;
}
} ATCODER_INITIALIZE;
string yes = "Yes", no = "No";
// string yes = "YES", no = "NO";
/* #endregion */
/**
Problem
*/
void solve() {
ll n, k;
cin >> n >> k;
string s;
cin >> s;
char chokuritsu = '0', sakadachi = '1';
// k 回の指示 → 2k+1 個の区間 (両端が1) or 2k 個の区間 (文字列の端＋1が端点)
// の長さの最大値が答え？
vll spans;
{
char prev = s[0];
ll len = 1;
REP(i, 1, n) {
if (s[i] == prev)
len++;
else {
if (prev == sakadachi)
spans.push_back(len);
else
spans.push_back(-len);
len = 1;
prev = s[i];
}
}
if (prev == sakadachi)
spans.push_back(len);
else
spans.push_back(-len);
}
// dump(spans);
ll spancnt = 0;
ll num = 0;
ll ret = 0;
REP(i, 0, SIZE(spans)) {
spancnt++;
num += abs(spans[i]);
// dump(i, spancnt, num, 2 * k + 1);
if (spancnt <= 2 * k)
chmax(ret, num);
else if (spancnt == 2 * k + 1) {
if (spans[i] > 0) // 右端が逆立ち区間
{
chmax(ret, num);
} else // 右端が直立区間
{
spancnt--;
num -= abs(spans[i - (2 * k)]);
chmax(ret, num);
}
} else // spancnt > 2 * k + 1
{
spancnt--;
// dump(i - (2 * k + 1));
num -= abs(spans[i - (2 * k + 1)]);
if (spans[i] > 0) // 右端が逆立ち区間
{
chmax(ret, num);
} else // 右端が直立区間
{
spancnt--;
num -= abs(spans[i - (2 * k + 1) + 1]);
chmax(ret, num);
}
}
}
cout << ret << endl;
}
/**
* エントリポイント．
* @return 0.
*/
int main() {
solve();
return 0;
}
| [] | 885,286 | 885,287 | u581262359 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll, ll> pll;
const ll mod = 1e9 + 7;
const ll inf = 1e18;
vector<pair<char, ll>> rle(string s) {
vector<pair<char, ll>> res;
char temp = s[0];
ll count = 0;
for (ll i = 0; i < s.size(); i++) {
if (temp == s[i]) {
count++;
} else {
res.push_back(pair<char, ll>(temp, count));
temp = s[i];
count = 1;
}
if (i == s.size() - 1) {
res.push_back(pair<char, ll>(temp, count));
}
}
return res;
}
int main() {
ll n, k;
string s;
cin >> n >> k >> s;
vector<pair<char, ll>> t = rle(s);
ll ans = 0;
ll temp = 0;
if (t[0].first == '0') {
for (ll i = 0; i < min((ll)t.size(), 2 * k); i++) {
temp += t[i].second;
}
ans = temp;
for (ll i = 2 * k; i < t.size(); i += 2) {
temp += t[i].second;
if (i + 1 < t.size())
temp += t[i + 1].second;
temp -= t[i - 2 * k].second;
if (i != 2 * k) {
temp += t[i - 2 * k - 1].second;
}
ans = max(ans, temp);
}
} else {
for (ll i = 0; i < min((ll)t.size(), 2 * k + 1); i++) {
temp += t[i].second;
}
ans = temp;
for (ll i = 2 * k + 1; i < t.size(); i += 2) {
temp += t[i].second;
if (i + 1 < t.size())
temp += t[i + 1].second;
temp -= t[i - 2 * k - 1].second;
temp -= t[i - 2 * k].second;
ans = max(ans, temp);
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll, ll> pll;
const ll mod = 1e9 + 7;
const ll inf = 1e18;
vector<pair<char, ll>> rle(string s) {
vector<pair<char, ll>> res;
char temp = s[0];
ll count = 0;
for (ll i = 0; i < s.size(); i++) {
if (temp == s[i]) {
count++;
} else {
res.push_back(pair<char, ll>(temp, count));
temp = s[i];
count = 1;
}
if (i == s.size() - 1) {
res.push_back(pair<char, ll>(temp, count));
}
}
return res;
}
int main() {
ll n, k;
string s;
cin >> n >> k >> s;
vector<pair<char, ll>> t = rle(s);
ll ans = 0;
ll temp = 0;
if (t[0].first == '0') {
for (ll i = 0; i < min((ll)t.size(), 2 * k); i++) {
temp += t[i].second;
}
ans = temp;
for (ll i = 2 * k; i < t.size(); i += 2) {
temp += t[i].second;
if (i + 1 < t.size())
temp += t[i + 1].second;
temp -= t[i - 2 * k].second;
if (i != 2 * k) {
temp -= t[i - 2 * k - 1].second;
}
ans = max(ans, temp);
}
} else {
for (ll i = 0; i < min((ll)t.size(), 2 * k + 1); i++) {
temp += t[i].second;
}
ans = temp;
for (ll i = 2 * k + 1; i < t.size(); i += 2) {
temp += t[i].second;
if (i + 1 < t.size())
temp += t[i + 1].second;
temp -= t[i - 2 * k - 1].second;
temp -= t[i - 2 * k].second;
ans = max(ans, temp);
}
}
cout << ans << endl;
} | [
"expression.operator.change"
] | 885,288 | 885,289 | u718758485 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const static ll INF = 1e9;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> V;
int cnt = 1;
for (int i = 1; i <= N; i++) {
if (i == N) {
if (S[i - 1] == '0')
cnt *= -1;
V.push_back(cnt);
break;
}
if (S[i - 1] == S[i])
cnt++;
else if (S[i - 1] != S[i]) {
if (S[i - 1] == '0')
cnt *= -1;
V.push_back(cnt);
cnt = 1;
}
}
cnt = 0;
int r = 0;
ll ans = 0;
ll MAX = 0;
for (int l = 0; l < V.size(); l++) {
while (cnt <= K && r < V.size()) {
if (V[r] < 0) {
if (cnt == K)
break;
else {
ans += V[r] * (-1);
cnt++;
}
} else
ans += V[r];
r++;
}
MAX = max(ans, MAX);
if (V[l] < 0) {
ans += V[l];
cnt--;
} else
ans -= V[l];
if (r == V.size() - 1)
break;
}
cout << MAX << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const static ll INF = 1e9;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> V;
int cnt = 1;
for (int i = 1; i <= N; i++) {
if (i == N) {
if (S[i - 1] == '0')
cnt *= -1;
V.push_back(cnt);
break;
}
if (S[i - 1] == S[i])
cnt++;
else if (S[i - 1] != S[i]) {
if (S[i - 1] == '0')
cnt *= -1;
V.push_back(cnt);
cnt = 1;
}
}
cnt = 0;
int r = 0;
ll ans = 0;
ll MAX = 0;
for (int l = 0; l < V.size(); l++) {
while (cnt <= K && r < V.size()) {
// cout << ans << endl;
if (V[r] < 0) {
if (cnt == K)
break;
else {
ans += V[r] * (-1);
cnt++;
}
} else
ans += V[r];
r++;
}
// cout << l << " " << r << " " << ans << endl;
MAX = max(ans, MAX);
if (V[l] < 0) {
ans += V[l];
cnt--;
} else
ans -= V[l];
if (r == V.size())
break;
}
cout << MAX << endl;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 885,290 | 885,291 | u521973174 | cpp |
p03074 | /*
* じょえチャンネル
* 高評価・チャンネル登録よろしくおねがいします！
* https://www.youtube.com/channel/UCRXsI3FL_kvaVL9zoolBfbQ
*/
#include <bits/stdc++.h>
#define f(i, n) for (int i = 0; i < (n); i++)
#define inf (int)(3e18)
#define int long long
#define mod (int)(1000000007)
#define intt long long
#define P pair<int, int>
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
using namespace std;
// Library
//モッドパウ
int modpow(int x, int y, int m = mod) {
int res = 1;
while (y) {
if (y % 2) {
res *= x;
res %= m;
}
x = x * x % mod;
y /= 2;
}
return res;
}
int mypow(int x, int y) {
int res = 1;
while (y) {
if (y % 2) {
res *= x;
}
x = x * x;
y /= 2;
}
return res;
}
// is the number (x) a prime number?
bool prime(int x) {
for (int i = 2; i * i <= x; i++) {
if (!(x % i)) {
return false;
}
}
return true;
}
// saidai-kouyakusuu
inline int gcd(int x, int y) {
if (!y) {
return x;
}
return gcd(y, x % y);
}
// number of keta
int keta(int x) {
int ans = 0;
while (x) {
x /= 10;
ans++;
}
return ans;
}
// sum of keta
int ketasum(int x) {
int ans = 0;
while (x) {
ans += x % 10;
x /= 10;
}
return ans;
}
inline int lcm(int x, int y) {
int ans = x / gcd(x, y) * y;
return ans;
}
int twobeki(int x) {
int ans = 0;
while (1) {
if (!(x & 1)) {
ans++;
x /= 2;
} else {
break;
}
}
return ans;
}
template <class T, class U> inline bool chmax(T &lhs, const U &rhs) {
if (lhs < rhs) {
lhs = rhs;
return 1;
}
return 0;
}
template <class T, class U> inline bool chmin(T &lhs, const U &rhs) {
if (lhs > rhs) {
lhs = rhs;
return 1;
}
return 0;
}
void Yes() { cout << "Yes" << endl; }
void No() { cout << "No" << endl; }
void YES() { cout << "YES" << endl; }
void NO() { cout << "NO" << endl; }
#define fin(i) scanf("%lld", &i)
#define fout(i) printf("%lld", i)
#define fendl printf("\n")
// Library-End
// SegTree
template <class T> class LazySegTree {
int n; // 葉の数
vector<T> data; // データを格納するvector
vector<T> lazy;
T def; // 初期値かつ単位元
function<T(T, T)> operation; // 区間クエリで使う処理
function<T(T, T)> update; // 点更新で使う処理
// 区間[a,b)の総和。ノードk=[l,r)に着目している。
T _query(int a, int b, int k, int l, int r) {
if (r <= a || b <= l)
return def; // 交差しない
if (a <= l && r <= b)
return data[k]; // a,l,r,bの順で完全に含まれる
else {
T c1 = _query(a, b, 2 * k + 1, l, (l + r) / 2); // 左の子
T c2 = _query(a, b, 2 * k + 2, (l + r) / 2, r); // 右の子
return operation(c1, c2);
}
}
public:
// _n:必要サイズ, _def:初期値かつ単位元, _operation:クエリ関数,
// _update:更新関数
LazySegTree(size_t _n, T _def, function<T(T, T)> _operation,
function<T(T, T)> _update)
: def(_def), operation(_operation), update(_update) {
n = 1;
while (n < _n) {
n *= 2;
}
data = vector<T>(2 * n - 1, def);
}
// 場所i(0-indexed)の値をxで更新
void change(int i, T x) {
i += n - 1;
data[i] = update(data[i], x);
while (i > 0) {
i = (i - 1) / 2;
data[i] = operation(data[i * 2 + 1], data[i * 2 + 2]);
}
}
void change(int i, int j, T x) {
i += n - 1;
data[i] = update(data[i], x);
while (i > 0) {
i = (i - 1) / 2;
data[i] = operation(data[i * 2 + 1], data[i * 2 + 2]);
}
}
// [a, b)の区間クエリを実行
T query(int a, int b) { return _query(a, b, 0, 0, n); }
// 添字でアクセス
T operator[](int i) { return data[i + n - 1]; }
};
#define R_MIN ([](long long a, long long b) { return min(a, b); })
#define R_MAX ([](long long a, long long b) { return max(a, b); })
#define R_SUM ([](long long a, long long b) { return a + b; })
#define NORMAL_UPDATE ([](long long a, long long b) { return b; })
#define ADD_UPDATE ([](long long a, long long b) { return a + b; })
#define MINUS_UPDATE ([](long long a, long long b) { return a - b; }
// int n,m,a[100004],ans;
// cin>>n;
// cin>>m;
// rep(i,n)fin(a[i]);
// cout<<ans<<endl;
string s;
int n, k, now, ans, sm;
vector<int> v;
int rui[100004];
signed main() {
cin >> n >> k;
cin >> s;
now = 1;
v.push_back(0);
REP(i, n - 1) {
if (s[i] != s[i - 1]) {
if (!(s[i] - '0')) {
sm++;
}
v.push_back(now);
now = 1;
} else {
now++;
}
}
if (!(s[n - 1] - '0')) {
sm++;
}
v.push_back(now);
chmin(k, sm);
REP(i, (int)v.size() - 1) { v[i] += v[i - 1]; }
if (!(s[0] - '0')) {
for (int i = 0; i < v.size(); i++) {
if (i & 1) {
chmax(ans, v[i] - v[max(0ll, i - k * 2)]);
} else {
chmax(ans, v[i] - v[max(0ll, i - k * 2 - 1)]);
}
}
} else {
for (int i = 0; i < v.size(); i++) {
if (i & 1) {
chmax(ans, v[i] - v[max(0ll, i - k * 2 - 1)]);
} else {
chmax(ans, v[i] - v[max(0ll, i - k * 2)]);
}
}
}
cout << ans << endl;
}
| /*
* じょえチャンネル
* 高評価・チャンネル登録よろしくおねがいします！
* https://www.youtube.com/channel/UCRXsI3FL_kvaVL9zoolBfbQ
*/
#include <bits/stdc++.h>
#define f(i, n) for (int i = 0; i < (n); i++)
#define inf (int)(3e18)
#define int long long
#define mod (int)(1000000007)
#define intt long long
#define P pair<int, int>
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
using namespace std;
// Library
//モッドパウ
int modpow(int x, int y, int m = mod) {
int res = 1;
while (y) {
if (y % 2) {
res *= x;
res %= m;
}
x = x * x % mod;
y /= 2;
}
return res;
}
int mypow(int x, int y) {
int res = 1;
while (y) {
if (y % 2) {
res *= x;
}
x = x * x;
y /= 2;
}
return res;
}
// is the number (x) a prime number?
bool prime(int x) {
for (int i = 2; i * i <= x; i++) {
if (!(x % i)) {
return false;
}
}
return true;
}
// saidai-kouyakusuu
inline int gcd(int x, int y) {
if (!y) {
return x;
}
return gcd(y, x % y);
}
// number of keta
int keta(int x) {
int ans = 0;
while (x) {
x /= 10;
ans++;
}
return ans;
}
// sum of keta
int ketasum(int x) {
int ans = 0;
while (x) {
ans += x % 10;
x /= 10;
}
return ans;
}
inline int lcm(int x, int y) {
int ans = x / gcd(x, y) * y;
return ans;
}
int twobeki(int x) {
int ans = 0;
while (1) {
if (!(x & 1)) {
ans++;
x /= 2;
} else {
break;
}
}
return ans;
}
template <class T, class U> inline bool chmax(T &lhs, const U &rhs) {
if (lhs < rhs) {
lhs = rhs;
return 1;
}
return 0;
}
template <class T, class U> inline bool chmin(T &lhs, const U &rhs) {
if (lhs > rhs) {
lhs = rhs;
return 1;
}
return 0;
}
void Yes() { cout << "Yes" << endl; }
void No() { cout << "No" << endl; }
void YES() { cout << "YES" << endl; }
void NO() { cout << "NO" << endl; }
#define fin(i) scanf("%lld", &i)
#define fout(i) printf("%lld", i)
#define fendl printf("\n")
// Library-End
// SegTree
template <class T> class LazySegTree {
int n; // 葉の数
vector<T> data; // データを格納するvector
vector<T> lazy;
T def; // 初期値かつ単位元
function<T(T, T)> operation; // 区間クエリで使う処理
function<T(T, T)> update; // 点更新で使う処理
// 区間[a,b)の総和。ノードk=[l,r)に着目している。
T _query(int a, int b, int k, int l, int r) {
if (r <= a || b <= l)
return def; // 交差しない
if (a <= l && r <= b)
return data[k]; // a,l,r,bの順で完全に含まれる
else {
T c1 = _query(a, b, 2 * k + 1, l, (l + r) / 2); // 左の子
T c2 = _query(a, b, 2 * k + 2, (l + r) / 2, r); // 右の子
return operation(c1, c2);
}
}
public:
// _n:必要サイズ, _def:初期値かつ単位元, _operation:クエリ関数,
// _update:更新関数
LazySegTree(size_t _n, T _def, function<T(T, T)> _operation,
function<T(T, T)> _update)
: def(_def), operation(_operation), update(_update) {
n = 1;
while (n < _n) {
n *= 2;
}
data = vector<T>(2 * n - 1, def);
}
// 場所i(0-indexed)の値をxで更新
void change(int i, T x) {
i += n - 1;
data[i] = update(data[i], x);
while (i > 0) {
i = (i - 1) / 2;
data[i] = operation(data[i * 2 + 1], data[i * 2 + 2]);
}
}
void change(int i, int j, T x) {
i += n - 1;
data[i] = update(data[i], x);
while (i > 0) {
i = (i - 1) / 2;
data[i] = operation(data[i * 2 + 1], data[i * 2 + 2]);
}
}
// [a, b)の区間クエリを実行
T query(int a, int b) { return _query(a, b, 0, 0, n); }
// 添字でアクセス
T operator[](int i) { return data[i + n - 1]; }
};
#define R_MIN ([](long long a, long long b) { return min(a, b); })
#define R_MAX ([](long long a, long long b) { return max(a, b); })
#define R_SUM ([](long long a, long long b) { return a + b; })
#define NORMAL_UPDATE ([](long long a, long long b) { return b; })
#define ADD_UPDATE ([](long long a, long long b) { return a + b; })
#define MINUS_UPDATE ([](long long a, long long b) { return a - b; }
// int n,m,a[100004],ans;
// cin>>n;
// cin>>m;
// rep(i,n)fin(a[i]);
// cout<<ans<<endl;
string s;
int n, k, now, ans, sm;
vector<int> v;
int rui[100004];
signed main() {
cin >> n >> k;
cin >> s;
now = 1;
v.push_back(0);
REP(i, n - 1) {
if (s[i] != s[i - 1]) {
if (!(s[i - 1] - '0')) {
sm++;
}
v.push_back(now);
now = 1;
} else {
now++;
}
}
if (!(s[n - 1] - '0')) {
sm++;
}
v.push_back(now);
chmin(k, sm);
REP(i, (int)v.size() - 1) { v[i] += v[i - 1]; }
if (!(s[0] - '0')) {
for (int i = 0; i < v.size(); i++) {
if (i & 1) {
chmax(ans, v[i] - v[max(0ll, i - k * 2)]);
} else {
chmax(ans, v[i] - v[max(0ll, i - k * 2 - 1)]);
}
}
} else {
for (int i = 0; i < v.size(); i++) {
if (i & 1) {
chmax(ans, v[i] - v[max(0ll, i - k * 2 - 1)]);
} else {
chmax(ans, v[i] - v[max(0ll, i - k * 2)]);
}
}
}
cout << ans << endl;
}
| [
"control_flow.branch.if.condition.change"
] | 885,299 | 885,300 | u943070796 | cpp |
p03074 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> a(n);
rep(i, n) a[i] = s[i] - '0';
if (n = 1) {
cout << 1 << endl;
return 0;
}
vector<pair<int, int>> b;
int cnt = 1;
rep(i, n - 1) {
if (a[i] != a[i + 1]) {
b.push_back(make_pair(a[i], cnt));
cnt = 1;
} else {
cnt++;
}
if (i == n - 2) {
if (a[i] != a[i + 1]) {
b.push_back(make_pair(a[i + 1], 1));
} else {
b.push_back(make_pair(a[i], cnt));
}
}
}
int ans = 0;
cnt = 0;
int d = 0;
queue<int> q;
rep(i, b.size()) {
cnt += b[i].second;
d += b[i].second;
if (!b[i].first) {
q.push(d);
d = 0;
}
if (q.size() > k) {
cnt -= q.front();
q.pop();
}
ans = max(ans, cnt);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> a(n);
rep(i, n) a[i] = s[i] - '0';
if (n == 1) {
cout << 1 << endl;
return 0;
}
vector<pair<int, int>> b;
int cnt = 1;
rep(i, n - 1) {
if (a[i] != a[i + 1]) {
b.push_back(make_pair(a[i], cnt));
cnt = 1;
} else {
cnt++;
}
if (i == n - 2) {
if (a[i] != a[i + 1]) {
b.push_back(make_pair(a[i + 1], 1));
} else {
b.push_back(make_pair(a[i], cnt));
}
}
}
int ans = 0;
cnt = 0;
int d = 0;
queue<int> q;
rep(i, b.size()) {
cnt += b[i].second;
d += b[i].second;
if (!b[i].first) {
q.push(d);
d = 0;
}
if (q.size() > k) {
cnt -= q.front();
q.pop();
}
ans = max(ans, cnt);
}
cout << ans << endl;
return 0;
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 885,305 | 885,306 | u131625544 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, k;
string s;
cin >> n >> k >> s;
vector<pair<ll, ll>> v;
bool f = false;
ll lef, rig;
for (int i = 0; i < n; i++) {
if (!f && s[i] == '0') {
f = 1;
lef = i;
}
if (f && s[i] == '1') {
f = 0;
rig = i - 1;
v.push_back(make_pair(lef, rig));
}
if (i == n - 1 && s[n - 1] == '0') {
rig = n - 1;
v.push_back(make_pair(lef, rig));
}
}
ll ans = 0;
if (v.size() <= k)
ans = n;
else {
ll le, ri;
for (int i = 0; i <= v.size() - k; i++) {
if (!i)
le = 0;
else
le = v[i - 1].second + 1;
if (i == v.size() - k)
ri = n - 1;
else
ri = v[i + 1].first - 1;
ans = max(ans, ri - le + 1);
}
}
cout << ans;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, k;
string s;
cin >> n >> k >> s;
vector<pair<ll, ll>> v;
bool f = false;
ll lef, rig;
for (int i = 0; i < n; i++) {
if (!f && s[i] == '0') {
f = 1;
lef = i;
}
if (f && s[i] == '1') {
f = 0;
rig = i - 1;
v.push_back(make_pair(lef, rig));
}
if (i == n - 1 && s[n - 1] == '0') {
rig = n - 1;
v.push_back(make_pair(lef, rig));
}
}
ll ans = 0;
if (v.size() <= k)
ans = n;
else {
ll le, ri;
for (int i = 0; i <= v.size() - k; i++) {
if (!i)
le = 0;
else
le = v[i - 1].second + 1;
if (i == v.size() - k)
ri = n - 1;
else
ri = v[i + k].first - 1;
ans = max(ans, ri - le + 1);
}
}
cout << ans;
return 0;
}
| [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 885,307 | 885,308 | u774202056 | cpp |
p03074 | #include <bits/stdc++.h>
#include <fstream>
#define inputtxt() \
std::ifstream in("input.txt"); \
std::cin.rdbuf(in.rdbuf())
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define foreach(e, v) for (auto e : v)
#define all(obj) (obj).begin(), (obj).end()
#define rall(obj) (obj).rbegin(), (obj).rend()
#define collect(arr, size) rep(i, size) cin >> arr[i];
int main() {
int n, k;
string s;
cin >> n >> k >> s;
// even->0 odd->1
vector<int> continuous;
continuous.push_back(0);
int num = 0;
bool now = 1;
rep(i, s.length()) {
if (s[i] == now + '0') {
num++;
} else {
continuous.push_back(continuous.back() + num);
num = 1;
now = !now;
}
}
continuous.push_back(continuous.back() + num);
int mx = 1;
for (int l = 0; l < continuous.size(); l++) {
int r = l + k * 2 + 1;
if (r >= continuous.size())
r = (int)continuous.size() - 1;
mx = max(mx, continuous[r] - continuous[l]);
}
cout << mx << endl;
return 0;
} | #include <bits/stdc++.h>
#include <fstream>
#define inputtxt() \
std::ifstream in("input.txt"); \
std::cin.rdbuf(in.rdbuf())
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define foreach(e, v) for (auto e : v)
#define all(obj) (obj).begin(), (obj).end()
#define rall(obj) (obj).rbegin(), (obj).rend()
#define collect(arr, size) rep(i, size) cin >> arr[i];
int main() {
int n, k;
string s;
cin >> n >> k >> s;
// even->0 odd->1
vector<int> continuous;
continuous.push_back(0);
int num = 0;
bool now = 1;
rep(i, s.length()) {
if (s[i] == now + '0') {
num++;
} else {
continuous.push_back(continuous.back() + num);
num = 1;
now = !now;
}
}
// rep(i,continuous.size()) cout << continuous[i] << ",";
continuous.push_back(continuous.back() + num);
int mx = 1;
for (int l = 0; l < continuous.size(); l += 2) {
int r = l + k * 2 + 1;
if (r >= continuous.size())
r = (int)continuous.size() - 1;
mx = max(mx, continuous[r] - continuous[l]);
}
cout << mx << endl;
return 0;
} | [] | 885,320 | 885,321 | u979852867 | cpp |
p03074 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define pb push_back
#define eb emplace_back
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll INF = 1LL << 50;
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;
}
using namespace std;
void solve() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> v;
int cnt;
int cur = 0;
int judge = 0;
if (s[0] == '0')
v.pb(0);
while (cur < n) {
cnt = cur;
while (cnt < n && s[cur] == s[cnt]) {
++cnt;
}
v.pb(cnt - cur); //切り替わるところを順番に格納
cur = cnt;
}
if (s.back() != '1')
v.pb(0); //最初と最後を1の数で合わせる
int maxv = 0;
vector<int> sum(
n + 1,
0); //そのまま数えると間に合わないため累積和、二分探索、しゃくとり法のいずれかを使う
rep(i, v.size()) sum[i + 1] = sum[i] + v[i];
for (int left = 0; left < v.size();
left +=
2) { //始まりは必ず1から(端に0があるパターンも番兵によって無くしたから)
int right = left + 2 * k + 1;
if (right >= sum.size())
right = sum.size() - 1;
maxv = max(maxv, sum[right] - sum[left]);
}
cout << maxv << "\n";
}
signed main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
solve();
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define pb push_back
#define eb emplace_back
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll INF = 1LL << 50;
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;
}
using namespace std;
void solve() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> v;
int cnt;
int cur = 0;
int judge = 0;
if (s[0] == '0')
v.pb(0);
while (cur < n) {
cnt = cur;
while (cnt < n && s[cur] == s[cnt]) {
++cnt;
}
v.pb(cnt - cur); //切り替わるところを順番に格納
cur = cnt;
}
if (s.back() != '1')
v.pb(0); //最初と最後を1の数で合わせる
int maxv = 0;
vector<int> sum(
v.size() + 1,
0); //そのまま数えると間に合わないため累積和、二分探索、しゃくとり法のいずれかを使う
rep(i, v.size()) sum[i + 1] = sum[i] + v[i];
for (int left = 0; left < v.size();
left +=
2) { //始まりは必ず1から(端に0があるパターンも番兵によって無くしたから)
int right = left + 2 * k + 1;
if (right >= sum.size())
right = sum.size() - 1;
maxv = max(maxv, sum[right] - sum[left]);
}
cout << maxv << "\n";
}
signed main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
solve();
return 0;
} | [
"call.arguments.change",
"expression.operation.binary.change",
"call.add"
] | 885,322 | 885,323 | u698883164 | cpp |
p03074 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<int, int> P;
const int inf = 1 << 21;
const ll INF = 1LL << 60;
const ll mod = 1e9 + 7;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// abc124d
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> ans;
int pre = 1;
if (s[0] == '0') {
ans.push_back(0);
ans.push_back(1);
pre = 0;
} else {
ans.push_back(1);
}
rep(i, n) {
if (i == 0)
continue;
if (pre == s[i] - '0') {
ans[ans.size() - 1] = ans[ans.size() - 1] + 1;
} else {
ans.push_back(1);
pre = s[i] - '0';
}
}
if (pre == 0)
ans.push_back(0);
rep(i, ans.size() - 1) ans[i + 1] = ans[i] + ans[i + 1];
int ansm = 0;
if (ans.size() == 1) {
cout << n << endl;
return 0;
}
if (2 * k + 1 > n) {
cout << n << endl;
return 0;
} else {
rep(i, n) {
int l = i, r = 2 * k + i;
if (i % 2 == 1)
continue;
if (r >= ans.size())
break;
if (l == 0) {
chmax(ansm, ans[r]);
} else {
chmax(ansm, ans[r] - ans[l - 1]);
}
}
}
cout << ansm << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<int, int> P;
const int inf = 1 << 21;
const ll INF = 1LL << 60;
const ll mod = 1e9 + 7;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// abc124d
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> ans;
int pre = 1;
if (s[0] == '0') {
ans.push_back(0);
ans.push_back(1);
pre = 0;
} else {
ans.push_back(1);
}
rep(i, n) {
if (i == 0)
continue;
if (pre == s[i] - '0') {
ans[ans.size() - 1] = ans[ans.size() - 1] + 1;
} else {
ans.push_back(1);
pre = s[i] - '0';
}
}
if (pre == 0)
ans.push_back(0);
rep(i, ans.size() - 1) ans[i + 1] = ans[i] + ans[i + 1];
int ansm = 0;
if (ans.size() == 1) {
cout << n << endl;
return 0;
}
if (2 * k + 1 > ans.size()) {
cout << n << endl;
return 0;
} else {
rep(i, n) {
int l = i, r = 2 * k + i;
if (i % 2 == 1)
continue;
if (r >= ans.size())
break;
if (l == 0) {
chmax(ansm, ans[r]);
} else {
chmax(ansm, ans[r] - ans[l - 1]);
}
}
}
cout << ansm << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change",
"call.add"
] | 885,328 | 885,329 | u770009793 | cpp |
p03074 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<int, int> P;
const int inf = 1 << 21;
const ll INF = 1LL << 60;
const ll mod = 1e9 + 7;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// abc124d
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> ans;
int pre = 1;
if (s[0] == '0') {
ans.push_back(0);
ans.push_back(1);
pre = 0;
} else {
ans.push_back(1);
}
rep(i, n) {
if (i == 0)
continue;
if (pre == s[i] - '0') {
ans[ans.size() - 1] = ans[ans.size() - 1] + 1;
} else {
ans.push_back(1);
pre = s[i] - '0';
}
}
if (pre == 0)
ans.push_back(0);
rep(i, ans.size() - 1) ans[i + 1] = ans[i] + ans[i + 1];
int ansm = 0;
if (ans.size() == 1) {
cout << n << endl;
return 0;
}
if (2 * k + 1 >= n) {
cout << n << endl;
return 0;
} else {
rep(i, n) {
int l = i, r = 2 * k + i;
if (i % 2 == 1)
continue;
if (r >= ans.size())
break;
if (l == 0) {
chmax(ansm, ans[r]);
} else {
chmax(ansm, ans[r] - ans[l - 1]);
}
}
}
cout << ansm << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<int, int> P;
const int inf = 1 << 21;
const ll INF = 1LL << 60;
const ll mod = 1e9 + 7;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// abc124d
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> ans;
int pre = 1;
if (s[0] == '0') {
ans.push_back(0);
ans.push_back(1);
pre = 0;
} else {
ans.push_back(1);
}
rep(i, n) {
if (i == 0)
continue;
if (pre == s[i] - '0') {
ans[ans.size() - 1] = ans[ans.size() - 1] + 1;
} else {
ans.push_back(1);
pre = s[i] - '0';
}
}
if (pre == 0)
ans.push_back(0);
rep(i, ans.size() - 1) ans[i + 1] = ans[i] + ans[i + 1];
int ansm = 0;
if (ans.size() == 1) {
cout << n << endl;
return 0;
}
if (2 * k + 1 > ans.size()) {
cout << n << endl;
return 0;
} else {
rep(i, n) {
int l = i, r = 2 * k + i;
if (i % 2 == 1)
continue;
if (r >= ans.size())
break;
if (l == 0) {
chmax(ansm, ans[r]);
} else {
chmax(ansm, ans[r] - ans[l - 1]);
}
}
}
cout << ansm << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change",
"call.add"
] | 885,330 | 885,329 | u770009793 | cpp |
p03074 | #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を切り替える時の計算
cnt = 1; //新しいのをカウントし始める
}
}
if (cnt != 0)
Nums.push_back(cnt);
// 1-0-1-0-1-0-1 って漢字の配列がほしい
// 1-0-1-0-1-0みたいに0で終わってたら，適当に1つ足す
if (Nums.size() % 2 == 0)
Nums.push_back(0);
int Add = 2 * K + 1;
int ans = 0;
int left = 0;
int right = 0;
int tmp = 0; // [left, right) のsum
for (int i = 0; i < Nums.size(); i += 2) {
int tmp = 0;
int nextleft = i;
int nextright = min((int)Nums.size(), i + Add);
// 左端を移動する
while (nextleft > left) {
tmp -= Nums[left];
left++;
}
//右端を移動する
while (nextright > right) {
tmp += Nums[right];
right++;
}
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を切り替える時の計算
cnt = 1; //新しいのをカウントし始める
}
}
if (cnt != 0)
Nums.push_back(cnt);
// 1-0-1-0-1-0-1 って漢字の配列がほしい
// 1-0-1-0-1-0みたいに0で終わってたら，適当に1つ足す
if (Nums.size() % 2 == 0)
Nums.push_back(0);
int Add = 2 * K + 1;
int ans = 0;
int left = 0;
int right = 0;
int tmp = 0; // [left, right) のsum
for (int i = 0; i < Nums.size(); i += 2) {
int nextleft = i;
int nextright = min((int)Nums.size(), i + Add);
// 左端を移動する
while (nextleft > left) {
tmp -= Nums[left];
left++;
}
//右端を移動する
while (nextright > right) {
tmp += Nums[right];
right++;
}
ans = max(tmp, ans);
}
cout << ans << endl;
} | [
"variable_declaration.remove"
] | 885,341 | 885,342 | u151505386 | cpp |
p03074 | // g++ -std=c++14 test.cpp -o test.out
#include <algorithm>
#include <cassert>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <stdlib.h>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
int N, K;
string S;
int ans = 0;
void solve() {
vector<int>
segment; // segmentには 1の数、0の数、1の数、0の数......1の数 と記録する
if (S[0] == '0')
segment.push_back(0);
int left_index = 0;
for (int right_index = 0; right_index < N;) {
while (right_index < N) {
if (S[left_index] == S[right_index])
right_index++;
else
break;
}
segment.push_back(right_index - left_index);
left_index = right_index;
}
if (S[N - 1] == '0')
segment.push_back(0);
// for(int i=0;i<segment.size();i++){
// cout << segment[i] << " ";
// }
// cout << endl;
int sumof1 = segment[0];
for (int i = 1; i <= K; i++) {
if (2 * i - 1 >= N) {
ans = sumof1;
return;
}
sumof1 += (segment[2 * i - 1] + segment[2 * i]);
}
ans = sumof1;
for (int i = 2 * K + 1; i < segment.size(); i += 2) {
sumof1 += (segment[i] + segment[i + 1]);
sumof1 -= (segment[i - (2 * K + 1)] + segment[i + 1 - (2 * K + 1)]);
if (ans < sumof1)
ans = sumof1;
}
}
int main() {
cin >> N >> K;
cin >> S;
solve();
cout << ans << endl;
return 0;
}
| // g++ -std=c++14 test.cpp -o test.out
#include <algorithm>
#include <cassert>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <stdlib.h>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
int N, K;
string S;
int ans = 0;
void solve() {
vector<int>
segment; // segmentには 1の数、0の数、1の数、0の数......1の数 と記録する
if (S[0] == '0')
segment.push_back(0);
int left_index = 0;
for (int right_index = 0; right_index < N;) {
while (right_index < N) {
if (S[left_index] == S[right_index])
right_index++;
else
break;
}
segment.push_back(right_index - left_index);
left_index = right_index;
}
if (S[N - 1] == '0')
segment.push_back(0);
// for(int i=0;i<segment.size();i++){
// cout << segment[i] << " ";
// }
// cout << endl;
int sumof1 = segment[0];
for (int i = 1; i <= K; i++) {
if (2 * i - 1 >= segment.size()) {
ans = sumof1;
return;
}
sumof1 += (segment[2 * i - 1] + segment[2 * i]);
}
ans = sumof1;
for (int i = 2 * K + 1; i < segment.size(); i += 2) {
sumof1 += (segment[i] + segment[i + 1]);
sumof1 -= (segment[i - (2 * K + 1)] + segment[i + 1 - (2 * K + 1)]);
if (ans < sumof1)
ans = sumof1;
}
}
int main() {
cin >> N >> K;
cin >> S;
solve();
cout << ans << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add"
] | 885,358 | 885,359 | u302000346 | cpp |
p03074 | /*input
1 1
1
*/
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<long long, null_type, less_equal<long long>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
#pragma GCC optimize("unroll-loops,no-stack-protector")
// order_of_key #of elements less than x
// find_by_order kth element
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
#define f first
#define s second
#define pb push_back
#define REP(i, n) for (int i = 0; i < n; i++)
#define REP1(i, n) for (int i = 1; i <= n; i++)
#define FILL(n, x) memset(n, x, sizeof(n))
#define ALL(_a) _a.begin(), _a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) \
(sort(c.begin(), c.end()), \
c.resize(distance(c.begin(), unique(c.begin(), c.end()))))
const ll INF64 = 4e18;
const int INF = 0x3f3f3f3f;
const ll MOD = 1e9 + 7;
const ld PI = acos(-1);
const ld eps = 1e-9;
#define lowb(x) x &(-x)
#define MNTO(x, y) x = min(x, (__typeof__(x))y)
#define MXTO(x, y) x = max(x, (__typeof__(x))y)
ll sub(ll a, ll b) {
ll x = a - b;
while (x < 0)
x += MOD;
while (x > MOD)
x -= MOD;
return x;
}
ll mult(ll a, ll b) { return a * b % MOD; }
ll mypow(ll a, ll b) {
if (b <= 0)
return 1;
ll res = 1LL;
while (b) {
if (b & 1)
res = (res * a) % MOD;
a = (a * a) % MOD;
b >>= 1;
}
return res;
}
const int maxn = 5e5 + 5;
vector<int> pref;
int main() {
int n, k;
cin >> n >> k;
vector<pii> v;
k = 2 * k;
int cons = 0, cons2 = 0;
pref.pb(0);
REP(i, n) {
char a;
cin >> a;
if (a == '0') {
if (cons) {
v.pb({cons, 1});
pref.pb(pref.back() + cons);
}
cons = 0;
cons2++;
} else {
if (cons2) {
v.pb({cons2, 0});
pref.pb(pref.back() + cons2);
}
cons2 = 0;
cons++;
}
}
if (cons) {
v.pb({cons, 1});
pref.pb(pref.back() + cons);
}
if (cons2) {
v.pb({cons2, 0});
pref.pb(pref.back() + cons2);
}
int ans = 0;
REP(i, sz(v)) {
if (v[i].s) {
MXTO(ans, pref[min(i + k + 2, sz(pref) - 1)] - pref[i]);
} else {
MXTO(ans, pref[min(i + k + 1, sz(pref) - 1)] - pref[i]);
}
}
cout << ans;
} | /*input
1 1
1
*/
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<long long, null_type, less_equal<long long>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
#pragma GCC optimize("unroll-loops,no-stack-protector")
// order_of_key #of elements less than x
// find_by_order kth element
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
#define f first
#define s second
#define pb push_back
#define REP(i, n) for (int i = 0; i < n; i++)
#define REP1(i, n) for (int i = 1; i <= n; i++)
#define FILL(n, x) memset(n, x, sizeof(n))
#define ALL(_a) _a.begin(), _a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) \
(sort(c.begin(), c.end()), \
c.resize(distance(c.begin(), unique(c.begin(), c.end()))))
const ll INF64 = 4e18;
const int INF = 0x3f3f3f3f;
const ll MOD = 1e9 + 7;
const ld PI = acos(-1);
const ld eps = 1e-9;
#define lowb(x) x &(-x)
#define MNTO(x, y) x = min(x, (__typeof__(x))y)
#define MXTO(x, y) x = max(x, (__typeof__(x))y)
ll sub(ll a, ll b) {
ll x = a - b;
while (x < 0)
x += MOD;
while (x > MOD)
x -= MOD;
return x;
}
ll mult(ll a, ll b) { return a * b % MOD; }
ll mypow(ll a, ll b) {
if (b <= 0)
return 1;
ll res = 1LL;
while (b) {
if (b & 1)
res = (res * a) % MOD;
a = (a * a) % MOD;
b >>= 1;
}
return res;
}
const int maxn = 5e5 + 5;
vector<int> pref;
int main() {
int n, k;
cin >> n >> k;
vector<pii> v;
k = 2 * k;
int cons = 0, cons2 = 0;
pref.pb(0);
REP(i, n) {
char a;
cin >> a;
if (a == '0') {
if (cons) {
v.pb({cons, 1});
pref.pb(pref.back() + cons);
}
cons = 0;
cons2++;
} else {
if (cons2) {
v.pb({cons2, 0});
pref.pb(pref.back() + cons2);
}
cons2 = 0;
cons++;
}
}
if (cons) {
v.pb({cons, 1});
pref.pb(pref.back() + cons);
}
if (cons2) {
v.pb({cons2, 0});
pref.pb(pref.back() + cons2);
}
int ans = 0;
REP(i, sz(v)) {
if (v[i].s) {
MXTO(ans, pref[min(i + k + 1, sz(pref) - 1)] - pref[i]);
} else {
MXTO(ans, pref[min(i + k, sz(pref) - 1)] - pref[i]);
}
}
cout << ans;
} | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 885,360 | 885,361 | u110464018 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define be begin
#define en end
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define ALL(a) (a).be(), (a).en()
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++) // repeat n times
#define REP2(i, s, n) for (int(i) = (s); (i) < (n); (i)++) // repeat from s to n
#define REPD(i, n) for (int(i) = (n); (i) >= 0; (i)--) // repeat from n to 0
#define REPD2(i, s, e) \
for (int(i) = (s); (i) >= (e); (i)--) // repeat from s to e
#define RANGE(i, v) for (auto &(i) : v) // repeat range
#define ASIZE(a) (sizeof(a) / sizeof(a[0])) // array size
using LL = long long;
template <typename T1, typename T2> using P = pair<T1, T2>;
using Pii = P<int, int>;
using Pdd = P<double, double>;
using Psi = P<string, double>;
template <typename T> using V = vector<T>;
using Vi = V<int>;
using Vll = V<LL>;
using Vs = V<string>;
template <typename T1, typename T2> using M = map<T1, T2>;
using Mii = M<int, int>;
using Msi = M<string, int>;
V<Psi> RLE(string s) {
V<Psi> rle;
string r = "";
int cnt = 0;
for (int i = 0; i < s.size(); i++) {
string c = s.substr(i, 1);
if (c == r) {
cnt++;
} else {
if (cnt != 0)
rle.pb(mp(r, cnt));
r = c;
cnt = 1;
}
}
rle.pb(mp(r, cnt));
return rle;
}
int main() {
int n, k;
string s;
cin >> n >> k;
cin >> s;
auto lre = RLE(s);
Vi l;
l.pb(1);
for (auto i : lre) {
l.pb(l[l.size() - 1] + i.se);
}
int max_x = 0;
REP(i, lre.size()) {
int cnt_k = 0;
int m;
if (lre[i].fi == "0")
m = i + 2 * k;
else
m = i + 2 * k + 1;
if (m > l.size())
m = l.size() - 1;
int x = l[m] - l[i];
max_x = max(max_x, x);
}
cout << max_x << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define be begin
#define en end
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define ALL(a) (a).be(), (a).en()
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++) // repeat n times
#define REP2(i, s, n) for (int(i) = (s); (i) < (n); (i)++) // repeat from s to n
#define REPD(i, n) for (int(i) = (n); (i) >= 0; (i)--) // repeat from n to 0
#define REPD2(i, s, e) \
for (int(i) = (s); (i) >= (e); (i)--) // repeat from s to e
#define RANGE(i, v) for (auto &(i) : v) // repeat range
#define ASIZE(a) (sizeof(a) / sizeof(a[0])) // array size
using LL = long long;
template <typename T1, typename T2> using P = pair<T1, T2>;
using Pii = P<int, int>;
using Pdd = P<double, double>;
using Psi = P<string, double>;
template <typename T> using V = vector<T>;
using Vi = V<int>;
using Vll = V<LL>;
using Vs = V<string>;
template <typename T1, typename T2> using M = map<T1, T2>;
using Mii = M<int, int>;
using Msi = M<string, int>;
V<Psi> RLE(string s) {
V<Psi> rle;
string r = "";
int cnt = 0;
for (int i = 0; i < s.size(); i++) {
string c = s.substr(i, 1);
if (c == r) {
cnt++;
} else {
if (cnt != 0)
rle.pb(mp(r, cnt));
r = c;
cnt = 1;
}
}
rle.pb(mp(r, cnt));
return rle;
}
int main() {
int n, k;
string s;
cin >> n >> k;
cin >> s;
auto lre = RLE(s);
Vi l;
l.pb(1);
for (auto i : lre) {
l.pb(l[l.size() - 1] + i.se);
}
int max_x = 0;
REP(i, lre.size()) {
int cnt_k = 0;
int m;
if (lre[i].fi == "0")
m = i + 2 * k;
else
m = i + 2 * k + 1;
if (m > lre.size())
m = l.size() - 1;
int x = l[m] - l[i];
max_x = max(max_x, x);
}
cout << max_x << endl;
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 885,367 | 885,368 | u129220625 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define be begin
#define en end
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define ALL(a) (a).be(), (a).en()
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++) // repeat n times
#define REP2(i, s, n) for (int(i) = (s); (i) < (n); (i)++) // repeat from s to n
#define REPD(i, n) for (int(i) = (n); (i) >= 0; (i)--) // repeat from n to 0
#define REPD2(i, s, e) \
for (int(i) = (s); (i) >= (e); (i)--) // repeat from s to e
#define RANGE(i, v) for (auto &(i) : v) // repeat range
#define ASIZE(a) (sizeof(a) / sizeof(a[0])) // array size
using LL = long long;
template <typename T1, typename T2> using P = pair<T1, T2>;
using Pii = P<int, int>;
using Pdd = P<double, double>;
using Psi = P<string, double>;
template <typename T> using V = vector<T>;
using Vi = V<int>;
using Vll = V<LL>;
using Vs = V<string>;
template <typename T1, typename T2> using M = map<T1, T2>;
using Mii = M<int, int>;
using Msi = M<string, int>;
V<Psi> RLE(string s) {
V<Psi> rle;
string r = "";
int cnt = 0;
for (int i = 0; i < s.size(); i++) {
string c = s.substr(i, 1);
if (c == r) {
cnt++;
} else {
if (cnt != 0)
rle.pb(mp(r, cnt));
r = c;
cnt = 1;
}
}
rle.pb(mp(r, cnt));
return rle;
}
int main() {
int n, k;
string s;
cin >> n >> k;
cin >> s;
auto lre = RLE(s);
Vi l;
l.pb(1);
for (auto i : lre) {
l.pb(l[l.size() - 1] + i.se);
}
int max_x = 0;
REP(i, lre.size()) {
int cnt_k = 0;
int m;
if (lre[i].fi == "0")
m = i + 2 * k;
else
m = i + 2 * k + 1;
if (m > l.size())
m = l.size();
int x = l[m] - l[i];
max_x = max(max_x, x);
}
cout << max_x << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define be begin
#define en end
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define ALL(a) (a).be(), (a).en()
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++) // repeat n times
#define REP2(i, s, n) for (int(i) = (s); (i) < (n); (i)++) // repeat from s to n
#define REPD(i, n) for (int(i) = (n); (i) >= 0; (i)--) // repeat from n to 0
#define REPD2(i, s, e) \
for (int(i) = (s); (i) >= (e); (i)--) // repeat from s to e
#define RANGE(i, v) for (auto &(i) : v) // repeat range
#define ASIZE(a) (sizeof(a) / sizeof(a[0])) // array size
using LL = long long;
template <typename T1, typename T2> using P = pair<T1, T2>;
using Pii = P<int, int>;
using Pdd = P<double, double>;
using Psi = P<string, double>;
template <typename T> using V = vector<T>;
using Vi = V<int>;
using Vll = V<LL>;
using Vs = V<string>;
template <typename T1, typename T2> using M = map<T1, T2>;
using Mii = M<int, int>;
using Msi = M<string, int>;
V<Psi> RLE(string s) {
V<Psi> rle;
string r = "";
int cnt = 0;
for (int i = 0; i < s.size(); i++) {
string c = s.substr(i, 1);
if (c == r) {
cnt++;
} else {
if (cnt != 0)
rle.pb(mp(r, cnt));
r = c;
cnt = 1;
}
}
rle.pb(mp(r, cnt));
return rle;
}
int main() {
int n, k;
string s;
cin >> n >> k;
cin >> s;
auto lre = RLE(s);
Vi l;
l.pb(1);
for (auto i : lre) {
l.pb(l[l.size() - 1] + i.se);
}
int max_x = 0;
REP(i, lre.size()) {
int cnt_k = 0;
int m;
if (lre[i].fi == "0")
m = i + 2 * k;
else
m = i + 2 * k + 1;
if (m > lre.size())
m = l.size() - 1;
int x = l[m] - l[i];
max_x = max(max_x, x);
}
cout << max_x << endl;
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.change"
] | 885,369 | 885,368 | u129220625 | cpp |
p03074 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cerr << #x << ": " << x << endl
int main() {
int n, k;
string s;
cin >> n >> k >> s;
vector<int> acc;
int bt = 1;
int cnt = 0;
rep(i, n) {
if (s[i] != (char)(bt + '0')) {
acc.push_back(cnt);
bt ^= 1;
cnt = 1;
}
cnt++;
}
if (cnt != 0)
acc.push_back(cnt);
if (!bt)
acc.push_back(0);
int m = (int)acc.size();
int d = 2 * k + 1;
int ans = 0;
for (int i = 0; i < m; i += 2) {
int tmp = 0;
int left = i;
int right = min(i + d, m);
for (int j = left; j < right; j++) {
tmp += acc[j];
}
ans = max(ans, tmp);
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cerr << #x << ": " << x << endl
int main() {
int n, k;
string s;
cin >> n >> k >> s;
vector<int> acc;
int bt = 1;
int cnt = 0;
rep(i, n) {
if (s[i] != (char)(bt + '0')) {
acc.push_back(cnt);
bt ^= 1;
cnt = 1;
} else {
cnt++;
}
}
if (cnt != 0)
acc.push_back(cnt);
if (!bt)
acc.push_back(0);
int m = (int)acc.size();
int d = 2 * k + 1;
int ans = 0;
for (int i = 0; i < m; i += 2) {
int tmp = 0;
int left = i;
int right = min(i + d, m);
for (int j = left; j < right; j++) {
tmp += acc[j];
}
ans = max(ans, tmp);
}
cout << ans << endl;
return 0;
}
| [
"control_flow.branch.else.add"
] | 885,372 | 885,373 | u846820729 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> K >> S;
int L = S.length();
S.push_back('2');
vector<int> A;
int tmp = 1;
for (int i = 1; i <= L; i++) {
if (S[i] == S[i - 1]) {
tmp++;
} else {
if (S[i - 1] == '1') {
A.push_back(tmp);
} else {
A.push_back(-tmp);
}
tmp = 1;
}
}
int M = A.size();
vector<int> sum(100010, 0);
sum[0] = 0;
for (int i = 1; i <= M; i++) {
sum[i] = sum[i - 1] + abs(A[i - 1]);
}
int ans = 0;
for (int i = 0; i < M; i++) {
int cur = 0;
if (A[i] > 0) {
ans = max(ans, sum[i + min(2 * K + 1, M)] - sum[i]);
} else {
ans = max(ans, sum[i + min(2 * K, M)] - sum[i]);
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> K >> S;
int L = S.length();
S.push_back('2');
vector<int> A;
int tmp = 1;
for (int i = 1; i <= L; i++) {
if (S[i] == S[i - 1]) {
tmp++;
} else {
if (S[i - 1] == '1') {
A.push_back(tmp);
} else {
A.push_back(-tmp);
}
tmp = 1;
}
}
int M = A.size();
vector<int> sum(100010, 0);
sum[0] = 0;
for (int i = 1; i <= M; i++) {
sum[i] = sum[i - 1] + abs(A[i - 1]);
}
int ans = 0;
for (int i = 0; i < M; i++) {
int cur = 0;
if (A[i] > 0) {
ans = max(ans, sum[i + min(2 * K + 1, M - i)] - sum[i]);
} else {
ans = max(ans, sum[i + min(2 * K, M - i)] - sum[i]);
}
}
cout << ans << endl;
} | [
"call.arguments.add"
] | 885,376 | 885,377 | u285358283 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define endl '\n'
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, k;
cin >> n >> k;
vector<char> s(n);
rep(i, n) cin >> s[i];
vector<int> a;
s.push_back('2');
int i = 0;
int cnt = 1;
while (i < n) {
if (s[i] == s[i + 1])
cnt++;
else {
a.push_back(cnt);
cnt = 1;
}
i++;
}
for (int j = 1; j < n; j++) {
a[j] += a[j - 1];
}
int ans = 0;
int m = a.size();
for (int j = 0; j < m; j++) {
int res = 0;
if (s[0] == '0' && j == 0) {
res = a[min(j + 2 * k - 1, m - 1)];
} else {
if (j == 0)
res = a[min(j + 2 * k, m - 1)];
else
res = a[min(j + 2 * k, m - 1)] - a[j - 1];
j++;
}
ans = max(res, ans);
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define endl '\n'
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, k;
cin >> n >> k;
vector<char> s(n);
rep(i, n) cin >> s[i];
vector<int> a;
s.push_back('2');
int i = 0;
int cnt = 1;
while (i < n) {
if (s[i] == s[i + 1])
cnt++;
else {
a.push_back(cnt);
cnt = 1;
}
i++;
}
for (int j = 1; j < a.size(); j++) {
a[j] += a[j - 1];
}
int ans = 0;
int m = a.size();
for (int j = 0; j < m; j++) {
int res = 0;
if (s[0] == '0' && j == 0) {
res = a[min(j + 2 * k - 1, m - 1)];
} else {
if (j == 0)
res = a[min(j + 2 * k, m - 1)];
else
res = a[min(j + 2 * k, m - 1)] - a[j - 1];
j++;
}
ans = max(res, ans);
}
cout << ans << endl;
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"call.add"
] | 885,380 | 885,381 | u862412671 | cpp |
p03074 | /*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;
}
| [
"assignment.change"
] | 885,389 | 885,390 | u264265458 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
char c = s[0];
vector<int> a;
a.push_back(0);
for (int i = 1; i < n; i++) {
if (s[i] != c) {
a.push_back(i);
c = s[i];
}
}
a.push_back(n);
int ans = 0;
int l = a.size();
int f = c - '0';
for (int i = 1; i < l; i++) {
if ((f + i) % 2) {
int m = min(i + 2 * k - 1, l - 1);
ans = max(ans, a[m] - a[i - 1]);
} else {
int m = min(i + 2 * k, l - 1);
ans = max(ans, a[m] - a[i - 1]);
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
char c = s[0];
vector<int> a;
a.push_back(0);
for (int i = 1; i < n; i++) {
if (s[i] != c) {
a.push_back(i);
c = s[i];
}
}
a.push_back(n);
int ans = 0;
int l = a.size();
int f = s[0] - '0';
for (int i = 1; i < l; i++) {
if ((f + i) % 2) {
int m = min(i + 2 * k - 1, l - 1);
ans = max(ans, a[m] - a[i - 1]);
} else {
int m = min(i + 2 * k, l - 1);
ans = max(ans, a[m] - a[i - 1]);
}
}
cout << ans << endl;
return 0;
}
| [
"expression.operation.binary.change"
] | 885,394 | 885,395 | u970690920 | cpp |
p03074 | #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)
using ll = long long;
#define INF 1e9
int N, K;
string S;
int main() {
cin >> N >> K;
cin >> S;
vector<int> retu;
if (S[0] == '0') {
retu.push_back(0);
}
int cnt = 1;
REP(i, N) {
if (i == N - 1) {
retu.push_back(cnt);
if (S[i] == '0') {
retu.push_back(0);
}
break;
}
if (S[i] == S[i + 1]) {
cnt++;
} else {
retu.push_back(cnt);
cnt = 1;
}
}
if (K * 2 >= retu.size() - 2) {
cout << N << endl;
return 0;
}
int sum = 0;
REP(i, 2 * K + 1) { sum += retu[i]; }
int ans = sum;
for (int i = 2; i + 2 * K < retu.size(); i += 2) {
sum -= (retu[i - 1] + retu[i - 2]);
sum += (retu[i + 2 * K] + retu[i + 2 * K - 1]);
ans = max(ans, sum);
}
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)
using ll = long long;
#define INF 1e9
int N, K;
string S;
int main() {
cin >> N >> K;
cin >> S;
vector<int> retu;
if (S[0] == '0') {
retu.push_back(0);
}
int cnt = 1;
REP(i, N) {
if (i == N - 1) {
retu.push_back(cnt);
if (S[i] == '0') {
retu.push_back(0);
}
break;
}
if (S[i] == S[i + 1]) {
cnt++;
} else {
retu.push_back(cnt);
cnt = 1;
}
}
if (K * 2 >= retu.size() - 1) {
cout << N << endl;
return 0;
}
int sum = 0;
REP(i, 2 * K + 1) { sum += retu[i]; }
int ans = sum;
for (int i = 2; i + 2 * K < retu.size(); i += 2) {
sum -= (retu[i - 1] + retu[i - 2]);
sum += (retu[i + 2 * K] + retu[i + 2 * K - 1]);
ans = max(ans, sum);
}
cout << ans << endl;
return 0;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 885,404 | 885,405 | u174434198 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define all(i) i.begin(), i.end()
template <class T, class U> bool cmax(T &a, U b) {
if (a < b) {
a = b;
return true;
} else
return false;
}
template <class T, class U> bool cmin(T &a, U b) {
if (a > b) {
a = b;
return true;
} else
return false;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, k;
string s;
cin >> n >> k >> s;
vector<pii> a;
rep(i, n) {
int cnt = 1;
while (i < n - 1 && s[i] == s[i + 1]) {
i++;
cnt++;
}
a.push_back({cnt, s[i] - '0'});
}
ll right = 0;
ll cnt = 0;
ll sum = 0;
ll ans = 0;
// [left, right)
rep(left, a.size()) {
while (right < a.size() && cnt + !a[right].second <= k) {
cnt += !a[right].second;
sum += a[right].first;
right++;
// cerr << left << " " << right << endl;
// cerr << " " << cnt << " " << sum << endl;
}
cmax(ans, sum);
if (right == left)
right++;
else {
cnt -= !a[right].second;
sum -= a[left].first;
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define all(i) i.begin(), i.end()
template <class T, class U> bool cmax(T &a, U b) {
if (a < b) {
a = b;
return true;
} else
return false;
}
template <class T, class U> bool cmin(T &a, U b) {
if (a > b) {
a = b;
return true;
} else
return false;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, k;
string s;
cin >> n >> k >> s;
vector<pii> a;
rep(i, n) {
int cnt = 1;
while (i < n - 1 && s[i] == s[i + 1]) {
i++;
cnt++;
}
a.push_back({cnt, s[i] - '0'});
}
ll right = 0;
ll cnt = 0;
ll sum = 0;
ll ans = 0;
// [left, right)
rep(left, a.size()) {
while (right < a.size() && cnt + !a[right].second <= k) {
cnt += !a[right].second;
sum += a[right].first;
right++;
// cerr << left << " " << right << endl;
// cerr << " " << cnt << " " << sum << endl;
}
cmax(ans, sum);
if (right == left)
right++;
else {
cnt -= !a[left].second;
sum -= a[left].first;
}
}
cout << ans << endl;
}
| [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 885,408 | 885,409 | u366644013 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define all(i) i.begin(), i.end()
template <class T, class U> bool cmax(T &a, U b) {
if (a < b) {
a = b;
return true;
} else
return false;
}
template <class T, class U> bool cmin(T &a, U b) {
if (a > b) {
a = b;
return true;
} else
return false;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, k;
string s;
cin >> n >> k >> s;
vector<pii> a;
rep(i, n) {
int cnt = 1;
while (i < n - 1 && s[i] == s[i + 1]) {
i++;
cnt++;
}
a.push_back({cnt, s[i] - '0'});
}
auto f = [&](ll i) { return !a[i].second; };
ll right = 0;
ll cnt = 0;
ll sum = 0;
ll ans = 0;
rep(left, a.size()) {
while (right < n && cnt + f(right) <= k) {
cnt += f(right);
sum += a[right].first;
right++;
// cerr << left << " " << right << endl;
// cerr << " " << cnt << " " << sum << endl;
}
cmax(ans, sum);
if (right == left)
right++;
else {
cnt -= f(left);
sum -= a[left].first;
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define all(i) i.begin(), i.end()
template <class T, class U> bool cmax(T &a, U b) {
if (a < b) {
a = b;
return true;
} else
return false;
}
template <class T, class U> bool cmin(T &a, U b) {
if (a > b) {
a = b;
return true;
} else
return false;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, k;
string s;
cin >> n >> k >> s;
vector<pii> a;
rep(i, n) {
int cnt = 1;
while (i < n - 1 && s[i] == s[i + 1]) {
i++;
cnt++;
}
a.push_back({cnt, s[i] - '0'});
}
auto f = [&](ll i) { return !a[i].second; };
ll right = 0;
ll cnt = 0;
ll sum = 0;
ll ans = 0;
// [left, right)
rep(left, a.size()) {
while (right < a.size() && cnt + f(right) <= k) {
cnt += f(right);
sum += a[right].first;
right++;
// cerr << left << " " << right << endl;
// cerr << " " << cnt << " " << sum << endl;
}
cmax(ans, sum);
if (right == left)
right++;
else {
cnt -= f(left);
sum -= a[left].first;
}
}
cout << ans << endl;
}
| [
"control_flow.loop.condition.change",
"call.add"
] | 885,410 | 885,411 | u366644013 | cpp |
p03074 | #include <bits/stdc++.h>
#define rep(i, a) for (int i = 0; i < int(a); ++i)
using ll = long long;
using namespace std;
ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
int main() {
int n, k;
string s;
cin >> n >> k >> s;
vector<int> zo;
rep(i, n) {
char c = s[i];
int cnt = 0;
while (c == s[i]) {
i++ + cnt++;
}
i--;
zo.push_back(cnt);
}
vector<int> sum(zo.size() + 1, 0);
rep(i, zo.size()) sum[i + 1] += sum[i] + zo[i];
/*if(k>(zo.size()-1)/2){
cout<<sum[sum.size()-1];
}else{
*/
int t;
int ans = 0;
if (s[0] == '0') {
rep(i, sum.size()) {
if (i % 2) {
// 1 そのマスからk*2+1
int t = k * 2 + 2;
if (i + t > sum.size() - 1) {
ans = max(ans, sum[sum.size() - 1] - sum[i]);
} else {
ans = max(ans, sum[i + t] - sum[i]);
}
} else {
// 0 k*2
int t = k * 2;
if (i + t > sum.size() - 1) {
ans = max(ans, sum[sum.size() - 1] - sum[i]);
} else {
ans = max(ans, sum[i + t] - sum[i]);
}
}
}
} else {
rep(i, sum.size()) {
if (i % 2) {
// 1 そのマスからk*2+1
int t = k * 2;
if (i + t > sum.size() - 1) {
ans = max(ans, sum[sum.size() - 1] - sum[i]);
} else {
ans = max(ans, sum[i + t] - sum[i]);
}
} else {
// 0 k*2
int t = k * 2 + 2;
if (i + t > sum.size() - 1) {
ans = max(ans, sum[sum.size() - 1] - sum[i]);
} else {
ans = max(ans, sum[i + t] - sum[i]);
}
}
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, a) for (int i = 0; i < int(a); ++i)
using ll = long long;
using namespace std;
ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
int main() {
int n, k;
string s;
cin >> n >> k >> s;
vector<int> zo;
rep(i, n) {
char c = s[i];
int cnt = 0;
while (c == s[i]) {
i++ + cnt++;
}
i--;
zo.push_back(cnt);
}
vector<int> sum(zo.size() + 1, 0);
rep(i, zo.size()) sum[i + 1] += sum[i] + zo[i];
/*if(k>(zo.size()-1)/2){
cout<<sum[sum.size()-1];
}else{
*/
int t;
int ans = 0;
if (s[0] == '0') {
rep(i, sum.size()) {
if (i % 2) {
// 1 そのマスからk*2+1
int t = k * 2 + 1;
if (i + t > sum.size() - 1) {
ans = max(ans, sum[sum.size() - 1] - sum[i]);
} else {
ans = max(ans, sum[i + t] - sum[i]);
}
} else {
// 0 k*2
int t = k * 2;
if (i + t > sum.size() - 1) {
ans = max(ans, sum[sum.size() - 1] - sum[i]);
} else {
ans = max(ans, sum[i + t] - sum[i]);
}
}
}
} else {
rep(i, sum.size()) {
if (i % 2) {
// 1 そのマスからk*2+1
int t = k * 2;
if (i + t > sum.size() - 1) {
ans = max(ans, sum[sum.size() - 1] - sum[i]);
} else {
ans = max(ans, sum[i + t] - sum[i]);
}
} else {
// 0 k*2
int t = k * 2 + 1;
if (i + t > sum.size() - 1) {
ans = max(ans, sum[sum.size() - 1] - sum[i]);
} else {
ans = max(ans, sum[i + t] - sum[i]);
}
}
}
}
cout << ans << endl;
} | [
"literal.number.change",
"expression.operation.binary.change"
] | 885,422 | 885,423 | u089885969 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
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);
for (int i = 0; i < n - 1; i++) {
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;
}
if (k * 2 + 1 >= a.size()) {
cout << n << endl;
return 0;
}
for (int i = 0; i < k; i++)
sum += a[i];
ans = sum;
int l = 0;
int r = 2 * k + 1;
for (int i = 0; i < (a.size() - k * 2 - 1) / 2; i++) {
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>
using namespace std;
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);
for (int i = 0; i < n - 1; i++) {
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;
}
if (k * 2 + 1 >= a.size()) {
cout << n << endl;
return 0;
}
for (int i = 0; i < k * 2 + 1; i++)
sum += a[i];
ans = sum;
int l = 0;
int r = 2 * k + 1;
for (int i = 0; i < (a.size() - k * 2 - 1) / 2; i++) {
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;
} | [
"control_flow.loop.for.condition.change"
] | 885,436 | 885,437 | u351265848 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string s;
cin >> s;
vector<int> res;
int tmp = 1;
for (int i = 0; i < N - 1; i++) {
if (s[i] == s[i + 1]) {
tmp++;
continue;
}
res.push_back(tmp);
tmp = 1;
}
res.push_back(tmp);
int ans = 0;
int M = res.size();
int sum[M + 1] = {};
for (int i = 0; i < M; i++) {
sum[i + 1] = sum[i] + res[i];
}
bool flag = true;
if (s[0] == '0')
flag = false;
for (int i = 1; i <= M; i++) {
if (flag) {
if (i % 2 == 1) {
int right = i + 2 * K;
if (right >= M)
;
right = M;
ans = max(ans, sum[right] - sum[i - 1]);
} else {
int right = i + 2 * K - 1;
if (right >= M)
;
right = M;
ans = max(ans, sum[right] - sum[i - 1]);
}
} else {
if (i % 2 == 0) {
int right = i + 2 * K;
if (right >= M)
;
right = M;
ans = max(ans, sum[right] - sum[i - 1]);
} else {
int right = i + 2 * K - 1;
if (right >= M)
;
right = M;
ans = max(ans, sum[right] - sum[i - 1]);
}
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string s;
cin >> s;
vector<int> res;
int tmp = 1;
for (int i = 0; i < N - 1; i++) {
if (s[i] == s[i + 1]) {
tmp++;
continue;
}
res.push_back(tmp);
tmp = 1;
}
res.push_back(tmp);
int ans = 0;
int M = res.size();
int sum[M + 1] = {};
for (int i = 0; i < M; i++) {
sum[i + 1] = sum[i] + res[i];
}
bool flag = true;
if (s[0] == '0')
flag = false;
for (int i = 1; i <= M; i++) {
if (flag) {
if (i % 2 == 1) {
int right = i + 2 * K;
if (right >= M)
right = M;
ans = max(ans, sum[right] - sum[i - 1]);
} else {
int right = i + 2 * K - 1;
if (right >= M)
right = M;
ans = max(ans, sum[right] - sum[i - 1]);
}
} else {
if (i % 2 == 0) {
int right = i + 2 * K;
if (right >= M)
right = M;
ans = max(ans, sum[right] - sum[i - 1]);
} else {
int right = i + 2 * K - 1;
if (right >= M)
right = M;
ans = max(ans, sum[right] - sum[i - 1]);
}
}
}
cout << ans << endl;
} | [] | 885,440 | 885,441 | u660341491 | cpp |
p03074 | #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(N + 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;
} | [
"call.arguments.change",
"expression.operation.binary.change",
"call.add",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one"
] | 885,444 | 885,443 | u660341491 | cpp |
p03074 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i <= n; ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
string s;
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;
int left = 0;
int right = 0;
int tmp = 0;
for (int i = 0; i < nums.size(); i += 2) {
int tmp = 0;
int nl = i;
int nr = min(i + add, (int)nums.size());
while (nl > left) {
tmp -= nums[left];
left++;
}
while (nr > right) {
tmp += nums[right];
right++;
}
ans = max(tmp, ans);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i <= n; ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
string s;
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;
int left = 0;
int right = 0;
int tmp = 0;
for (int i = 0; i < nums.size(); i += 2) {
int nl = i;
int nr = min(i + add, (int)nums.size());
while (nl > left) {
tmp -= nums[left];
left++;
}
while (nr > right) {
tmp += nums[right];
right++;
}
ans = max(tmp, ans);
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.remove"
] | 885,448 | 885,449 | u963903527 | cpp |
p03074 | #include <bits/stdc++.h>
#define GET_REP(_1, _2, _3, NAME, ...) NAME
#define rep(...) GET_REP(__VA_ARGS__, irep, _rep)(__VA_ARGS__)
#define rep1(...) GET_REP(__VA_ARGS__, irep1, _rep1)(__VA_ARGS__)
#define _rep(i, n) irep(i, 0, n)
#define _rep1(i, n) irep1(i, 1, n)
#define irep(i, a, n) for (int i = a; i < (int)(n); ++i)
#define irep1(i, a, n) for (int i = a; i <= (int)(n); ++i)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define rrep1(i, n) for (int i = (int)(n); i >= 1; --i)
#define allrep(X, x) for (auto &&X : x)
#define all(x) (x).begin(), (x).end()
#ifdef LOCAL
#include "../../Lib/cout_container.hpp"
#define debug(x) cerr << #x " => " << (x) << endl
#else
#define debug(x) 0
#endif
using lint = long long;
constexpr int INF = 1 << 29;
constexpr lint INFL = 1LL << 61;
constexpr int MOD = (int)1e9 + 7;
constexpr double EPS = 1e-9;
using namespace std;
namespace {
struct INIT {
INIT() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
} INIT;
} // namespace
int main(void) {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> v;
int cnt = 0, prev = 1;
allrep(c, s) {
if (c - '0' == prev)
++cnt;
else {
v.push_back(cnt);
cnt = 1;
prev = !prev;
}
}
v.push_back(cnt);
if (s.back() == '0')
v.push_back(0);
vector<int> sumv(v.size() + 1);
rep(i, v.size()) sumv[i + 1] = sumv[i] + v[i];
int maxi = 0, times = min(k, (int)v.size() / 2);
for (int i = 0; i * 2 + 1 <= v.size(); i += 2) {
maxi = max(maxi, sumv[i + times * 2 + 1] - sumv[i]);
}
cout << maxi << endl;
return 0;
} | #include <bits/stdc++.h>
#define GET_REP(_1, _2, _3, NAME, ...) NAME
#define rep(...) GET_REP(__VA_ARGS__, irep, _rep)(__VA_ARGS__)
#define rep1(...) GET_REP(__VA_ARGS__, irep1, _rep1)(__VA_ARGS__)
#define _rep(i, n) irep(i, 0, n)
#define _rep1(i, n) irep1(i, 1, n)
#define irep(i, a, n) for (int i = a; i < (int)(n); ++i)
#define irep1(i, a, n) for (int i = a; i <= (int)(n); ++i)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define rrep1(i, n) for (int i = (int)(n); i >= 1; --i)
#define allrep(X, x) for (auto &&X : x)
#define all(x) (x).begin(), (x).end()
#ifdef LOCAL
#include "../../Lib/cout_container.hpp"
#define debug(x) cerr << #x " => " << (x) << endl
#else
#define debug(x) 0
#endif
using lint = long long;
constexpr int INF = 1 << 29;
constexpr lint INFL = 1LL << 61;
constexpr int MOD = (int)1e9 + 7;
constexpr double EPS = 1e-9;
using namespace std;
namespace {
struct INIT {
INIT() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
} INIT;
} // namespace
int main(void) {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> v;
int cnt = 0, prev = 1;
allrep(c, s) {
if (c - '0' == prev)
++cnt;
else {
v.push_back(cnt);
cnt = 1;
prev = !prev;
}
}
v.push_back(cnt);
if (s.back() == '0')
v.push_back(0);
vector<int> sumv(v.size() + 1);
rep(i, v.size()) sumv[i + 1] = sumv[i] + v[i];
int maxi = 0, times = min(k, (int)v.size() / 2);
for (int i = 0; i + times * 2 + 1 <= v.size(); i += 2) {
maxi = max(maxi, sumv[i + times * 2 + 1] - sumv[i]);
}
cout << maxi << endl;
return 0;
} | [
"control_flow.loop.for.condition.change"
] | 885,450 | 885,451 | u020746846 | cpp |
p03074 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define rep(i, n) FOR(i, 0, (n))
#define REPS(i, n) FOR(i, 1, (n) + 1)
#define RREP(i, n) RFOR(i, 0, (n))
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
#define debug(x) cout << #x << " = " << (x) << endl;
#define SORT(x) sort(rng(x))
#define RSORT(x) sort(rrng(x))
#define SUM(x) accumulate(rng(x), 0)
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define bn(x) ((1 << x) - 1)
#define dup(x, y) (((x) + (y)-1) / (y))
#define uni(x) x.erase(unique(rng(x)), x.end())
#define SP << " " <<
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using pii = pair<int, int>;
using tiii = tuple<int, int, int>;
const int mod = 1000000007;
const double EPS = 1e-9;
const int INF = (1 << 30) - 1;
const ll INFLL = (1LL << 62) - 1;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
// cout << fixed << setprecision(10);
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vi nums;
int now = 1;
int cnt = 0;
// 1-0-1-0-1の形の配列を作る
// 0番目の区間が0なら、(1,0)が先頭に追加される
// 0番目の区間が1なら、そのまま数えられる
rep(i, n) {
if (s[i] == (char)('0' + now))
cnt++;
else {
nums.pb(cnt);
now = 1 - now;
cnt = 1;
}
}
if (cnt != 1)
nums.pb(cnt);
if (nums.size() % 2 == 0)
nums.pb(0);
int add = 2 * k + 1;
int ans = 0;
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;
return 0;
} | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define rep(i, n) FOR(i, 0, (n))
#define REPS(i, n) FOR(i, 1, (n) + 1)
#define RREP(i, n) RFOR(i, 0, (n))
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
#define debug(x) cout << #x << " = " << (x) << endl;
#define SORT(x) sort(rng(x))
#define RSORT(x) sort(rrng(x))
#define SUM(x) accumulate(rng(x), 0)
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define bn(x) ((1 << x) - 1)
#define dup(x, y) (((x) + (y)-1) / (y))
#define uni(x) x.erase(unique(rng(x)), x.end())
#define SP << " " <<
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using pii = pair<int, int>;
using tiii = tuple<int, int, int>;
const int mod = 1000000007;
const double EPS = 1e-9;
const int INF = (1 << 30) - 1;
const ll INFLL = (1LL << 62) - 1;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
// cout << fixed << setprecision(10);
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vi nums;
int now = 1;
int cnt = 0;
// 1-0-1-0-1の形の配列を作る
// 0番目の区間が0なら、(1,0)が先頭に追加される
// 0番目の区間が1なら、そのまま数えられる
rep(i, n) {
if (s[i] == (char)('0' + now))
cnt++;
else {
nums.pb(cnt);
now = 1 - now;
cnt = 1;
}
}
// 最後の区間がまだ、ついていないので付け加える
if (cnt != 0)
nums.pb(cnt);
// numsのサイズが偶数の場合、1-0-1-0の形になってしまっているので、
// 後ろに(1,0)を追加して、1-0-1-0-1の形にする
if (nums.size() % 2 == 0)
nums.pb(0);
// k = 1: 1-0-1 -> 1-1-1
// | |
// l l+2*k
// k = 2: 1-0-1-0-1 -> 1-1-1-1-1
// | |
// l l+2*k
int add = 2 * k + 1;
int ans = 0;
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;
return 0;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 885,456 | 885,457 | u850516963 | cpp |
p03074 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> Rs(1);
if (S[0] == '1')
Rs[0] = 0;
else
Rs.push_back(0);
int before = (int)S[0];
rep(i, N) {
int s = (int)S[i];
if (s != before) {
Rs.push_back(0);
}
Rs[Rs.size() - 1]++;
before = s;
}
if (Rs.back() == 0)
Rs.push_back(0);
// if (K * 2 + 1 >= Rs.size()) {
// cout << S.size() << endl;
// return 0;
// }
vector<int> sums(Rs.size() + 1, 0);
rep(i, Rs.size()) sums[i + 1] = sums[i] + Rs[i];
int mx = 0;
for (int i = 2 * K + 1; i < sums.size(); i += 2) {
mx = max(mx, sums[i] - sums[i - 2 * K - 1]);
}
if (2 * K + 1 >= sums.size()) {
mx = sums[sums.size() - 1];
}
cout << mx << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> Rs(1);
if (S[0] == '1')
Rs[0] = 0;
else
Rs.push_back(0);
int before = (int)S[0];
rep(i, N) {
int s = (int)S[i];
if (s != before) {
Rs.push_back(0);
}
Rs[Rs.size() - 1]++;
before = s;
}
if (S.back() == '0')
Rs.push_back(0);
vector<int> sums(Rs.size() + 1, 0);
rep(i, Rs.size()) sums[i + 1] = sums[i] + Rs[i];
int mx = 0;
for (int i = 2 * K + 1; i < sums.size(); i += 2) {
mx = max(mx, sums[i] - sums[i - 2 * K - 1]);
}
if (2 * K + 1 >= sums.size()) {
mx = sums[sums.size() - 1];
}
cout << mx << endl;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 885,470 | 885,471 | u945359338 | cpp |
p03074 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <numeric>
#include <queue>
#include <unordered_map>
#include <vector>
const int mod = 1e9 + 7;
const int kmax = 510000;
long long fact[kmax], fact_inv[kmax], inv[kmax];
int gcd(int a, int b) {
if (!b) {
return a;
}
return gcd(b, a % b);
}
void init_comb() {
fact[0] = fact[1] = 1;
fact_inv[0] = fact_inv[1] = 1;
inv[1] = 1;
for (int i = 2; i < kmax; i++) {
fact[i] = fact[i - 1] * i % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
fact_inv[i] = fact_inv[i - 1] * inv[i] % mod;
}
}
long long comb(int n, int r) {
if (n < r) {
return 0;
}
if (n < 0 || r < 0) {
return 0;
}
return fact[n] * (fact_inv[r] * fact_inv[n - r] % mod) % mod;
}
int main() {
long long n, k;
std::cin >> n >> k;
std::string s;
std::cin >> s;
std::vector<long long> pos;
pos.push_back(0);
for (int i = 0; i < n - 1; i++) {
if (s[i] != s[i + 1]) {
pos.push_back(i + 1);
}
}
pos.push_back(n);
long long ans = 0;
for (auto i = 0; i < pos.size() - 1; i++) {
long long end_pos = 0;
if (s[i] == '0') {
end_pos = i + 2 * k;
} else {
end_pos = i + 2 * k + 1;
}
if (end_pos >= pos.size()) {
end_pos = pos.size() - 1;
}
ans = std::max(ans, pos[end_pos] - pos[i]);
}
std::cout << ans << std::endl;
}
| #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <numeric>
#include <queue>
#include <unordered_map>
#include <vector>
const int mod = 1e9 + 7;
const int kmax = 510000;
long long fact[kmax], fact_inv[kmax], inv[kmax];
int gcd(int a, int b) {
if (!b) {
return a;
}
return gcd(b, a % b);
}
void init_comb() {
fact[0] = fact[1] = 1;
fact_inv[0] = fact_inv[1] = 1;
inv[1] = 1;
for (int i = 2; i < kmax; i++) {
fact[i] = fact[i - 1] * i % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
fact_inv[i] = fact_inv[i - 1] * inv[i] % mod;
}
}
long long comb(int n, int r) {
if (n < r) {
return 0;
}
if (n < 0 || r < 0) {
return 0;
}
return fact[n] * (fact_inv[r] * fact_inv[n - r] % mod) % mod;
}
int main() {
long long n, k;
std::cin >> n >> k;
std::string s;
std::cin >> s;
std::vector<long long> pos;
pos.push_back(0);
for (int i = 0; i < n - 1; i++) {
if (s[i] != s[i + 1]) {
pos.push_back(i + 1);
}
}
pos.push_back(n);
long long ans = 0;
for (auto i = 0; i < pos.size() - 1; i++) {
long long end_pos = 0;
if (s[pos[i]] == '0') {
end_pos = i + 2 * k;
} else {
end_pos = i + 2 * k + 1;
}
if (end_pos >= pos.size()) {
end_pos = pos.size() - 1;
}
ans = std::max(ans, pos[end_pos] - pos[i]);
}
std::cout << ans << std::endl;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 885,472 | 885,473 | u083910207 | cpp |
p03074 | #include <iostream>
#include <vector>
int main() {
int n, k;
std::cin >> n >> k;
std::string s;
std::cin >> s;
std::vector<int> pos;
pos.push_back(0);
for (int i = 0; i < s.length() - 1; i++) {
if (s[i] != s[i + 1]) {
pos.push_back(i + 1);
}
}
pos.push_back(n);
int ans = 0;
for (int i = 0; i < pos.size() - 1; i++) {
int end_pos_idx;
if (s[i] == '1') {
end_pos_idx = i + 2 * k + 1;
} else {
end_pos_idx = i + 2 * k;
}
if (end_pos_idx >= pos.size()) {
end_pos_idx = pos.size() - 1;
}
ans = std::max(ans, pos[end_pos_idx] - pos[i]);
}
std::cout << ans << std::endl;
}
| #include <iostream>
#include <vector>
int main() {
int n, k;
std::cin >> n >> k;
std::string s;
std::cin >> s;
std::vector<int> pos;
pos.push_back(0);
for (int i = 0; i < s.length() - 1; i++) {
if (s[i] != s[i + 1]) {
pos.push_back(i + 1);
}
}
pos.push_back(n);
int ans = 0;
for (int i = 0; i < pos.size() - 1; i++) {
int end_pos_idx;
if (s[pos[i]] == '1') {
end_pos_idx = i + 2 * k + 1;
} else {
end_pos_idx = i + 2 * k;
}
if (end_pos_idx >= pos.size()) {
end_pos_idx = pos.size() - 1;
}
ans = std::max(ans, pos[end_pos_idx] - pos[i]);
}
std::cout << ans << std::endl;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 885,474 | 885,475 | u083910207 | cpp |
p03074 | #include <iostream>
#include <vector>
int main() {
int n, k;
std::cin >> n >> k;
std::string s;
std::cin >> s;
std::vector<int> pos;
pos.push_back(0);
for (int i = 0; i < s.length() - 1; i++) {
if (s[i] != s[i + 1]) {
pos.push_back(i + 1);
}
}
pos.push_back(n);
int ans = 0;
for (int i = 0; i < pos.size() - 1; i++) {
int end_pos_idx;
if (s[i] == '1') {
end_pos_idx = i + 2 * k + 1;
} else {
end_pos_idx = i + 2 * k;
}
if (end_pos_idx >= pos.size()) {
end_pos_idx = pos.size() - 1;
}
ans = std::max(ans, pos[end_pos_idx] - pos[i]);
}
std::cout << ans << std::endl;
}
| #include <iostream>
#include <vector>
int main() {
int n, k;
std::cin >> n >> k;
std::string s;
std::cin >> s;
std::vector<int> pos;
pos.push_back(0);
for (int i = 0; i < s.length() - 1; i++) {
if (s[i] != s[i + 1]) {
pos.push_back(i + 1);
}
}
pos.push_back(n);
int ans = 0;
for (int i = 0; i < pos.size() - 1; i++) {
int end_pos_idx;
if (s[pos[i]] == '1') {
end_pos_idx = i + 2 * k + 1;
} else {
end_pos_idx = i + 2 * k;
}
if (end_pos_idx >= pos.size()) {
end_pos_idx = pos.size() - 1;
}
ans = std::max(ans, pos[end_pos_idx] - pos[i]);
}
std::cout << ans << std::endl;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 885,474 | 885,476 | u083910207 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, b, e) for (int i = (b); i < (e); ++i)
#define RREP(i, b, e) for (int i = (b)-1; i >= e; --i)
#define rep(i, e) for (int i = 0; i < (e); ++i)
inline void print(void) { cout << '\n'; }
template <class T> inline void print(const T &x) { cout << x << '\n'; }
template <class T, class... U> inline void print(const T &x, const U &...y) {
cout << x << " ";
print(y...);
}
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> a;
a.emplace_back(0);
if (s[0] == '0')
a.emplace_back(0);
int cur = 1;
REP(i, 1, n) {
if (s[i] == s[i - 1])
++cur;
else {
a.emplace_back(cur);
cur = 1;
}
}
a.emplace_back(cur);
rep(i, k) a.emplace_back(0);
rep(i, a.size() - 1) a[i + 1] += a[i];
int ans = 0;
for (int i = 1; i + 2 * k < a.size(); i += 2) {
ans = max(ans, a[i + 2 * k] - a[i - 1]);
}
print(ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, b, e) for (int i = (b); i < (e); ++i)
#define RREP(i, b, e) for (int i = (b)-1; i >= e; --i)
#define rep(i, e) for (int i = 0; i < (e); ++i)
inline void print(void) { cout << '\n'; }
template <class T> inline void print(const T &x) { cout << x << '\n'; }
template <class T, class... U> inline void print(const T &x, const U &...y) {
cout << x << " ";
print(y...);
}
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> a;
a.emplace_back(0);
if (s[0] == '0')
a.emplace_back(0);
int cur = 1;
REP(i, 1, n) {
if (s[i] == s[i - 1])
++cur;
else {
a.emplace_back(cur);
cur = 1;
}
}
a.emplace_back(cur);
rep(i, 3 * k) a.emplace_back(0);
rep(i, a.size() - 1) a[i + 1] += a[i];
int ans = 0;
for (int i = 1; i + 2 * k < a.size(); i += 2) {
ans = max(ans, a[i + 2 * k] - a[i - 1]);
}
print(ans);
return 0;
} | [
"expression.operation.binary.add"
] | 885,477 | 885,478 | u403301154 | cpp |
p03074 | #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;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"call.add"
] | 885,481 | 885,482 | u726604439 | cpp |
p03074 | #include <cmath>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
using namespace std;
typedef long long ll;
int main(void) {
int n, k;
cin >> n >> k;
string s;
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;
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;
int left = 0;
int right = 0;
int tmp = 0;
for (int i = 0; i < nums.size(); i += 2) {
int nextright = i;
int nextleft = 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;
} | #include <cmath>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
using namespace std;
typedef long long ll;
int main(void) {
int n, k;
cin >> n >> k;
string s;
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;
int left = 0;
int right = 0;
int tmp = 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;
} | [
"assignment.value.change",
"assignment.change",
"variable_declaration.name.change",
"identifier.change"
] | 885,487 | 885,488 | u247576416 | cpp |
p03074 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
// ceil(a/b) (a + (b - 1))/ b
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
typedef pair<int, int> P;
const int inf = 1012345678;
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
int gcd(int a, int b) {
if (a % b == 0) {
return (b);
} else {
return (gcd(b, a % b));
}
}
int ans[1000000];
int sum[1000000];
int main() {
int N, K;
string s;
cin >> N >> K;
cin >> s;
int now = 1;
int cnt = 0;
vector<int> v;
if (s[0] == '0') {
v.push_back(0);
now--;
cnt++;
} else
cnt++;
for (int i = 1; i < N; i++) {
if (s[i] == (char)(now + '0')) {
cnt++;
} else {
now ^= 1;
v.push_back(cnt);
cnt = 1;
}
}
if (cnt)
v.push_back(cnt);
// rep(i,v.size())cout << v[i] << endl;
int add = 2 * K + 1;
vector<int> sum(v.size() + 1);
for (int i = 0; i < v.size(); i++) {
sum[i + 1] = v[i] + sum[i];
}
// rep(i,sum.size()) cout << sum[i] << endl;
int ans = 0;
for (int i = 0; i < sum.size(); i += 2) {
int l = i;
int r = min(i + add, int(sum.size()));
int tmp = sum[r] - sum[l];
ans = max(ans, tmp);
}
cout << ans << endl;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
// ceil(a/b) (a + (b - 1))/ b
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
typedef pair<int, int> P;
const int inf = 1012345678;
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
int gcd(int a, int b) {
if (a % b == 0) {
return (b);
} else {
return (gcd(b, a % b));
}
}
int ans[1000000];
int sum[1000000];
int main() {
int N, K;
string s;
cin >> N >> K;
cin >> s;
int now = 1;
int cnt = 0;
vector<int> v;
if (s[0] == '0') {
v.push_back(0);
now--;
cnt++;
} else
cnt++;
for (int i = 1; i < N; i++) {
if (s[i] == (char)(now + '0')) {
cnt++;
} else {
now ^= 1;
v.push_back(cnt);
cnt = 1;
}
}
if (cnt)
v.push_back(cnt);
// rep(i,v.size())cout << v[i] << endl;
int add = 2 * K + 1;
vector<int> sum(v.size() + 1);
for (int i = 0; i < v.size(); i++) {
sum[i + 1] = v[i] + sum[i];
}
int ans = 0;
for (int i = 0; i < sum.size(); i += 2) {
int l = i;
int r = min(i + add, int(sum.size()) - 1);
int tmp = sum[r] - sum[l];
ans = max(ans, tmp);
}
cout << ans << endl;
}
| [
"assignment.change"
] | 885,489 | 885,490 | u950174376 | cpp |
p03074 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define REP(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define lamsort(v, p) \
sort(v.begin(), v.end(), [](p a, p b) { return a.num < b.num; });
#define check(v) \
rep(i, v.size()) cout << v[i] << " "; \
cout << endl
#define INF 1e8
typedef long long ll;
using namespace std;
//オーバーフローに気をつけろよおおおおおお
//確認忘れるなよおおおおおお
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, k;
cin >> n >> k;
string s;
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;
cnt = 1;
}
}
if (cnt)
nums.push_back(cnt);
if (nums.size() % 2 == 0)
nums.push_back(0);
int ans = 0;
int add = 2 * k + 1;
int left = 0;
int right = 0;
int tmp = 0;
for (int i = 0; i < nums.size(); i += 2) {
int nleft = i;
int nright = min(i + add, (int)nums.size());
while (nleft > left) {
tmp -= nums[i];
left++;
}
while (nright > right) {
tmp += nums[right];
right++;
}
ans = max(ans, tmp);
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define REP(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define lamsort(v, p) \
sort(v.begin(), v.end(), [](p a, p b) { return a.num < b.num; });
#define check(v) \
rep(i, v.size()) cout << v[i] << " "; \
cout << endl
#define INF 1e8
typedef long long ll;
using namespace std;
//オーバーフローに気をつけろよおおおおおお
//確認忘れるなよおおおおおお
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, k;
cin >> n >> k;
string s;
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;
cnt = 1;
}
}
if (cnt)
nums.push_back(cnt);
if (nums.size() % 2 == 0)
nums.push_back(0);
int ans = 0;
int add = 2 * k + 1;
int left = 0;
int right = 0;
int tmp = 0;
for (int i = 0; i < nums.size(); i += 2) {
int nleft = i;
int nright = min(i + add, (int)nums.size());
while (nleft > left) {
tmp -= nums[left];
left++;
}
while (nright > right) {
tmp += nums[right];
right++;
}
ans = max(ans, tmp);
}
cout << ans << endl;
return 0;
} | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 885,498 | 885,499 | u008582165 | cpp |
p03074 | #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, l) { 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;
}
| [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 885,502 | 885,501 | u813174766 | cpp |
p03074 | #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;
} | [
"expression.operation.binary.remove"
] | 885,506 | 885,507 | u088895504 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
typedef vector<ll> vel;
typedef vector<int> vei;
typedef vector<char> vec;
typedef vector<bool> veb;
typedef vector<string> ves;
typedef vector<vector<ll>> ve_vel;
typedef vector<vector<int>> ve_vei;
typedef vector<vector<char>> ve_vec;
typedef vector<vector<bool>> ve_veb;
typedef vector<vector<string>> ve_ves;
#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 rep2(i, n) for (int i = 2; i < (int)(n); i++)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define fs first
#define sc second
#define pub push_back
#define pob pop_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define maxel(a) *max_element(all(a))
#define minel(a) *min_element(all(a))
#define acc accumulate
#define EPS (1e-7)
//#define INF (1e9)
#define PI (acos(-1))
#define mod (1000000007)
typedef long long int64;
const int64 INF = 1LL << 58;
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 (a > b) {
a = b;
return 1;
}
return 0;
}
vei printRLE(string str) {
int n = str.length();
vei res = {0};
for (int i = 0; i < n; i++) {
// Count occurrences of current character
int count = 1;
while (i < n - 1 && str[i] == str[i + 1]) {
count++;
i++;
}
// Print character and its count
res.pub(count);
}
return res;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
string S;
cin >> N >> K >> S;
vei rle = printRLE(S);
rle.pub(0);
int l = rle.size();
vei imos(l + 1, 0);
for (int i = 0; i <= l - 1; i++)
imos[i + 1] += imos[i] + (rle[i] - '0');
int ans = 0;
if (S[0] == '0') {
if ((l - 1) / 2 <= K) {
cout << N << endl;
return 0;
}
for (int i = 1; i <= l - 2 * K; i += 2) {
int temp = imos[i + 2 * K] - imos[i - 1];
ans = max(ans, temp);
}
cout << ans << endl;
} else {
if ((l - 2) / 2 <= K) {
cout << N << endl;
return 0;
}
for (int i = 2; i <= l - 2 * K; i += 2) {
int temp = imos[i + 2 * K] - imos[i - 1];
ans = max(ans, temp);
}
cout << ans << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
typedef vector<ll> vel;
typedef vector<int> vei;
typedef vector<char> vec;
typedef vector<bool> veb;
typedef vector<string> ves;
typedef vector<vector<ll>> ve_vel;
typedef vector<vector<int>> ve_vei;
typedef vector<vector<char>> ve_vec;
typedef vector<vector<bool>> ve_veb;
typedef vector<vector<string>> ve_ves;
#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 rep2(i, n) for (int i = 2; i < (int)(n); i++)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define fs first
#define sc second
#define pub push_back
#define pob pop_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define maxel(a) *max_element(all(a))
#define minel(a) *min_element(all(a))
#define acc accumulate
#define EPS (1e-7)
//#define INF (1e9)
#define PI (acos(-1))
#define mod (1000000007)
typedef long long int64;
const int64 INF = 1LL << 58;
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 (a > b) {
a = b;
return 1;
}
return 0;
}
vei printRLE(string str) {
int n = str.length();
vei res = {0};
for (int i = 0; i < n; i++) {
// Count occurrences of current character
int count = 1;
while (i < n - 1 && str[i] == str[i + 1]) {
count++;
i++;
}
// Print character and its count
res.pub(count);
}
return res;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
string S;
cin >> N >> K >> S;
vei rle = printRLE(S);
rle.pub(0);
int l = rle.size();
vei imos(l + 1, 0);
for (int i = 0; i <= l - 1; i++)
imos[i + 1] += imos[i] + rle[i];
int ans = 0;
if (S[0] == '0') {
if ((l - 1) / 2 <= K) {
cout << N << endl;
return 0;
}
for (int i = 1; i <= l - 2 * K; i += 2) {
int temp = imos[i + 2 * K] - imos[i - 1];
ans = max(ans, temp);
}
cout << ans << endl;
} else {
if ((l - 2) / 2 <= K) {
cout << N << endl;
return 0;
}
for (int i = 2; i <= l - 2 * K; i += 2) {
int temp = imos[i + 2 * K] - imos[i - 1];
ans = max(ans, temp);
}
cout << ans << endl;
}
return 0;
} | [] | 885,508 | 885,509 | u263715385 | cpp |
p03074 | #include "bits/stdc++.h"
using namespace std;
typedef long long LL;
typedef long double LD;
int main() {
LL N, K;
cin >> N >> K;
string S;
cin >> S;
LL range_max = 0;
//! 1の左側を起点とすればOKだが、S[0]が0ときだけ異なる
if (S[0] == '0') {
LL C = 1;
LL i = 0;
LL j;
for (j = i; j < S.length(); ++j) {
if (S[j] == '1' && S[j + 1] == '0' && C >= K) {
break;
} else if (S[j] == '1' && S[j + 1] == '0' && C < K) {
C++;
}
}
//! 右端のとき
if (j >= N) {
j--;
}
LL range = j - i + 1;
// cout << i << " : " << j << " : " << j - i + 1 << endl;
range_max = max(range_max, range);
}
LL index = S.find("1");
string U = "";
for (LL i = S.find("1"); i < S.length(); ++i) {
U += S[i];
}
// cerr << S << endl;
S = U;
// cerr << S << endl;
LL C = 0;
LL j = 0;
for (LL i = 0; i < S.length(); ++i) {
if (S[i] == '0') {
continue;
}
//! 一つ前のもとの同じ場合はスキップ（先頭を除く）
if (i != 0) {
if (S[i - 1] == '1' && S[i] == '1') {
continue;
}
}
for (; j < S.length(); ++j) {
if (S[j] == '1' && S[j + 1] == '0' && C >= K) {
C--;
break;
} else if (S[j] == '1' && S[j + 1] == '0' && C < K) {
C++;
}
}
//! 右端のとき
if (j >= N) {
j--;
}
LL range = j - i + 1;
// cout << i << " : " << j << " : " << j - i + 1 << endl;
range_max = max(range_max, range);
}
cout << range_max;
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
typedef long long LL;
typedef long double LD;
int main() {
LL N, K;
cin >> N >> K;
string S;
cin >> S;
LL range_max = 0;
//! 1の左側を起点とすればOKだが、S[0]が0ときだけ異なる
if (S[0] == '0') {
LL C = 1;
LL i = 0;
LL j;
for (j = i; j < S.length(); ++j) {
if (S[j] == '1' && S[j + 1] == '0' && C >= K) {
break;
} else if (S[j] == '1' && S[j + 1] == '0' && C < K) {
C++;
}
}
//! 右端のとき
if (j >= N) {
j--;
}
LL range = j - i + 1;
// cout << i << " : " << j << " : " << j - i + 1 << endl;
range_max = max(range_max, range);
}
LL index = S.find("1");
string U = "";
for (LL i = S.find("1"); i < S.length(); ++i) {
U += S[i];
}
// cerr << S << endl;
S = U;
// cerr << S << endl;
LL C = 0;
LL j = 0;
for (LL i = 0; i < S.length(); ++i) {
if (S[i] == '0') {
continue;
}
//! 一つ前のもとの同じ場合はスキップ（先頭を除く）
if (i != 0) {
if (S[i - 1] == '1' && S[i] == '1') {
continue;
}
}
for (; j < S.length(); ++j) {
if (S[j] == '1' && S[j + 1] == '0' && C >= K) {
C--;
break;
} else if (S[j] == '1' && S[j + 1] == '0' && C < K) {
C++;
}
}
//! 右端のとき
if (j >= S.length()) {
j--;
}
LL range = j - i + 1;
// cout << i << " : " << j << " : " << j - i + 1 << endl;
range_max = max(range_max, range);
}
cout << range_max;
return 0;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add"
] | 885,518 | 885,519 | u412164358 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> K >> S;
vector<int> cnt(100010, 0);
cnt[0] = 1;
int cur = 0;
for (int i = 1; i < N; i++) {
if (S[i] == S[i - 1]) {
cnt[cur]++;
} else {
cur++;
cnt[cur]++;
}
}
vector<int> sum(100010, 0);
sum[0] = 0;
for (int i = 0; i < 100010; i++) {
sum[i + 1] = sum[i] + cnt[i];
}
int ans = 0;
if (S[0] == '1') {
int x = (cur + 1) / 2;
if (x <= K) {
ans = N;
} else {
for (int i = 0; i <= cur - 2 * K; i += 2) {
ans = max(ans, sum[min(cur + 1, i + 2 * K + 1)] - sum[i]);
}
}
} else {
int x = (cur + 2) / 2;
if (x <= K) {
ans = N;
} else {
for (int i = 1; i <= cur - 2 * K; i += 2) {
ans = max(ans, sum[min(cur + 1, i + 2 * K + 1)] - sum[i]);
}
ans = max(ans, sum[min(cur + 1, 2 * K)] - sum[0]);
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> K >> S;
vector<int> cnt(100010, 0);
cnt[0] = 1;
int cur = 0;
for (int i = 1; i < N; i++) {
if (S[i] == S[i - 1]) {
cnt[cur]++;
} else {
cur++;
cnt[cur]++;
}
}
vector<int> sum(100010, 0);
sum[0] = 0;
for (int i = 0; i < 100010; i++) {
sum[i + 1] = sum[i] + cnt[i];
}
int ans = 0;
if (S[0] == '1') {
int x = (cur + 1) / 2;
if (x <= K) {
ans = N;
} else {
for (int i = 0; i <= cur - 2 * K + 1; i += 2) {
ans = max(ans, sum[min(cur + 1, i + 2 * K + 1)] - sum[i]);
}
}
} else {
int x = (cur + 2) / 2;
if (x <= K) {
ans = N;
} else {
for (int i = 1; i <= cur - 2 * K + 1; i += 2) {
ans = max(ans, sum[min(cur + 1, i + 2 * K + 1)] - sum[i]);
}
ans = max(ans, sum[min(cur + 1, 2 * K)] - sum[0]);
}
}
cout << ans << endl;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 885,520 | 885,521 | u275786410 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, k;
string s;
cin >> n >> k >> s;
vector<int> a;
int prev = s[0];
a.push_back(0);
for (int i = 1; i < n; ++i) {
if (prev != s[i])
a.push_back(i);
prev = s[i];
}
a.push_back(n);
int ans = 0;
for (int i = 0; i < a.size(); ++i) {
int m = 2 * k + 1;
if (s[a[i]] == '0') {
m--;
}
ans = max(ans, (m + i < a.size()) ? a[m + i] : n - a[i]);
// cout << a[m+i] - a[i] << endl;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, k;
string s;
cin >> n >> k >> s;
vector<int> a;
int prev = s[0];
a.push_back(0);
for (int i = 1; i < n; ++i) {
if (prev != s[i])
a.push_back(i);
prev = s[i];
}
a.push_back(n);
int ans = 0;
for (int i = 0; i < a.size(); ++i) {
int m = 2 * k + 1;
if (s[a[i]] == '0') {
m--;
}
ans = max(ans, ((m + i < a.size()) ? a[m + i] : n) - a[i]);
// cout << a[m+i] - a[i] << endl;
}
cout << ans << endl;
return 0;
} | [
"call.arguments.change"
] | 885,522 | 885,523 | u023195454 | cpp |
p03074 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <istream>
#include <random>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int N, K;
cin >> N >> K;
string s;
cin >> s;
vector<ll> vec;
//一番左端が0なら調整を加える
if (s[0] == '0')
vec.push_back(0);
// 00..または11…が続いているところをまとめ上げる
for (ll i = 0; i < s.size(); i++) {
ll j = i;
//一緒の間ループを回し続けて，切れ目を探す
while (j < s.size() && s[j] == s[i]) {
++j;
}
vec.push_back(j - i);
//次の始点へすっ飛ばす
i = j;
}
//最高尾が0だったら調整を加える
if (s[s.length() - 1] == '0') {
vec.push_back(0);
}
//累積和を取る
//始点は0から
vector<ll> sum(vec.size() + 1, 0);
for (ll i = 0; i < vec.size(); i++) {
sum[i + 1] = sum[i] + vec[i];
}
//累積和メイン
ll ans = 0;
for (ll left = 0; left < sum.size(); left += 2) {
ll right = left + K * 2 + 1;
if (right >= sum.size()) {
right = sum.size() - 1;
}
ans = max(ans, sum[right] - sum[left]);
}
cout << ans << endl;
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <istream>
#include <random>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int N, K;
cin >> N >> K;
string s;
cin >> s;
vector<ll> vec;
//一番左端が0なら調整を加える
if (s[0] == '0')
vec.push_back(0);
// 00..または11…が続いているところをまとめ上げる
for (ll i = 0; i < s.size();) {
ll j = i;
//一緒の間ループを回し続けて，切れ目を探す
while (j < s.size() && s[j] == s[i]) {
++j;
}
vec.push_back(j - i);
//次の始点へすっ飛ばす
i = j;
}
//最高尾が0だったら調整を加える
if (s[s.length() - 1] == '0') {
vec.push_back(0);
}
//累積和を取る
//始点は0から
vector<ll> sum(vec.size() + 1, 0);
for (ll i = 0; i < vec.size(); i++) {
sum[i + 1] = sum[i] + vec[i];
}
//累積和メイン
ll ans = 0;
for (ll left = 0; left < sum.size(); left += 2) {
ll right = left + K * 2 + 1;
if (right >= sum.size()) {
right = sum.size() - 1;
}
ans = max(ans, sum[right] - sum[left]);
}
cout << ans << endl;
} | [
"control_flow.loop.for.update.change"
] | 885,526 | 885,527 | u048791623 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using edge = pair<ll, P>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
using Graph = vector<vector<ll>>;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const int ddx[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const int ddy[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll MOD = 1000000007;
const ll INF = 1000000000000000000L;
#ifdef __DEBUG
#include "cpp-pyprint/pyprint.h"
#endif
void Main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
int ans = 0;
int left = 0;
int right = 0;
int remain = K;
if (S[0] == '0') {
remain--;
}
while (left < N) {
while (remain >= 0 && right < N) {
if (S[right] == '1' && right + 1 < N && S[right + 1] == '0') {
remain--;
}
right++;
}
ans = max(ans, right - left);
if (right == left) {
right++;
} else {
if (S[left] == '0' && left - 1 >= 0 && S[left - 1] == '1') {
remain++;
}
}
left++;
}
cout << ans << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using edge = pair<ll, P>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
using Graph = vector<vector<ll>>;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const int ddx[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const int ddy[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll MOD = 1000000007;
const ll INF = 1000000000000000000L;
#ifdef __DEBUG
#include "cpp-pyprint/pyprint.h"
#endif
void Main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
int ans = 0;
int left = 0;
int right = 0;
int remain = K;
if (S[0] == '0') {
remain--;
}
while (left < N) {
while (remain >= 0 && right < N) {
if (S[right] == '1' && right + 1 < N && S[right + 1] == '0') {
remain--;
}
right++;
}
ans = max(ans, right - left);
if (right == left) {
right++;
}
if (S[left] == '0' && left + 1 >= 0 && S[left + 1] == '1') {
remain++;
}
left++;
}
cout << ans << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"variable_access.subscript.index.change"
] | 885,528 | 885,529 | u427344224 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using edge = pair<ll, P>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
using Graph = vector<vector<ll>>;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const int ddx[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const int ddy[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll MOD = 1000000007;
const ll INF = 1000000000000000000L;
#ifdef __DEBUG
#include "cpp-pyprint/pyprint.h"
#endif
void Main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
int ans = 0;
int left = 0;
int right = 0;
int remain = K;
if (S[0] == '0') {
remain--;
}
while (left < N) {
while (remain >= 0 && right < N) {
if (S[right] == '1' && right + 1 < N && S[right + 1] == '0') {
remain--;
}
right++;
}
ans = max(ans, right - left);
if (right == left) {
right++;
}
if (S[left] == '0' && left - 1 >= 0 && S[left - 1] == '1') {
remain++;
}
left++;
}
cout << ans << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using edge = pair<ll, P>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
using Graph = vector<vector<ll>>;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const int ddx[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const int ddy[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll MOD = 1000000007;
const ll INF = 1000000000000000000L;
#ifdef __DEBUG
#include "cpp-pyprint/pyprint.h"
#endif
void Main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
int ans = 0;
int left = 0;
int right = 0;
int remain = K;
if (S[0] == '0') {
remain--;
}
while (left < N) {
while (remain >= 0 && right < N) {
if (S[right] == '1' && right + 1 < N && S[right + 1] == '0') {
remain--;
}
right++;
}
ans = max(ans, right - left);
if (right == left) {
right++;
}
if (S[left] == '0' && left + 1 >= 0 && S[left + 1] == '1') {
remain++;
}
left++;
}
cout << ans << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"variable_access.subscript.index.change"
] | 885,530 | 885,529 | u427344224 | cpp |
p03074 | #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;
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"call.add"
] | 885,549 | 885,550 | u562319622 | cpp |
p03074 | #include <algorithm>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#ifdef LDEBUG
#define debug(x) cout << #x << ":" << x << endl
#else
#define debug(...)
#endif
#define REP(i, n) for (int i = 0; i < n; ++i)
typedef unsigned long long u64;
typedef long long i64;
int n, k;
string s;
vector<int> v;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n >> k >> s;
int i = 0, j = 0;
while (i < n) {
v.push_back(i);
j = i;
while (s[i] == s[j] && j < n)
j++;
i = j;
}
v.push_back(n);
REP(z, v.size())
debug(v[z]);
int m = 0;
REP(z, v.size()) {
int idx = v[z];
if (s[idx] == '0') {
m = max(m, v[min(z + 2 * k, (int)v.size() - 1)] - v[z]);
} else {
m = max(m, v[min(z + 2 * k + 2, (int)v.size() - 1)] - v[z]);
}
}
cout << m << endl;
return 0;
} | #include <algorithm>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#ifdef LDEBUG
#define debug(x) cout << #x << ":" << x << endl
#else
#define debug(...)
#endif
#define REP(i, n) for (int i = 0; i < n; ++i)
typedef unsigned long long u64;
typedef long long i64;
int n, k;
string s;
vector<int> v;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n >> k >> s;
int i = 0, j = 0;
while (i < n) {
v.push_back(i);
j = i;
while (s[i] == s[j] && j < n)
j++;
i = j;
}
v.push_back(n);
REP(z, v.size())
debug(v[z]);
int m = 0;
REP(z, v.size()) {
int idx = v[z];
if (s[idx] == '0') {
m = max(m, v[min(z + 2 * k, (int)v.size() - 1)] - v[z]);
} else {
m = max(m, v[min(z + 2 * k + 1, (int)v.size() - 1)] - v[z]);
}
}
cout << m << endl;
return 0;
}
| [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 885,556 | 885,557 | u742504115 | cpp |
p03074 | #include <bits/stdc++.h>
#define L long long
#define ff first
#define ss second
using namespace std;
const int N = 100005;
int a[N], b[N], sum[N];
int n, K, idx = 0, onz, zero;
int main() {
cin >> n >> K;
string x;
cin >> x;
for (int i = 0; i < n; i++) {
if (x[i] == '0') {
if (onz)
idx++, b[idx] = 1, sum[idx] = sum[idx - 1] + onz, onz = 0;
zero++;
} else {
if (zero)
idx++, b[idx] = 0, sum[idx] = sum[idx - 1] + zero, zero = 0;
onz++;
}
}
if (onz)
idx++, b[idx] = 1, sum[idx] = sum[idx - 1] + onz;
else if (zero)
idx++, b[idx] = 0, sum[idx] = sum[idx - 1] + zero;
int k = K, y;
n = idx;
int Max = 0;
for (int i = 1; i <= n; i++) {
if (b[i] == 0) {
int t = k - 1;
y = min(i + 2 * t + 1, n);
Max = max(Max, sum[y] - sum[i - 1]);
} else {
y = min(i + 2 * k + 1, n);
Max = max(Max, sum[y] - sum[i - 1]);
}
}
cout << Max << endl;
// 1010101
return 0;
}
| #include <bits/stdc++.h>
#define L long long
#define ff first
#define ss second
using namespace std;
const int N = 100005;
int a[N], b[N], sum[N];
int n, K, idx = 0, onz, zero;
int main() {
cin >> n >> K;
string x;
cin >> x;
for (int i = 0; i < n; i++) {
if (x[i] == '0') {
if (onz)
idx++, b[idx] = 1, sum[idx] = sum[idx - 1] + onz, onz = 0;
zero++;
} else {
if (zero)
idx++, b[idx] = 0, sum[idx] = sum[idx - 1] + zero, zero = 0;
onz++;
}
}
if (onz)
idx++, b[idx] = 1, sum[idx] = sum[idx - 1] + onz;
else if (zero)
idx++, b[idx] = 0, sum[idx] = sum[idx - 1] + zero;
int k = K, y;
n = idx;
int Max = 0;
for (int i = 1; i <= n; i++) {
if (b[i] == 0) {
int t = k - 1;
y = min(i + 2 * t + 1, n);
Max = max(Max, sum[y] - sum[i - 1]);
} else {
y = min(i + 2 * k, n);
Max = max(Max, sum[y] - sum[i - 1]);
}
}
cout << Max << endl;
// 1010
return 0;
}
| [
"expression.operation.binary.remove"
] | 885,560 | 885,561 | u521171255 | cpp |
p03074 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> count;
if (S[0] == '0')
count.push_back(0);
for (int i = 0; i < N; i++) {
int j = i;
while (j < N && S[j] == S[i])
++j;
count.push_back(j - i);
i = j;
}
if (S.back() == '0')
count.push_back(0);
vector<int> sums(count.size() + 1, 0);
for (int i = 0; i < count.size(); i++)
sums[i + 1] = sums[i] + count[i];
int res = 0;
for (int left = 0; left < sums.size(); left += 2) {
int right =
(left + K * 2 + 1 >= sums.size() ? sums.size() - 1 : left + K * 2 + 1);
res = max(res, sums[right] - sums[left]);
}
cout << res << endl;
}
| #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> count;
if (S[0] == '0')
count.push_back(0);
for (int i = 0; i < N; i++) {
int j = i;
while (j < N && S[j] == S[i])
++j;
count.push_back(j - i);
i = j - 1;
}
if (S.back() == '0')
count.push_back(0);
vector<int> sums(count.size() + 1, 0);
for (int i = 0; i < count.size(); i++)
sums[i + 1] = sums[i] + count[i];
int res = 0;
for (int left = 0; left < sums.size(); left += 2) {
int right =
(left + K * 2 + 1 >= sums.size() ? sums.size() - 1 : left + K * 2 + 1);
res = max(res, sums[right] - sums[left]);
}
cout << res << endl;
}
| [
"assignment.change"
] | 885,564 | 885,565 | u940000534 | cpp |
p03074 | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int n, k, i;
int ans = 0;
std::cin >> n >> k;
string s;
std::cin >> s;
int num = 0;
int a[n];
if (s[0] == '0') {
a[0] = 0;
num++;
}
for (i = 1; i < n; i++) {
if (s[i - 1] == '0' && s[i] == '1') {
a[num] = i;
num++;
}
if (s[i - 1] == '1' && s[i] == '0') {
a[num] = i;
num++;
}
}
if (s[n - 1] == '1') {
a[num] = n;
num++;
}
if (s[n - 1] == '0') {
a[num] = n;
num++;
a[num] = n;
num++;
}
// for (i=0;i<num;i++){std::cout << a[i] << std::endl;}
if (num - 1 <= 2 * k)
std::cout << n << std::endl;
else {
for (i = 0; i < (num - 2 * k - 1) / 2; i++) {
if (i == 0)
ans = a[2 * k];
else {
if (a[2 * (k + i)] - a[2 * i - 1] > ans)
ans = a[2 * (k + i)] - a[2 * i - 1];
}
}
std::cout << ans << std::endl;
}
}
| #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int n, k, i;
int ans = 0;
std::cin >> n >> k;
string s;
std::cin >> s;
int num = 0;
int a[n];
if (s[0] == '0') {
a[0] = 0;
num++;
}
for (i = 1; i < n; i++) {
if (s[i - 1] == '0' && s[i] == '1') {
a[num] = i;
num++;
}
if (s[i - 1] == '1' && s[i] == '0') {
a[num] = i;
num++;
}
}
if (s[n - 1] == '1') {
a[num] = n;
num++;
}
if (s[n - 1] == '0') {
a[num] = n;
num++;
a[num] = n;
num++;
}
// for (i=0;i<num;i++){std::cout << a[i] << std::endl;}
if (num - 1 <= 2 * k)
std::cout << n << std::endl;
else {
for (i = 0; i < (num - 2 * k + 1) / 2; i++) {
if (i == 0)
ans = a[2 * k];
else {
if (a[2 * (k + i)] - a[2 * i - 1] > ans)
ans = a[2 * (k + i)] - a[2 * i - 1];
}
}
std::cout << ans << std::endl;
}
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 885,566 | 885,567 | u409569205 | cpp |
p03074 | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int n, k, i;
int ans = 0;
std::cin >> n >> k;
string s;
std::cin >> s;
int num = 0;
int a[n];
if (s[0] == '0') {
a[0] = 0;
num++;
}
for (i = 1; i < n; i++) {
if (s[i - 1] == '0' && s[i] == '1') {
a[num] = i;
num++;
}
if (s[i - 1] == '1' && s[i] == '0') {
a[num] = i;
num++;
}
}
if (s[n - 1] == '1') {
a[num] = n;
num++;
}
if (s[n - 1] == '0') {
a[num] = n;
num++;
a[num] = n;
num++;
}
// for (i=0;i<num;i++){std::cout << a[i] << std::endl;}
if (num - 1 <= 2 * k)
std::cout << n << std::endl;
else {
for (i = 0; i < num - 2 * k - 1; i++) {
if (i == 0)
ans = a[2 * k];
else {
if (a[2 * (k + i)] - a[2 * i - 1] > ans)
ans = a[2 * (k + i)] - a[2 * i - 1];
}
}
std::cout << ans << std::endl;
}
}
| #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int n, k, i;
int ans = 0;
std::cin >> n >> k;
string s;
std::cin >> s;
int num = 0;
int a[n];
if (s[0] == '0') {
a[0] = 0;
num++;
}
for (i = 1; i < n; i++) {
if (s[i - 1] == '0' && s[i] == '1') {
a[num] = i;
num++;
}
if (s[i - 1] == '1' && s[i] == '0') {
a[num] = i;
num++;
}
}
if (s[n - 1] == '1') {
a[num] = n;
num++;
}
if (s[n - 1] == '0') {
a[num] = n;
num++;
a[num] = n;
num++;
}
// for (i=0;i<num;i++){std::cout << a[i] << std::endl;}
if (num - 1 <= 2 * k)
std::cout << n << std::endl;
else {
for (i = 0; i < (num - 2 * k + 1) / 2; i++) {
if (i == 0)
ans = a[2 * k];
else {
if (a[2 * (k + i)] - a[2 * i - 1] > ans)
ans = a[2 * (k + i)] - a[2 * i - 1];
}
}
std::cout << ans << std::endl;
}
}
| [
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.loop.for.condition.change"
] | 885,568 | 885,567 | u409569205 | cpp |
p03074 | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int n, k, i;
int ans = 0;
std::cin >> n >> k;
string s;
std::cin >> s;
int num = 0;
int a[n];
if (s[0] == '0') {
a[0] = 0;
num++;
}
for (i = 1; i < n; i++) {
if (s[i - 1] == '0' && s[i] == '1') {
a[num] = i;
num++;
}
if (s[i - 1] == '1' && s[i] == '0') {
a[num] = i;
num++;
}
}
if (s[n - 1] == '1') {
a[num] = n;
num++;
}
if (s[n - 1] == '0') {
a[num] = n;
num++;
a[num] = n;
num++;
}
// for (i=0;i<num;i++){std::cout << a[i] << std::endl;}
if (num - 1 < 2 * k)
std::cout << n << std::endl;
else {
for (i = 0; i < num - 2 * k - 1; i++) {
if (i == 0)
ans = a[2 * k];
else {
if (a[2 * (k + i)] - a[2 * i - 1] > ans)
ans = a[2 * (k + i)] - a[2 * i - 1];
}
}
std::cout << ans << std::endl;
}
}
| #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int n, k, i;
int ans = 0;
std::cin >> n >> k;
string s;
std::cin >> s;
int num = 0;
int a[n];
if (s[0] == '0') {
a[0] = 0;
num++;
}
for (i = 1; i < n; i++) {
if (s[i - 1] == '0' && s[i] == '1') {
a[num] = i;
num++;
}
if (s[i - 1] == '1' && s[i] == '0') {
a[num] = i;
num++;
}
}
if (s[n - 1] == '1') {
a[num] = n;
num++;
}
if (s[n - 1] == '0') {
a[num] = n;
num++;
a[num] = n;
num++;
}
// for (i=0;i<num;i++){std::cout << a[i] << std::endl;}
if (num - 1 <= 2 * k)
std::cout << n << std::endl;
else {
for (i = 0; i < (num - 2 * k + 1) / 2; i++) {
if (i == 0)
ans = a[2 * k];
else {
if (a[2 * (k + i)] - a[2 * i - 1] > ans)
ans = a[2 * (k + i)] - a[2 * i - 1];
}
}
std::cout << ans << std::endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.loop.for.condition.change"
] | 885,569 | 885,567 | u409569205 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string str;
cin >> str;
vector<pair<int, int>> zerSegs;
int st;
for (int i = 0; i < n; ++i) {
if (str[i] == '1' && i != 0 && str[i - 1] == '0') {
zerSegs.push_back({st, i - 1});
} else if (str[i] == '0' && (str[i - 1] == '1' || i == 0)) {
st = i;
}
if (str[i] == '0' && i == n - 1) {
zerSegs.push_back({st, i});
}
}
int numSegs = zerSegs.size();
if (k >= numSegs) {
cout << n << "\n";
return 0;
}
int mxlen = 0;
for (int i = 0; i + k <= numSegs; ++i) {
if (i == 0) {
mxlen = max(mxlen, zerSegs[i + k].first);
} else if (i + k == numSegs) {
mxlen = max(mxlen, n - zerSegs[i - 1].second - 1);
} else {
mxlen = max(mxlen, zerSegs[i + k].first + 1 - zerSegs[i - 1].second);
}
}
cout << mxlen << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string str;
cin >> str;
vector<pair<int, int>> zerSegs;
int st;
for (int i = 0; i < n; ++i) {
if (str[i] == '1' && i != 0 && str[i - 1] == '0') {
zerSegs.push_back({st, i - 1});
} else if (str[i] == '0' && (str[i - 1] == '1' || i == 0)) {
st = i;
}
if (str[i] == '0' && i == n - 1) {
zerSegs.push_back({st, i});
}
}
int numSegs = zerSegs.size();
if (k >= numSegs) {
cout << n << "\n";
return 0;
}
int mxlen = 0;
for (int i = 0; i + k <= numSegs; ++i) {
if (i == 0) {
mxlen = max(mxlen, zerSegs[i + k].first);
} else if (i + k == numSegs) {
mxlen = max(mxlen, n - zerSegs[i - 1].second - 1);
} else {
mxlen = max(mxlen, zerSegs[i + k].first - 1 - zerSegs[i - 1].second);
}
}
cout << mxlen << "\n";
return 0;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 885,574 | 885,575 | u210162517 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string str;
cin >> str;
vector<pair<int, int>> zerSegs;
int st;
for (int i = 0; i < n; ++i) {
if (str[i] == '1' && i != 0 && str[i - 1] == '0') {
zerSegs.push_back({st, i - 1});
} else if (str[i] == '0' && (str[i - 1] == '1' || i == 0)) {
st = i;
}
if (str[i] == '0' && i == n - 1) {
zerSegs.push_back({st, i});
}
}
int numSegs = zerSegs.size();
if (k >= numSegs) {
cout << n << "\n";
return 0;
}
int mxlen = 0;
for (int i = 0; i + k <= numSegs; ++i) {
if (i == 0) {
mxlen = max(mxlen, zerSegs[i + k].first);
} else if (i + k == numSegs) {
mxlen = max(mxlen, n - zerSegs[i].first + 1);
} else {
mxlen = max(mxlen, zerSegs[i + k].first - 1 - zerSegs[i - 1].second);
}
}
cout << mxlen << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string str;
cin >> str;
vector<pair<int, int>> zerSegs;
int st;
for (int i = 0; i < n; ++i) {
if (str[i] == '1' && i != 0 && str[i - 1] == '0') {
zerSegs.push_back({st, i - 1});
} else if (str[i] == '0' && (str[i - 1] == '1' || i == 0)) {
st = i;
}
if (str[i] == '0' && i == n - 1) {
zerSegs.push_back({st, i});
}
}
int numSegs = zerSegs.size();
if (k >= numSegs) {
cout << n << "\n";
return 0;
}
int mxlen = 0;
for (int i = 0; i + k <= numSegs; ++i) {
if (i == 0) {
mxlen = max(mxlen, zerSegs[i + k].first);
} else if (i + k == numSegs) {
mxlen = max(mxlen, n - zerSegs[i - 1].second - 1);
} else {
mxlen = max(mxlen, zerSegs[i + k].first - 1 - zerSegs[i - 1].second);
}
}
cout << mxlen << "\n";
return 0;
}
| [] | 885,576 | 885,575 | u210162517 | cpp |
p03074 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int ans = 0;
int N;
cin >> N;
int K;
cin >> 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って感じの配列が欲しい
// 1-0-1-0みたいに0で終わってたら、適当に一つたす
if (Nums.size() % 2 == 0)
Nums.push_back(0);
vector<int> sum(Nums.size() + 1);
for (int i = 0; i < Nums.size(); i++) {
sum[i + 1] = sum[i] + Nums[i];
}
int Add = 2 * K + 1;
for (int i = 0; i < Nums.size(); i++) {
int tmp = 0;
int left = i;
int right = min(i + Add, (int)Nums.size());
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 ans = 0;
int N;
cin >> N;
int K;
cin >> 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って感じの配列が欲しい
// 1-0-1-0みたいに0で終わってたら、適当に一つたす
if (Nums.size() % 2 == 0)
Nums.push_back(0);
vector<int> sum(Nums.size() + 1);
for (int i = 0; i < Nums.size(); i++) {
sum[i + 1] = sum[i] + Nums[i];
}
int Add = 2 * K + 1;
for (int i = 0; i < Nums.size(); i += 2) {
int tmp = 0;
int left = i;
int right = min(i + Add, (int)Nums.size());
tmp = sum[right] - sum[left];
ans = max(tmp, ans);
}
cout << ans << endl;
}
| [] | 885,581 | 885,582 | u791220701 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
char beg = S[0], en = S[N - 1];
vi C0, C1;
int l = 0;
for (int i = 0; i <= N; ++i) {
if (i == 0)
l++;
else if (i == N) {
if (S[i - 1] == '0')
C0.push_back(l);
else
C1.push_back(l);
}
else {
if (S[i] != S[i - 1]) {
if (S[i - 1] == '0') {
C0.push_back(l);
l = 1;
} else {
C1.push_back(l);
l = 1;
}
} else
l++;
}
}
int L = C0.size();
if (L <= K) {
cout << N << endl;
return 0;
}
C1.push_back(0);
int tmp = 0;
int ans = 0;
if (beg == '0') {
for (int i = 0; i < K; ++i) {
tmp += C0[i] + C1[i];
}
ans = tmp;
for (int i = K; i < L; ++i) {
if (i == K) {
tmp += C0[i] + C1[i] - C0[0];
ans = max(tmp, ans);
}
tmp += C0[i] + C1[i] - C0[i - K] - C1[i - K - 1];
ans = max(ans, tmp);
}
}
else {
tmp += C1[0];
for (int i = 0; i < K; ++i) {
tmp += C0[i] + C1[i + 1];
}
ans = tmp;
for (int i = K; i < L; ++i) {
tmp += C0[i] + C1[i + 1] - C0[i - K] - C1[i - K];
ans = max(ans, tmp);
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
char beg = S[0], en = S[N - 1];
vi C0, C1;
int l = 0;
for (int i = 0; i <= N; ++i) {
if (i == 0)
l++;
else if (i == N) {
if (S[i - 1] == '0')
C0.push_back(l);
else
C1.push_back(l);
}
else {
if (S[i] != S[i - 1]) {
if (S[i - 1] == '0') {
C0.push_back(l);
l = 1;
} else {
C1.push_back(l);
l = 1;
}
} else
l++;
}
}
int L = C0.size();
if (L <= K) {
cout << N << endl;
return 0;
}
C1.push_back(0);
int tmp = 0;
int ans = 0;
if (beg == '0') {
for (int i = 0; i < K; ++i) {
tmp += C0[i] + C1[i];
}
ans = tmp;
for (int i = K; i < L; ++i) {
if (i == K) {
tmp += C0[i] + C1[i] - C0[0];
ans = max(tmp, ans);
} else {
tmp += C0[i] + C1[i] - C0[i - K] - C1[i - K - 1];
ans = max(ans, tmp);
}
}
}
else {
tmp += C1[0];
for (int i = 0; i < K; ++i) {
tmp += C0[i] + C1[i + 1];
}
ans = tmp;
for (int i = K; i < L; ++i) {
tmp += C0[i] + C1[i + 1] - C0[i - K] - C1[i - K];
ans = max(ans, tmp);
}
}
cout << ans << endl;
return 0;
}
| [
"control_flow.branch.else.add"
] | 885,587 | 885,588 | u826487371 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
char beg = S[0], en = S[N - 1];
vi C0, C1;
int l = 0;
for (int i = 0; i <= N; ++i) {
if (i == 0)
l++;
else if (i == N) {
if (S[i - 1] == '0')
C0.push_back(l);
else
C1.push_back(l);
}
else {
if (S[i] != S[i - 1]) {
if (S[i - 1] == '0') {
C0.push_back(l);
l = 1;
} else {
C1.push_back(l);
l = 1;
}
} else
l++;
}
}
int L = C0.size();
if (L <= K) {
cout << N << endl;
return 0;
}
C1.push_back(0);
int tmp = 0;
int ans = 0;
if (beg == '0') {
for (int i = 0; i < K; ++i) {
tmp += C0[i] + C1[i];
}
ans = tmp;
for (int i = K; i < L; ++i) {
if (i == K) {
tmp += C0[i] + C1[i] - C0[0];
ans = max(tmp, ans);
}
tmp += C0[i] + C1[i] - C0[i - K] - C1[i - K];
ans = max(ans, tmp);
}
}
else {
tmp += C1[0];
for (int i = 0; i < K; ++i) {
tmp += C0[i] + C1[i + 1];
}
ans = tmp;
for (int i = K; i < L; ++i) {
tmp += C0[i] + C1[i + 1] - C0[i - K] - C1[i - K];
ans = max(ans, tmp);
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
char beg = S[0], en = S[N - 1];
vi C0, C1;
int l = 0;
for (int i = 0; i <= N; ++i) {
if (i == 0)
l++;
else if (i == N) {
if (S[i - 1] == '0')
C0.push_back(l);
else
C1.push_back(l);
}
else {
if (S[i] != S[i - 1]) {
if (S[i - 1] == '0') {
C0.push_back(l);
l = 1;
} else {
C1.push_back(l);
l = 1;
}
} else
l++;
}
}
int L = C0.size();
if (L <= K) {
cout << N << endl;
return 0;
}
C1.push_back(0);
int tmp = 0;
int ans = 0;
if (beg == '0') {
for (int i = 0; i < K; ++i) {
tmp += C0[i] + C1[i];
}
ans = tmp;
for (int i = K; i < L; ++i) {
if (i == K) {
tmp += C0[i] + C1[i] - C0[0];
ans = max(tmp, ans);
} else {
tmp += C0[i] + C1[i] - C0[i - K] - C1[i - K - 1];
ans = max(ans, tmp);
}
}
}
else {
tmp += C1[0];
for (int i = 0; i < K; ++i) {
tmp += C0[i] + C1[i + 1];
}
ans = tmp;
for (int i = K; i < L; ++i) {
tmp += C0[i] + C1[i + 1] - C0[i - K] - C1[i - K];
ans = max(ans, tmp);
}
}
cout << ans << endl;
return 0;
}
| [
"control_flow.branch.else.add",
"assignment.change"
] | 885,589 | 885,588 | u826487371 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vi zero_endpts;
vi one_endpts;
for (int i = 0; i < N; ++i) {
if (i == N - 1) {
if (S[i] == '0') {
zero_endpts.push_back(i + 1);
} else {
one_endpts.push_back(i + 1);
}
} else {
if (S[i] == '0' && S[i + 1] == '1') {
zero_endpts.push_back(i + 1);
} else if (S[i] == '1' && S[i + 1] == '0') {
one_endpts.push_back(i + 1);
}
}
}
int ans = 0;
int M = zero_endpts.size();
int L = one_endpts.size();
if (M <= K) {
ans = N;
} else if (L == 0) {
ans = N;
} else {
if (S[0] == '0') {
int best_score = one_endpts[K - 1];
for (int i = K; i < M; ++i) {
if (zero_endpts[i] != N - 1) {
best_score = max(best_score, one_endpts[i] - zero_endpts[i - K]);
} else {
best_score = max(best_score, zero_endpts[i] - zero_endpts[i - K]);
}
}
ans = best_score;
}
else {
int best_score;
if (L >= K + 1) {
best_score = one_endpts[K];
} else {
best_score = N;
}
for (int i = K; i < M; ++i) {
if (zero_endpts[i] != N - 1) {
best_score = max(best_score, one_endpts[i + 1] - zero_endpts[i - K]);
} else {
best_score = max(best_score, zero_endpts[i] - zero_endpts[i - K]);
}
}
ans = best_score;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vi zero_endpts;
vi one_endpts;
for (int i = 0; i < N; ++i) {
if (i == N - 1) {
if (S[i] == '0') {
zero_endpts.push_back(i + 1);
} else {
one_endpts.push_back(i + 1);
}
} else {
if (S[i] == '0' && S[i + 1] == '1') {
zero_endpts.push_back(i + 1);
} else if (S[i] == '1' && S[i + 1] == '0') {
one_endpts.push_back(i + 1);
}
}
}
int ans = 0;
int M = zero_endpts.size();
int L = one_endpts.size();
if (M <= K) {
ans = N;
} else if (L == 0) {
ans = N;
} else {
if (S[0] == '0') {
int best_score = one_endpts[K - 1];
for (int i = K; i < M; ++i) {
if (zero_endpts[i] != N) {
best_score = max(best_score, one_endpts[i] - zero_endpts[i - K]);
} else {
best_score = max(best_score, zero_endpts[i] - zero_endpts[i - K]);
}
}
ans = best_score;
}
else {
int best_score;
if (L >= K + 1) {
best_score = one_endpts[K];
} else {
best_score = N;
}
for (int i = K; i < M; ++i) {
if (zero_endpts[i] != N) {
best_score = max(best_score, one_endpts[i + 1] - zero_endpts[i - K]);
} else {
best_score = max(best_score, zero_endpts[i] - zero_endpts[i - K]);
}
}
ans = best_score;
}
}
cout << ans << endl;
return 0;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 885,590 | 885,591 | u826487371 | cpp |
p03074 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> K >> S;
vector<int> last;
last.push_back(0);
int i = 0;
while (i < N - 1) {
if (S[i] != S[i + 1]) {
last.push_back(i + 1);
}
i++;
}
last.push_back(N);
int len = last.size();
/*for(int i=0;i<len;i++) cout << last[i] << " ";
cout <<endl;*/
int ans = 0;
if (S[0] == '1') {
for (int i = 0; 2 * i + 1 < len + 1; i++) {
int a = max(0, 2 * i - 2 * K);
int b = min(len - 1, 2 * i + 1);
ans = max(ans, last[b] - last[a]);
// cout << ans <<endl;
}
} else {
for (int i = 0; 2 * i < len + 1; i++) {
int a = max(0, 2 * i - 2 * K - 1);
int b = max(len - 1, 2 * i);
ans = max(ans, last[2 * i] - last[a]);
}
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> K >> S;
vector<int> last;
last.push_back(0);
int i = 0;
while (i < N - 1) {
if (S[i] != S[i + 1]) {
last.push_back(i + 1);
}
i++;
}
last.push_back(N);
int len = last.size();
/*for(int i=0;i<len;i++) cout << last[i] << " ";
cout <<endl;*/
int ans = 0;
if (S[0] == '1') {
for (int i = 0; 2 * i + 1 < len + 1; i++) {
int a = max(0, 2 * i - 2 * K);
int b = min(len - 1, 2 * i + 1);
ans = max(ans, last[b] - last[a]);
// cout << ans <<endl;
}
} else {
for (int i = 0; 2 * i < len + 1; i++) {
int a = max(0, 2 * i - 2 * K - 1);
int b = min(len - 1, 2 * i);
ans = max(ans, last[b] - last[a]);
}
}
cout << ans << endl;
return 0;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 885,592 | 885,593 | u797165415 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
#define INCANT cin.tie(0), ios::sync_with_stdio(false)
#define int long long
#define double long double
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define gcd __gcd
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define sz(x) x.size()
#define all(x) (x).begin(), (x).end()
#define sortv(v) sort(all(v))
#define sortvg(v) sort(all(v), greater<int>())
#define countv(v, c) count(all(v), c)
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(...) _overload(__VA_ARGS__, repi, _rep)(__VA_ARGS__)
#define _rev(i, n) revi(i, n, 0)
#define revi(i, a, b) for (int i = (int)(a - 1); i >= (int)(b); i--)
#define rev(...) _overload(__VA_ARGS__, revi, _rev)(__VA_ARGS__)
#define each(i, n) for (auto &&i : n)
#define inv(x) each(i, x) in(i)
#define out(x) cout << (x)
#define space() cout << " "
#define indent() cout << '\n'
#define print(x) out(x), indent()
#define printv(x) \
each(i, x) out(i), space(); \
indent()
#define debug(x, ...) cerr << __LINE__ << ": " << #x << ": " << (x) << '\n'
#define YN(x) out((x) ? "YES" : "NO"), indent()
#define Yn(x) out((x) ? "Yes" : "No"), indent()
#define yn(x) out((x) ? "yes" : "no"), indent()
void in() {}
template <typename F, typename... R> void in(F &f, R &...r) {
cin >> f, in(r...);
}
const int INF = 1e16, MOD = 1e9 + 7, LIMIT = 100001, S_LIMIT = 101;
const int dx[] = {0, 0, 1, 0, -1, -1, 1, 1, -1},
dy[] = {0, -1, 0, 1, 0, -1, -1, 1, 1};
const string alphabet = "abcdefghijklmnopqrstuvwxyz";
const string ALPHABET = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int g[S_LIMIT][S_LIMIT] = {};
int lcm(int a, int b) { return a / gcd(a, b) * b; }
int modpow(int x, int n) {
return n < 2 ? x : modpow(x * x % MOD, n / 2) * (n % 2 ? x : 1) % MOD;
}
int factorial(int a) { return a < 2 ? 1 : factorial(a - 1) * a; }
int modfact(int a) { return a < 2 ? 1 : factorial(a - 1) * a % MOD; }
int summation(int a) { return a < 1 ? 0 : (a * a + a) / 2; }
int combination(int n, int r) {
int res = 1;
rep(i, 1, r + 1) { res *= n--, res /= i; }
return res;
}
int modcomb(int n, int r) {
return modfact(n) * modpow(modfact(r), MOD - 2) % MOD *
modpow(modfact(n - r), MOD - 2) % MOD;
}
bool isPrime(int n) {
rep(i, 2, sqrt(n) + 1) {
if (i > 3) {
i++;
}
if (!(n % i)) {
return false;
}
}
return true;
}
void warshall(int n) {
rep(i, n) {
rep(j, n) {
rep(k, n) { chmin(g[j][k], g[j][i] + g[i][k]); }
}
}
}
vector<int> divisor(int n) {
vector<int> ans;
rep(i, 1, sqrt(n) + 1) {
if (!(n % i)) {
ans.pb(i);
if (i * i < n) {
ans.pb(n / i);
}
}
}
return ans;
}
map<int, int> factorization(int n) {
map<int, int> ans;
rep(i, 2, sqrt(n) + 1) {
if (i > 3) {
i++;
}
while (!(n % i)) {
ans[i]++, n /= i;
}
}
if (n > 1) {
ans[n]++;
}
return ans;
}
struct UF {
vector<int> t;
UF(int size) : t(size, -1) {}
int root(int x) { return t[x] < 0 ? x : t[x] = root(t[x]); }
int size(int x) { return -t[root(x)]; }
bool isSame(int x, int y) { return root(x) == root(y); }
bool unite(int x, int y) {
x = root(x), y = root(y);
if (x != y) {
if (t[y] < t[x]) {
swap(x, y);
}
t[x] += t[y], t[y] = x;
}
return x != y;
}
};
int a, b, c, k, n, m, l, r, x, y, h, w, res = 0, cnt0 = 0, cnt1 = 0, sum = 0,
mx = -INF, mn = INF;
string s, t;
main() {
INCANT;
in(n, k, s);
vector<int> num0, num1;
num1.pb(0);
rep(i, s.size()) {
if (s[i] == '0') {
cnt0++;
} else {
cnt1++;
}
if (i) {
if (s[i] == '0') {
if (cnt1) {
num1.pb(cnt1);
}
cnt1 = 0;
} else {
if (cnt0) {
num0.pb(cnt0);
}
cnt0 = 0;
}
}
}
if (cnt0) {
num0.pb(cnt0);
}
if (cnt1) {
num1.pb(cnt1);
}
num1.pb(0);
if (s[0] == '1') {
rep(i, 1, min((int)num1.size(), k + 2)) { sum += num1[i]; }
rep(i, min((int)num0.size(), k)) { sum += num0[i]; }
chmax(res, sum);
debug(sum);
rep(i, k, num0.size()) {
sum += num0[i] + num1[i + 1];
sum -= num0[i - k] + num1[i - k + 1];
chmax(res, sum);
debug(sum);
}
} else {
rep(i, 1, min((int)num1.size(), k + 1)) { sum += num1[i]; }
rep(i, min((int)num0.size(), k)) { sum += num0[i]; }
chmax(res, sum);
rep(i, k, num0.size()) {
sum += num0[i] + num1[i + 1];
sum -= num0[i - k] + num1[i - k];
chmax(res, sum);
}
}
out(res);
}
| #include <bits/stdc++.h>
using namespace std;
#define INCANT cin.tie(0), ios::sync_with_stdio(false)
#define int long long
#define double long double
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define gcd __gcd
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define sz(x) x.size()
#define all(x) (x).begin(), (x).end()
#define sortv(v) sort(all(v))
#define sortvg(v) sort(all(v), greater<int>())
#define countv(v, c) count(all(v), c)
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(...) _overload(__VA_ARGS__, repi, _rep)(__VA_ARGS__)
#define _rev(i, n) revi(i, n, 0)
#define revi(i, a, b) for (int i = (int)(a - 1); i >= (int)(b); i--)
#define rev(...) _overload(__VA_ARGS__, revi, _rev)(__VA_ARGS__)
#define each(i, n) for (auto &&i : n)
#define inv(x) each(i, x) in(i)
#define out(x) cout << (x)
#define space() cout << " "
#define indent() cout << '\n'
#define print(x) out(x), indent()
#define printv(x) \
each(i, x) out(i), space(); \
indent()
#define debug(x, ...) cerr << __LINE__ << ": " << #x << ": " << (x) << '\n'
#define YN(x) out((x) ? "YES" : "NO"), indent()
#define Yn(x) out((x) ? "Yes" : "No"), indent()
#define yn(x) out((x) ? "yes" : "no"), indent()
void in() {}
template <typename F, typename... R> void in(F &f, R &...r) {
cin >> f, in(r...);
}
const int INF = 1e16, MOD = 1e9 + 7, LIMIT = 100001, S_LIMIT = 101;
const int dx[] = {0, 0, 1, 0, -1, -1, 1, 1, -1},
dy[] = {0, -1, 0, 1, 0, -1, -1, 1, 1};
const string alphabet = "abcdefghijklmnopqrstuvwxyz";
const string ALPHABET = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int g[S_LIMIT][S_LIMIT] = {};
int lcm(int a, int b) { return a / gcd(a, b) * b; }
int modpow(int x, int n) {
return n < 2 ? x : modpow(x * x % MOD, n / 2) * (n % 2 ? x : 1) % MOD;
}
int factorial(int a) { return a < 2 ? 1 : factorial(a - 1) * a; }
int modfact(int a) { return a < 2 ? 1 : factorial(a - 1) * a % MOD; }
int summation(int a) { return a < 1 ? 0 : (a * a + a) / 2; }
int combination(int n, int r) {
int res = 1;
rep(i, 1, r + 1) { res *= n--, res /= i; }
return res;
}
int modcomb(int n, int r) {
return modfact(n) * modpow(modfact(r), MOD - 2) % MOD *
modpow(modfact(n - r), MOD - 2) % MOD;
}
bool isPrime(int n) {
rep(i, 2, sqrt(n) + 1) {
if (i > 3) {
i++;
}
if (!(n % i)) {
return false;
}
}
return true;
}
void warshall(int n) {
rep(i, n) {
rep(j, n) {
rep(k, n) { chmin(g[j][k], g[j][i] + g[i][k]); }
}
}
}
vector<int> divisor(int n) {
vector<int> ans;
rep(i, 1, sqrt(n) + 1) {
if (!(n % i)) {
ans.pb(i);
if (i * i < n) {
ans.pb(n / i);
}
}
}
return ans;
}
map<int, int> factorization(int n) {
map<int, int> ans;
rep(i, 2, sqrt(n) + 1) {
if (i > 3) {
i++;
}
while (!(n % i)) {
ans[i]++, n /= i;
}
}
if (n > 1) {
ans[n]++;
}
return ans;
}
struct UF {
vector<int> t;
UF(int size) : t(size, -1) {}
int root(int x) { return t[x] < 0 ? x : t[x] = root(t[x]); }
int size(int x) { return -t[root(x)]; }
bool isSame(int x, int y) { return root(x) == root(y); }
bool unite(int x, int y) {
x = root(x), y = root(y);
if (x != y) {
if (t[y] < t[x]) {
swap(x, y);
}
t[x] += t[y], t[y] = x;
}
return x != y;
}
};
int a, b, c, k, n, m, l, r, x, y, h, w, res = 0, cnt0 = 0, cnt1 = 0, sum = 0,
mx = -INF, mn = INF;
string s, t;
main() {
INCANT;
in(n, k, s);
vector<int> num0, num1;
num1.pb(0);
rep(i, s.size()) {
if (s[i] == '0') {
cnt0++;
} else {
cnt1++;
}
if (i) {
if (s[i] == '0') {
if (cnt1) {
num1.pb(cnt1);
}
cnt1 = 0;
} else {
if (cnt0) {
num0.pb(cnt0);
}
cnt0 = 0;
}
}
}
if (cnt0) {
num0.pb(cnt0);
}
if (cnt1) {
num1.pb(cnt1);
}
num1.pb(0);
if (s[0] == '1') {
rep(i, 1, min((int)num1.size(), k + 2)) { sum += num1[i]; }
rep(i, min((int)num0.size(), k)) { sum += num0[i]; }
chmax(res, sum);
debug(sum);
rep(i, k, num0.size()) {
sum += num0[i] + num1[i + 2];
sum -= num0[i - k] + num1[i - k + 1];
chmax(res, sum);
debug(sum);
}
} else {
rep(i, 1, min((int)num1.size(), k + 1)) { sum += num1[i]; }
rep(i, min((int)num0.size(), k)) { sum += num0[i]; }
chmax(res, sum);
rep(i, k, num0.size()) {
sum += num0[i] + num1[i + 1];
sum -= num0[i - k] + num1[i - k];
chmax(res, sum);
}
}
out(res);
}
| [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 885,594 | 885,595 | u303059352 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
#define INCANT cin.tie(0), ios::sync_with_stdio(false)
#define int long long
#define double long double
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define gcd __gcd
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define sz(x) x.size()
#define all(x) (x).begin(), (x).end()
#define sortv(v) sort(all(v))
#define sortvg(v) sort(all(v), greater<int>())
#define countv(v, c) count(all(v), c)
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(...) _overload(__VA_ARGS__, repi, _rep)(__VA_ARGS__)
#define _rev(i, n) revi(i, n, 0)
#define revi(i, a, b) for (int i = (int)(a - 1); i >= (int)(b); i--)
#define rev(...) _overload(__VA_ARGS__, revi, _rev)(__VA_ARGS__)
#define each(i, n) for (auto &&i : n)
#define inv(x) each(i, x) in(i)
#define out(x) cout << (x)
#define space() cout << " "
#define indent() cout << '\n'
#define print(x) out(x), indent()
#define printv(x) \
each(i, x) out(i), space(); \
indent()
#define debug(x, ...) cerr << __LINE__ << ": " << #x << ": " << (x) << '\n'
#define YN(x) out((x) ? "YES" : "NO"), indent()
#define Yn(x) out((x) ? "Yes" : "No"), indent()
#define yn(x) out((x) ? "yes" : "no"), indent()
void in() {}
template <typename F, typename... R> void in(F &f, R &...r) {
cin >> f, in(r...);
}
const int INF = 1e16, MOD = 1e9 + 7, LIMIT = 100001, S_LIMIT = 101;
const int dx[] = {0, 0, 1, 0, -1, -1, 1, 1, -1},
dy[] = {0, -1, 0, 1, 0, -1, -1, 1, 1};
const string alphabet = "abcdefghijklmnopqrstuvwxyz";
const string ALPHABET = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int g[S_LIMIT][S_LIMIT] = {};
int lcm(int a, int b) { return a / gcd(a, b) * b; }
int modpow(int x, int n) {
return n < 2 ? x : modpow(x * x % MOD, n / 2) * (n % 2 ? x : 1) % MOD;
}
int factorial(int a) { return a < 2 ? 1 : factorial(a - 1) * a; }
int modfact(int a) { return a < 2 ? 1 : factorial(a - 1) * a % MOD; }
int summation(int a) { return a < 1 ? 0 : (a * a + a) / 2; }
int combination(int n, int r) {
int res = 1;
rep(i, 1, r + 1) { res *= n--, res /= i; }
return res;
}
int modcomb(int n, int r) {
return modfact(n) * modpow(modfact(r), MOD - 2) % MOD *
modpow(modfact(n - r), MOD - 2) % MOD;
}
bool isPrime(int n) {
rep(i, 2, sqrt(n) + 1) {
if (i > 3) {
i++;
}
if (!(n % i)) {
return false;
}
}
return true;
}
void warshall(int n) {
rep(i, n) {
rep(j, n) {
rep(k, n) { chmin(g[j][k], g[j][i] + g[i][k]); }
}
}
}
vector<int> divisor(int n) {
vector<int> ans;
rep(i, 1, sqrt(n) + 1) {
if (!(n % i)) {
ans.pb(i);
if (i * i < n) {
ans.pb(n / i);
}
}
}
return ans;
}
map<int, int> factorization(int n) {
map<int, int> ans;
rep(i, 2, sqrt(n) + 1) {
if (i > 3) {
i++;
}
while (!(n % i)) {
ans[i]++, n /= i;
}
}
if (n > 1) {
ans[n]++;
}
return ans;
}
struct UF {
vector<int> t;
UF(int size) : t(size, -1) {}
int root(int x) { return t[x] < 0 ? x : t[x] = root(t[x]); }
int size(int x) { return -t[root(x)]; }
bool isSame(int x, int y) { return root(x) == root(y); }
bool unite(int x, int y) {
x = root(x), y = root(y);
if (x != y) {
if (t[y] < t[x]) {
swap(x, y);
}
t[x] += t[y], t[y] = x;
}
return x != y;
}
};
int a, b, c, k, n, m, l, r, x, y, h, w, res = 0, cnt0 = 0, cnt1 = 0, sum = 0,
mx = -INF, mn = INF;
string s, t;
main() {
INCANT;
in(n, k, s);
vector<int> num0, num1;
num1.pb(0);
rep(i, s.size()) {
if (s[i] == '0') {
cnt0++;
} else {
cnt1++;
}
if (i) {
if (s[i] == '0') {
if (cnt1) {
num1.pb(cnt1);
}
cnt1 = 0;
} else {
if (cnt0) {
num0.pb(cnt0);
}
cnt0 = 0;
}
}
}
if (cnt0) {
num0.pb(cnt0);
}
if (cnt1) {
num1.pb(cnt1);
}
num1.pb(0);
// printv(num1);
// printv(num0);
if (s[0] == '1') {
rep(i, 1, min((int)num1.size(), k + 2)) { sum += num1[i]; }
rep(i, min((int)num0.size(), k)) { sum += num0[i]; }
chmax(res, sum);
debug(sum);
rep(i, k, num0.size()) {
sum += num0[i] + num1[i + 2];
sum -= num0[i - k] + num1[i - k + 1];
chmax(res, sum);
debug(sum);
}
} else {
rep(i, 1, min((int)num1.size(), k + 1)) { sum += num1[i]; }
rep(i, min((int)num0.size(), k)) { sum += num0[i]; }
chmax(res, sum);
rep(i, k, num0.size()) {
sum += num0[i] + num1[i + 2];
sum -= num0[i - k] + num1[i - k + 1];
chmax(res, sum);
}
}
out(res);
}
| #include <bits/stdc++.h>
using namespace std;
#define INCANT cin.tie(0), ios::sync_with_stdio(false)
#define int long long
#define double long double
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define gcd __gcd
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define sz(x) x.size()
#define all(x) (x).begin(), (x).end()
#define sortv(v) sort(all(v))
#define sortvg(v) sort(all(v), greater<int>())
#define countv(v, c) count(all(v), c)
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(...) _overload(__VA_ARGS__, repi, _rep)(__VA_ARGS__)
#define _rev(i, n) revi(i, n, 0)
#define revi(i, a, b) for (int i = (int)(a - 1); i >= (int)(b); i--)
#define rev(...) _overload(__VA_ARGS__, revi, _rev)(__VA_ARGS__)
#define each(i, n) for (auto &&i : n)
#define inv(x) each(i, x) in(i)
#define out(x) cout << (x)
#define space() cout << " "
#define indent() cout << '\n'
#define print(x) out(x), indent()
#define printv(x) \
each(i, x) out(i), space(); \
indent()
#define debug(x, ...) cerr << __LINE__ << ": " << #x << ": " << (x) << '\n'
#define YN(x) out((x) ? "YES" : "NO"), indent()
#define Yn(x) out((x) ? "Yes" : "No"), indent()
#define yn(x) out((x) ? "yes" : "no"), indent()
void in() {}
template <typename F, typename... R> void in(F &f, R &...r) {
cin >> f, in(r...);
}
const int INF = 1e16, MOD = 1e9 + 7, LIMIT = 100001, S_LIMIT = 101;
const int dx[] = {0, 0, 1, 0, -1, -1, 1, 1, -1},
dy[] = {0, -1, 0, 1, 0, -1, -1, 1, 1};
const string alphabet = "abcdefghijklmnopqrstuvwxyz";
const string ALPHABET = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int g[S_LIMIT][S_LIMIT] = {};
int lcm(int a, int b) { return a / gcd(a, b) * b; }
int modpow(int x, int n) {
return n < 2 ? x : modpow(x * x % MOD, n / 2) * (n % 2 ? x : 1) % MOD;
}
int factorial(int a) { return a < 2 ? 1 : factorial(a - 1) * a; }
int modfact(int a) { return a < 2 ? 1 : factorial(a - 1) * a % MOD; }
int summation(int a) { return a < 1 ? 0 : (a * a + a) / 2; }
int combination(int n, int r) {
int res = 1;
rep(i, 1, r + 1) { res *= n--, res /= i; }
return res;
}
int modcomb(int n, int r) {
return modfact(n) * modpow(modfact(r), MOD - 2) % MOD *
modpow(modfact(n - r), MOD - 2) % MOD;
}
bool isPrime(int n) {
rep(i, 2, sqrt(n) + 1) {
if (i > 3) {
i++;
}
if (!(n % i)) {
return false;
}
}
return true;
}
void warshall(int n) {
rep(i, n) {
rep(j, n) {
rep(k, n) { chmin(g[j][k], g[j][i] + g[i][k]); }
}
}
}
vector<int> divisor(int n) {
vector<int> ans;
rep(i, 1, sqrt(n) + 1) {
if (!(n % i)) {
ans.pb(i);
if (i * i < n) {
ans.pb(n / i);
}
}
}
return ans;
}
map<int, int> factorization(int n) {
map<int, int> ans;
rep(i, 2, sqrt(n) + 1) {
if (i > 3) {
i++;
}
while (!(n % i)) {
ans[i]++, n /= i;
}
}
if (n > 1) {
ans[n]++;
}
return ans;
}
struct UF {
vector<int> t;
UF(int size) : t(size, -1) {}
int root(int x) { return t[x] < 0 ? x : t[x] = root(t[x]); }
int size(int x) { return -t[root(x)]; }
bool isSame(int x, int y) { return root(x) == root(y); }
bool unite(int x, int y) {
x = root(x), y = root(y);
if (x != y) {
if (t[y] < t[x]) {
swap(x, y);
}
t[x] += t[y], t[y] = x;
}
return x != y;
}
};
int a, b, c, k, n, m, l, r, x, y, h, w, res = 0, cnt0 = 0, cnt1 = 0, sum = 0,
mx = -INF, mn = INF;
string s, t;
main() {
INCANT;
in(n, k, s);
vector<int> num0, num1;
num1.pb(0);
rep(i, s.size()) {
if (s[i] == '0') {
cnt0++;
} else {
cnt1++;
}
if (i) {
if (s[i] == '0') {
if (cnt1) {
num1.pb(cnt1);
}
cnt1 = 0;
} else {
if (cnt0) {
num0.pb(cnt0);
}
cnt0 = 0;
}
}
}
if (cnt0) {
num0.pb(cnt0);
}
if (cnt1) {
num1.pb(cnt1);
}
num1.pb(0);
if (s[0] == '1') {
rep(i, 1, min((int)num1.size(), k + 2)) { sum += num1[i]; }
rep(i, min((int)num0.size(), k)) { sum += num0[i]; }
chmax(res, sum);
debug(sum);
rep(i, k, num0.size()) {
sum += num0[i] + num1[i + 2];
sum -= num0[i - k] + num1[i - k + 1];
chmax(res, sum);
debug(sum);
}
} else {
rep(i, 1, min((int)num1.size(), k + 1)) { sum += num1[i]; }
rep(i, min((int)num0.size(), k)) { sum += num0[i]; }
chmax(res, sum);
rep(i, k, num0.size()) {
sum += num0[i] + num1[i + 1];
sum -= num0[i - k] + num1[i - k];
chmax(res, sum);
}
}
out(res);
}
| [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 885,596 | 885,595 | u303059352 | cpp |
p03074 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int N, K;
cin >> N >> K;
string s;
cin >> s;
vector<int> num;
int now = 1;
int cnt = 0;
for (int i = 0; i < s.length(); i++) {
if (s[i] == (char)('0' + now))
cnt++;
else {
num.push_back(cnt);
now = 1 - now;
cnt = 1;
}
}
num.push_back(cnt);
vector<int> data(num.size() + 1);
for (int i = 0; i < num.size(); i++) {
data[i + 1] = data[i] + num[i];
}
int Add = K * 2 + 1;
int ans = 0;
for (int i = 0; i < num.size(); i++) {
int left = i;
int right = min(i + Add, (int)num.size());
int sum = data[right] - data[left];
ans = max(sum, ans);
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int N, K;
cin >> N >> K;
string s;
cin >> s;
vector<int> num;
int now = 1;
int cnt = 0;
for (int i = 0; i < s.length(); i++) {
if (s[i] == (char)('0' + now))
cnt++;
else {
num.push_back(cnt);
now = 1 - now;
cnt = 1;
}
}
num.push_back(cnt);
vector<int> data(num.size() + 1);
for (int i = 0; i < num.size(); i++) {
data[i + 1] = data[i] + num[i];
}
int Add = K * 2 + 1;
int ans = 0;
for (int i = 0; i < num.size(); i += 2) {
int left = i;
int right = min(i + Add, (int)num.size());
int sum = data[right] - data[left];
ans = max(sum, ans);
}
cout << ans << endl;
return 0;
}
| [] | 885,601 | 885,602 | u806800460 | cpp |
p03074 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int N, K;
string S;
cin >> N >> K;
cin >> S;
vector<int>
switch_index; // S[i-1]とS[i]とで値が切り替わる場合、switch_indexにiを追加する
// 1回の指示 → 人の切り替わりを2箇所まで潰せる(1110011 を 11111111)
// 1回の変換で潰せる切り替わり場所は最大2K
// 開始地点が0の場合、まずそこを切り替えないとなので、潰せる切り替え場所が1つ減る(どこかで00011..となっているものを11111..にしないとなので)
switch_index.push_back(0);
for (int i = 1; i < N; i++) {
if (S[i - 1] != S[i]) {
switch_index.push_back(i);
}
}
switch_index.push_back(N);
/*
for (int i = 0; i < switch_index.size(); i++) {
cout << switch_index[i] << endl;
}
*/
int max_length = 0;
// 切り替わり箇所の数だけ候補がある
for (int i = 0; i < switch_index.size(); i++) {
int first = i;
int last;
if (S[switch_index[i]] == '1') {
last = 2 * K + 1;
} else {
last = 2 * K;
}
if (last >= switch_index.size()) {
last = switch_index.size() - 1;
}
int length = switch_index[last] - switch_index[first];
if (length > max_length) {
max_length = length;
}
}
cout << max_length << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int N, K;
string S;
cin >> N >> K;
cin >> S;
vector<int>
switch_index; // S[i-1]とS[i]とで値が切り替わる場合、switch_indexにiを追加する
// 1回の指示 → 人の切り替わりを2箇所まで潰せる(1110011 を 11111111)
// 1回の変換で潰せる切り替わり場所は最大2K
// 開始地点が0の場合、まずそこを切り替えないとなので、潰せる切り替え場所が1つ減る(どこかで00011..となっているものを11111..にしないとなので)
switch_index.push_back(0);
for (int i = 1; i < N; i++) {
if (S[i - 1] != S[i]) {
switch_index.push_back(i);
}
}
switch_index.push_back(N);
/*
for (int i = 0; i < switch_index.size(); i++) {
cout << switch_index[i] << endl;
}
*/
int max_length = 0;
// 切り替わり箇所の数だけ候補がある
for (int i = 0; i < switch_index.size(); i++) {
int first = i;
int last;
if (S[switch_index[i]] == '1') {
last = first + 2 * K + 1;
} else {
last = first + 2 * K;
}
if (last >= switch_index.size()) {
last = switch_index.size() - 1;
}
int length = switch_index[last] - switch_index[first];
// cout << "length = " << length << endl;
if (length > max_length) {
max_length = length;
}
}
cout << max_length << endl;
return 0;
} | [
"assignment.change"
] | 885,611 | 885,612 | u867671099 | cpp |
p03074 | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n) for (int i = 1; i <= (int)(n); i++)
#define REP(i, n) for (int i = n - 1; i >= 0; i--)
#define REPS(i, n) for (int i = n; i > 0; i--)
#define INF (int)(1123456789)
#define LINF (long long int)(112345678901234567)
int main(void) {
int N, K;
cin >> N >> K;
string s;
cin >> s;
vector<int> cnts;
int cnt = 1;
/// 1の個数、0の個数、1の個数、…
///、0の個数、1の個数となるように配列cntsを作る
/// 入力sが、0で始まるor0で終わるようなら、最初or最後に1の個数が0として加えておく
if (s[0] == '0') {
cnts.push_back(0);
}
rep(i, N) {
if (s[i] != s[i + 1]) {
cnts.push_back(cnt);
cnt = 1;
} else {
cnt++;
}
}
while (cnts.size() < 4 + 2 * K) {
cnts.push_back(0);
}
if (s[s.size() - 1] == '0') {
cnts.push_back(0);
}
/// 2K+1個ずつ、'1の個数'から始まるように和を比較する(尺取法)
int tmp = 0;
rep(i, 2 * K + 1) { tmp += cnts[i]; }
int ans = tmp;
reps(i, cnts.size() - 2 * K - 3) {
i++;
tmp -= cnts[i - 2] + cnts[i - 1];
tmp += cnts[i + 2 * K - 1] + cnts[i + 2 * K];
ans = max(ans, tmp);
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n) for (int i = 1; i <= (int)(n); i++)
#define REP(i, n) for (int i = n - 1; i >= 0; i--)
#define REPS(i, n) for (int i = n; i > 0; i--)
#define INF (int)(1123456789)
#define LINF (long long int)(112345678901234567)
int main(void) {
int N, K;
cin >> N >> K;
string s;
cin >> s;
vector<int> cnts;
int cnt = 1;
/// 1の個数、0の個数、1の個数、…
///、0の個数、1の個数となるように配列cntsを作る
/// 入力sが、0で始まるor0で終わるようなら、最初or最後に1の個数が0として加えておく
if (s[0] == '0') {
cnts.push_back(0);
}
rep(i, N) {
if (s[i] != s[i + 1]) {
cnts.push_back(cnt);
cnt = 1;
} else {
cnt++;
}
}
while (cnts.size() < 2 + 2 * K) {
cnts.push_back(0);
}
if (s[s.size() - 1] == '0') {
cnts.push_back(0);
}
/// 2K+1個ずつ、'1の個数'から始まるように和を比較する(尺取法)
int tmp = 0;
rep(i, 2 * K + 1) { tmp += cnts[i]; }
int ans = tmp;
reps(i, cnts.size() - 2 * K - 2) {
i++;
tmp -= cnts[i - 2] + cnts[i - 1];
tmp += cnts[i + 2 * K - 1] + cnts[i + 2 * K];
ans = max(ans, tmp);
}
cout << ans << endl;
return 0;
}
| [
"literal.number.change",
"control_flow.loop.condition.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 885,638 | 885,639 | u838742270 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.