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 |
|---|---|---|---|---|---|---|---|
p03073 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string str;
cin >> str;
string ans_1 = (""), ans_2 = ("");
int ans1 = 0, ans2 = 0;
for (int i = 1; i < str.size(); i++) {
if (i % 2 == 0) {
ans_1.push_back('0');
ans_2.push_back('1');
} else {
ans_1.push_back('1');
ans_2.push_back('0');
}
}
for (int i = 1; i < str.size(); i++) {
if (str[i] != ans_1[i])
ans1++;
if (str[i] != ans_2[i])
ans2++;
}
/*
for(int i = 1; i< str.size();i++){
//cout << str << endl;
if(str[i] == str[i - 1]){
ans++;
if(str[i] == '0')str[i] = '1';
else str[i] = '0';
}
}
*/
/*
if(ans < ((str.size() + 1)/2))cout << ans << endl;
else cout << str.size() - ans << endl;
*/
if (ans1 < ans2)
cout << ans1 << endl;
else
cout << ans2 << endl;
} | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string str;
cin >> str;
string ans_1 = (""), ans_2 = ("");
int ans1 = 0, ans2 = 0;
for (int i = 0; i < str.size(); i++) {
if (i % 2 == 0) {
ans_1.push_back('0');
ans_2.push_back('1');
} else {
ans_1.push_back('1');
ans_2.push_back('0');
}
}
for (int i = 0; i < str.size(); i++) {
if (str[i] != ans_1[i])
ans1++;
if (str[i] != ans_2[i])
ans2++;
}
if (ans1 < ans2)
cout << ans1 << endl;
else
cout << ans2 << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 884,513 | 884,514 | u570417673 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
int main() {
int ans = 0;
string S;
cin >> S;
char c = '0';
int case1 = 0, case2 = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] != c)
case1++;
if (c == '0')
c = '1';
else
c = '0';
}
c = 1;
for (int i = 0; i < S.size(); i++) {
if (S[i] != c)
case2++;
if (c == '0')
c = '1';
else
c = '0';
}
ans = min(case1, case2);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int ans = 0;
string S;
cin >> S;
char c = '0';
int case1 = 0, case2 = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] != c)
case1++;
if (c == '0')
c = '1';
else
c = '0';
}
c = '1';
for (int i = 0; i < S.size(); i++) {
if (S[i] != c)
case2++;
if (c == '0')
c = '1';
else
c = '0';
}
ans = min(case1, case2);
cout << ans << endl;
} | [] | 884,530 | 884,531 | u445628522 | cpp |
p03073 | /*
オーダー
10**6 余裕を持って間に合う
10**7 おそらく間に合う 余裕を持って間に合う
10**8 非常にシンプルな処理でない限り厳しい おそらく間に合う
10**9 非常にシンプルな処理でない限り厳しい
logn :OK
n :10^7
nlogn :10^6
n**2 :10^4
n**3 :300
2**n :20
n! :10
// 各桁の和を計算する関数
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) { // n が 0 になるまで
sum += n % 10;
n /= 10;
}
return sum;
}
sort(a, a + N, greater<int>()); // a[0:N] を大きい順にソート
int num[110] = {0}; // バケット
for (int i = 0; i < N; ++i) {
num[d[i]]++; // d[i] が 1 個増える
}
map<string, int> mp; // 連想配列 map<キー型, 値型> オブジェクト名
for (int i = 0; i < N; ++i) {
auto itr = mp.find(s[i]); // s[i] が設定されているか？
if(itr != mp.end() ) {
mp[s[i]] += 1;
}
else {
mp[s[i]] += 1 ;
}
}
stack<int> s; //intをデータとするスタックを用意
s.push(1); //{} -> {1}
printf("%d\n", s.top()); // 3
s.pop();
queue<int> que; //intをデータとするキューを用意
que.push(1); //{} -> {1}
printf("%d\n", que.front()); // 1
que.pop();
*/
#include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
// #define for(i,a,b) for (int i=(a);i<(b);++i)
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i, n) for (long long i = 0; i < (long long)(n); i++)
#define pb push_back // vectorに要素追加
#define INF (ll)1e18
// int
// // 各桁の和を計算する関数
// int findSumOfDigits(int n) {
// int amari = 0;
// int keta = 0;
// while (n > 0) { // n が 0 になるまで
// amari += n % 2;
// if (keta%2==0)
// n /= 10;
// }
// return sum;
// }
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
// const ll MAX_N = 1e5;
// ll N;
// ll h[MAX_N];
// ll dp[MAX_N+1]; // メモ化テーブル
// // i番目以降の品物から重さの総和がj以下になるように選ぶ
// void rec(ll i){
// if (i==0) dp[i] = 0;
// else if (i==1) dp[i] = abs(h[1]-h[0]);
// else dp[i] = min(dp[i-1]+abs(h[i]-h[i-1]), dp[i-2]+abs(h[i]-h[i-2]));
// return;
// }
int main() {
// 入力
string S;
cin >> S;
// 解法
ll ans1 = 0;
REP(i, S.size() / 2) {
if (S[i * 2] == '0')
ans1++;
}
ll ans2 = 0;
REP(i, (S.size() + 1) / 2) {
if (S[i * 2 + 1] == '1')
ans2++;
}
ll ans = min(ans1 + ans2, ll(S.size()) - ans1 - ans2);
//出力
// printf("%lld, %lld, %lld\n", ans1, ans2, ans);
cout << ans << endl;
}
| /*
オーダー
10**6 余裕を持って間に合う
10**7 おそらく間に合う 余裕を持って間に合う
10**8 非常にシンプルな処理でない限り厳しい おそらく間に合う
10**9 非常にシンプルな処理でない限り厳しい
logn :OK
n :10^7
nlogn :10^6
n**2 :10^4
n**3 :300
2**n :20
n! :10
// 各桁の和を計算する関数
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) { // n が 0 になるまで
sum += n % 10;
n /= 10;
}
return sum;
}
sort(a, a + N, greater<int>()); // a[0:N] を大きい順にソート
int num[110] = {0}; // バケット
for (int i = 0; i < N; ++i) {
num[d[i]]++; // d[i] が 1 個増える
}
map<string, int> mp; // 連想配列 map<キー型, 値型> オブジェクト名
for (int i = 0; i < N; ++i) {
auto itr = mp.find(s[i]); // s[i] が設定されているか？
if(itr != mp.end() ) {
mp[s[i]] += 1;
}
else {
mp[s[i]] += 1 ;
}
}
stack<int> s; //intをデータとするスタックを用意
s.push(1); //{} -> {1}
printf("%d\n", s.top()); // 3
s.pop();
queue<int> que; //intをデータとするキューを用意
que.push(1); //{} -> {1}
printf("%d\n", que.front()); // 1
que.pop();
*/
#include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
// #define for(i,a,b) for (int i=(a);i<(b);++i)
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i, n) for (long long i = 0; i < (long long)(n); i++)
#define pb push_back // vectorに要素追加
#define INF (ll)1e18
// int
// // 各桁の和を計算する関数
// int findSumOfDigits(int n) {
// int amari = 0;
// int keta = 0;
// while (n > 0) { // n が 0 になるまで
// amari += n % 2;
// if (keta%2==0)
// n /= 10;
// }
// return sum;
// }
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
// const ll MAX_N = 1e5;
// ll N;
// ll h[MAX_N];
// ll dp[MAX_N+1]; // メモ化テーブル
// // i番目以降の品物から重さの総和がj以下になるように選ぶ
// void rec(ll i){
// if (i==0) dp[i] = 0;
// else if (i==1) dp[i] = abs(h[1]-h[0]);
// else dp[i] = min(dp[i-1]+abs(h[i]-h[i-1]), dp[i-2]+abs(h[i]-h[i-2]));
// return;
// }
int main() {
// 入力
string S;
cin >> S;
// 解法
ll ans1 = 0;
REP(i, S.size() / 2) {
if (S[i * 2 + 1] == '0')
ans1++;
}
ll ans2 = 0;
// cout<<(S.size()+1)/2<<endl;
REP(i, (S.size() + 1) / 2) {
if (S[i * 2] == '1')
ans2++;
}
ll ans = min(ans1 + ans2, ll(S.size()) - ans1 - ans2);
//出力
// printf("%lld, %lld, %lld\n", ans1, ans2, ans);
cout << ans << endl;
}
| [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 884,532 | 884,533 | u757738907 | cpp |
p03073 | /*
オーダー
10**6 余裕を持って間に合う
10**7 おそらく間に合う 余裕を持って間に合う
10**8 非常にシンプルな処理でない限り厳しい おそらく間に合う
10**9 非常にシンプルな処理でない限り厳しい
logn :OK
n :10^7
nlogn :10^6
n**2 :10^4
n**3 :300
2**n :20
n! :10
// 各桁の和を計算する関数
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) { // n が 0 になるまで
sum += n % 10;
n /= 10;
}
return sum;
}
sort(a, a + N, greater<int>()); // a[0:N] を大きい順にソート
int num[110] = {0}; // バケット
for (int i = 0; i < N; ++i) {
num[d[i]]++; // d[i] が 1 個増える
}
map<string, int> mp; // 連想配列 map<キー型, 値型> オブジェクト名
for (int i = 0; i < N; ++i) {
auto itr = mp.find(s[i]); // s[i] が設定されているか？
if(itr != mp.end() ) {
mp[s[i]] += 1;
}
else {
mp[s[i]] += 1 ;
}
}
stack<int> s; //intをデータとするスタックを用意
s.push(1); //{} -> {1}
printf("%d\n", s.top()); // 3
s.pop();
queue<int> que; //intをデータとするキューを用意
que.push(1); //{} -> {1}
printf("%d\n", que.front()); // 1
que.pop();
*/
#include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
// #define for(i,a,b) for (int i=(a);i<(b);++i)
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i, n) for (long long i = 0; i < (long long)(n); i++)
#define pb push_back // vectorに要素追加
#define INF (ll)1e18
// int
// // 各桁の和を計算する関数
// int findSumOfDigits(int n) {
// int amari = 0;
// int keta = 0;
// while (n > 0) { // n が 0 になるまで
// amari += n % 2;
// if (keta%2==0)
// n /= 10;
// }
// return sum;
// }
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
// const ll MAX_N = 1e5;
// ll N;
// ll h[MAX_N];
// ll dp[MAX_N+1]; // メモ化テーブル
// // i番目以降の品物から重さの総和がj以下になるように選ぶ
// void rec(ll i){
// if (i==0) dp[i] = 0;
// else if (i==1) dp[i] = abs(h[1]-h[0]);
// else dp[i] = min(dp[i-1]+abs(h[i]-h[i-1]), dp[i-2]+abs(h[i]-h[i-2]));
// return;
// }
int main() {
// 入力
string S;
cin >> S;
// 解法
ll ans1 = 0;
REP(i, S.size() / 2) {
if (S[i * 2] == '0')
ans1++;
}
ll ans2 = 0;
REP(i, (S.size() + 1) / 2) {
if (S[i * 2 + 1] == '0')
ans2++;
}
ll ans = min(ans1 + ans2, ll(S.size()) - ans1 - ans2);
//出力
cout << ans << endl;
}
| /*
オーダー
10**6 余裕を持って間に合う
10**7 おそらく間に合う 余裕を持って間に合う
10**8 非常にシンプルな処理でない限り厳しい おそらく間に合う
10**9 非常にシンプルな処理でない限り厳しい
logn :OK
n :10^7
nlogn :10^6
n**2 :10^4
n**3 :300
2**n :20
n! :10
// 各桁の和を計算する関数
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) { // n が 0 になるまで
sum += n % 10;
n /= 10;
}
return sum;
}
sort(a, a + N, greater<int>()); // a[0:N] を大きい順にソート
int num[110] = {0}; // バケット
for (int i = 0; i < N; ++i) {
num[d[i]]++; // d[i] が 1 個増える
}
map<string, int> mp; // 連想配列 map<キー型, 値型> オブジェクト名
for (int i = 0; i < N; ++i) {
auto itr = mp.find(s[i]); // s[i] が設定されているか？
if(itr != mp.end() ) {
mp[s[i]] += 1;
}
else {
mp[s[i]] += 1 ;
}
}
stack<int> s; //intをデータとするスタックを用意
s.push(1); //{} -> {1}
printf("%d\n", s.top()); // 3
s.pop();
queue<int> que; //intをデータとするキューを用意
que.push(1); //{} -> {1}
printf("%d\n", que.front()); // 1
que.pop();
*/
#include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
// #define for(i,a,b) for (int i=(a);i<(b);++i)
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i, n) for (long long i = 0; i < (long long)(n); i++)
#define pb push_back // vectorに要素追加
#define INF (ll)1e18
// int
// // 各桁の和を計算する関数
// int findSumOfDigits(int n) {
// int amari = 0;
// int keta = 0;
// while (n > 0) { // n が 0 になるまで
// amari += n % 2;
// if (keta%2==0)
// n /= 10;
// }
// return sum;
// }
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
// const ll MAX_N = 1e5;
// ll N;
// ll h[MAX_N];
// ll dp[MAX_N+1]; // メモ化テーブル
// // i番目以降の品物から重さの総和がj以下になるように選ぶ
// void rec(ll i){
// if (i==0) dp[i] = 0;
// else if (i==1) dp[i] = abs(h[1]-h[0]);
// else dp[i] = min(dp[i-1]+abs(h[i]-h[i-1]), dp[i-2]+abs(h[i]-h[i-2]));
// return;
// }
int main() {
// 入力
string S;
cin >> S;
// 解法
ll ans1 = 0;
REP(i, S.size() / 2) {
if (S[i * 2 + 1] == '0')
ans1++;
}
ll ans2 = 0;
// cout<<(S.size()+1)/2<<endl;
REP(i, (S.size() + 1) / 2) {
if (S[i * 2] == '1')
ans2++;
}
ll ans = min(ans1 + ans2, ll(S.size()) - ans1 - ans2);
//出力
// printf("%lld, %lld, %lld\n", ans1, ans2, ans);
cout << ans << endl;
}
| [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove",
"literal.string.change"
] | 884,534 | 884,533 | u757738907 | cpp |
p03073 | #include <algorithm>
#include <functional>
#include <iostream>
#include <numeric>
#include <vector>
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++)
int main() {
int ans1 = 0, ans2 = 0;
string str;
cin >> str;
REP(i, str.length() - 1) {
if (i % 2 == 0) {
if (str[0] == '0')
ans1++;
else
ans2++;
} else {
if (str[0] == '1')
ans1++;
else
ans2++;
}
}
cout << min(ans1, ans2) << endl;
return 0;
} | #include <algorithm>
#include <functional>
#include <iostream>
#include <numeric>
#include <vector>
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++)
int main() {
int ans1 = 0, ans2 = 0;
string str;
cin >> str;
REP(i, str.length()) {
if (i % 2 == 0) {
if (str[i] == '0')
ans1++;
else
ans2++;
} else {
if (str[i] == '1')
ans1++;
else
ans2++;
}
}
cout << min(ans1, ans2) << endl;
return 0;
} | [
"expression.operation.binary.remove",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 884,537 | 884,538 | u064626595 | cpp |
p03073 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define pb push_back
#define ALL(obj) (obj).begin(), (obj).end()
using namespace std;
string S;
int main() {
cin >> S;
int N = S.size();
int ans = 0;
string S2 = S;
int ans2 = 0;
rep(i, N - 1) {
if (S[i] == S[i + 1]) {
if (S[i] == '0')
S[i + 1] = '1';
else
S[i + 1] = '0';
ans++;
}
}
if (S2[0] == '0') {
S2[0] = '1';
ans++;
} else {
S2[0] = '0';
ans++;
}
rep(i, N - 1) {
if (S2[i] == S2[i + 1]) {
if (S2[i] == '0')
S2[i + 1] = '1';
else
S2[i + 1] = '0';
ans2++;
}
}
cout << min(ans, ans2) << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define pb push_back
#define ALL(obj) (obj).begin(), (obj).end()
using namespace std;
string S;
int main() {
cin >> S;
int N = S.size();
int ans = 0;
string S2 = S;
int ans2 = 0;
rep(i, N - 1) {
if (S[i] == S[i + 1]) {
if (S[i] == '0')
S[i + 1] = '1';
else
S[i + 1] = '0';
ans++;
}
}
if (S2[0] == '0') {
S2[0] = '1';
ans2++;
} else {
S2[0] = '0';
ans2++;
}
rep(i, N - 1) {
if (S2[i] == S2[i + 1]) {
if (S2[i] == '0')
S2[i + 1] = '1';
else
S2[i + 1] = '0';
ans2++;
}
}
cout << min(ans, ans2) << endl;
} | [
"identifier.change"
] | 884,542 | 884,543 | u281168735 | cpp |
p03073 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
#define INF 1070000000LL
#define pb push_back
#define irep(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) irep(i, 0, n)
typedef long long lint;
typedef pair<int, int> pint;
struct Edge {
int to, weight;
};
typedef vector<vector<Edge>> Graph;
int main() {
string s;
cin >> s;
string a, b;
rep(i, s.length()) {
if (i % 2 == 0) {
a += '0';
b += '1';
} else {
a += '1';
b += '0';
}
}
int count_a, count_b = 0;
rep(i, s.length()) {
if (s[i] != a[i])
++count_a;
else
++count_b;
}
cout << min(count_a, count_b) << endl;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
#define INF 1070000000LL
#define pb push_back
#define irep(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) irep(i, 0, n)
typedef long long lint;
typedef pair<int, int> pint;
struct Edge {
int to, weight;
};
typedef vector<vector<Edge>> Graph;
int main() {
string s;
cin >> s;
string a, b;
rep(i, s.length()) {
if (i % 2 == 0) {
a += '0';
b += '1';
} else {
a += '1';
b += '0';
}
}
int count_a = 0, count_b = 0;
rep(i, s.length()) {
if (s[i] != a[i])
++count_a;
else
++count_b;
}
cout << min(count_a, count_b) << endl;
} | [
"variable_declaration.value.change"
] | 884,544 | 884,545 | u698677417 | cpp |
p03073 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
string T[2];
int main(void) {
string S;
cin >> S;
int N = S.size();
;
for (int i = 0; i < N; i++) {
if (i % 2 == 0) {
T[0] += "0";
T[1] += "1";
} else {
T[0] + "1";
T[1] += "0";
}
}
int ans1 = 0;
for (int i = 0; i < N; i++) {
if (S[i] != T[0][i]) {
ans1++;
}
}
int ans2 = 0;
for (int i = 0; i < N; i++) {
if (S[i] != T[1][i]) {
ans2++;
}
}
cout << min(ans1, ans2) << endl;
// system("pause");
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
string T[2];
int main(void) {
string S;
cin >> S;
int N = S.size();
;
for (int i = 0; i < N; i++) {
if (i % 2 == 0) {
T[0] += "0";
T[1] += "1";
} else {
T[0] += "1";
T[1] += "0";
}
}
int ans1 = 0;
for (int i = 0; i < N; i++) {
if (S[i] != T[0][i]) {
ans1++;
}
}
int ans2 = 0;
for (int i = 0; i < N; i++) {
if (S[i] != T[1][i]) {
ans2++;
}
}
// cout << T[0] << endl;
// cout << T[1] << endl;
cout << min(ans1, ans2) << endl;
// system("pause");
return 0;
} | [
"assignment.compound.arithmetic.replace.add",
"expression.operator.arithmetic.replace.remove",
"expression.operation.binary.change"
] | 884,554 | 884,555 | u835297884 | cpp |
p03073 | #include <algorithm>
#include <cstdio>
#include <iostream>
#define SIZE 100100
using namespace std;
char s[SIZE];
int main() {
scanf("%s", s);
int i, total1 = 0;
int total0 = 0;
for (i = 0; s[i]; i++) {
if ((s[i] & 1) ^ 1)
total1++;
else
total0++;
}
printf("%d\n", min(total0, total1));
return 0;
}
| #include <algorithm>
#include <cstdio>
#include <iostream>
#define SIZE 100100
using namespace std;
char s[SIZE];
int main() {
scanf("%s", s);
int i, total1 = 0;
int total0 = 0;
for (i = 0; s[i]; i++) {
if ((s[i] & 1) ^ (i & 1))
total1++;
else
total0++;
}
printf("%d\n", min(total0, total1));
return 0;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 884,558 | 884,559 | u074123934 | cpp |
p03073 | //↓template↓
#include "bits/stdc++.h"
using namespace std;
#define Would
#define you
#define all(n) n.begin(), n.end()
const long long INF = 1e18;
const long long MOD = 1e9 + 7;
const double pi = acos(-1);
const int SIZE = 1 << 17;
int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1}, alp[30];
long long fac[200005], finv[200005], inv[200005];
vector<long long> dij;
struct edge {
long long to, cost;
};
vector<vector<edge>> G;
long long mod_pow(long long a, long long b) {
long long res = 1;
while (b) {
if (b & 1) {
res = res * a % MOD;
}
a = a * a % MOD;
b >>= 1;
}
return res;
}
void addedge(int from, int to, int cost) {
G[from].push_back({to, cost});
G[to].push_back({from, cost});
}
//↑template↑
int mon, ze, it;
int main() {
string h;
cin >> h;
mon = h[0];
//[0]=0
if (h[0] != '0') {
++ze;
}
for (int i = 1; i < h.length(); ++i) {
if (i % 2 == 1 && h[i] != '1') {
++ze;
} else if (i % 2 == 0 && h[i] != '0') {
++ze;
}
}
mon = h[0];
//[0]=1
if (h[0] != '1') {
++ze;
}
for (int i = 1; i < h.length(); ++i) {
if (i % 2 == 1 && h[i] != '0') {
++it;
} else if (i % 2 == 0 && h[i] != '1') {
++it;
}
}
cout << min(ze, it) << endl;
} | //↓template↓
#include "bits/stdc++.h"
using namespace std;
#define Would
#define you
#define all(n) n.begin(), n.end()
const long long INF = 1e18;
const long long MOD = 1e9 + 7;
const double pi = acos(-1);
const int SIZE = 1 << 17;
int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1}, alp[30];
long long fac[200005], finv[200005], inv[200005];
vector<long long> dij;
struct edge {
long long to, cost;
};
vector<vector<edge>> G;
long long mod_pow(long long a, long long b) {
long long res = 1;
while (b) {
if (b & 1) {
res = res * a % MOD;
}
a = a * a % MOD;
b >>= 1;
}
return res;
}
void addedge(int from, int to, int cost) {
G[from].push_back({to, cost});
G[to].push_back({from, cost});
}
//↑template↑
long long mon, ze, it;
int main() {
string h;
cin >> h;
mon = h[0];
//[0]=0
if (h[0] != '0') {
++ze;
}
for (int i = 1; i < h.length(); ++i) {
if (i % 2 == 1 && h[i] != '1') {
++ze;
} else if (i % 2 == 0 && h[i] != '0') {
++ze;
}
}
mon = h[0];
//[0]=1
if (h[0] != '1') {
++it;
}
for (int i = 1; i < h.length(); ++i) {
if (i % 2 == 1 && h[i] != '0') {
++it;
} else if (i % 2 == 0 && h[i] != '1') {
++it;
}
}
cout << min(ze, it) << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"identifier.change"
] | 884,562 | 884,563 | u539402331 | cpp |
p03073 | /*#include <iostream>
#include <algorithm>
#include <array>
#include <cmath>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define FOR(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define SORT(c) sort((c).begin(), (c).end())
typedef long long ll;
const ll INF = 1LL << 60;
const ll mod = 1e9 + 7;
const int MAX_N = 5e5 + 5;
int dx[] = {-1, 0, 1, 0}, dy[] = {0, 1, 0, -1};
vector<ll> prime;
ll inv[MAX_N], fac[MAX_N];
template <class T = ll> T in() {
T x;
cin >> x;
return (x);
}
inline ll GCD(ll a, ll b) {
ll c;
while (b != 0) {
c = a % b;
a = b;
b = c;
}
return a;
}
inline ll LCM(ll a, ll b) { return a * b / GCD(a, b); }
inline ll POW(ll a, ll b) {
ll c = 1;
while (b > 0) {
if (b & 1) {
c = a * c % mod;
}
a = a * a % mod;
b >>= 1LL;
}
return c;
}
inline void _nCr() {
fac[0] = 1;
for (int i = 1LL; i < MAX_N; i++) {
fac[i] = fac[i - 1] * i % mod;
}
for (int i = 0; i < MAX_N; i++) {
inv[i] = POW(fac[i], mod - 2);
}
}
inline ll nCr(ll n, ll r) { return (fac[n] * inv[r] % mod) * inv[n - r] % mod; }
inline void PRI(ll n) {
bool a[n + 1];
for (int i = 0; i < n + 1; i++) {
a[i] = 1;
}
for (int i = 2; i < n + 1; i++) {
if (a[i]) {
prime.pb(i);
ll b = i;
while (b <= n) {
a[b] = 0;
b += i;
}
}
}
}
typedef pair<int, pair<int, int>> edge;
signed main() {
string s;
cin >> s;
int ans = 0;
int tmp = 0;
REP(i, s.size()) {
if (i % 2 == 0) {
if (s[i] == '1')
ans++;
else
tmp++;
}
if (i % 2 == 1) {
if (s[i] == '1')
tmp++;
else
ans++;
}
}
cout << max(ans, tmp) << endl;
}
| /*#include <iostream>
#include <algorithm>
#include <array>
#include <cmath>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define FOR(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define SORT(c) sort((c).begin(), (c).end())
typedef long long ll;
const ll INF = 1LL << 60;
const ll mod = 1e9 + 7;
const int MAX_N = 5e5 + 5;
int dx[] = {-1, 0, 1, 0}, dy[] = {0, 1, 0, -1};
vector<ll> prime;
ll inv[MAX_N], fac[MAX_N];
template <class T = ll> T in() {
T x;
cin >> x;
return (x);
}
inline ll GCD(ll a, ll b) {
ll c;
while (b != 0) {
c = a % b;
a = b;
b = c;
}
return a;
}
inline ll LCM(ll a, ll b) { return a * b / GCD(a, b); }
inline ll POW(ll a, ll b) {
ll c = 1;
while (b > 0) {
if (b & 1) {
c = a * c % mod;
}
a = a * a % mod;
b >>= 1LL;
}
return c;
}
inline void _nCr() {
fac[0] = 1;
for (int i = 1LL; i < MAX_N; i++) {
fac[i] = fac[i - 1] * i % mod;
}
for (int i = 0; i < MAX_N; i++) {
inv[i] = POW(fac[i], mod - 2);
}
}
inline ll nCr(ll n, ll r) { return (fac[n] * inv[r] % mod) * inv[n - r] % mod; }
inline void PRI(ll n) {
bool a[n + 1];
for (int i = 0; i < n + 1; i++) {
a[i] = 1;
}
for (int i = 2; i < n + 1; i++) {
if (a[i]) {
prime.pb(i);
ll b = i;
while (b <= n) {
a[b] = 0;
b += i;
}
}
}
}
typedef pair<int, pair<int, int>> edge;
signed main() {
string s;
cin >> s;
int ans = 0;
int tmp = 0;
REP(i, s.size()) {
if (i % 2 == 0) {
if (s[i] == '1')
ans++;
else
tmp++;
}
if (i % 2 == 1) {
if (s[i] == '1')
tmp++;
else
ans++;
}
}
cout << min(ans, tmp) << endl;
}
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 884,568 | 884,569 | u764234894 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
char p[2] = {'0', '1'};
int a = 0, b = 0;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == p[i % 2])
a++;
}
for (int i = 1; i <= s.size(); i++) {
if (s[i] == p[i % 2])
b++;
}
cout << min(a, b) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
char p[2] = {'0', '1'};
int a = 0, b = 0;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == p[i % 2])
a++;
}
for (int i = 0; i <= s.size(); i++) {
if (s[i] == p[(i + 1) % 2])
b++;
}
cout << min(a, b) << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 884,574 | 884,575 | u565219356 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
// Define
using ll = int64_t;
using ul = uint64_t;
using ld = long double;
const ll MOD = 1e9 + 7;
const ll INF = LONG_MAX;
const ul MAX = ULONG_MAX;
const char nl = '\n';
#define elif else if
#define def inline auto
#define run __attribute__((constructor)) def _
// Debug
#define debug(x) cerr << (x) << " (L:" << __LINE__ << ")" << '\n'
// Loop
#define inc(i, a, n) for (ll i = (a), _##i = (n); i < _##i; ++i)
#define dec(i, a, n) for (ll i = (a), _##i = (n); i > _##i; --i)
#define rep(i, n) inc(i, 0, n)
#define be(c) begin(c), end(c)
// Stream
#define fout(n) cout << fixed << setprecision(n)
#define fasten cin.tie(0), ios::sync_with_stdio(0)
// Speed
run() { fasten, fout(10); }
#pragma GCC optimize("-O3")
#pragma GCC target("avx")
signed main() {
string s;
cin >> s;
int n = s.size();
map<int, int> m;
for (int i = 0; i < n - 1; i += 2) {
int a = (s[i] - '0') * 2 + (s[i + 1] - '0');
++m[a];
}
auto a = m[2] * 2 + m[0] + m[3];
auto b = m[1] * 2 + m[0] + m[3];
if (n % 2 != 0) {
if (s[n - 1] == '1')
++b;
else
++a;
}
cout << min(a, b) << nl;
}
| #include <bits/stdc++.h>
using namespace std;
// Define
using ll = int64_t;
using ul = uint64_t;
using ld = long double;
const ll MOD = 1e9 + 7;
const ll INF = LONG_MAX;
const ul MAX = ULONG_MAX;
const char nl = '\n';
#define elif else if
#define def inline auto
#define run __attribute__((constructor)) def _
// Debug
#define debug(x) cerr << (x) << " (L:" << __LINE__ << ")" << '\n'
// Loop
#define inc(i, a, n) for (ll i = (a), _##i = (n); i < _##i; ++i)
#define dec(i, a, n) for (ll i = (a), _##i = (n); i > _##i; --i)
#define rep(i, n) inc(i, 0, n)
#define be(c) begin(c), end(c)
// Stream
#define fout(n) cout << fixed << setprecision(n)
#define fasten cin.tie(0), ios::sync_with_stdio(0)
// Speed
run() { fasten, fout(10); }
#pragma GCC optimize("-O3")
#pragma GCC target("avx")
signed main() {
string s;
cin >> s;
int n = s.size();
map<int, int> m;
for (int i = 0; i < n - 1; i += 2) {
int a = (s[i] - '0') * 2 + (s[i + 1] - '0');
++m[a];
}
auto a = m[2] * 2 + m[0] + m[3];
auto b = m[1] * 2 + m[0] + m[3];
if (n % 2 != 0) {
if (s[n - 1] == '1')
++a;
else
++b;
}
cout << min(a, b) << nl;
}
| [
"expression.unary.arithmetic.remove",
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"expression.unary.arithmetic.add"
] | 884,580 | 884,581 | u874039158 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
// Define
using ll = int64_t;
using ul = uint64_t;
using ld = long double;
const ll MOD = 1e9 + 7;
const ll INF = LONG_MAX;
const ul MAX = ULONG_MAX;
const char nl = '\n';
#define elif else if
#define def inline auto
#define run __attribute__((constructor)) def _
// Debug
#define debug(x) cerr << (x) << " (L:" << __LINE__ << ")" << '\n'
// Loop
#define inc(i, a, n) for (ll i = (a), _##i = (n); i < _##i; ++i)
#define dec(i, a, n) for (ll i = (a), _##i = (n); i > _##i; --i)
#define rep(i, n) inc(i, 0, n)
#define be(c) begin(c), end(c)
// Stream
#define fout(n) cout << fixed << setprecision(n)
#define fasten cin.tie(0), ios::sync_with_stdio(0)
// Speed
run() { fasten, fout(10); }
#pragma GCC optimize("-O3")
#pragma GCC target("avx")
signed main() {
string s;
cin >> s;
int n = s.size();
map<int, int> m;
for (int i = 0; i < n; i += 2) {
int a = (s[i] - '0') * 2 + (s[i + 1] - '0');
++m[a];
}
auto a = m[2] * 2 + m[0] + m[3];
auto b = m[1] * 2 + m[0] + m[3];
if (n % 2 != 0) {
if (s[n - 1] == '1')
++b;
else
++a;
}
cout << min(a, b) << nl;
}
| #include <bits/stdc++.h>
using namespace std;
// Define
using ll = int64_t;
using ul = uint64_t;
using ld = long double;
const ll MOD = 1e9 + 7;
const ll INF = LONG_MAX;
const ul MAX = ULONG_MAX;
const char nl = '\n';
#define elif else if
#define def inline auto
#define run __attribute__((constructor)) def _
// Debug
#define debug(x) cerr << (x) << " (L:" << __LINE__ << ")" << '\n'
// Loop
#define inc(i, a, n) for (ll i = (a), _##i = (n); i < _##i; ++i)
#define dec(i, a, n) for (ll i = (a), _##i = (n); i > _##i; --i)
#define rep(i, n) inc(i, 0, n)
#define be(c) begin(c), end(c)
// Stream
#define fout(n) cout << fixed << setprecision(n)
#define fasten cin.tie(0), ios::sync_with_stdio(0)
// Speed
run() { fasten, fout(10); }
#pragma GCC optimize("-O3")
#pragma GCC target("avx")
signed main() {
string s;
cin >> s;
int n = s.size();
map<int, int> m;
for (int i = 0; i < n - 1; i += 2) {
int a = (s[i] - '0') * 2 + (s[i + 1] - '0');
++m[a];
}
auto a = m[2] * 2 + m[0] + m[3];
auto b = m[1] * 2 + m[0] + m[3];
if (n % 2 != 0) {
if (s[n - 1] == '1')
++a;
else
++b;
}
cout << min(a, b) << nl;
}
| [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"identifier.change"
] | 884,582 | 884,581 | u874039158 | cpp |
p03073 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int n = S.length();
int idxOdd0 = 0, idxOdd1 = 0, idxEvn0 = 0, idxEvn1 = 0;
for (int i = 0; i < n; i++) {
if (i % 2 == 0) {
if (S[i] == '0') {
idxEvn0++;
} else {
idxEvn1++;
}
} else {
if (S[i] == '1') {
idxOdd1++;
} else {
idxOdd0++;
}
}
}
int startWZero = idxEvn0 + idxOdd1;
int startWOne = idxEvn1 + idxOdd0;
int nOfEven = idxEvn0 + idxEvn1;
int nOfOdd = idxOdd0 + idxOdd1;
if (startWZero > startWOne) {
cout << (nOfEven - idxEvn0) + idxOdd0 << endl;
} else {
cout << (nOfOdd - idxEvn1) + idxOdd1 << endl;
}
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int n = S.length();
int idxOdd0 = 0, idxOdd1 = 0, idxEvn0 = 0, idxEvn1 = 0;
for (int i = 0; i < n; i++) {
if (i % 2 == 0) {
if (S[i] == '0') {
idxEvn0++;
} else {
idxEvn1++;
}
} else {
if (S[i] == '1') {
idxOdd1++;
} else {
idxOdd0++;
}
}
}
int startWZero = idxEvn0 + idxOdd1;
int startWOne = idxEvn1 + idxOdd0;
int nOfEven = idxEvn0 + idxEvn1;
int nOfOdd = idxOdd0 + idxOdd1;
if (startWZero >= startWOne) {
cout << (nOfEven - idxEvn0) + idxOdd0 << endl;
} else {
cout << (nOfEven - idxEvn1) + idxOdd1 << endl;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"io.output.change"
] | 884,587 | 884,588 | u239023686 | cpp |
p03073 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int n = S.length();
int idxOdd0 = 0, idxOdd1 = 0, idxEvn0 = 0, idxEvn1 = 0;
for (int i = 0; i < n; i++) {
if (i % 2 == 0) {
if (S[i] == '0') {
idxEvn0++;
} else {
idxEvn1++;
}
} else {
if (S[i] == '1') {
idxOdd1++;
} else {
idxOdd0++;
}
}
}
int startWZero = idxEvn0 + idxOdd1;
int startWOne = idxEvn1 + idxOdd0;
int nOfEven = idxEvn0 + idxEvn1;
int nOfOdd = idxOdd0 + idxOdd1;
if (startWZero >= startWOne) {
cout << (nOfEven - idxEvn0) + idxOdd0 << endl;
} else {
cout << (nOfOdd - idxEvn1) + idxOdd1 << endl;
}
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int n = S.length();
int idxOdd0 = 0, idxOdd1 = 0, idxEvn0 = 0, idxEvn1 = 0;
for (int i = 0; i < n; i++) {
if (i % 2 == 0) {
if (S[i] == '0') {
idxEvn0++;
} else {
idxEvn1++;
}
} else {
if (S[i] == '1') {
idxOdd1++;
} else {
idxOdd0++;
}
}
}
int startWZero = idxEvn0 + idxOdd1;
int startWOne = idxEvn1 + idxOdd0;
int nOfEven = idxEvn0 + idxEvn1;
int nOfOdd = idxOdd0 + idxOdd1;
if (startWZero >= startWOne) {
cout << (nOfEven - idxEvn0) + idxOdd0 << endl;
} else {
cout << (nOfEven - idxEvn1) + idxOdd1 << endl;
}
} | [
"identifier.change",
"io.output.change"
] | 884,589 | 884,588 | u239023686 | cpp |
p03073 | #include <algorithm>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main() {
char s[1000001];
cin >> s;
int len = strlen(s);
char tmp[1000001];
strcpy(tmp, s);
int ans1 = 0;
for (int i = 1; i < len; i++) {
if (s[i - 1] == '0' && s[i] == '0') {
s[i] = '1';
ans1++;
} else if (s[i - 1] == '1' && s[i] == '1') {
s[i] = '0';
ans1++;
}
}
strcpy(s, tmp);
if (s[0] == '0')
s[0] = '1';
else
s[0] = '0';
int ans2 = 0;
for (int i = 1; i < len; i++) {
if (s[i - 1] == '0' && s[i] == '0') {
s[i] = '1';
ans2++;
} else if (s[i - 1] == '1' && s[i] == '1') {
s[i] = '0';
ans2++;
}
}
cout << min(ans1, ans2) << endl;
return 0;
} | #include <algorithm>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main() {
char s[1000001];
cin >> s;
int len = strlen(s);
char tmp[1000001];
strcpy(tmp, s);
int ans1 = 0;
for (int i = 1; i < len; i++) {
if (s[i - 1] == '0' && s[i] == '0') {
s[i] = '1';
ans1++;
} else if (s[i - 1] == '1' && s[i] == '1') {
s[i] = '0';
ans1++;
}
}
strcpy(s, tmp);
if (s[0] == '0')
s[0] = '1';
else
s[0] = '0';
int ans2 = 1;
for (int i = 1; i < len; i++) {
if (s[i - 1] == '0' && s[i] == '0') {
s[i] = '1';
ans2++;
} else if (s[i - 1] == '1' && s[i] == '1') {
s[i] = '0';
ans2++;
}
}
cout << min(ans1, ans2) << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 884,590 | 884,591 | u905270643 | cpp |
p03073 | #include <algorithm>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main() {
char s[100001];
cin >> s;
int len = strlen(s);
char tmp[100001];
strcpy(tmp, s);
int ans1 = 0;
for (int i = 1; i < len; i++) {
if (s[i - 1] == '0' && s[i] == '0') {
s[i] = '1';
ans1++;
} else if (s[i - 1] == '1' && s[i] == '1') {
s[i] = '0';
ans1++;
}
}
strcpy(s, tmp);
if (s[0] == '0')
s[0] = '1';
else
s[0] = '0';
int ans2 = 0;
for (int i = 1; i < len; i++) {
if (s[i - 1] == '0' && s[i] == '0') {
s[i] = '1';
ans2++;
} else if (s[i - 1] == '1' && s[i] == '1') {
s[i] = '0';
ans2++;
}
}
cout << min(ans1, ans2) << endl;
return 0;
} | #include <algorithm>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main() {
char s[1000001];
cin >> s;
int len = strlen(s);
char tmp[1000001];
strcpy(tmp, s);
int ans1 = 0;
for (int i = 1; i < len; i++) {
if (s[i - 1] == '0' && s[i] == '0') {
s[i] = '1';
ans1++;
} else if (s[i - 1] == '1' && s[i] == '1') {
s[i] = '0';
ans1++;
}
}
strcpy(s, tmp);
if (s[0] == '0')
s[0] = '1';
else
s[0] = '0';
int ans2 = 1;
for (int i = 1; i < len; i++) {
if (s[i - 1] == '0' && s[i] == '0') {
s[i] = '1';
ans2++;
} else if (s[i - 1] == '1' && s[i] == '1') {
s[i] = '0';
ans2++;
}
}
cout << min(ans1, ans2) << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_declaration.value.change"
] | 884,592 | 884,591 | u905270643 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define SORT(v, n) sort(v, v + n);
#define SSORT(v, n) sort(v, v + n, greater<int>())
int main() {
string s, s2 = "";
cin >> s;
s2 = s;
int ans1 = 0;
int ans2 = 0;
for (int i = 0; i < s.length(); i++) {
if (i % 2 == 0 && s[i] == 1) {
s[i] = 0;
ans1++;
}
if (i % 2 == 1 && s[i] == 0) {
s[i] = 1;
ans1++;
}
}
for (int i = 0; i < s.length(); i++) {
if (s[i] == s2[i])
ans2++;
}
if (ans2 > ans1)
cout << ans1 << endl;
else
cout << ans2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define SORT(v, n) sort(v, v + n);
#define SSORT(v, n) sort(v, v + n, greater<int>())
int main() {
string s, s2 = "";
cin >> s;
s2 = s;
int ans1 = 0;
int ans2 = 0;
for (int i = 0; i < s.length(); i++) {
if (i % 2 == 0 && s[i] == '1') {
s[i] = 0;
ans1++;
}
if (i % 2 == 1 && s[i] == '0') {
s[i] = 1;
ans1++;
}
}
for (int i = 0; i < s.length(); i++) {
if (s[i] == s2[i])
ans2++;
}
if (ans2 > ans1)
cout << ans1 << endl;
else
cout << ans2 << endl;
} | [
"control_flow.branch.if.condition.change"
] | 884,618 | 884,619 | u398211442 | cpp |
p03073 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
vector<char> S;
vector<char> T;
for (int i = 0; i < s.size(); i++) {
S.push_back(s.at(i));
T.push_back(s.at(i));
}
int count_first = 0;
for (int i = 1; i < s.size(); i++) {
if (S[i - 1] == S[i]) {
if (S[i] == '1') {
S[i] = '0';
count_first++;
} else if (S[i] == '0') {
S[i] = '1';
count_first++;
}
}
}
int count_last = 0;
for (int i = s.size(); i > 1; i--) {
if (T[i] == T[i - 1]) {
if (T[i - 1] == '1') {
T[i - 1] = '0';
count_last++;
} else if (T[i - 1] == '0') {
T[i - 1] = '1';
count_last++;
}
}
}
cout << min(count_first, count_last) << endl;
}
| #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
vector<char> S;
vector<char> T;
for (int i = 0; i < s.size(); i++) {
S.push_back(s.at(i));
T.push_back(s.at(i));
}
int count_first = 0;
for (int i = 1; i < s.size(); i++) {
if (S[i - 1] == S[i]) {
if (S[i] == '1') {
S[i] = '0';
count_first++;
} else if (S[i] == '0') {
S[i] = '1';
count_first++;
}
}
}
int count_last = 0;
for (int i = s.size(); i > 0; i--) {
if (T[i] == T[i - 1]) {
if (T[i - 1] == '1') {
T[i - 1] = '0';
count_last++;
} else if (T[i - 1] == '0') {
T[i - 1] = '1';
count_last++;
}
}
}
cout << min(count_first, count_last) << endl;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 884,620 | 884,621 | u115819033 | cpp |
p03073 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
// const int maxn = 100 + 10;
// int h[maxn];
int main() {
string a, b;
cin >> a;
int len = a.length(), ans = 100000 + 10;
for (int i = 0; i < len; i++) {
a[i] = a[i] - '0';
}
b = a;
// int len = a.length(), ans = 100000 + 10;
for (int i = 0; i < 2; i++) {
int j = 0, anw = 0;
if (i == 0) {
j = 1;
} else {
a[0] = (a[0] + 1) % 2;
}
for (; j < len; j++) {
if (j != 0 && a[j] == a[j - 1]) {
a[j] = (a[j] + 1) % 2;
anw++;
}
}
a = b;
ans = min(ans, anw);
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
// const int maxn = 100 + 10;
// int h[maxn];
int main() {
string a, b;
cin >> a;
int len = a.length(), ans = 100000 + 10;
for (int i = 0; i < len; i++) {
a[i] = a[i] - '0';
}
b = a;
// int len = a.length(), ans = 100000 + 10;
for (int i = 0; i < 2; i++) {
int j = 0, anw = 0;
if (i == 0) {
j = 1;
} else {
a[0] = (a[0] + 1) % 2;
anw = 1;
}
for (; j < len; j++) {
if (j != 0 && a[j] == a[j - 1]) {
a[j] = (a[j] + 1) % 2;
anw++;
}
}
a = b;
ans = min(ans, anw);
}
cout << ans << endl;
return 0;
}
| [
"assignment.add"
] | 884,629 | 884,630 | u125824817 | cpp |
p03073 | #include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int a, b;
size_t size = s.length();
a = 0;
b = 0;
for (int j = 0; j < size; j++) {
if (j % 2 == 0) {
if (s[j] == '0') {
a++;
}
}
if (j % 2 == 1) {
if (s[j] == '1') {
a++;
}
}
}
for (int k = 0; k < size; k++) {
if (k % 2 == 0) {
if (s[k] == '1') {
b++;
}
}
if (k % 2 == 1) {
if (s[k] == '0') {
b++;
}
}
}
if (a > b) {
cout << a << endl;
}
if (b >= a) {
cout << b << endl;
}
}
| #include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int a, b;
size_t size = s.length();
a = 0;
b = 0;
for (int j = 0; j < size; j++) {
if (j % 2 == 0) {
if (s[j] == '0') {
a++;
}
}
if (j % 2 == 1) {
if (s[j] == '1') {
a++;
}
}
}
for (int k = 0; k < size; k++) {
if (k % 2 == 0) {
if (s[k] == '1') {
b++;
}
}
if (k % 2 == 1) {
if (s[k] == '0') {
b++;
}
}
}
if (a > b) {
cout << b << endl;
}
if (b >= a) {
cout << a << endl;
}
}
| [
"identifier.change",
"io.output.change"
] | 884,637 | 884,638 | u313043608 | cpp |
p03073 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string input;
cin >> input;
string input2;
input2.reserve(input.size());
reverse_copy(input.begin(), input.end(), back_inserter(input2));
int ans1 = 0;
int ans2 = 0;
int ans3 = 0;
int ans4 = 0;
unsigned long length = input.length();
string my1;
string my2;
my1.push_back(input[0]);
if (input[0] == '0') {
my2.push_back('1');
} else {
my2.push_back('0');
}
string my3;
string my4;
my3.push_back(input2[0]);
if (input2[0] == '0') {
my4.push_back('1');
} else {
my4.push_back('0');
}
for (int i = 1; i < length; ++i) {
if (my1[i - 1] != input[i]) {
my1.push_back(input[i]);
} else {
ans1++;
if (input[i] == '0') {
my1.push_back('1');
} else {
my1.push_back('0');
}
}
if (my2[i - 1] != input[i]) {
my2.push_back(input[i]);
} else {
ans2++;
if (input[i] == '0') {
my2.push_back('1');
} else {
my2.push_back('0');
}
}
if (my3[i - 1] != input2[i]) {
my3.push_back(input2[i]);
} else {
ans3++;
if (input2[i] == '0') {
my3.push_back('1');
} else {
my3.push_back('0');
}
}
if (my4[i - 1] != input2[i]) {
my4.push_back(input2[i]);
} else {
ans4++;
if (input2[i] == '0') {
my4.push_back('1');
} else {
my4.push_back('0');
}
}
}
int min = ans1;
if (min > ans2) {
min = ans2;
}
if (min > ans3) {
min = ans3;
}
if (min > ans4) {
min = ans4;
}
cout << min;
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string input;
cin >> input;
string input2;
input2.reserve(input.size());
reverse_copy(input.begin(), input.end(), back_inserter(input2));
int ans1 = 0;
int ans2 = 1;
int ans3 = 0;
int ans4 = 1;
unsigned long length = input.length();
string my1;
string my2;
my1.push_back(input[0]);
if (input[0] == '0') {
my2.push_back('1');
} else {
my2.push_back('0');
}
string my3;
string my4;
my3.push_back(input2[0]);
if (input2[0] == '0') {
my4.push_back('1');
} else {
my4.push_back('0');
}
for (int i = 1; i < length; ++i) {
if (my1[i - 1] != input[i]) {
my1.push_back(input[i]);
} else {
ans1++;
if (input[i] == '0') {
my1.push_back('1');
} else {
my1.push_back('0');
}
}
if (my2[i - 1] != input[i]) {
my2.push_back(input[i]);
} else {
ans2++;
if (input[i] == '0') {
my2.push_back('1');
} else {
my2.push_back('0');
}
}
if (my3[i - 1] != input2[i]) {
my3.push_back(input2[i]);
} else {
ans3++;
if (input2[i] == '0') {
my3.push_back('1');
} else {
my3.push_back('0');
}
}
if (my4[i - 1] != input2[i]) {
my4.push_back(input2[i]);
} else {
ans4++;
if (input2[i] == '0') {
my4.push_back('1');
} else {
my4.push_back('0');
}
}
}
int min = ans1;
if (min > ans2) {
min = ans2;
}
if (min > ans3) {
min = ans3;
}
if (min > ans4) {
min = ans4;
}
cout << min;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 884,641 | 884,642 | u995475449 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a1, a2;
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (i % 2 == 0) {
if (s[i] == '0')
a1++;
else
a2++;
} else {
if (s[i] == '0')
a2++;
else
a1++;
}
}
cout << min(a1, a2) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a1 = 0, a2 = 0;
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (i % 2 == 0) {
if (s[i] == '0')
a1++;
else
a2++;
} else {
if (s[i] == '0')
a2++;
else
a1++;
}
}
cout << min(a1, a2) << endl;
} | [
"variable_declaration.value.change"
] | 884,647 | 884,648 | u732571394 | cpp |
p03073 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n, i, j, count1 = 0, count2 = 0;
char a[10000];
cin >> a;
for (j = 1; j < strlen(a); j++) {
if (j % 2 == 1) {
if (a[j] == '1')
count1++;
} else {
if (a[j] == '0')
count1++;
}
}
for (j = 1; j < strlen(a); j++) {
if (j % 2 == 1) {
if (a[j] == '0')
count2++;
} else {
if (a[j] == '1')
count2++;
}
}
if (count1 > count2)
cout << count2;
else
cout << count1;
return 0;
}
| #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n, i, j, count1 = 0, count2 = 0;
char a[100020];
cin >> a;
for (j = 0; j < strlen(a); j++) {
if (j % 2 == 1) {
if (a[j] == '1')
count1++;
} else {
if (a[j] == '0')
count1++;
}
}
for (j = 0; j < strlen(a); j++) {
if (j % 2 == 1) {
if (a[j] == '0')
count2++;
} else {
if (a[j] == '1')
count2++;
}
}
if (count1 > count2)
cout << count2;
else
cout << count1;
return 0;
}
| [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 884,663 | 884,662 | u749530685 | cpp |
p03073 | #include <cstdlib>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int n;
n = s.length();
int r1, r2 = 0;
for (int i = 0; i < n; i++) {
r1 += abs((int)(s[i]) - 48 - i % 2);
r2 += abs((int)(s[i]) - 48 - (i + 1) % 2);
}
cout << min(r1, r2);
} | #include <cstdlib>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int n;
n = s.length();
int r1 = 0;
int r2 = 0;
// if (n%2==0){
for (int i = 0; i < n; i++) {
r1 += abs((int)(s[i]) - 48 - i % 2);
r2 += abs((int)(s[i]) - 48 - (i + 1) % 2);
}
//}else{
// for (int i=0;i<n;i++){
//}
//}
cout << min(r1, r2);
} | [
"variable_declaration.add"
] | 884,668 | 884,669 | u442039299 | cpp |
p03069 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define ALL(obj) \
(obj).begin(), (obj).end() //イテレータの簡略化（コンテナじゃないと使えない）
using namespace std;
typedef long long ll; // long longをllでかけるようにした
const int INF = 100100100;
// 最大公約数
int gcd(int a, int b) {
int c;
if (a < b) {
a += b;
b = a - b;
a -= b;
}
while (b != 0) {
c = a % b;
a = b;
b = c;
}
return a;
}
// 最小公倍数
int lcm(int m, int n) {
// 引数に０がある場合は０を返す
if ((0 == m) || (0 == n))
return 0;
return ((m / gcd(m, n)) * n); // lcm = m * n / gcd(m,n)
}
/* 二分探索 */
// indexが条件を満たすかどうか
bool isOK(int index, int key, vector<int> a) {
if (a[index] >= key)
return true;
else
return false;
}
//汎用的な二分探索のテンプレ
int meguru_binary_search(int key, vector<int> A) {
int ng = -1; // lowerの時は-1, upperの時は(int)A.size() //「index =
// 0」が条件を満たすこともあるので、初期値は -1
int ok =
(int)A.size(); // lowerの時は(int)A.size(), upperの時は-1 // 「index =
// a.size()-1」が条件を満たさないこともあるので、初期値は
// a.size()
/* どんな二分探索でもここの書き方を変えずにできる！ */
while (abs(ok - ng) > 1) {
int mid = (ok + ng) / 2;
if (isOK(mid, key, A))
ok = mid;
else
ng = mid;
}
/* left は条件を満たさない最大の値、right
* は条件を満たす最小の値になっている(lowerだと) */
return ok;
}
/* lower_boundとかでイテレータから配列の添え字を求めたいとき(lower_bound(v.begin(),v.end(),hoge)-v.begin())というようにする
*/
// distanceも使える
//三項演算子 ?:
int main(void) {
int n;
cin >> n;
string s;
cin >> s;
vector<int> sb(n), sw(n);
if (s[0] == '.') {
sb[0] = 0;
sw[0] = 1;
} else {
sb[0] = 1;
sw[0] = 0;
}
FOR(i, 1, n) {
if (s[i] == '.') {
sb[i] = sb[i - 1];
sw[i] = sw[i - 1] + 1;
} else {
sb[i] = sb[i - 1] + 1;
sw[i] = sw[i - 1];
}
}
int ans = 2000000;
REP(i, n) ans = min(ans, sb[i] + sw[n - 1] - sw[i]);
cout << ans << endl;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define ALL(obj) \
(obj).begin(), (obj).end() //イテレータの簡略化（コンテナじゃないと使えない）
using namespace std;
typedef long long ll; // long longをllでかけるようにした
const int INF = 100100100;
// 最大公約数
int gcd(int a, int b) {
int c;
if (a < b) {
a += b;
b = a - b;
a -= b;
}
while (b != 0) {
c = a % b;
a = b;
b = c;
}
return a;
}
// 最小公倍数
int lcm(int m, int n) {
// 引数に０がある場合は０を返す
if ((0 == m) || (0 == n))
return 0;
return ((m / gcd(m, n)) * n); // lcm = m * n / gcd(m,n)
}
/* 二分探索 */
// indexが条件を満たすかどうか
bool isOK(int index, int key, vector<int> a) {
if (a[index] >= key)
return true;
else
return false;
}
//汎用的な二分探索のテンプレ
int meguru_binary_search(int key, vector<int> A) {
int ng = -1; // lowerの時は-1, upperの時は(int)A.size() //「index =
// 0」が条件を満たすこともあるので、初期値は -1
int ok =
(int)A.size(); // lowerの時は(int)A.size(), upperの時は-1 // 「index =
// a.size()-1」が条件を満たさないこともあるので、初期値は
// a.size()
/* どんな二分探索でもここの書き方を変えずにできる！ */
while (abs(ok - ng) > 1) {
int mid = (ok + ng) / 2;
if (isOK(mid, key, A))
ok = mid;
else
ng = mid;
}
/* left は条件を満たさない最大の値、right
* は条件を満たす最小の値になっている(lowerだと) */
return ok;
}
/* lower_boundとかでイテレータから配列の添え字を求めたいとき(lower_bound(v.begin(),v.end(),hoge)-v.begin())というようにする
*/
// distanceも使える
//三項演算子 ?:
int main(void) {
int n;
cin >> n;
string s;
cin >> s;
vector<int> sb(n), sw(n);
if (s[0] == '.') {
sb[0] = 0;
sw[0] = 1;
} else {
sb[0] = 1;
sw[0] = 0;
}
FOR(i, 1, n) {
if (s[i] == '.') {
sb[i] = sb[i - 1];
sw[i] = sw[i - 1] + 1;
} else {
sb[i] = sb[i - 1] + 1;
sw[i] = sw[i - 1];
}
}
int ans = sw[n - 1];
REP(i, n) ans = min(ans, sb[i] + sw[n - 1] - sw[i]);
cout << ans << endl;
} | [
"identifier.replace.add",
"literal.replace.remove"
] | 884,685 | 884,686 | u369212307 | cpp |
p03069 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)
#define REP(i, n) FOR(i, 0, n - 1)
#define NREP(i, n) FOR(i, 1, n)
using ll = long long;
using pii = pair<int, int>;
using piii = pair<pii, pii>;
const int dx[4] = {0, -1, 1, 0};
const int dy[4] = {-1, 0, 0, 1};
const int INF = 1e9 + 7;
int gcd(int x, int y) {
if (x < y)
swap(x, y);
if (y == 0)
return x;
return gcd(y, x % y);
}
template <class T1, class T2> void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <class T1, class T2> void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
template <class T> void Add(T &a, const T &b, const T &mod = 1000000007) {
int val = ((a % mod) + (b % mod)) % mod;
if (val < 0) {
val += mod;
}
a = val;
}
////////////////////////////////////////
int main() {
int N;
string S;
cin >> N >> S;
int ans = INF;
int key1[200100] = {}; // key1[i]でi文字目までに含まれている.の数
for (int i = 0; i < N; ++i) {
key1[i + 1] += key1[i];
if (S[i] == '.') {
key1[i + 1]++;
}
}
for (int i = 1; i <= N; ++i) {
int key = 0;
key += (i - key1[i]);
key += (key1[N] - key1[i]);
ans = min(ans, key);
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)
#define REP(i, n) FOR(i, 0, n - 1)
#define NREP(i, n) FOR(i, 1, n)
using ll = long long;
using pii = pair<int, int>;
using piii = pair<pii, pii>;
const int dx[4] = {0, -1, 1, 0};
const int dy[4] = {-1, 0, 0, 1};
const int INF = 1e9 + 7;
int gcd(int x, int y) {
if (x < y)
swap(x, y);
if (y == 0)
return x;
return gcd(y, x % y);
}
template <class T1, class T2> void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <class T1, class T2> void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
template <class T> void Add(T &a, const T &b, const T &mod = 1000000007) {
int val = ((a % mod) + (b % mod)) % mod;
if (val < 0) {
val += mod;
}
a = val;
}
////////////////////////////////////////
int main() {
int N;
string S;
cin >> N >> S;
int ans = INF;
int key1[200100] = {}; // key1[i]でi文字目までに含まれている.の数
for (int i = 0; i < N; ++i) {
key1[i + 1] += key1[i];
if (S[i] == '.') {
key1[i + 1]++;
}
}
for (int i = 0; i <= N; ++i) {
int key = 0;
key += (i - key1[i]);
key += (key1[N] - key1[i]);
ans = min(ans, key);
}
cout << ans << endl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 884,687 | 884,688 | u406158207 | cpp |
p03069 | #ifdef _DEBUG
#include "MyLib.h"
#else
#define main_C main
#include "bits/stdc++.h"
#include <regex>
#define _USE_MATH_DEFINES
#include <math.h>
#define FOR(i, s, e) for (int i = int(s); i < int(e); ++i)
#define REP(i, e) FOR(i, 0, e)
#define INF (INT_MAX / 2)
#define EPS (1.0e-8)
#define LINF (LONG_MAX / 2)
const int MGN = 8;
const int ARY_SZ_MAX = 10000000;
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvvb = vector<vvb>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vd = vector<double>;
using vs = vector<string>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
// functions
#endif
int main_C() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
string S;
cin >> S;
int white = 0, black = 0;
REP(i, N) {
if (S[i] == '.')
white++;
else
black++;
}
int ans = INF;
int w = 0, b = 0;
REP(i, N) {
if (S[i] == '.')
w++;
else
b++;
ans = min(ans, b + white - w);
}
cout << ans << endl;
return 0;
} | #ifdef _DEBUG
#include "MyLib.h"
#else
#define main_C main
#include "bits/stdc++.h"
#include <regex>
#define _USE_MATH_DEFINES
#include <math.h>
#define FOR(i, s, e) for (int i = int(s); i < int(e); ++i)
#define REP(i, e) FOR(i, 0, e)
#define INF (INT_MAX / 2)
#define EPS (1.0e-8)
#define LINF (LONG_MAX / 2)
const int MGN = 8;
const int ARY_SZ_MAX = 10000000;
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvvb = vector<vvb>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vd = vector<double>;
using vs = vector<string>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
// functions
#endif
int main_C() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
string S;
cin >> S;
int white = 0, black = 0;
REP(i, N) {
if (S[i] == '.')
white++;
else
black++;
}
int ans = white;
int w = 0, b = 0;
REP(i, N) {
if (S[i] == '.')
w++;
else
b++;
ans = min(ans, b + white - w);
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.value.change",
"identifier.change"
] | 884,695 | 884,696 | u404244809 | cpp |
p03069 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
int white = 0;
for (char &c : S) {
if (c == '.')
white++;
}
int rightWhite = white;
int leftBlack = 0;
int ans = N;
for (int inx = 0; inx < N; inx++) {
if (S[inx] == '.') {
rightWhite--;
} else {
leftBlack++;
}
ans = min(ans, leftBlack + rightWhite);
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
int white = 0;
for (char &c : S) {
if (c == '.')
white++;
}
int rightWhite = white;
int leftBlack = 0;
int ans = white;
for (int inx = 0; inx < N; inx++) {
if (S[inx] == '.') {
rightWhite--;
} else {
leftBlack++;
}
ans = min(ans, leftBlack + rightWhite);
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.value.change",
"identifier.change"
] | 884,721 | 884,722 | u436484848 | cpp |
p03069 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
const int INF = 1e9;
int main() {
int N;
string S;
cin >> N >> S;
int white = 0, black = 0;
for (char &c : S) {
if (c == '.')
white++;
else
black++;
}
int leftWhite = 0, rightWhite = white;
int leftBlack = 0, rightBlack = black;
int ans = min(white, black);
for (int inx = 0; inx < N; inx++) {
if (S[inx] == '.') {
leftWhite++;
rightWhite--;
}
{
leftBlack++;
rightBlack--;
}
ans = min(ans, leftBlack + rightWhite);
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
const int INF = 1e9;
int main() {
int N;
string S;
cin >> N >> S;
int white = 0, black = 0;
for (char &c : S) {
if (c == '.')
white++;
else
black++;
}
int leftWhite = 0, rightWhite = white;
int leftBlack = 0, rightBlack = black;
int ans = min(white, black);
for (int inx = 0; inx < N; inx++) {
if (S[inx] == '.') {
leftWhite++;
rightWhite--;
} else {
leftBlack++;
rightBlack--;
}
ans = min(ans, leftBlack + rightWhite);
}
cout << ans << endl;
return 0;
}
| [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 884,723 | 884,724 | u436484848 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
vector<int> black(N + 1, 0), white(N + 1, 0);
for (int i = 1; i <= N; i++) {
if (S[i - 1] == '#')
black[i] = black[i - 1] + 1;
else
black[i] = black[i - 1];
}
for (int i = N - 2; i >= -1; i--) {
if (S[i + 1] == '.')
white[i + 1] = white[i + 2] + 1;
else
white[i + 1] = white[i + 2];
}
for (int i = 1; i < N + 1; i++) {
black[i] += white[i];
}
sort(black.begin(), black.end());
cout << black[1] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
vector<int> black(N + 1, 0), white(N + 1, 0);
for (int i = 1; i <= N; i++) {
if (S[i - 1] == '#')
black[i] = black[i - 1] + 1;
else
black[i] = black[i - 1];
}
for (int i = N - 2; i >= -1; i--) {
if (S[i + 1] == '.')
white[i + 1] = white[i + 2] + 1;
else
white[i + 1] = white[i + 2];
}
for (int i = 0; i <= N; i++) {
black[i] += white[i];
}
sort(black.begin(), black.end());
cout << black[0] << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"variable_acc... | 884,774 | 884,775 | u628332144 | cpp |
p03069 | #include <bits/stdc++.h>
#define mkp make_pair
#define pb push_back
#define emb emplace_back
#define em emplace
#define ii pair<int, int>
#define iii pair<int, ii>
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define allc(x) x.begin(), x.end(), cmp
#define optimizar_io \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
using namespace std;
const int INF = 0x3f3f3f3f;
const int MAXN = 2e5 + 5;
char s[MAXN];
int b[MAXN], w[MAXN];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf(" %c", &s[i]);
}
for (int i = 1; i <= n; i++) {
if (s[i - 1] == '#') {
b[i]++;
}
b[i] += b[i - 1];
}
for (int i = n; i >= 1; i--) {
if (s[i - 1] == '.') {
w[i]++;
}
w[i] += w[i + 1];
}
int ans = MAXN + 1;
// for(int i = 1 ; i <= n ; i++){
// printf("%d ",b[i]);
// }
// printf("\n");
// for(int i = 1 ; i <= n ; i++){
// printf("%d ",w[i]);
// }
for (int i = 1; i <= n; i++) {
ans = min(ans, b[i] + w[i + 1]);
}
printf("%d", ans);
} | #include <bits/stdc++.h>
#define mkp make_pair
#define pb push_back
#define emb emplace_back
#define em emplace
#define ii pair<int, int>
#define iii pair<int, ii>
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define allc(x) x.begin(), x.end(), cmp
#define optimizar_io \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
using namespace std;
const int INF = 0x3f3f3f3f;
const int MAXN = 2e5 + 5;
char s[MAXN];
int b[MAXN], w[MAXN];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf(" %c", &s[i]);
}
for (int i = 1; i <= n; i++) {
if (s[i - 1] == '#') {
b[i]++;
}
b[i] += b[i - 1];
}
for (int i = n; i >= 1; i--) {
if (s[i - 1] == '.') {
w[i]++;
}
w[i] += w[i + 1];
}
int ans = MAXN + 1;
// for(int i = 1 ; i <= n ; i++){
// printf("%d ",b[i]);
// }
// printf("\n");
// for(int i = 1 ; i <= n ; i++){
// printf("%d ",w[i]);
// }
for (int i = 0; i <= n; i++) {
ans = min(ans, b[i] + w[i + 1]);
}
printf("%d", ans);
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 884,784 | 884,785 | u091359364 | cpp |
p03069 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
int main() {
long N;
cin >> N;
string S;
cin >> S;
long count_white = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == '.')
count_white++;
}
long count_black = 0;
long count_min = 9999999;
for (long borderline = 0; borderline < S.size(); borderline++) {
if (S[borderline] == '.') {
count_white--;
} else if (S[borderline] == '#') {
count_black++;
}
if (count_min > (count_white + count_black)) {
count_min = count_white + count_black;
}
}
cout << count_min << endl;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
int main() {
long N;
cin >> N;
string S;
cin >> S;
long count_white = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == '.')
count_white++;
}
long count_black = 0;
long count_min = count_white;
for (long borderline = 0; borderline < S.size(); borderline++) {
if (S[borderline] == '.') {
count_white--;
} else if (S[borderline] == '#') {
count_black++;
}
if (count_min > (count_white + count_black)) {
count_min = count_white + count_black;
}
}
cout << count_min << endl;
} | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 884,798 | 884,799 | u027284591 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define loop(i, a, b) for (int i = a; i < (int)(b); i++)
int main() {
int N;
string S;
cin >> N;
cin >> S;
N = S.length();
int totalWhite = 0;
int totalBlack = 0;
int black[N];
int white[N];
rep(i, N) {
if (S[i] == '#') {
totalBlack++;
} else {
totalWhite++;
}
black[i] = totalBlack;
white[i] = totalWhite;
}
int ans = INT_MAX;
rep(i, N - 1) {
int leftBlack = black[i];
int leftWhite = white[i];
int rightBlack = totalBlack - black[i + 1];
int rightWhite = totalWhite - white[i + 1];
//全部白にするときの数
int allWhite = leftBlack + rightBlack;
//左を白、みぎを黒にするときの数
int turn = leftBlack + rightWhite;
//全部黒にする
int allBlack = leftWhite + rightWhite;
ans = min(ans, allWhite);
ans = min(ans, allBlack);
ans = min(ans, turn);
}
if (ans == INT_MAX) {
cout << 0 << endl;
} else {
cout << ans << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define loop(i, a, b) for (int i = a; i < (int)(b); i++)
int main() {
int N;
string S;
cin >> N;
cin >> S;
N = S.length();
int totalWhite = 0;
int totalBlack = 0;
int black[N];
int white[N];
rep(i, N) {
if (S[i] == '#') {
totalBlack++;
} else {
totalWhite++;
}
black[i] = totalBlack;
white[i] = totalWhite;
}
int ans = INT_MAX;
rep(i, N) {
int leftBlack = black[i];
int leftWhite = white[i];
int rightBlack = totalBlack - black[i];
int rightWhite = totalWhite - white[i];
//全部白にするときの数
int allWhite = leftBlack + rightBlack;
//左を白、みぎを黒にするときの数
int turn = leftBlack + rightWhite;
//全部黒にする
int allBlack = leftWhite + rightWhite;
ans = min(ans, allWhite);
ans = min(ans, allBlack);
ans = min(ans, turn);
}
if (ans == INT_MAX) {
cout << 0 << endl;
} else {
cout << ans << endl;
}
return 0;
} | [
"expression.operation.binary.remove"
] | 884,804 | 884,805 | u129315407 | cpp |
p03069 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const int INF = 2000000000;
// const ll MOD = 1000000007;
int N;
string S;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> N >> S;
vector<int> b_sum(N + 1, 0);
vector<int> w_sum(N + 1, 0);
for (int i = 1; i <= N; i++) {
if (S[i - 1] == '#') {
b_sum[i] = b_sum[i - 1] + 1;
} else {
b_sum[i] = b_sum[i - 1];
}
if (S[i - 1] == '.') {
w_sum[i] = w_sum[i - 1] + 1;
} else {
w_sum[i] = w_sum[i - 1];
}
}
int ans = INF;
for (int i = 0; i < N; i++) {
int tmp = 0;
tmp += (b_sum[i + 1] - b_sum[0]);
tmp += (w_sum[N] - w_sum[i + 1]);
ans = min(ans, tmp);
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const int INF = 2000000000;
// const ll MOD = 1000000007;
int N;
string S;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> N >> S;
vector<int> b_sum(N + 1, 0);
vector<int> w_sum(N + 1, 0);
for (int i = 1; i <= N; i++) {
if (S[i - 1] == '#') {
b_sum[i] = b_sum[i - 1] + 1;
} else {
b_sum[i] = b_sum[i - 1];
}
if (S[i - 1] == '.') {
w_sum[i] = w_sum[i - 1] + 1;
} else {
w_sum[i] = w_sum[i - 1];
}
}
int ans = INF;
for (int i = 0; i <= N; i++) {
int tmp = 0;
tmp += (b_sum[i] - b_sum[0]);
tmp += (w_sum[N] - w_sum[i]);
ans = min(ans, tmp);
}
cout << ans << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 884,806 | 884,807 | u751964641 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define bug cout << "AIkahne aise" << endl
ll A[5000001];
vector<ll> v;
vector<pair<ll, ll>> v2;
/*void sieve()
{
for(ll i=3; i<=2000; i+=2)
{
for(ll j=i*i; j<=4000000; j+=i)
A[j]=1;
}
v.push_back(2);
for(ll i=3; i<=4000000; i+=2)
if(A[i]==0)
v.push_back(i);
}*/
int main() {
ll n, k, white = 0, black = 0, ans = 9999999999, nblack = 0, nwhite = 0;
string s;
cin >> n;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '#')
black++;
else
white++;
}
for (int i = 0; i < s.size(); i++) {
if (s[i] == '#')
nblack++;
else
nwhite++;
ans = min(ans, nblack + white - nwhite);
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define bug cout << "AIkahne aise" << endl
ll A[5000001];
vector<ll> v;
vector<pair<ll, ll>> v2;
/*void sieve()
{
for(ll i=3; i<=2000; i+=2)
{
for(ll j=i*i; j<=4000000; j+=i)
A[j]=1;
}
v.push_back(2);
for(ll i=3; i<=4000000; i+=2)
if(A[i]==0)
v.push_back(i);
}*/
int main() {
ll n, k, white = 0, black = 0, ans = 9999999999, nblack = 0, nwhite = 0;
string s;
cin >> n;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '#')
black++;
else
white++;
}
ans = white;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '#')
nblack++;
else
nwhite++;
ans = min(ans, nblack + white - nwhite);
}
cout << ans << endl;
return 0;
}
| [
"assignment.add"
] | 884,808 | 884,809 | u313033295 | cpp |
p03069 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define INF 2147483647
#define LINF 9223372036854775807
#define MOD 1000000007
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
//#define MODE 1
#ifdef MODE
#define DEB(X) cout << #X << ": " << X << " ";
#define ARDEB(i, X) cout << #X << "[" << i << "]: " << X[i] << " ";
#define END cout << endl;
#else
#define DEB(X) \
{}
#define ARDEB(i, X) \
{}
#define END \
{}
#endif
// typedef long long int ll;
signed main() {
int n;
string s;
cin >> n >> s;
int b[222222], w[222222];
int kb = 0, kw = 0;
b[0] = 0;
w[0] = 0;
for (int i = 1; i <= s.size(); i++) {
if (s[i] == '#')
kb++;
else
kw++;
b[i] = kb;
w[i] = kw;
}
int min = INF;
rep(i, s.size() + 1) { min = std::min(b[i] + w[s.size()] - w[i], min); }
cout << min << endl;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define INF 2147483647
#define LINF 9223372036854775807
#define MOD 1000000007
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
//#define MODE 1
#ifdef MODE
#define DEB(X) cout << #X << ": " << X << " ";
#define ARDEB(i, X) cout << #X << "[" << i << "]: " << X[i] << " ";
#define END cout << endl;
#else
#define DEB(X) \
{}
#define ARDEB(i, X) \
{}
#define END \
{}
#endif
// typedef long long int ll;
signed main() {
int n;
string s;
cin >> n >> s;
int b[222222], w[222222];
int kb = 0, kw = 0;
b[0] = 0;
w[0] = 0;
for (int i = 1; i <= s.size(); i++) {
if (s[i - 1] == '#')
kb++;
else
kw++;
b[i] = kb;
w[i] = kw;
}
int min = INF;
rep(i, s.size() + 1) { min = std::min(b[i] + w[s.size()] - w[i], min); }
cout << min << endl;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 884,810 | 884,811 | u901561754 | cpp |
p03069 | #include <iostream>
#include <algorithm>
#include <string>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
// 境界を探索
int c_b = 0, c_w = 0;
for (int i = 0; i < n; i++) {
string t = s.substr(i, 1);
if (s == ".")
c_w++;
}
int min = c_w;
for (int i = 0; i < n; i++) {
string t = s.substr(i, 1);
if (s == "#")
c_b++;
if (s == ".")
c_w--;
if (min > c_b + c_w)
min = c_b + c_w;
}
cout << min << endl;
} | #include <iostream>
#include <algorithm>
#include <string>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
// 境界を探索
int c_b = 0, c_w = 0;
for (int i = 0; i < n; i++) {
string t = s.substr(i, 1);
if (t == ".")
c_w++;
}
int min = c_w;
for (int i = 0; i < n; i++) {
string t = s.substr(i, 1);
if (t == "#")
c_b++;
if (t == ".")
c_w--;
if (min > c_b + c_w)
min = c_b + c_w;
}
cout << min << endl;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 884,821 | 884,822 | u491550356 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string a;
cin >> a;
//白白...黒黒...
vector<int> b(n + 1);
vector<int> w(n + 1);
for (int i = 1; i <= n; i++) {
if (a[i - 1] == '.') {
w[i] = w[i - 1] + 1;
b[i] = b[i - 1];
} else {
w[i] = w[i - 1];
b[i] = b[i - 1] + 1;
}
}
int ans, cnt;
ans = 200000;
for (int i = 1; i <= n; i++) {
cnt = b[i] - w[i] + w[n];
if (cnt < ans)
ans = cnt;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string a;
cin >> a;
//白白...黒黒...
vector<int> b(n + 1);
vector<int> w(n + 1);
for (int i = 1; i <= n; i++) {
if (a[i - 1] == '.') {
w[i] = w[i - 1] + 1;
b[i] = b[i - 1];
} else {
w[i] = w[i - 1];
b[i] = b[i - 1] + 1;
}
}
int ans, cnt;
ans = 200000;
for (int i = 0; i <= n; i++) {
cnt = b[i] - w[i] + w[n];
if (cnt < ans)
ans = cnt;
}
cout << ans << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 884,829 | 884,830 | u280114218 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string a;
cin >> a;
//白白...黒黒...
vector<int> b(n + 1);
vector<int> w(n + 1);
for (int i = 1; i <= n; i++) {
if (a[i - 1] == '.') {
w[i] = w[i - 1] + 1;
b[i] = b[i - 1];
} else {
w[i] = w[i - 1];
b[i] = b[i - 1] + 1;
}
}
int ans, cnt;
ans = 200000;
for (int i = 1; i <= n; i++) {
cnt = b[i] - w[i] + w[n];
if (cnt < ans)
ans = cnt;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string a;
cin >> a;
//白白...黒黒...
vector<int> b(n + 1);
vector<int> w(n + 1);
for (int i = 1; i <= n; i++) {
if (a[i - 1] == '.') {
w[i] = w[i - 1] + 1;
b[i] = b[i - 1];
} else {
w[i] = w[i - 1];
b[i] = b[i - 1] + 1;
}
}
int ans, cnt;
ans = 200000;
for (int i = 0; i <= n; i++) {
cnt = b[i] - w[i] + w[n];
if (cnt < ans)
ans = cnt;
}
cout << ans << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 884,831 | 884,830 | u280114218 | cpp |
p03073 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
int main() {
string s;
cin >> s;
int n = s.size();
int ct = 0;
for (int i = 0; i < n; i++) {
if ((i % 2 == 0 && s[i] == '0') || (i % 2 == 1 && s[i] == '1'))
ct++;
}
int ct2 = 0;
for (int i = 0; i < n; i++) {
if ((i % 2 == 0 && s[i] == '1') || (i % 2 == 1 && s[i] == '0'))
ct2++;
}
cout << max(ct, ct2) << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
int main() {
string s;
cin >> s;
int n = s.size();
int ct = 0;
for (int i = 0; i < n; i++) {
if ((i % 2 == 0 && s[i] == '0') || (i % 2 == 1 && s[i] == '1'))
ct++;
}
int ct2 = 0;
for (int i = 0; i < n; i++) {
if ((i % 2 == 0 && s[i] == '1') || (i % 2 == 1 && s[i] == '0'))
ct2++;
}
cout << min(ct, ct2) << endl;
return 0;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 884,843 | 884,844 | u930898631 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using uint = unsigned int;
using pcc = pair<char, char>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using tuplis = pair<ll, pll>;
using tuplis2 = pair<pll, ll>;
template <class T> using pq = priority_queue<T, vector<T>, greater<T>>;
const ll LINF = 0x1fffffffffffffff;
const ll MOD = 1000000007;
const ll MODD = 998244353;
const int INF = 0x3fffffff;
const double DINF = numeric_limits<double>::infinity();
const vector<ll> four = {0, 1, 0, -1, 0};
const vector<ll> eight = {0, 1, -1, 1, 1, 0, -1, -1, 0};
#define _overload4(_1, _2, _3, _4, name, ...) name
#define _overload3(_1, _2, _3, name, ...) name
#define _rep1(n) for (ll i = 0; i < n; ++i)
#define _rep2(i, n) for (ll i = 0; i < n; ++i)
#define _rep3(i, a, b) for (ll i = a; i < b; ++i)
#define _rep4(i, a, b, c) for (ll i = a; i < b; i += c)
#define rep(...) \
_overload4(__VA_ARGS__, _rep4, _rep3, _rep2, _rep1)(__VA_ARGS__)
#define _rrep1(n) for (ll i = n - 1; i >= 0; i--)
#define _rrep2(i, n) for (ll i = n - 1; i >= 0; i--)
#define _rrep3(i, a, b) for (ll i = b - 1; i >= a; i--)
#define _rrep4(i, a, b, c) for (ll i = a + (b - a - 1) / c * c; i >= a; i -= c)
#define rrep(...) \
_overload4(__VA_ARGS__, _rrep4, _rrep3, _rrep2, _rrep1)(__VA_ARGS__)
#define each(i, a) for (auto &i : a)
#define sum(...) accumulate(range(__VA_ARGS__), 0LL)
#define dsum(...) accumulate(range(__VA_ARGS__), double(0))
#define _range(i) (i).begin(), (i).end()
#define _range2(i, k) (i).begin(), (i).begin() + k
#define _range3(i, a, b) (i).begin() + a, (i).begin() + b
#define range(...) \
_overload3(__VA_ARGS__, _range3, _range2, _range)(__VA_ARGS__)
#define _rrange(i) (i).rbegin(), (i).rend()
#define _rrange2(i, k) (i).rbegin(), (i).rbegin() + k
#define _rrange3(i, a, b) (i).rbegin() + a, (i).rbegin() + b
#define rrange(...) \
_overload3(__VA_ARGS__, _rrange3, _rrange2, _rrange)(__VA_ARGS__)
#define elif else if
#define unless(a) if (!(a))
#define mp make_pair
#define mt make_tuple
#define INT(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define LL(...) \
ll __VA_ARGS__; \
in(__VA_ARGS__)
#define ULL(...) \
ull __VA_ARGS__; \
in(__VA_ARGS__)
#define STR(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
#define CHR(...) \
char __VA_ARGS__; \
in(__VA_ARGS__)
#define DBL(...) \
double __VA_ARGS__; \
in(__VA_ARGS__)
#define LD(...) \
ld __VA_ARGS__; \
in(__VA_ARGS__)
#define vec(type, name, ...) vector<type> name(__VA_ARGS__)
#define VEC(type, name, size) \
vector<type> name(size); \
in(name)
#define vv(type, name, h, ...) \
vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define VV(type, name, h, ...) \
vector<vector<type>> name(h, vector<type>(__VA_ARGS__)); \
in(name)
#define vvv(type, name, h, w, ...) \
vector<vector<vector<type>>> name( \
h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))
__attribute__((constructor)) void SETTINGS() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
};
inline constexpr ll gcd(ll a, ll b) {
if (!a || !b)
return 0;
if (a < b) {
ll c = a;
a = b;
b = c;
}
while (b) {
ll c = b;
b = a % b;
a = c;
}
return a;
}
inline constexpr ll lcm(ll a, ll b) {
if (!a || !b)
return 0;
return a * b / gcd(a, b);
}
template <class T> inline constexpr T min(vector<T> &v) {
return *min_element(range(v));
}
inline char min(string &v) { return *min_element(range(v)); }
template <class T> inline constexpr T max(vector<T> &v) {
return *max_element(range(v));
}
inline char max(string &v) { return *max_element(range(v)); }
inline constexpr ll intpow(const ll &a, const ll &b) {
if (b == 0)
return 1;
ll ans = intpow(a, b / 2);
return ans * ans * (b & 1 ? a : 1);
}
inline constexpr ll modpow(const ll &a, const ll &b, const ll &mod = MOD) {
if (b == 0)
return 1;
ll ans = modpow(a, b / 2, mod);
ans = ans * ans % mod;
if (b & 1)
ans = ans * a % mod;
return ans;
}
template <typename T> inline constexpr bool update_min(T &mn, const T &cnt) {
if (mn > cnt) {
mn = cnt;
return 1;
} else
return 0;
}
template <typename T> inline constexpr bool update_max(T &mx, const T &cnt) {
if (mx < cnt) {
mx = cnt;
return 1;
} else
return 0;
}
inline void in() {}
template <class T> istream &operator>>(istream &is, vector<T> &vec);
template <class T, size_t size>
istream &operator>>(istream &is, array<T, size> &vec);
template <class T, class L> istream &operator>>(istream &is, pair<T, L> &p);
template <class T> ostream &operator<<(ostream &os, vector<T> &vec);
template <class T, class L> ostream &operator<<(ostream &os, pair<T, L> &p);
template <class T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
template <class T, class L> istream &operator>>(istream &is, pair<T, L> &p) {
is >> p.first;
is >> p.second;
return is;
}
template <class T> ostream &operator<<(ostream &os, vector<T> &vec) {
os << vec[0];
rep(i, 1, vec.size()) { os << ' ' << vec[i]; }
return os;
}
template <class T> ostream &operator<<(ostream &os, deque<T> &deq) {
os << deq[0];
rep(i, 1, deq.size()) { os << ' ' << deq[i]; }
return os;
}
template <class T, class L> ostream &operator<<(ostream &os, pair<T, L> &p) {
os << p.first << " " << p.second;
return os;
}
template <class T, class L> pair<T, L> operator+(pair<T, L> a, pair<T, L> b) {
return {a.first + b.first, a.second + b.second};
}
template <class Head, class... Tail>
inline void in(Head &&head, Tail &&...tail) {
cin >> head;
in(move(tail)...);
}
template <class T> inline bool out(T t) {
cout << t << '\n';
return 0;
}
inline bool out() {
cout << '\n';
return 0;
}
template <class Head, class... Tail> inline bool out(Head head, Tail... tail) {
cout << head << ' ';
out(move(tail)...);
return 0;
}
template <class T> inline void err(T t) { cerr << t << '\n'; }
inline void err() { cerr << '\n'; }
template <class Head, class... Tail> inline void err(Head head, Tail... tail) {
cerr << head << ' ';
out(move(tail)...);
}
inline bool yes(bool i) { return out(i ? "yes" : "no"); }
inline bool Yes(bool i) { return out(i ? "Yes" : "No"); }
inline bool YES(bool i) { return out(i ? "YES" : "NO"); }
inline bool Yay(bool i) { return out(i ? "Yay!" : ":("); }
inline bool possible(bool i) { return out(i ? "possible" : "impossible"); }
inline bool Possible(bool i) { return out(i ? "Possible" : "Impossible"); }
inline bool POSSIBLE(bool i) { return out(i ? "POSSIBLE" : "IMPOSSIBLE"); }
inline bool First(bool i) { return out(i ? "First" : "Second"); }
inline void Case(ll i) { cout << "Case #" << i << ": "; }
signed main() {
STR(s);
ll a = 0, b = 0;
rep(s.size()) {
if (s[i] ^ i & 1)
a++;
else
b++;
}
out(min(a, b));
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using uint = unsigned int;
using pcc = pair<char, char>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using tuplis = pair<ll, pll>;
using tuplis2 = pair<pll, ll>;
template <class T> using pq = priority_queue<T, vector<T>, greater<T>>;
const ll LINF = 0x1fffffffffffffff;
const ll MOD = 1000000007;
const ll MODD = 998244353;
const int INF = 0x3fffffff;
const double DINF = numeric_limits<double>::infinity();
const vector<ll> four = {0, 1, 0, -1, 0};
const vector<ll> eight = {0, 1, -1, 1, 1, 0, -1, -1, 0};
#define _overload4(_1, _2, _3, _4, name, ...) name
#define _overload3(_1, _2, _3, name, ...) name
#define _rep1(n) for (ll i = 0; i < n; ++i)
#define _rep2(i, n) for (ll i = 0; i < n; ++i)
#define _rep3(i, a, b) for (ll i = a; i < b; ++i)
#define _rep4(i, a, b, c) for (ll i = a; i < b; i += c)
#define rep(...) \
_overload4(__VA_ARGS__, _rep4, _rep3, _rep2, _rep1)(__VA_ARGS__)
#define _rrep1(n) for (ll i = n - 1; i >= 0; i--)
#define _rrep2(i, n) for (ll i = n - 1; i >= 0; i--)
#define _rrep3(i, a, b) for (ll i = b - 1; i >= a; i--)
#define _rrep4(i, a, b, c) for (ll i = a + (b - a - 1) / c * c; i >= a; i -= c)
#define rrep(...) \
_overload4(__VA_ARGS__, _rrep4, _rrep3, _rrep2, _rrep1)(__VA_ARGS__)
#define each(i, a) for (auto &i : a)
#define sum(...) accumulate(range(__VA_ARGS__), 0LL)
#define dsum(...) accumulate(range(__VA_ARGS__), double(0))
#define _range(i) (i).begin(), (i).end()
#define _range2(i, k) (i).begin(), (i).begin() + k
#define _range3(i, a, b) (i).begin() + a, (i).begin() + b
#define range(...) \
_overload3(__VA_ARGS__, _range3, _range2, _range)(__VA_ARGS__)
#define _rrange(i) (i).rbegin(), (i).rend()
#define _rrange2(i, k) (i).rbegin(), (i).rbegin() + k
#define _rrange3(i, a, b) (i).rbegin() + a, (i).rbegin() + b
#define rrange(...) \
_overload3(__VA_ARGS__, _rrange3, _rrange2, _rrange)(__VA_ARGS__)
#define elif else if
#define unless(a) if (!(a))
#define mp make_pair
#define mt make_tuple
#define INT(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define LL(...) \
ll __VA_ARGS__; \
in(__VA_ARGS__)
#define ULL(...) \
ull __VA_ARGS__; \
in(__VA_ARGS__)
#define STR(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
#define CHR(...) \
char __VA_ARGS__; \
in(__VA_ARGS__)
#define DBL(...) \
double __VA_ARGS__; \
in(__VA_ARGS__)
#define LD(...) \
ld __VA_ARGS__; \
in(__VA_ARGS__)
#define vec(type, name, ...) vector<type> name(__VA_ARGS__)
#define VEC(type, name, size) \
vector<type> name(size); \
in(name)
#define vv(type, name, h, ...) \
vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define VV(type, name, h, ...) \
vector<vector<type>> name(h, vector<type>(__VA_ARGS__)); \
in(name)
#define vvv(type, name, h, w, ...) \
vector<vector<vector<type>>> name( \
h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))
__attribute__((constructor)) void SETTINGS() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
};
inline constexpr ll gcd(ll a, ll b) {
if (!a || !b)
return 0;
if (a < b) {
ll c = a;
a = b;
b = c;
}
while (b) {
ll c = b;
b = a % b;
a = c;
}
return a;
}
inline constexpr ll lcm(ll a, ll b) {
if (!a || !b)
return 0;
return a * b / gcd(a, b);
}
template <class T> inline constexpr T min(vector<T> &v) {
return *min_element(range(v));
}
inline char min(string &v) { return *min_element(range(v)); }
template <class T> inline constexpr T max(vector<T> &v) {
return *max_element(range(v));
}
inline char max(string &v) { return *max_element(range(v)); }
inline constexpr ll intpow(const ll &a, const ll &b) {
if (b == 0)
return 1;
ll ans = intpow(a, b / 2);
return ans * ans * (b & 1 ? a : 1);
}
inline constexpr ll modpow(const ll &a, const ll &b, const ll &mod = MOD) {
if (b == 0)
return 1;
ll ans = modpow(a, b / 2, mod);
ans = ans * ans % mod;
if (b & 1)
ans = ans * a % mod;
return ans;
}
template <typename T> inline constexpr bool update_min(T &mn, const T &cnt) {
if (mn > cnt) {
mn = cnt;
return 1;
} else
return 0;
}
template <typename T> inline constexpr bool update_max(T &mx, const T &cnt) {
if (mx < cnt) {
mx = cnt;
return 1;
} else
return 0;
}
inline void in() {}
template <class T> istream &operator>>(istream &is, vector<T> &vec);
template <class T, size_t size>
istream &operator>>(istream &is, array<T, size> &vec);
template <class T, class L> istream &operator>>(istream &is, pair<T, L> &p);
template <class T> ostream &operator<<(ostream &os, vector<T> &vec);
template <class T, class L> ostream &operator<<(ostream &os, pair<T, L> &p);
template <class T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
template <class T, class L> istream &operator>>(istream &is, pair<T, L> &p) {
is >> p.first;
is >> p.second;
return is;
}
template <class T> ostream &operator<<(ostream &os, vector<T> &vec) {
os << vec[0];
rep(i, 1, vec.size()) { os << ' ' << vec[i]; }
return os;
}
template <class T> ostream &operator<<(ostream &os, deque<T> &deq) {
os << deq[0];
rep(i, 1, deq.size()) { os << ' ' << deq[i]; }
return os;
}
template <class T, class L> ostream &operator<<(ostream &os, pair<T, L> &p) {
os << p.first << " " << p.second;
return os;
}
template <class T, class L> pair<T, L> operator+(pair<T, L> a, pair<T, L> b) {
return {a.first + b.first, a.second + b.second};
}
template <class Head, class... Tail>
inline void in(Head &&head, Tail &&...tail) {
cin >> head;
in(move(tail)...);
}
template <class T> inline bool out(T t) {
cout << t << '\n';
return 0;
}
inline bool out() {
cout << '\n';
return 0;
}
template <class Head, class... Tail> inline bool out(Head head, Tail... tail) {
cout << head << ' ';
out(move(tail)...);
return 0;
}
template <class T> inline void err(T t) { cerr << t << '\n'; }
inline void err() { cerr << '\n'; }
template <class Head, class... Tail> inline void err(Head head, Tail... tail) {
cerr << head << ' ';
out(move(tail)...);
}
inline bool yes(bool i) { return out(i ? "yes" : "no"); }
inline bool Yes(bool i) { return out(i ? "Yes" : "No"); }
inline bool YES(bool i) { return out(i ? "YES" : "NO"); }
inline bool Yay(bool i) { return out(i ? "Yay!" : ":("); }
inline bool possible(bool i) { return out(i ? "possible" : "impossible"); }
inline bool Possible(bool i) { return out(i ? "Possible" : "Impossible"); }
inline bool POSSIBLE(bool i) { return out(i ? "POSSIBLE" : "IMPOSSIBLE"); }
inline bool First(bool i) { return out(i ? "First" : "Second"); }
inline void Case(ll i) { cout << "Case #" << i << ": "; }
signed main() {
STR(s);
ll a = 0, b = 0;
rep(s.size()) {
if ((s[i] ^ i) & 1)
a++;
else
b++;
}
out(min(a, b));
}
| [
"control_flow.branch.if.condition.change"
] | 884,847 | 884,848 | u874644572 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using uint = unsigned int;
using pcc = pair<char, char>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using tuplis = pair<ll, pll>;
using tuplis2 = pair<pll, ll>;
template <class T> using pq = priority_queue<T, vector<T>, greater<T>>;
const ll LINF = 0x1fffffffffffffff;
const ll MOD = 1000000007;
const ll MODD = 998244353;
const int INF = 0x3fffffff;
const double DINF = numeric_limits<double>::infinity();
const vector<ll> four = {0, 1, 0, -1, 0};
const vector<ll> eight = {0, 1, -1, 1, 1, 0, -1, -1, 0};
#define _overload4(_1, _2, _3, _4, name, ...) name
#define _overload3(_1, _2, _3, name, ...) name
#define _rep1(n) for (ll i = 0; i < n; ++i)
#define _rep2(i, n) for (ll i = 0; i < n; ++i)
#define _rep3(i, a, b) for (ll i = a; i < b; ++i)
#define _rep4(i, a, b, c) for (ll i = a; i < b; i += c)
#define rep(...) \
_overload4(__VA_ARGS__, _rep4, _rep3, _rep2, _rep1)(__VA_ARGS__)
#define _rrep1(n) for (ll i = n - 1; i >= 0; i--)
#define _rrep2(i, n) for (ll i = n - 1; i >= 0; i--)
#define _rrep3(i, a, b) for (ll i = b - 1; i >= a; i--)
#define _rrep4(i, a, b, c) for (ll i = a + (b - a - 1) / c * c; i >= a; i -= c)
#define rrep(...) \
_overload4(__VA_ARGS__, _rrep4, _rrep3, _rrep2, _rrep1)(__VA_ARGS__)
#define each(i, a) for (auto &i : a)
#define sum(...) accumulate(range(__VA_ARGS__), 0LL)
#define dsum(...) accumulate(range(__VA_ARGS__), double(0))
#define _range(i) (i).begin(), (i).end()
#define _range2(i, k) (i).begin(), (i).begin() + k
#define _range3(i, a, b) (i).begin() + a, (i).begin() + b
#define range(...) \
_overload3(__VA_ARGS__, _range3, _range2, _range)(__VA_ARGS__)
#define _rrange(i) (i).rbegin(), (i).rend()
#define _rrange2(i, k) (i).rbegin(), (i).rbegin() + k
#define _rrange3(i, a, b) (i).rbegin() + a, (i).rbegin() + b
#define rrange(...) \
_overload3(__VA_ARGS__, _rrange3, _rrange2, _rrange)(__VA_ARGS__)
#define elif else if
#define unless(a) if (!(a))
#define mp make_pair
#define mt make_tuple
#define INT(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define LL(...) \
ll __VA_ARGS__; \
in(__VA_ARGS__)
#define ULL(...) \
ull __VA_ARGS__; \
in(__VA_ARGS__)
#define STR(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
#define CHR(...) \
char __VA_ARGS__; \
in(__VA_ARGS__)
#define DBL(...) \
double __VA_ARGS__; \
in(__VA_ARGS__)
#define LD(...) \
ld __VA_ARGS__; \
in(__VA_ARGS__)
#define vec(type, name, ...) vector<type> name(__VA_ARGS__)
#define VEC(type, name, size) \
vector<type> name(size); \
in(name)
#define vv(type, name, h, ...) \
vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define VV(type, name, h, ...) \
vector<vector<type>> name(h, vector<type>(__VA_ARGS__)); \
in(name)
#define vvv(type, name, h, w, ...) \
vector<vector<vector<type>>> name( \
h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))
__attribute__((constructor)) void SETTINGS() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
};
inline constexpr ll gcd(ll a, ll b) {
if (!a || !b)
return 0;
if (a < b) {
ll c = a;
a = b;
b = c;
}
while (b) {
ll c = b;
b = a % b;
a = c;
}
return a;
}
inline constexpr ll lcm(ll a, ll b) {
if (!a || !b)
return 0;
return a * b / gcd(a, b);
}
template <class T> inline constexpr T min(vector<T> &v) {
return *min_element(range(v));
}
inline char min(string &v) { return *min_element(range(v)); }
template <class T> inline constexpr T max(vector<T> &v) {
return *max_element(range(v));
}
inline char max(string &v) { return *max_element(range(v)); }
inline constexpr ll intpow(const ll &a, const ll &b) {
if (b == 0)
return 1;
ll ans = intpow(a, b / 2);
return ans * ans * (b & 1 ? a : 1);
}
inline constexpr ll modpow(const ll &a, const ll &b, const ll &mod = MOD) {
if (b == 0)
return 1;
ll ans = modpow(a, b / 2, mod);
ans = ans * ans % mod;
if (b & 1)
ans = ans * a % mod;
return ans;
}
template <typename T> inline constexpr bool update_min(T &mn, const T &cnt) {
if (mn > cnt) {
mn = cnt;
return 1;
} else
return 0;
}
template <typename T> inline constexpr bool update_max(T &mx, const T &cnt) {
if (mx < cnt) {
mx = cnt;
return 1;
} else
return 0;
}
inline void in() {}
template <class T> istream &operator>>(istream &is, vector<T> &vec);
template <class T, size_t size>
istream &operator>>(istream &is, array<T, size> &vec);
template <class T, class L> istream &operator>>(istream &is, pair<T, L> &p);
template <class T> ostream &operator<<(ostream &os, vector<T> &vec);
template <class T, class L> ostream &operator<<(ostream &os, pair<T, L> &p);
template <class T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
template <class T, class L> istream &operator>>(istream &is, pair<T, L> &p) {
is >> p.first;
is >> p.second;
return is;
}
template <class T> ostream &operator<<(ostream &os, vector<T> &vec) {
os << vec[0];
rep(i, 1, vec.size()) { os << ' ' << vec[i]; }
return os;
}
template <class T> ostream &operator<<(ostream &os, deque<T> &deq) {
os << deq[0];
rep(i, 1, deq.size()) { os << ' ' << deq[i]; }
return os;
}
template <class T, class L> ostream &operator<<(ostream &os, pair<T, L> &p) {
os << p.first << " " << p.second;
return os;
}
template <class T, class L> pair<T, L> operator+(pair<T, L> a, pair<T, L> b) {
return {a.first + b.first, a.second + b.second};
}
template <class Head, class... Tail>
inline void in(Head &&head, Tail &&...tail) {
cin >> head;
in(move(tail)...);
}
template <class T> inline bool out(T t) {
cout << t << '\n';
return 0;
}
inline bool out() {
cout << '\n';
return 0;
}
template <class Head, class... Tail> inline bool out(Head head, Tail... tail) {
cout << head << ' ';
out(move(tail)...);
return 0;
}
template <class T> inline void err(T t) { cerr << t << '\n'; }
inline void err() { cerr << '\n'; }
template <class Head, class... Tail> inline void err(Head head, Tail... tail) {
cerr << head << ' ';
out(move(tail)...);
}
inline bool yes(bool i) { return out(i ? "yes" : "no"); }
inline bool Yes(bool i) { return out(i ? "Yes" : "No"); }
inline bool YES(bool i) { return out(i ? "YES" : "NO"); }
inline bool Yay(bool i) { return out(i ? "Yay!" : ":("); }
inline bool possible(bool i) { return out(i ? "possible" : "impossible"); }
inline bool Possible(bool i) { return out(i ? "Possible" : "Impossible"); }
inline bool POSSIBLE(bool i) { return out(i ? "POSSIBLE" : "IMPOSSIBLE"); }
inline bool First(bool i) { return out(i ? "First" : "Second"); }
inline void Case(ll i) { cout << "Case #" << i << ": "; }
signed main() {
STR(s);
ll a = 0, b = 0;
rep(s.size()) {
if (s[i] ^ i)
a++;
else
b++;
}
out(min(a, b));
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using uint = unsigned int;
using pcc = pair<char, char>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using tuplis = pair<ll, pll>;
using tuplis2 = pair<pll, ll>;
template <class T> using pq = priority_queue<T, vector<T>, greater<T>>;
const ll LINF = 0x1fffffffffffffff;
const ll MOD = 1000000007;
const ll MODD = 998244353;
const int INF = 0x3fffffff;
const double DINF = numeric_limits<double>::infinity();
const vector<ll> four = {0, 1, 0, -1, 0};
const vector<ll> eight = {0, 1, -1, 1, 1, 0, -1, -1, 0};
#define _overload4(_1, _2, _3, _4, name, ...) name
#define _overload3(_1, _2, _3, name, ...) name
#define _rep1(n) for (ll i = 0; i < n; ++i)
#define _rep2(i, n) for (ll i = 0; i < n; ++i)
#define _rep3(i, a, b) for (ll i = a; i < b; ++i)
#define _rep4(i, a, b, c) for (ll i = a; i < b; i += c)
#define rep(...) \
_overload4(__VA_ARGS__, _rep4, _rep3, _rep2, _rep1)(__VA_ARGS__)
#define _rrep1(n) for (ll i = n - 1; i >= 0; i--)
#define _rrep2(i, n) for (ll i = n - 1; i >= 0; i--)
#define _rrep3(i, a, b) for (ll i = b - 1; i >= a; i--)
#define _rrep4(i, a, b, c) for (ll i = a + (b - a - 1) / c * c; i >= a; i -= c)
#define rrep(...) \
_overload4(__VA_ARGS__, _rrep4, _rrep3, _rrep2, _rrep1)(__VA_ARGS__)
#define each(i, a) for (auto &i : a)
#define sum(...) accumulate(range(__VA_ARGS__), 0LL)
#define dsum(...) accumulate(range(__VA_ARGS__), double(0))
#define _range(i) (i).begin(), (i).end()
#define _range2(i, k) (i).begin(), (i).begin() + k
#define _range3(i, a, b) (i).begin() + a, (i).begin() + b
#define range(...) \
_overload3(__VA_ARGS__, _range3, _range2, _range)(__VA_ARGS__)
#define _rrange(i) (i).rbegin(), (i).rend()
#define _rrange2(i, k) (i).rbegin(), (i).rbegin() + k
#define _rrange3(i, a, b) (i).rbegin() + a, (i).rbegin() + b
#define rrange(...) \
_overload3(__VA_ARGS__, _rrange3, _rrange2, _rrange)(__VA_ARGS__)
#define elif else if
#define unless(a) if (!(a))
#define mp make_pair
#define mt make_tuple
#define INT(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define LL(...) \
ll __VA_ARGS__; \
in(__VA_ARGS__)
#define ULL(...) \
ull __VA_ARGS__; \
in(__VA_ARGS__)
#define STR(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
#define CHR(...) \
char __VA_ARGS__; \
in(__VA_ARGS__)
#define DBL(...) \
double __VA_ARGS__; \
in(__VA_ARGS__)
#define LD(...) \
ld __VA_ARGS__; \
in(__VA_ARGS__)
#define vec(type, name, ...) vector<type> name(__VA_ARGS__)
#define VEC(type, name, size) \
vector<type> name(size); \
in(name)
#define vv(type, name, h, ...) \
vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define VV(type, name, h, ...) \
vector<vector<type>> name(h, vector<type>(__VA_ARGS__)); \
in(name)
#define vvv(type, name, h, w, ...) \
vector<vector<vector<type>>> name( \
h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))
__attribute__((constructor)) void SETTINGS() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
};
inline constexpr ll gcd(ll a, ll b) {
if (!a || !b)
return 0;
if (a < b) {
ll c = a;
a = b;
b = c;
}
while (b) {
ll c = b;
b = a % b;
a = c;
}
return a;
}
inline constexpr ll lcm(ll a, ll b) {
if (!a || !b)
return 0;
return a * b / gcd(a, b);
}
template <class T> inline constexpr T min(vector<T> &v) {
return *min_element(range(v));
}
inline char min(string &v) { return *min_element(range(v)); }
template <class T> inline constexpr T max(vector<T> &v) {
return *max_element(range(v));
}
inline char max(string &v) { return *max_element(range(v)); }
inline constexpr ll intpow(const ll &a, const ll &b) {
if (b == 0)
return 1;
ll ans = intpow(a, b / 2);
return ans * ans * (b & 1 ? a : 1);
}
inline constexpr ll modpow(const ll &a, const ll &b, const ll &mod = MOD) {
if (b == 0)
return 1;
ll ans = modpow(a, b / 2, mod);
ans = ans * ans % mod;
if (b & 1)
ans = ans * a % mod;
return ans;
}
template <typename T> inline constexpr bool update_min(T &mn, const T &cnt) {
if (mn > cnt) {
mn = cnt;
return 1;
} else
return 0;
}
template <typename T> inline constexpr bool update_max(T &mx, const T &cnt) {
if (mx < cnt) {
mx = cnt;
return 1;
} else
return 0;
}
inline void in() {}
template <class T> istream &operator>>(istream &is, vector<T> &vec);
template <class T, size_t size>
istream &operator>>(istream &is, array<T, size> &vec);
template <class T, class L> istream &operator>>(istream &is, pair<T, L> &p);
template <class T> ostream &operator<<(ostream &os, vector<T> &vec);
template <class T, class L> ostream &operator<<(ostream &os, pair<T, L> &p);
template <class T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
template <class T, class L> istream &operator>>(istream &is, pair<T, L> &p) {
is >> p.first;
is >> p.second;
return is;
}
template <class T> ostream &operator<<(ostream &os, vector<T> &vec) {
os << vec[0];
rep(i, 1, vec.size()) { os << ' ' << vec[i]; }
return os;
}
template <class T> ostream &operator<<(ostream &os, deque<T> &deq) {
os << deq[0];
rep(i, 1, deq.size()) { os << ' ' << deq[i]; }
return os;
}
template <class T, class L> ostream &operator<<(ostream &os, pair<T, L> &p) {
os << p.first << " " << p.second;
return os;
}
template <class T, class L> pair<T, L> operator+(pair<T, L> a, pair<T, L> b) {
return {a.first + b.first, a.second + b.second};
}
template <class Head, class... Tail>
inline void in(Head &&head, Tail &&...tail) {
cin >> head;
in(move(tail)...);
}
template <class T> inline bool out(T t) {
cout << t << '\n';
return 0;
}
inline bool out() {
cout << '\n';
return 0;
}
template <class Head, class... Tail> inline bool out(Head head, Tail... tail) {
cout << head << ' ';
out(move(tail)...);
return 0;
}
template <class T> inline void err(T t) { cerr << t << '\n'; }
inline void err() { cerr << '\n'; }
template <class Head, class... Tail> inline void err(Head head, Tail... tail) {
cerr << head << ' ';
out(move(tail)...);
}
inline bool yes(bool i) { return out(i ? "yes" : "no"); }
inline bool Yes(bool i) { return out(i ? "Yes" : "No"); }
inline bool YES(bool i) { return out(i ? "YES" : "NO"); }
inline bool Yay(bool i) { return out(i ? "Yay!" : ":("); }
inline bool possible(bool i) { return out(i ? "possible" : "impossible"); }
inline bool Possible(bool i) { return out(i ? "Possible" : "Impossible"); }
inline bool POSSIBLE(bool i) { return out(i ? "POSSIBLE" : "IMPOSSIBLE"); }
inline bool First(bool i) { return out(i ? "First" : "Second"); }
inline void Case(ll i) { cout << "Case #" << i << ": "; }
signed main() {
STR(s);
ll a = 0, b = 0;
rep(s.size()) {
if ((s[i] ^ i) & 1)
a++;
else
b++;
}
out(min(a, b));
}
| [
"control_flow.branch.if.condition.change"
] | 884,849 | 884,848 | u874644572 | cpp |
p03074 | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (N); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9 + 7;
typedef long long ll;
typedef pair<ll, int> P;
typedef set<int> S;
int main() {
cout << fixed << setprecision(10);
int n, k;
string s;
cin >> n >> k >> s;
vector<int> nums;
if (s[0] == '0')
nums.push_back(0);
for (int i = 0; i < s.size();) {
int j = i;
while (j < s.size() && s[j] == s[i])
j++;
nums.push_back(j - i);
i = j;
}
// cout << endl;
if (s.back() == '0')
nums.push_back(0);
// cout << endl;
vector<int> sums((int)sums.size() + 1, 0);
for (int i = 0; i < nums.size(); i++)
sums[i + 1] = sums[i] + nums[i];
// for(int i = 0; i < nums.size();i++) cout << nums[i] << endl;
int res = 0;
for (int left = 0; left < sums.size(); left += 2) {
int right = left + k * 2 + 1;
if (right >= sums.size())
right = (int)sums.size() - 1;
res = max(res, sums[right] - sums[left]);
}
cout << res << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (N); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9 + 7;
typedef long long ll;
typedef pair<ll, int> P;
typedef set<int> S;
int main() {
cout << fixed << setprecision(10);
int n, k;
string s;
cin >> n >> k >> s;
vector<int> nums;
if (s[0] == '0')
nums.push_back(0);
for (int i = 0; i < s.size();) {
int j = i;
while (j < s.size() && s[j] == s[i])
j++;
nums.push_back(j - i);
i = j;
}
// cout << endl;
if (s.back() == '0')
nums.push_back(0);
// cout << endl;
vector<int> sums((int)nums.size() + 1, 0);
for (int i = 0; i < nums.size(); i++)
sums[i + 1] = sums[i] + nums[i];
// for(int i = 0; i < nums.size();i++) cout << nums[i] << endl;
int res = 0;
for (int left = 0; left < sums.size(); left += 2) {
int right = left + k * 2 + 1;
if (right >= sums.size())
right = (int)sums.size() - 1;
res = max(res, sums[right] - sums[left]);
}
cout << res << endl;
return 0;
} | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 884,854 | 884,855 | u418810472 | cpp |
p03074 | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (N); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9 + 7;
typedef long long ll;
typedef pair<ll, int> P;
typedef set<int> S;
int main() {
cout << fixed << setprecision(10);
int n, k;
string s;
cin >> n >> k >> s;
vector<int> nums;
if (s[0] == '0')
nums.push_back(0);
for (int i = 0; i < s.size(); i++) {
int j = i;
while (j < s.size() && s[j] == s[i])
j++;
nums.push_back(j - i);
i = j;
}
// cout << endl;
if (s.back() == '0')
nums.push_back(0);
// cout << endl;
vector<int> sums((int)sums.size() + 1, 0);
for (int i = 0; i < nums.size(); i++)
sums[i + 1] = sums[i] + nums[i];
// for(int i = 0; i < nums.size();i++) cout << nums[i] << endl;
int res = 0;
for (int left = 0; left < sums.size(); left += 2) {
int right = left + k * 2 + 1;
if (right >= sums.size())
right = (int)sums.size() - 1;
res = max(res, sums[right] - sums[left]);
}
cout << res << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (N); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9 + 7;
typedef long long ll;
typedef pair<ll, int> P;
typedef set<int> S;
int main() {
cout << fixed << setprecision(10);
int n, k;
string s;
cin >> n >> k >> s;
vector<int> nums;
if (s[0] == '0')
nums.push_back(0);
for (int i = 0; i < s.size();) {
int j = i;
while (j < s.size() && s[j] == s[i])
j++;
nums.push_back(j - i);
i = j;
}
// cout << endl;
if (s.back() == '0')
nums.push_back(0);
// cout << endl;
vector<int> sums((int)nums.size() + 1, 0);
for (int i = 0; i < nums.size(); i++)
sums[i + 1] = sums[i] + nums[i];
// for(int i = 0; i < nums.size();i++) cout << nums[i] << endl;
int res = 0;
for (int left = 0; left < sums.size(); left += 2) {
int right = left + k * 2 + 1;
if (right >= sums.size())
right = (int)sums.size() - 1;
res = max(res, sums[right] - sums[left]);
}
cout << res << endl;
return 0;
} | [
"control_flow.loop.for.update.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 884,856 | 884,855 | u418810472 | cpp |
p03074 | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (N); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9 + 7;
typedef long long ll;
typedef pair<ll, int> P;
typedef set<int> S;
int main() {
cout << fixed << setprecision(10);
int n, k;
string s;
cin >> n >> k >> s;
vector<int> nums;
if (s[0] = '0')
nums.push_back(0);
for (int i = 0; i < s.size(); i++) {
int j = i;
while (j < s.size() && s[j] == s[i])
j++;
nums.push_back(j - i);
i = j;
}
// cout << endl;
if (s.back() == '0')
nums.push_back(0);
// cout << endl;
vector<int> sums((int)sums.size() + 1, 0);
for (int i = 0; i < nums.size(); i++)
sums[i + 1] = sums[i] + nums[i];
// for(int i = 0; i < nums.size();i++) cout << nums[i] << endl;
int res = 0;
for (int left = 0; left < sums.size(); left += 2) {
int right = left + k * 2 + 1;
if (right > sums.size())
right = (int)sums.size() - 1;
res = max(res, sums[right] - sums[left]);
}
cout << res << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (N); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9 + 7;
typedef long long ll;
typedef pair<ll, int> P;
typedef set<int> S;
int main() {
cout << fixed << setprecision(10);
int n, k;
string s;
cin >> n >> k >> s;
vector<int> nums;
if (s[0] == '0')
nums.push_back(0);
for (int i = 0; i < s.size();) {
int j = i;
while (j < s.size() && s[j] == s[i])
j++;
nums.push_back(j - i);
i = j;
}
// cout << endl;
if (s.back() == '0')
nums.push_back(0);
// cout << endl;
vector<int> sums((int)nums.size() + 1, 0);
for (int i = 0; i < nums.size(); i++)
sums[i + 1] = sums[i] + nums[i];
// for(int i = 0; i < nums.size();i++) cout << nums[i] << endl;
int res = 0;
for (int left = 0; left < sums.size(); left += 2) {
int right = left + k * 2 + 1;
if (right >= sums.size())
right = (int)sums.size() - 1;
res = max(res, sums[right] - sums[left]);
}
cout << res << endl;
return 0;
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo",
"control_flow.loop.for.update.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 884,857 | 884,855 | u418810472 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define all(x) (x).begin(), (x).end() // 昇順ソート
#define rall(v) (v).rbegin(), (v).rend() // 降順ソート
#define FastIO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
typedef long long ll;
using P = pair<int, int>;
using VI = vector<int>;
using VVI = vector<vector<int>>;
using VL = vector<ll>;
using VVL = vector<vector<ll>>;
using VP = vector<P>;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
int n, k;
string s;
cin >> n >> k >> s;
VI cnts;
int cnt = 0, c = 0;
rep(i, n) {
if (s[i] != '0' + c) {
cnts.push_back(cnt);
c ^= 1;
cnt = 0;
}
cnt++;
}
cnts.push_back(cnt);
if (cnts.size() % 2 != 0)
cnts.push_back(1);
int sz = cnts.size();
VI sum(sz + 1);
rep(i, sz) { sum[i + 1] = sum[i] + cnts[i]; }
int ans = 0;
int left = 0, right = min(2 * k, sz);
while (right <= sz) {
int val = sum[right] - sum[max(left - 1, 0)];
ans = max(ans, val);
left += 2;
right += 2;
}
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 rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define all(x) (x).begin(), (x).end() // 昇順ソート
#define rall(v) (v).rbegin(), (v).rend() // 降順ソート
#define FastIO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
typedef long long ll;
using P = pair<int, int>;
using VI = vector<int>;
using VVI = vector<vector<int>>;
using VL = vector<ll>;
using VVL = vector<vector<ll>>;
using VP = vector<P>;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
int n, k;
string s;
cin >> n >> k >> s;
VI cnts;
int cnt = 0, c = 0;
rep(i, n) {
if (s[i] != '0' + c) {
cnts.push_back(cnt);
c ^= 1;
cnt = 0;
}
cnt++;
}
cnts.push_back(cnt);
if (cnts.size() % 2 != 0)
cnts.push_back(0);
int sz = cnts.size();
VI sum(sz + 1);
rep(i, sz) { sum[i + 1] = sum[i] + cnts[i]; }
int ans = 0;
int left = 0, right = min(2 * k, sz);
while (right <= sz) {
int val = sum[right] - sum[max(left - 1, 0)];
ans = max(ans, val);
left += 2;
right += 2;
}
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"call.arguments.change"
] | 884,858 | 884,859 | u084949493 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for (int i = a; i < b; i++)
#define all(x) (x).begin(), (x).end() // 昇順ソート
#define rall(v) (v).rbegin(), (v).rend() // 降順ソート
#define FastIO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
typedef long long ll;
typedef long long int lli;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int dx[] = {1, 1, 0, -1, -1, -1, 0, 1};
int dy[] = {0, 1, 1, 1, 0, -1, -1, -1};
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<pair<int, int>> lr;
lr.push_back(make_pair(-1, -1));
int l = 0;
int sum = 0, ans = 0;
bool ok = false;
rep(i, n) {
if (s[i] == '1' && ok) {
lr.push_back(make_pair(l, i - 1));
ok = false;
sum++;
}
if (s[i] == '0') {
if (!ok)
l = i;
ok = true;
ans = max(ans, sum);
sum = 0;
}
}
if (s[n - 1] == '0')
lr.push_back(make_pair(l, n - 1));
lr.push_back(make_pair(n, n));
if (lr.size() - 2 <= k) {
cout << n << endl;
return 0;
}
for (int i = 0; i < lr.size() - 1; i++) {
int oneSum = 0;
int cnt = k;
int j;
for (j = i + 1; j < lr.size() - 1; j++) {
if (cnt == 0)
break;
oneSum += lr[j].second - lr[j - 1].first;
cnt--;
}
oneSum += lr[j].first - lr[j - 1].second - 1;
ans = max(ans, oneSum);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for (int i = a; i < b; i++)
#define all(x) (x).begin(), (x).end() // 昇順ソート
#define rall(v) (v).rbegin(), (v).rend() // 降順ソート
#define FastIO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
typedef long long ll;
typedef long long int lli;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int dx[] = {1, 1, 0, -1, -1, -1, 0, 1};
int dy[] = {0, 1, 1, 1, 0, -1, -1, -1};
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<pair<int, int>> lr;
lr.push_back(make_pair(-1, -1));
int l = 0;
int sum = 0, ans = 0;
bool ok = false;
rep(i, n) {
if (s[i] == '1' && ok) {
lr.push_back(make_pair(l, i - 1));
ok = false;
sum++;
}
if (s[i] == '0') {
if (!ok)
l = i;
ok = true;
ans = max(ans, sum);
sum = 0;
}
}
if (s[n - 1] == '0')
lr.push_back(make_pair(l, n - 1));
lr.push_back(make_pair(n, n));
if (lr.size() - 2 <= k) {
cout << n << endl;
return 0;
}
for (int i = 0; i < lr.size() - 1; i++) {
int oneSum = 0;
int cnt = k;
int j;
for (j = i + 1; j < lr.size() - 1; j++) {
if (cnt == 0)
break;
oneSum += lr[j].second - lr[j - 1].second;
cnt--;
}
oneSum += lr[j].first - lr[j - 1].second - 1;
ans = max(ans, oneSum);
}
cout << ans << endl;
} | [
"assignment.value.change",
"expression.operation.binary.change"
] | 884,860 | 884,861 | u084949493 | cpp |
p03074 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(ri, n) for (int ri = (int)(n - 1); ri >= 0; ri--)
#define rep2(i, x, n) for (int i = (int)(x); i < (int)(n); i++)
#define repit(itr, x) for (auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr, x) for (auto ritr = x.rbegin(); ritr != x.rend(); ritr++)
#define ALL(x) x.begin(), x.end()
using ll = long long;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
s.push_back('x');
vector<pair<char, int>> vp;
pair<char, int> p = make_pair(s.front(), 1);
rep2(i, 1, n + 1) {
if (p.first != s.at(i)) {
vp.push_back(p);
p = make_pair(s.at(i), 1);
} else
p.second++;
}
// for(auto p : vp){
// cerr << p.first << p.second << " ";
// }
// cerr << endl;
int ans = -1, sum = 0, l = 0, co = 0;
rep(i, vp.size()) {
if (vp.at(i).first == '0')
co++;
if (co == k + 1) {
ans = max(ans, sum);
sum -= vp.at(l).second;
if (vp.at(l).first == '1') {
l++;
sum -= vp.at(l).second;
}
l++;
}
sum += vp.at(i).second;
// cerr << ans << endl;
}
ans = max(ans, sum);
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(ri, n) for (int ri = (int)(n - 1); ri >= 0; ri--)
#define rep2(i, x, n) for (int i = (int)(x); i < (int)(n); i++)
#define repit(itr, x) for (auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr, x) for (auto ritr = x.rbegin(); ritr != x.rend(); ritr++)
#define ALL(x) x.begin(), x.end()
using ll = long long;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
s.push_back('x');
vector<pair<char, int>> vp;
pair<char, int> p = make_pair(s.front(), 1);
rep2(i, 1, n + 1) {
if (p.first != s.at(i)) {
vp.push_back(p);
p = make_pair(s.at(i), 1);
} else
p.second++;
}
// for(auto p : vp){
// cerr << p.first << p.second << " ";
// }
// cerr << endl;
int ans = -1, sum = 0, l = 0, co = 0;
rep(i, vp.size()) {
if (vp.at(i).first == '0')
co++;
if (co == k + 1) {
ans = max(ans, sum);
sum -= vp.at(l).second;
co--;
if (vp.at(l).first == '1') {
l++;
sum -= vp.at(l).second;
}
l++;
}
sum += vp.at(i).second;
}
ans = max(ans, sum);
cout << ans << endl;
return 0;
} | [
"expression.unary.arithmetic.add"
] | 884,866 | 884,867 | u617826263 | cpp |
p03074 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <ccomplex>
#include <cctype>
#include <cerrno>
#include <cfenv>
#include <cfloat>
#include <chrono>
#include <cinttypes>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <condition_variable>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstdbool>
#include <cstddef>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctgmath>
#include <ctime>
#include <cwchar>
#include <cwctype>
#include <deque>
#include <exception>
#include <forward_list>
#include <fstream>
#include <functional>
#include <initializer_list>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <mutex>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <system_error>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <typeinfo>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <valarray>
#include <vector>
using namespace std;
using llong = long long;
using ullong = unsigned long long;
#ifndef __MACRO_H__
#define __MACRO_H__
#define all(collection) (collection).begin(), (collection).end()
#define loop(i, times) for (llong i = 0; i < times; i++)
#define rloop(i, times) for (llong i = times - 1; 0 <= i; i--)
std::chrono::system_clock::time_point start;
void TimeStart(void) { start = std::chrono::system_clock::now(); }
void TimeEnd(void) {
auto time = std::chrono::system_clock::now() - start;
auto msec =
std::chrono::duration_cast<std::chrono::milliseconds>(time).count();
cerr << endl << msec << " msec " << endl;
}
#endif
class ABC124D {
public:
ABC124D() {
cin >> n_;
cin >> k_;
cin >> s_;
}
void Run(void) {
CountBlock();
if (ceil((double)count_.size() / 2) <=
k_ +
1) { // 特殊ケース: kが'0'ブロックの数を上回るとき、答えはs_の文字数
cout << s_.size();
return;
}
llong ans =
count_[2 *
k_]; // ansを初期化: 一番最初は累積和で計算できないので注意する
llong i = 2;
while (1) { // 累積和で最大値を計算する
// ただし、check_range[i, i+2*k_]がcount_のサイズを超えないように注意する
if ((llong)count_.size() <= i + 2 * k_)
break;
ans = max(ans, count_[i + 2 * k_] - count_[i - 1]);
i += 2;
}
cout << ans;
}
private:
/**
@brief 各ブロックの文字数を調べる関数
@note
各ブロックの文字数をcount_に保存する。
例えば111001111なら、count_[0]=3, count_[1]=2, count_[2]=4となる。
**/
void CountBlock(void) {
// count_[0]はNextBlockIndex(0)とする
count_.push_back(NextBlockIndex(0));
llong i = NextBlockIndex(0);
if (s_[0] ==
'0') { // ただし、処理を単純化するためにs_[0]が'0'のときは先頭に長さ0の'1'文字列(空集合)があることにする
count_[0] = 0;
i = 0;
}
while (i < n_) { // 累積和の作成
count_.push_back(count_.back() + NextBlockIndex(i) - i);
i = NextBlockIndex(i);
}
// 処理を単純化するため、末尾ブロックが文字列'0'ブロックのとき、
// つまり、sizeが偶数のとき長さ0の文字列'1'ブロック(空集合)を追加しておく
if ((llong)count_.size() % 2 == 0)
count_.push_back(0);
}
/**
@brief 次のブロック開始インデックスを取得する関数
@note
s_[index]が属するブロック終端を検索し、検索結果の次のブロック開始インデックスを返す。
**/
llong NextBlockIndex(llong index) { // indexが入力サイズを超える
if (n_ <= index + 1)
return index + 1;
while (s_[index] == s_[index + 1])
index++;
return index + 1;
}
llong n_;
llong k_;
string s_;
vector<llong> count_;
};
int main(void) {
ABC124D abc124d;
abc124d.Run();
return 0;
}
| #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <ccomplex>
#include <cctype>
#include <cerrno>
#include <cfenv>
#include <cfloat>
#include <chrono>
#include <cinttypes>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <condition_variable>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstdbool>
#include <cstddef>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctgmath>
#include <ctime>
#include <cwchar>
#include <cwctype>
#include <deque>
#include <exception>
#include <forward_list>
#include <fstream>
#include <functional>
#include <initializer_list>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <mutex>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <system_error>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <typeinfo>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <valarray>
#include <vector>
using namespace std;
using llong = long long;
using ullong = unsigned long long;
#ifndef __MACRO_H__
#define __MACRO_H__
#define all(collection) (collection).begin(), (collection).end()
#define loop(i, times) for (llong i = 0; i < times; i++)
#define rloop(i, times) for (llong i = times - 1; 0 <= i; i--)
std::chrono::system_clock::time_point start;
void TimeStart(void) { start = std::chrono::system_clock::now(); }
void TimeEnd(void) {
auto time = std::chrono::system_clock::now() - start;
auto msec =
std::chrono::duration_cast<std::chrono::milliseconds>(time).count();
cerr << endl << msec << " msec " << endl;
}
#endif
class ABC124D {
public:
ABC124D() {
cin >> n_;
cin >> k_;
cin >> s_;
}
void Run(void) {
CountBlock();
if (ceil((double)count_.size() / 2) <=
k_) { // 特殊ケース: kが'0'ブロックの数を上回るとき、答えはs_の文字数
cout << s_.size();
return;
}
llong ans =
count_[2 *
k_]; // ansを初期化: 一番最初は累積和で計算できないので注意する
llong i = 2;
while (1) { // 累積和で最大値を計算する
// ただし、check_range[i, i+2*k_]がcount_のサイズを超えないように注意する
if ((llong)count_.size() <= i + 2 * k_)
break;
ans = max(ans, count_[i + 2 * k_] - count_[i - 1]);
i += 2;
}
cout << ans;
}
private:
/**
@brief 各ブロックの文字数を調べる関数
@note
各ブロックの文字数をcount_に保存する。
例えば111001111なら、count_[0]=3, count_[1]=2, count_[2]=4となる。
**/
void CountBlock(void) {
// count_[0]はNextBlockIndex(0)とする
count_.push_back(NextBlockIndex(0));
llong i = NextBlockIndex(0);
if (s_[0] ==
'0') { // ただし、処理を単純化するためにs_[0]が'0'のときは先頭に長さ0の'1'文字列(空集合)があることにする
count_[0] = 0;
i = 0;
}
while (i < n_) { // 累積和の作成
count_.push_back(count_.back() + NextBlockIndex(i) - i);
i = NextBlockIndex(i);
}
// 処理を単純化するため、末尾ブロックが文字列'0'ブロックのとき、
// つまり、sizeが偶数のとき長さ0の文字列'1'ブロック(空集合)を追加しておく
if ((llong)count_.size() % 2 == 0)
count_.push_back(count_.back());
}
/**
@brief 次のブロック開始インデックスを取得する関数
@note
s_[index]が属するブロック終端を検索し、検索結果の次のブロック開始インデックスを返す。
**/
llong NextBlockIndex(llong index) { // indexが入力サイズを超える
if (n_ <= index + 1)
return index + 1;
while (s_[index] == s_[index + 1])
index++;
return index + 1;
}
llong n_;
llong k_;
string s_;
vector<llong> count_;
};
int main(void) {
ABC124D abc124d;
abc124d.Run();
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 884,885 | 884,886 | u153390822 | cpp |
p03074 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <ccomplex>
#include <cctype>
#include <cerrno>
#include <cfenv>
#include <cfloat>
#include <chrono>
#include <cinttypes>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <condition_variable>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstdbool>
#include <cstddef>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctgmath>
#include <ctime>
#include <cwchar>
#include <cwctype>
#include <deque>
#include <exception>
#include <forward_list>
#include <fstream>
#include <functional>
#include <initializer_list>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <mutex>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <system_error>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <typeinfo>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <valarray>
#include <vector>
using namespace std;
using llong = long long;
using ullong = unsigned long long;
#ifndef __MACRO_H__
#define __MACRO_H__
#define all(collection) (collection).begin(), (collection).end()
#define loop(i, times) for (llong i = 0; i < times; i++)
#define rloop(i, times) for (llong i = times - 1; 0 <= i; i--)
std::chrono::system_clock::time_point start;
void TimeStart(void) { start = std::chrono::system_clock::now(); }
void TimeEnd(void) {
auto time = std::chrono::system_clock::now() - start;
auto msec =
std::chrono::duration_cast<std::chrono::milliseconds>(time).count();
cerr << endl << msec << " msec " << endl;
}
#endif
class ABC124D {
public:
ABC124D() {
cin >> n_;
cin >> k_;
cin >> s_;
}
void Run(void) {
CountBlock();
if (ceil((double)count_.size() / 2 <=
k_ + 1)) { // 特殊ケース:
// k+1が'0'ブロックの数を上回るとき、答えはs_の文字数
cout << s_.size();
return;
}
llong ans =
count_[2 *
k_]; // ansを初期化: 一番最初は累積和で計算できないので注意する
llong i = 2;
while (1) { // 累積和で最大値を計算する
// ただし、check_range[i, i+2*k_]がcount_のサイズを超えないように注意する
if ((llong)count_.size() <= i + 2 * k_)
break;
ans = max(ans, count_[i + 2 * k_] - count_[i - 1]);
i += 2;
}
cout << ans;
}
private:
/**
@brief 各ブロックの文字数を調べる関数
@note
各ブロックの文字数をcount_に保存する。
例えば111001111なら、count_[0]=3, count_[1]=2, count_[2]=4となる。
**/
void CountBlock(void) {
// count_[0]はNextBlockIndex(0)とする
count_.push_back(NextBlockIndex(0));
llong i = NextBlockIndex(0);
if (s_[0] ==
'0') { // ただし、処理を単純化するためにs_[0]が'0'のときは先頭に長さ0の'1'文字列(空集合)があることにする
count_[0] = 0;
i = 0;
}
while (i < n_) { // 累積和の作成
count_.push_back(count_.back() + NextBlockIndex(i) - i);
i = NextBlockIndex(i);
}
// 処理を単純化するため、末尾ブロックが文字列'0'ブロックのとき、
// つまり、sizeが偶数のとき長さ0の文字列'1'ブロック(空集合)を追加しておく
if ((llong)count_.size() % 2 == 0)
count_.push_back(0);
}
/**
@brief 次のブロック開始インデックスを取得する関数
@note
s_[index]が属するブロック終端を検索し、検索結果の次のブロック開始インデックスを返す。
**/
llong NextBlockIndex(llong index) { // indexが入力サイズを超える
if (n_ <= index + 1)
return index + 1;
while (s_[index] == s_[index + 1])
index++;
return index + 1;
}
llong n_;
llong k_;
string s_;
vector<llong> count_;
};
int main(void) {
ABC124D abc124d;
abc124d.Run();
return 0;
}
| #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <ccomplex>
#include <cctype>
#include <cerrno>
#include <cfenv>
#include <cfloat>
#include <chrono>
#include <cinttypes>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <condition_variable>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstdbool>
#include <cstddef>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctgmath>
#include <ctime>
#include <cwchar>
#include <cwctype>
#include <deque>
#include <exception>
#include <forward_list>
#include <fstream>
#include <functional>
#include <initializer_list>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <mutex>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <system_error>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <typeinfo>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <valarray>
#include <vector>
using namespace std;
using llong = long long;
using ullong = unsigned long long;
#ifndef __MACRO_H__
#define __MACRO_H__
#define all(collection) (collection).begin(), (collection).end()
#define loop(i, times) for (llong i = 0; i < times; i++)
#define rloop(i, times) for (llong i = times - 1; 0 <= i; i--)
std::chrono::system_clock::time_point start;
void TimeStart(void) { start = std::chrono::system_clock::now(); }
void TimeEnd(void) {
auto time = std::chrono::system_clock::now() - start;
auto msec =
std::chrono::duration_cast<std::chrono::milliseconds>(time).count();
cerr << endl << msec << " msec " << endl;
}
#endif
class ABC124D {
public:
ABC124D() {
cin >> n_;
cin >> k_;
cin >> s_;
}
void Run(void) {
CountBlock();
if (ceil((double)count_.size() / 2) <=
k_) { // 特殊ケース: kが'0'ブロックの数を上回るとき、答えはs_の文字数
cout << s_.size();
return;
}
llong ans =
count_[2 *
k_]; // ansを初期化: 一番最初は累積和で計算できないので注意する
llong i = 2;
while (1) { // 累積和で最大値を計算する
// ただし、check_range[i, i+2*k_]がcount_のサイズを超えないように注意する
if ((llong)count_.size() <= i + 2 * k_)
break;
ans = max(ans, count_[i + 2 * k_] - count_[i - 1]);
i += 2;
}
cout << ans;
}
private:
/**
@brief 各ブロックの文字数を調べる関数
@note
各ブロックの文字数をcount_に保存する。
例えば111001111なら、count_[0]=3, count_[1]=2, count_[2]=4となる。
**/
void CountBlock(void) {
// count_[0]はNextBlockIndex(0)とする
count_.push_back(NextBlockIndex(0));
llong i = NextBlockIndex(0);
if (s_[0] ==
'0') { // ただし、処理を単純化するためにs_[0]が'0'のときは先頭に長さ0の'1'文字列(空集合)があることにする
count_[0] = 0;
i = 0;
}
while (i < n_) { // 累積和の作成
count_.push_back(count_.back() + NextBlockIndex(i) - i);
i = NextBlockIndex(i);
}
// 処理を単純化するため、末尾ブロックが文字列'0'ブロックのとき、
// つまり、sizeが偶数のとき長さ0の文字列'1'ブロック(空集合)を追加しておく
if ((llong)count_.size() % 2 == 0)
count_.push_back(count_.back());
}
/**
@brief 次のブロック開始インデックスを取得する関数
@note
s_[index]が属するブロック終端を検索し、検索結果の次のブロック開始インデックスを返す。
**/
llong NextBlockIndex(llong index) { // indexが入力サイズを超える
if (n_ <= index + 1)
return index + 1;
while (s_[index] == s_[index + 1])
index++;
return index + 1;
}
llong n_;
llong k_;
string s_;
vector<llong> count_;
};
int main(void) {
ABC124D abc124d;
abc124d.Run();
return 0;
}
| [
"control_flow.branch.if.condition.change",
"call.arguments.change"
] | 884,887 | 884,886 | u153390822 | cpp |
p03074 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <ccomplex>
#include <cctype>
#include <cerrno>
#include <cfenv>
#include <cfloat>
#include <chrono>
#include <cinttypes>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <condition_variable>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstdbool>
#include <cstddef>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctgmath>
#include <ctime>
#include <cwchar>
#include <cwctype>
#include <deque>
#include <exception>
#include <forward_list>
#include <fstream>
#include <functional>
#include <initializer_list>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <mutex>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <system_error>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <typeinfo>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <valarray>
#include <vector>
using namespace std;
using llong = long long;
using ullong = unsigned long long;
#ifndef __MACRO_H__
#define __MACRO_H__
#define all(collection) (collection).begin(), (collection).end()
#define loop(i, times) for (llong i = 0; i < times; i++)
#define rloop(i, times) for (llong i = times - 1; 0 <= i; i--)
std::chrono::system_clock::time_point start;
void TimeStart(void) { start = std::chrono::system_clock::now(); }
void TimeEnd(void) {
auto time = std::chrono::system_clock::now() - start;
auto msec =
std::chrono::duration_cast<std::chrono::milliseconds>(time).count();
cerr << endl << msec << " msec " << endl;
}
#endif
class ABC124D {
public:
ABC124D() {
cin >> n_;
cin >> k_;
cin >> s_;
}
void Run(void) {
CountBlock();
if (ceil((double)count_.size() / 2 <=
k_)) { // 特殊ケース:
// kが'0'ブロックの数を上回るとき、答えはs_の文字数
cout << s_.size();
return;
}
llong ans =
count_[2 *
k_]; // ansを初期化: 一番最初は累積和で計算できないので注意する
llong i = 2;
while (1) { // 累積和で最大値を計算する
// ただし、check_range[i, i+2*k_]がcount_のサイズを超えないように注意する
if ((llong)count_.size() <= i + 2 * k_)
break;
ans = max(ans, count_[i + 2 * k_] - count_[i - 1]);
i += 2;
}
cout << ans;
}
private:
/**
@brief 各ブロックの文字数を調べる関数
@note
各ブロックの文字数をcount_に保存する。
例えば111001111なら、count_[0]=3, count_[1]=2, count_[2]=4となる。
**/
void CountBlock(void) {
// count_[0]はNextBlockIndex(0)とする
count_.push_back(NextBlockIndex(0));
llong i = NextBlockIndex(0);
if (s_[0] ==
'0') { // ただし、処理を単純化するためにs_[0]が'0'のときは先頭に長さ0の'1'文字列があることにする
count_[0] = 0;
i = 0;
}
while (i < n_) { // 累積和の作成
count_.push_back(count_.back() + NextBlockIndex(i) - i);
i = NextBlockIndex(i);
}
// 処理を単純化するため、末尾ブロックが文字列'0'ブロックのとき、つまりsizeが偶数のとき空集合{}を追加しておく
if ((llong)count_.size() % 2 == 0)
count_.push_back(0);
}
/**
@brief 次のブロック開始インデックスを取得する関数
@note
s_[index]が属するブロック終端を検索し、検索結果の次のブロック開始インデックスを返す。
**/
llong NextBlockIndex(llong index) { // indexが入力サイズを超える
if (n_ <= index + 1)
return index + 1;
while (s_[index] == s_[index + 1])
index++;
return index + 1;
}
llong n_;
llong k_;
string s_;
vector<llong> count_;
};
int main(void) {
ABC124D abc124d;
abc124d.Run();
return 0;
}
| #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <ccomplex>
#include <cctype>
#include <cerrno>
#include <cfenv>
#include <cfloat>
#include <chrono>
#include <cinttypes>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <condition_variable>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstdbool>
#include <cstddef>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctgmath>
#include <ctime>
#include <cwchar>
#include <cwctype>
#include <deque>
#include <exception>
#include <forward_list>
#include <fstream>
#include <functional>
#include <initializer_list>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <mutex>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <system_error>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <typeinfo>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <valarray>
#include <vector>
using namespace std;
using llong = long long;
using ullong = unsigned long long;
#ifndef __MACRO_H__
#define __MACRO_H__
#define all(collection) (collection).begin(), (collection).end()
#define loop(i, times) for (llong i = 0; i < times; i++)
#define rloop(i, times) for (llong i = times - 1; 0 <= i; i--)
std::chrono::system_clock::time_point start;
void TimeStart(void) { start = std::chrono::system_clock::now(); }
void TimeEnd(void) {
auto time = std::chrono::system_clock::now() - start;
auto msec =
std::chrono::duration_cast<std::chrono::milliseconds>(time).count();
cerr << endl << msec << " msec " << endl;
}
#endif
class ABC124D {
public:
ABC124D() {
cin >> n_;
cin >> k_;
cin >> s_;
}
void Run(void) {
CountBlock();
if (ceil((double)count_.size() / 2) <=
k_) { // 特殊ケース: kが'0'ブロックの数を上回るとき、答えはs_の文字数
cout << s_.size();
return;
}
llong ans =
count_[2 *
k_]; // ansを初期化: 一番最初は累積和で計算できないので注意する
llong i = 2;
while (1) { // 累積和で最大値を計算する
// ただし、check_range[i, i+2*k_]がcount_のサイズを超えないように注意する
if ((llong)count_.size() <= i + 2 * k_)
break;
ans = max(ans, count_[i + 2 * k_] - count_[i - 1]);
i += 2;
}
cout << ans;
}
private:
/**
@brief 各ブロックの文字数を調べる関数
@note
各ブロックの文字数をcount_に保存する。
例えば111001111なら、count_[0]=3, count_[1]=2, count_[2]=4となる。
**/
void CountBlock(void) {
// count_[0]はNextBlockIndex(0)とする
count_.push_back(NextBlockIndex(0));
llong i = NextBlockIndex(0);
if (s_[0] ==
'0') { // ただし、処理を単純化するためにs_[0]が'0'のときは先頭に長さ0の'1'文字列(空集合)があることにする
count_[0] = 0;
i = 0;
}
while (i < n_) { // 累積和の作成
count_.push_back(count_.back() + NextBlockIndex(i) - i);
i = NextBlockIndex(i);
}
// 処理を単純化するため、末尾ブロックが文字列'0'ブロックのとき、
// つまり、sizeが偶数のとき長さ0の文字列'1'ブロック(空集合)を追加しておく
if ((llong)count_.size() % 2 == 0)
count_.push_back(count_.back());
}
/**
@brief 次のブロック開始インデックスを取得する関数
@note
s_[index]が属するブロック終端を検索し、検索結果の次のブロック開始インデックスを返す。
**/
llong NextBlockIndex(llong index) { // indexが入力サイズを超える
if (n_ <= index + 1)
return index + 1;
while (s_[index] == s_[index + 1])
index++;
return index + 1;
}
llong n_;
llong k_;
string s_;
vector<llong> count_;
};
int main(void) {
ABC124D abc124d;
abc124d.Run();
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 884,884 | 884,886 | u153390822 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
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;
}
lli n, k;
string s;
int main(void) {
cin >> n >> k >> s;
vector<lli> p;
rep(i, n) {
if (i == 0)
p.push_back(i);
else {
if (s[i] != s[i - 1])
p.push_back(i);
}
}
p.push_back(n);
lli m = p.size();
lli ans = 0;
rep(i, m - 1) {
if (s[i] == '0') {
ans = max(ans, p[min(i + 2 * k, m - 1)] - p[i]);
} else {
ans = max(ans, p[min(i + 2 * k + 1, m - 1)] - p[i]);
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
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;
}
lli n, k;
string s;
int main(void) {
cin >> n >> k >> s;
vector<lli> p;
rep(i, n) {
if (i == 0)
p.push_back(i);
else {
if (s[i] != s[i - 1])
p.push_back(i);
}
}
p.push_back(n);
lli m = p.size();
lli ans = 0;
rep(i, m - 1) {
if (s[p[i]] == '0') {
ans = max(ans, p[min(i + 2 * k, m - 1)] - p[i]);
} else {
ans = max(ans, p[min(i + 2 * k + 1, m - 1)] - p[i]);
}
}
cout << ans << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 884,892 | 884,893 | u720447689 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
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;
}
lli n, k;
string s;
int main(void) {
cin >> n >> k >> s;
vector<lli> p;
rep(i, n) {
if (i == 0)
p.push_back(i);
else {
if (s[i] != s[i - 1])
p.push_back(i);
}
}
p.push_back(n);
lli m = p.size();
lli ans = 0;
rep(i, m) {
if (s[i] == '0') {
ans = max(ans, p[min(i + 2 * k, m - 1)] - p[i]);
} else {
ans = max(ans, p[min(i + 2 * k + 1, m - 1)] - p[i]);
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
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;
}
lli n, k;
string s;
int main(void) {
cin >> n >> k >> s;
vector<lli> p;
rep(i, n) {
if (i == 0)
p.push_back(i);
else {
if (s[i] != s[i - 1])
p.push_back(i);
}
}
p.push_back(n);
lli m = p.size();
lli ans = 0;
rep(i, m - 1) {
if (s[p[i]] == '0') {
ans = max(ans, p[min(i + 2 * k, m - 1)] - p[i]);
} else {
ans = max(ans, p[min(i + 2 * k + 1, m - 1)] - p[i]);
}
}
cout << ans << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 884,894 | 884,893 | u720447689 | cpp |
p03074 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> P;
const ll MOD = 1000000007;
const ll MAX_N = 500010;
const ll INF = 1 << 18;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> c(0);
if (s[0] == '0')
c.push_back(0);
if (n == 1)
c.push_back(1);
for (int i = 1; i < n; i++) {
int seq = 1;
while (i < n && s[i] == s[i - 1]) {
i++;
seq++;
}
c.push_back(seq);
}
if (s[n - 1] != s[n - 2])
c.push_back(1);
int sum = 0;
int m = c.size();
for (int i = 0; i <= min(2 * k, m - 1); i++) {
sum += c[i];
}
int ans = sum;
for (int i = 2 * k + 1; i < m; i += 2) {
sum -= c[i - 2 * k - 1];
sum -= c[i - 2 * k];
sum += c[i];
if (i + 1 < m)
sum += c[i + 1];
ans = max(ans, sum);
// cout<<sum<<endl;
}
cout << ans << endl;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> P;
const ll MOD = 1000000007;
const ll MAX_N = 500010;
const ll INF = 1 << 18;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> c(0);
if (s[0] == '0')
c.push_back(0);
if (n == 1)
c.push_back(1);
for (int i = 1; i < n; i++) {
int seq = 1;
while (i < n && s[i] == s[i - 1]) {
i++;
seq++;
}
c.push_back(seq);
}
if (n > 1 && s[n - 1] != s[n - 2])
c.push_back(1);
int sum = 0;
int m = c.size();
for (int i = 0; i <= min(2 * k, m - 1); i++) {
sum += c[i];
}
int ans = sum;
for (int i = 2 * k + 1; i < m; i += 2) {
sum -= c[i - 2 * k - 1];
sum -= c[i - 2 * k];
sum += c[i];
if (i + 1 < m)
sum += c[i + 1];
ans = max(ans, sum);
// cout<<sum<<endl;
}
cout << ans << endl;
} | [
"control_flow.branch.if.condition.change"
] | 884,895 | 884,896 | u118225776 | 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 i = 0; i < n; ++i) {
int ren = i;
while (ren < n && s[i] == s[ren])
++ren;
num.push_back(ren - i);
i = ren;
}
if (s.back() == '0')
num.push_back(0);
vector<int> ruisekiwa((int)num.size() + 1, 0);
for (int i = 0; i < (int)num.size(); i++) {
ruisekiwa[i + 1] = ruisekiwa[i] + num[i];
}
int ans = 0;
for (int i = 0; i < (int)ruisekiwa.size(); i += 2) {
int j = i + k * 2 + 1;
if (j >= (int)ruisekiwa.size())
j = (int)ruisekiwa.size() - 1;
ans = max(ans, ruisekiwa[j] - ruisekiwa[i]);
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> num;
if (s[0] == '0')
num.push_back(0);
for (int i = 0; i < n;) {
int ren = i;
while (ren < n && s[i] == s[ren])
++ren;
num.push_back(ren - i);
i = ren;
}
if (s.back() == '0')
num.push_back(0);
vector<int> ruisekiwa((int)num.size() + 1, 0);
for (int i = 0; i < (int)num.size(); i++) {
ruisekiwa[i + 1] = ruisekiwa[i] + num[i];
}
int ans = 0;
for (int i = 0; i < (int)ruisekiwa.size(); i += 2) {
int j = i + k * 2 + 1;
if (j >= (int)ruisekiwa.size())
j = (int)ruisekiwa.size() - 1;
ans = max(ans, ruisekiwa[j] - ruisekiwa[i]);
}
cout << ans << endl;
return 0;
}
| [
"control_flow.loop.for.update.change"
] | 884,897 | 884,898 | u144029820 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
void solve() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> v;
int flag = 1;
int cnt = 0;
rep(i, n) {
if (flag == s[i] - '0') {
cnt++;
} else {
v.push_back(cnt);
cnt = 1;
flag = 1 - flag;
}
}
if (cnt)
v.push_back(cnt);
if (v.size() % 2 == 1)
v.push_back(0);
vector<int> sum(v.size() + 1);
rep(i, v.size()) sum[i + 1] = sum[i] + v[i];
int ans = 0;
for (int i = 0; i < v.size(); i += 2) {
int t = sum[min(i + 2 * k + 1, (int)v.size() - 1)] - sum[i];
ans = max(ans, t);
}
cout << ans << endl;
}
int main() {
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
void solve() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> v;
int flag = 1;
int cnt = 0;
rep(i, n) {
if (flag == s[i] - '0') {
cnt++;
} else {
v.push_back(cnt);
cnt = 1;
flag = 1 - flag;
}
}
if (cnt)
v.push_back(cnt);
if (v.size() % 2 == 1)
v.push_back(0);
vector<int> sum(v.size() + 1);
rep(i, v.size()) sum[i + 1] = sum[i] + v[i];
int ans = 0;
for (int i = 0; i < (int)sum.size(); i += 2) {
int t = sum[min(i + 2 * k + 1, (int)sum.size() - 1)] - sum[i];
ans = max(ans, t);
}
cout << ans << endl;
}
int main() {
solve();
return 0;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 884,899 | 884,900 | u280175105 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
int main() {
int N, K;
string S;
cin >> N >> K >> S;
vector<int> x;
int count = 1;
for (int i = 1; i < N; i++) {
if (S.at(i) == S.at(i - 1))
count++;
else {
x.push_back(count);
count = 1;
}
}
x.push_back(count);
// for(int i=0;i<x.size();i++) cout << x.at(i) << ",";
vector<int> sum(x.size() + 1);
sum.at(0) = 0;
for (int i = 1; i < sum.size(); i++) {
sum.at(i) = sum.at(i - 1) + x.at(i - 1);
}
// for(int i=0;i<sum.size();i++) cout << sum.at(i) << ",";
int ans = 0;
if (S.at(0) == '0') {
for (int i = 0; i + 2 * K < sum.size(); i += 2) {
int a = sum.at(i + 2 * K) - sum.at(i);
if (i > 0)
a = sum.at(i + 2 * K) - sum.at(i - 1);
ans = max(ans, a);
if (S.at(N - 1) == '0' && i + 2 * K + 2 >= sum.size()) {
int b = sum.at(i + 2 * K + 1) - sum.at(i + 2);
ans = max(ans, b);
}
}
} else if (S.at(0) == '1') {
for (int i = 0; i + 1 + 2 * K < sum.size(); i += 2) {
int a = sum.at(i + 1 + 2 * K) - sum.at(i);
ans = max(ans, a);
if (S.at(N - 1) == '0' && i + 1 + 2 * K + 2 >= sum.size()) {
int b = sum.at(i + 1 + 2 * K + 1) - sum.at(i + 2);
ans = max(ans, b);
}
}
}
if (S.at(0) == '0' && S.at(N - 1) == '0' && 2 * K - 1 >= x.size())
ans = N;
else if (S.at(0) == '0' && S.at(N - 1) == '1' && 2 * K >= x.size())
ans = N;
else if (S.at(0) == '1' && S.at(N - 1) == '0' && 2 * K >= x.size())
ans = N;
else if (S.at(0) == '1' && S.at(N - 1) == '1' && 2 * K + 1 >= x.size())
ans = N;
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
int main() {
int N, K;
string S;
cin >> N >> K >> S;
vector<int> x;
int count = 1;
for (int i = 1; i < N; i++) {
if (S.at(i) == S.at(i - 1))
count++;
else {
x.push_back(count);
count = 1;
}
}
x.push_back(count);
// for(int i=0;i<x.size();i++) cout << x.at(i) << ",";
vector<int> sum(x.size() + 1);
sum.at(0) = 0;
for (int i = 1; i < sum.size(); i++) {
sum.at(i) = sum.at(i - 1) + x.at(i - 1);
}
// for(int i=0;i<sum.size();i++) cout << sum.at(i) << ",";
int ans = 0;
if (S.at(0) == '0') {
for (int i = 0; i + 2 * K < sum.size(); i += 2) {
int a = sum.at(i + 2 * K) - sum.at(i);
if (i > 0)
a = sum.at(i + 2 * K) - sum.at(i - 1);
ans = max(ans, a);
if (S.at(N - 1) == '0' && i + 2 * K + 2 >= sum.size()) {
int b = sum.at(i + 2 * K + 1) - sum.at(i + 1);
ans = max(ans, b);
}
}
} else if (S.at(0) == '1') {
for (int i = 0; i + 1 + 2 * K < sum.size(); i += 2) {
int a = sum.at(i + 1 + 2 * K) - sum.at(i);
ans = max(ans, a);
if (S.at(N - 1) == '0' && i + 1 + 2 * K + 2 >= sum.size()) {
int b = sum.at(i + 1 + 2 * K + 1) - sum.at(i + 2);
ans = max(ans, b);
}
}
}
if (S.at(0) == '0' && S.at(N - 1) == '0' && 2 * K - 1 >= x.size())
ans = N;
else if (S.at(0) == '0' && S.at(N - 1) == '1' && 2 * K >= x.size())
ans = N;
else if (S.at(0) == '1' && S.at(N - 1) == '0' && 2 * K >= x.size())
ans = N;
else if (S.at(0) == '1' && S.at(N - 1) == '1' && 2 * K + 1 >= x.size())
ans = N;
cout << ans << endl;
return 0;
}
| [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 884,904 | 884,905 | u618649215 | cpp |
p03074 | #ifndef ONLINE_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define bit(n, k) (((ll)n >> (ll)k) & 1) /*nのk bit目*/
#define pb push_back
#define eb emplace_back
#define SZ(x) ((ll)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const long long INF = 1e+18 + 1;
// long long INF=(1LL<<31)-1;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
const ll MOD = 1000000007LL;
// ll MOD=1000000007LL;
// const ll MOD=998244353LL;
// const ll MOD=1777777777LL;
// const ll MAX_V=114514LL;
// const ll MAX = 500010LL;
const ll mod = MOD;
string abc = "abcdefghijklmnopqrstuvwxyz";
string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
vl dx = {0, 0, 1, -1};
vl dy = {1, -1, 0, 0};
//素因数分解O(√n)
map<ll, ll> prime_factor(ll n) {
map<ll, ll> res;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
res[i]++;
n /= i;
}
}
if (n != 1)
res[n] = 1;
return res;
}
const ll MAX = 2000010;
long long fac[MAX], finv[MAX], inv[MAX];
// finvが階乗の逆元
// テーブルを作る前処理
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;
}
}
// 二項係数計算
long long 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;
}
ll modpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
/*ll N=2000010;
vl arr(N);
void Eratosthenes(){
for(ll i = 0; i < N; i++){
arr[i] = 1;
}
arr[1]=0;
for(ll i = 2; i < sqrt(N); i++){
if(arr[i]){
for(ll j = 0; i * (j + 2) < N; j++){
arr[i *(j + 2)] = 0;
}
}
}
}*/
//素数判定O(√n)
bool is_prime(ll n) {
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
//約数の列挙O(√n)
vector<ll> divisor(ll n) {
vector<ll> res;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (i != n / i)
res.push_back(n / i);
}
}
return res;
}
/* SegTree<X>(n,fx,ex): モノイド(集合X, 二項演算fx,
単位元ex)についてサイズnで構築 set(int i, X x), build():
i番目の要素をxにセット。まとめてセグ木を構築する。O(n) update(i,x): i
番目の要素を x に更新。O(log(n)) query(a,b): [a,b)
全てにfxを作用させた値を取得。O(log(n))
*/
template <typename X> struct SegTree {
using FX = function<X(X, X)>;
int n;
FX fx;
const X ex;
vector<X> dat;
SegTree(int n_, FX fx_, X ex_) : n(), fx(fx_), ex(ex_), dat(n_ * 4, ex_) {
int x = 1;
while (n_ > x) {
x *= 2;
}
n = x;
}
void set(int i, X x) { dat[i + n - 1] = x; }
void build() {
for (int k = n - 2; k >= 0; k--)
dat[k] = fx(dat[2 * k + 1], dat[2 * k + 2]);
}
void update(int i, X x) {
i += n - 1;
dat[i] = x;
while (i > 0) {
i = (i - 1) / 2; // parent
dat[i] = fx(dat[i * 2 + 1], dat[i * 2 + 2]);
}
}
// the minimum element of [a,b)
X query(int a, int b) { return query_sub(a, b, 0, 0, n); }
X query_sub(int a, int b, int k, int l, int r) {
if (r <= a || b <= l) {
return ex;
} else if (a <= l && r <= b) {
return dat[k];
} else {
X vl = query_sub(a, b, k * 2 + 1, l, (l + r) / 2);
X vr = query_sub(a, b, k * 2 + 2, (l + r) / 2, r);
return fx(vl, vr);
}
}
/* debug */
inline X operator[](int a) { return query(a, a + 1); }
void print() {
for (int i = 0; i < 2 * n - 1; ++i) {
cout << (*this)[i];
if (i != n)
cout << ",";
}
cout << endl;
}
/*
使用例
auto fx=[](int x1,int x2)->int{return max(x1,x2);};
ll ex=0;
SegTree<ll>rmq(n,fx,ex);*/
};
/* Trie 木： 文字の種類(char_size)、int型で0に対応する文字(base)
insert(word): 単語 word を Trie 木に挿入する
search(word): 単語 word が Trie 木にあるか判定する
start_with(prefix): prefix が一致する単語が Trie 木にあるか判定する
count(): 挿入した単語の数を返す
size(): Trie 木の頂点数を返す
計算量：insert, search ともに O(M)（Mは単語の長さ）
*/
template <int char_size, int base> struct Trie {
struct Node { // 頂点を表す構造体
vector<int> next; // 子の頂点番号を格納。存在しなければ-1
vector<int> accept; // 末端がこの頂点になる単語の word_id を保存
int c; // base からの間隔をint型で表現したもの
int common; // いくつの単語がこの頂点を共有しているか
Node(int c_) : c(c_), common(0) { next.assign(char_size, -1); }
};
vector<Node> nodes; // trie 木本体
int root;
Trie() : root(0) { nodes.push_back(Node(root)); }
// 単語の挿入
void insert(const string &word, int word_id) {
int node_id = 0;
for (int i = 0; i < (int)word.size(); i++) {
int c = (int)(word[i] - base);
int &next_id = nodes[node_id].next[c];
if (next_id == -1) { // 次の頂点が存在しなければ追加
next_id = (int)nodes.size();
nodes.push_back(Node(c));
}
++nodes[node_id].common;
node_id = next_id;
}
++nodes[node_id].common;
nodes[node_id].accept.push_back(word_id);
}
void insert(const string &word) { insert(word, nodes[0].common); }
// 単語とprefixの検索
bool search(const string &word, bool prefix = false) {
int node_id = 0;
for (int i = 0; i < (int)word.size(); i++) {
int c = (int)(word[i] - base);
int &next_id = nodes[node_id].next[c];
if (next_id == -1) { // 次の頂点が存在しなければ終了
return false;
}
node_id = next_id;
}
return (prefix) ? true : nodes[node_id].accept.size() > 0;
}
// prefix を持つ単語が存在するかの検索
bool start_with(const string &prefix) { return search(prefix, true); }
// 挿入した単語の数
int count() const { return (nodes[0].common); }
// Trie木のノード数
int size() const { return ((int)nodes.size()); }
};
int main() {
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
cout << fixed << setprecision(10);
/*--------------------------------*/
/*Trie<26,'a'>trie;
ll n;cin>>n;
vl s(n);
rep(i,n){cin>>s[i];reverse(all(s[i]));}
vector<pair<int,string>>v(n);
rep(i,n){
v[i].first=s[i].size();
v[i].second=s[i];
}
sort(all(v));
reverse(all(v));
rep(i,n){
if(trie.start_with(v[i].second.substr(0,v[i].first-1))){
}
trie.insert(v[i].second);
}
*/
/*ll n,d;cin>>n>>d;
ll x,y;cin>>x>>y;
ll gx=abs(x+y),gy=abs(x-y);
COMinit();
if(gx<=n*d && gx%d==0 && (gx/d)%2==n%2 && gy<=n*d && gy%d==0 &&
(gy/d)%2==n%2){ ll d=COM(n,(n-gx/d)/2)*COM(n,(n-gy/d)/2); cout<<gx<<"
"<<gy<<endl; cout<<1.0/d<<endl;
}
else cout<<0<<endl;
*/
ll n;
cin >> n;
ll k;
cin >> k;
string s;
cin >> s;
vector<P> v;
{
set<ll> S;
rep(i, n) S.insert(s[i] - '0');
if (S.size() == 1) {
cout << s.size() << endl;
return 0;
}
}
if (s[0] == '0')
v.pb(make_pair(0, 1));
ll now = 1;
ll cnt = 0;
rep(i, n) {
if (i != 0 && s[i] == s[i - 1]) {
cnt++;
} else {
if (i != 0)
v.pb(make_pair(cnt, now));
now = s[i] - '0';
cnt = 1;
}
}
v.pb(make_pair(cnt, now));
// rep(i,v.size())cout<<v[i].first<<" "<<v[i].second<<" \n"[i+1==v.size()];
if (v.back().second == '0')
v.pb(make_pair(0, 1));
vl sum(v.size());
sum[0] = v[0].first;
for (ll i = 1; i < v.size(); i++) {
sum[i] = sum[i - 1] + v[i].first;
}
if (v.size() - 1 <= 2 * k) {
cout << sum[v.size() - 1] << endl;
return 0;
}
ll ans = sum[2 * k];
// cout<<ans<<endl;
// rep(i,sum.size())cout<<sum[i]<<" \n"[i+1==v.size()];
for (ll i = 2; i + 2 * k < sum.size(); i += 2) {
ans = max(ans, sum[i + 2 * k] - sum[i - 1]);
// cout<<sum[i+2*k]<<" "<<sum[i-1]<<endl;
}
cout << ans << endl;
}
| #ifndef ONLINE_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define bit(n, k) (((ll)n >> (ll)k) & 1) /*nのk bit目*/
#define pb push_back
#define eb emplace_back
#define SZ(x) ((ll)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const long long INF = 1e+18 + 1;
// long long INF=(1LL<<31)-1;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
const ll MOD = 1000000007LL;
// ll MOD=1000000007LL;
// const ll MOD=998244353LL;
// const ll MOD=1777777777LL;
// const ll MAX_V=114514LL;
// const ll MAX = 500010LL;
const ll mod = MOD;
string abc = "abcdefghijklmnopqrstuvwxyz";
string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
vl dx = {0, 0, 1, -1};
vl dy = {1, -1, 0, 0};
//素因数分解O(√n)
map<ll, ll> prime_factor(ll n) {
map<ll, ll> res;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
res[i]++;
n /= i;
}
}
if (n != 1)
res[n] = 1;
return res;
}
const ll MAX = 2000010;
long long fac[MAX], finv[MAX], inv[MAX];
// finvが階乗の逆元
// テーブルを作る前処理
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;
}
}
// 二項係数計算
long long 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;
}
ll modpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
/*ll N=2000010;
vl arr(N);
void Eratosthenes(){
for(ll i = 0; i < N; i++){
arr[i] = 1;
}
arr[1]=0;
for(ll i = 2; i < sqrt(N); i++){
if(arr[i]){
for(ll j = 0; i * (j + 2) < N; j++){
arr[i *(j + 2)] = 0;
}
}
}
}*/
//素数判定O(√n)
bool is_prime(ll n) {
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
//約数の列挙O(√n)
vector<ll> divisor(ll n) {
vector<ll> res;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (i != n / i)
res.push_back(n / i);
}
}
return res;
}
/* SegTree<X>(n,fx,ex): モノイド(集合X, 二項演算fx,
単位元ex)についてサイズnで構築 set(int i, X x), build():
i番目の要素をxにセット。まとめてセグ木を構築する。O(n) update(i,x): i
番目の要素を x に更新。O(log(n)) query(a,b): [a,b)
全てにfxを作用させた値を取得。O(log(n))
*/
template <typename X> struct SegTree {
using FX = function<X(X, X)>;
int n;
FX fx;
const X ex;
vector<X> dat;
SegTree(int n_, FX fx_, X ex_) : n(), fx(fx_), ex(ex_), dat(n_ * 4, ex_) {
int x = 1;
while (n_ > x) {
x *= 2;
}
n = x;
}
void set(int i, X x) { dat[i + n - 1] = x; }
void build() {
for (int k = n - 2; k >= 0; k--)
dat[k] = fx(dat[2 * k + 1], dat[2 * k + 2]);
}
void update(int i, X x) {
i += n - 1;
dat[i] = x;
while (i > 0) {
i = (i - 1) / 2; // parent
dat[i] = fx(dat[i * 2 + 1], dat[i * 2 + 2]);
}
}
// the minimum element of [a,b)
X query(int a, int b) { return query_sub(a, b, 0, 0, n); }
X query_sub(int a, int b, int k, int l, int r) {
if (r <= a || b <= l) {
return ex;
} else if (a <= l && r <= b) {
return dat[k];
} else {
X vl = query_sub(a, b, k * 2 + 1, l, (l + r) / 2);
X vr = query_sub(a, b, k * 2 + 2, (l + r) / 2, r);
return fx(vl, vr);
}
}
/* debug */
inline X operator[](int a) { return query(a, a + 1); }
void print() {
for (int i = 0; i < 2 * n - 1; ++i) {
cout << (*this)[i];
if (i != n)
cout << ",";
}
cout << endl;
}
/*
使用例
auto fx=[](int x1,int x2)->int{return max(x1,x2);};
ll ex=0;
SegTree<ll>rmq(n,fx,ex);*/
};
/* Trie 木： 文字の種類(char_size)、int型で0に対応する文字(base)
insert(word): 単語 word を Trie 木に挿入する
search(word): 単語 word が Trie 木にあるか判定する
start_with(prefix): prefix が一致する単語が Trie 木にあるか判定する
count(): 挿入した単語の数を返す
size(): Trie 木の頂点数を返す
計算量：insert, search ともに O(M)（Mは単語の長さ）
*/
template <int char_size, int base> struct Trie {
struct Node { // 頂点を表す構造体
vector<int> next; // 子の頂点番号を格納。存在しなければ-1
vector<int> accept; // 末端がこの頂点になる単語の word_id を保存
int c; // base からの間隔をint型で表現したもの
int common; // いくつの単語がこの頂点を共有しているか
Node(int c_) : c(c_), common(0) { next.assign(char_size, -1); }
};
vector<Node> nodes; // trie 木本体
int root;
Trie() : root(0) { nodes.push_back(Node(root)); }
// 単語の挿入
void insert(const string &word, int word_id) {
int node_id = 0;
for (int i = 0; i < (int)word.size(); i++) {
int c = (int)(word[i] - base);
int &next_id = nodes[node_id].next[c];
if (next_id == -1) { // 次の頂点が存在しなければ追加
next_id = (int)nodes.size();
nodes.push_back(Node(c));
}
++nodes[node_id].common;
node_id = next_id;
}
++nodes[node_id].common;
nodes[node_id].accept.push_back(word_id);
}
void insert(const string &word) { insert(word, nodes[0].common); }
// 単語とprefixの検索
bool search(const string &word, bool prefix = false) {
int node_id = 0;
for (int i = 0; i < (int)word.size(); i++) {
int c = (int)(word[i] - base);
int &next_id = nodes[node_id].next[c];
if (next_id == -1) { // 次の頂点が存在しなければ終了
return false;
}
node_id = next_id;
}
return (prefix) ? true : nodes[node_id].accept.size() > 0;
}
// prefix を持つ単語が存在するかの検索
bool start_with(const string &prefix) { return search(prefix, true); }
// 挿入した単語の数
int count() const { return (nodes[0].common); }
// Trie木のノード数
int size() const { return ((int)nodes.size()); }
};
int main() {
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
cout << fixed << setprecision(10);
/*--------------------------------*/
/*Trie<26,'a'>trie;
ll n;cin>>n;
vl s(n);
rep(i,n){cin>>s[i];reverse(all(s[i]));}
vector<pair<int,string>>v(n);
rep(i,n){
v[i].first=s[i].size();
v[i].second=s[i];
}
sort(all(v));
reverse(all(v));
rep(i,n){
if(trie.start_with(v[i].second.substr(0,v[i].first-1))){
}
trie.insert(v[i].second);
}
*/
/*ll n,d;cin>>n>>d;
ll x,y;cin>>x>>y;
ll gx=abs(x+y),gy=abs(x-y);
COMinit();
if(gx<=n*d && gx%d==0 && (gx/d)%2==n%2 && gy<=n*d && gy%d==0 &&
(gy/d)%2==n%2){ ll d=COM(n,(n-gx/d)/2)*COM(n,(n-gy/d)/2); cout<<gx<<"
"<<gy<<endl; cout<<1.0/d<<endl;
}
else cout<<0<<endl;
*/
ll n;
cin >> n;
ll k;
cin >> k;
string s;
cin >> s;
vector<P> v;
{
set<ll> S;
rep(i, n) S.insert(s[i] - '0');
if (S.size() == 1) {
cout << s.size() << endl;
return 0;
}
}
if (s[0] == '0')
v.pb(make_pair(0, 1));
ll now = 1;
ll cnt = 0;
rep(i, n) {
if (i != 0 && s[i] == s[i - 1]) {
cnt++;
} else {
if (i != 0)
v.pb(make_pair(cnt, now));
now = s[i] - '0';
cnt = 1;
}
}
v.pb(make_pair(cnt, now));
// rep(i,v.size())cout<<v[i].first<<" "<<v[i].second<<" \n"[i+1==v.size()];
if (v.back().second == 0) {
// cout<<"ok"<<endl;
v.pb(make_pair(0, 1));
}
// cout<<v.back().first<<" "<<v.back().second<<endl;
// cout<<(v.back().second==0)<<endl;
// rep(i,v.size())cout<<v[i].first<<" "<<v[i].second<<" \n"[i+1==v.size()];
vl sum(v.size());
sum[0] = v[0].first;
for (ll i = 1; i < v.size(); i++) {
sum[i] = sum[i - 1] + v[i].first;
}
if (v.size() - 1 <= 2 * k) {
cout << sum[v.size() - 1] << endl;
return 0;
}
ll ans = sum[2 * k];
// cout<<ans<<endl;
// rep(i,sum.size())cout<<sum[i]<<" \n"[i+1==v.size()];
for (ll i = 2; i + 2 * k < sum.size(); i += 2) {
ans = max(ans, sum[i + 2 * k] - sum[i - 1]);
// cout<<sum[i+2*k]<<" "<<sum[i-1]<<endl;
}
cout << ans << endl;
}
| [
"control_flow.branch.if.condition.change"
] | 884,906 | 884,907 | u614128939 | cpp |
p03074 | /*
Converted from Scratch by scratch2cpp
(https://github.com/yos1up/scratch2cpp).
*/
#include <algorithm>
#include <iostream>
#include <math.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define debug \
cerr << "--" << __LINE__ << "--" \
<< "\n"
typedef long long ll;
using namespace std;
class Var { // NOTE: immutable
public:
mutable string sval;
mutable long double dval;
enum NumericState { UNKNOWN = -1, STRINGY = 0, NUMERIC = 1 };
mutable NumericState numericState;
mutable bool svalValid, dvalValid; // TODO: initialize at here?
Var() { *this = Var(""); }
Var(string s) {
sval = s;
svalValid = true;
dvalValid = false;
numericState = UNKNOWN;
}
Var(long double d) {
dval = d;
svalValid = false;
dvalValid = true;
numericState = NUMERIC;
}
Var(const Var &v) {
sval = string(v.sval);
dval = v.dval;
svalValid = v.svalValid;
dvalValid = v.dvalValid;
numericState = v.numericState;
}
void fillDval() const {
if (dvalValid)
return;
long double d;
bool numeric = isNumericString(sval, &d);
if (numeric) {
numericState = NUMERIC;
dval = d;
} else {
numericState = STRINGY;
dval = 0.0;
}
dvalValid = true;
}
static bool isNumericString(const string &s, long double *ptr) {
char *ep;
// cause side-effect: errno can be ERANGE after calling strtod
*ptr = strtold(s.c_str(), &ep);
// Scratch 3.0 recognize the string cause underflows or overflows as Numeric
return NULL != ep && '\0' == ep[0] && s[0] != '\0';
}
bool isNumeric() const {
fillDval();
return numericState == NUMERIC;
}
void fillSval() const {
if (svalValid)
return;
sval = (floorl(dval) == dval) ? to_string((ll)dval) : to_string(dval);
svalValid = true;
}
long double asNumber() const {
fillDval();
return dval;
}
string asString() const {
fillSval();
return sval;
}
Var operator+(const Var &y) const {
return Var(this->asNumber() + y.asNumber());
}
Var operator+=(const Var &y) {
*this = *this + y;
return *this;
}
Var operator-(const Var &y) const {
return Var(this->asNumber() - y.asNumber());
}
Var operator*(const Var &y) const {
return Var(this->asNumber() * y.asNumber());
}
Var operator/(const Var &y) const {
return Var(this->asNumber() / y.asNumber());
}
Var operator%(const Var &y) const {
return Var(fmodl(this->asNumber(), y.asNumber()));
}
bool operator<(const Var &y) const {
if (this->isNumeric() && y.isNumeric()) {
return this->asNumber() < y.asNumber();
} // compare as number if both can be interpreted as numeric
return this->asString() < y.asString();
}
bool operator>(const Var &y) const { return y < *this; }
bool operator==(const Var &y) const {
if (this->isNumeric() && y.isNumeric()) {
return this->asNumber() == y.asNumber();
} // compare as numeric if both are numeric
return this->asString() == y.asString();
}
friend ostream &operator<<(ostream &os, const Var &p);
friend istream &operator>>(istream &is, const Var &p);
};
ostream &operator<<(ostream &os, const Var &p) {
os << p.asString();
return os;
}
istream &operator>>(istream &is, Var &p) {
string s;
is >> s;
p = Var(s);
return is;
}
Var letterOf(Var index, Var sourceString) {
/* index: 1-origined */
string str = sourceString.asString();
int idx = (int)(index.asNumber() - 1);
// seem to be dirty but Scratch seems to do like this.
// ex. letterOf(0.01, "world") == "w", letterOf(1.99, "world") == "w",
// letterOf(5.99, "world") == "d"
if (0 <= idx && idx < str.size())
return Var(str.substr(idx, 1));
return Var();
}
class VarList {
public:
vector<Var> data;
VarList(const vector<Var> &x) { data = x; }
void push_back(const Var &x) { data.push_back(x); }
void pop_back() { data.pop_back(); }
void clear() { data.clear(); }
int size() { return (int)data.size(); }
Var getLineOfList(const Var &index) const {
/* index: 1-origined */
int idx = (int)index.asNumber() - 1;
// (unlike 'letterOf', index==0.9 does not work.)
if (0 <= idx && idx < data.size())
return data[idx];
return Var();
}
void setLineOfListTo(const Var &index, const Var &v) {
/* index: 1-origined */
int idx = (int)index.asNumber() - 1;
if (0 <= idx && idx < data.size())
data[idx] = v;
}
void deleteLineOfList(const Var &index) {
/* index: 1-origined */
string kwd = index.asString();
if (kwd == "all") {
data.clear();
} else if (kwd == "last") {
data.pop_back();
} else {
int idx = (int)index.asNumber() - 1;
if (0 <= idx && idx < data.size())
data.erase(data.begin() + idx);
}
}
void insertAtIndexOfList(const Var &item, const Var &index) {
/* index: 1-origined */
int idx = (int)index.asNumber() - 1;
if (0 <= idx && idx <= data.size())
data.insert(data.begin() + idx, item);
}
void insertAtRandomOfList(const Var &item) {
int idx = rand() % (data.size() + 1);
data.insert(data.begin() + idx, item);
}
string asString() const {
/* concatenate elements of list with space */
// TODO: concatenated without spaces only if all elements are single
// characters. (Is it an official bug? (or feature?))
string ret;
for (int i = 0; i < data.size(); i++) {
if (i > 0)
ret += ' ';
ret += data[i].asString();
}
return ret;
}
int itemNumOfList(const Var &item) const {
auto itr = find(data.begin(), data.end(), item);
if (itr == data.end())
return 0;
return 1 + (int)(itr - data.begin());
/* index: 1-origined */
}
friend ostream &operator<<(ostream &os, const VarList &p);
};
ostream &operator<<(ostream &os, const VarList &p) {
os << p.asString();
return os;
}
long double randUniform(const long double x, const long double y) {
if (x > y)
return randUniform(y, x);
if (floor(x) == x && floor(y) == y) {
ll xi = (ll)round(x), yi = (ll)round(y);
return xi + rand() % (yi - xi + 1);
} else {
return x + (y - x) * (0.0 + rand()) / RAND_MAX;
}
}
Var buf_answer; // for "answer"
// ============================= Scripts =============================
// variable declaration
Var var_N(1);
Var var_K(0);
Var var_S(1);
Var var_length(1);
Var var_i(1);
Var var_sum(1);
Var var_max(1);
// list declaration
VarList list_Length({Var(1)});
VarList list_Char({Var(1)});
// prototype declaration of functions
int main();
int func__30e9_30f3_30ec_30f3_30b0_30b9_7b26_53f7_5316();
// contents of functions
int main() {
cin >> buf_answer;
var_N = buf_answer;
cin >> buf_answer;
var_K = buf_answer;
cin >> buf_answer;
var_S = buf_answer;
func__30e9_30f3_30ec_30f3_30b0_30b9_7b26_53f7_5316();
if ((list_Char.getLineOfList(Var(1)) == Var(0))) {
list_Char.insertAtIndexOfList(Var(1), Var(1));
list_Length.insertAtIndexOfList(Var(1), Var(0));
}
if ((list_Char.getLineOfList(Var(list_Char.size())) == Var(0))) {
list_Char.push_back(Var(1));
list_Length.push_back(Var(0));
}
if ((((Var(list_Char.size()) - Var(1)) / Var(2)) < var_K)) {
var_K = ((Var(list_Char.size()) - Var(1)) / Var(2));
}
var_sum = Var(0);
var_i = Var(1);
for (int cnt_0 = 0; cnt_0 < ((var_K * Var(2)) + Var(1)).asNumber(); cnt_0++) {
var_sum = (var_sum + list_Length.getLineOfList(var_i));
var_i += Var(1);
}
var_max = var_sum;
var_i = Var(1);
for (int cnt_1 = 0;
cnt_1 < (((Var(list_Char.size()) - Var(1)) / Var(2)) - var_K).asNumber();
cnt_1++) {
var_sum = (var_sum - list_Length.getLineOfList(var_i));
var_sum = (var_sum - list_Length.getLineOfList((var_i + Var(1))));
var_sum = (var_sum + list_Length.getLineOfList(
(((var_K * Var(2)) + Var(1)) + var_i)));
var_sum = (var_sum + list_Length.getLineOfList(
((((var_K * Var(2)) + Var(1)) + var_i) + Var(1))));
if ((var_max < var_sum)) {
var_max = var_sum;
}
var_i += Var(2);
}
cout << var_max << endl;
return 0;
}
int func__30e9_30f3_30ec_30f3_30b0_30b9_7b26_53f7_5316() {
list_Char.clear();
list_Length.clear();
var_length = Var(0);
var_i = Var(1);
for (int cnt_2 = 0; cnt_2 < Var(var_S.asString().size()).asNumber();
cnt_2++) {
if (((Var(1) < var_i) &&
(!(letterOf((var_i - Var(1)), var_S) == letterOf(var_i, var_S))))) {
list_Char.push_back(letterOf((var_i - Var(1)), var_S));
list_Length.push_back(var_length);
var_length = Var(0);
}
var_length += Var(1);
var_i += Var(1);
}
if ((Var(1) < var_i)) {
list_Char.push_back(letterOf((var_i - Var(1)), var_S));
list_Length.push_back(var_length);
}
return 0;
}
| /*
Converted from Scratch by scratch2cpp
(https://github.com/yos1up/scratch2cpp).
*/
#include <algorithm>
#include <iostream>
#include <math.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define debug \
cerr << "--" << __LINE__ << "--" \
<< "\n"
typedef long long ll;
using namespace std;
class Var { // NOTE: immutable
public:
mutable string sval;
mutable long double dval;
enum NumericState { UNKNOWN = -1, STRINGY = 0, NUMERIC = 1 };
mutable NumericState numericState;
mutable bool svalValid, dvalValid; // TODO: initialize at here?
Var() { *this = Var(""); }
Var(string s) {
sval = s;
svalValid = true;
dvalValid = false;
numericState = UNKNOWN;
}
Var(long double d) {
dval = d;
svalValid = false;
dvalValid = true;
numericState = NUMERIC;
}
Var(const Var &v) {
sval = string(v.sval);
dval = v.dval;
svalValid = v.svalValid;
dvalValid = v.dvalValid;
numericState = v.numericState;
}
void fillDval() const {
if (dvalValid)
return;
long double d;
bool numeric = isNumericString(sval, &d);
if (numeric) {
numericState = NUMERIC;
dval = d;
} else {
numericState = STRINGY;
dval = 0.0;
}
dvalValid = true;
}
static bool isNumericString(const string &s, long double *ptr) {
char *ep;
// cause side-effect: errno can be ERANGE after calling strtod
*ptr = strtold(s.c_str(), &ep);
// Scratch 3.0 recognize the string cause underflows or overflows as Numeric
return NULL != ep && '\0' == ep[0] && s[0] != '\0';
}
bool isNumeric() const {
fillDval();
return numericState == NUMERIC;
}
void fillSval() const {
if (svalValid)
return;
sval = (floorl(dval) == dval) ? to_string((ll)dval) : to_string(dval);
svalValid = true;
}
long double asNumber() const {
fillDval();
return dval;
}
string asString() const {
fillSval();
return sval;
}
Var operator+(const Var &y) const {
return Var(this->asNumber() + y.asNumber());
}
Var operator+=(const Var &y) {
*this = *this + y;
return *this;
}
Var operator-(const Var &y) const {
return Var(this->asNumber() - y.asNumber());
}
Var operator*(const Var &y) const {
return Var(this->asNumber() * y.asNumber());
}
Var operator/(const Var &y) const {
return Var(this->asNumber() / y.asNumber());
}
Var operator%(const Var &y) const {
return Var(fmodl(this->asNumber(), y.asNumber()));
}
bool operator<(const Var &y) const {
if (this->isNumeric() && y.isNumeric()) {
return this->asNumber() < y.asNumber();
} // compare as number if both can be interpreted as numeric
return this->asString() < y.asString();
}
bool operator>(const Var &y) const { return y < *this; }
bool operator==(const Var &y) const {
if (this->isNumeric() && y.isNumeric()) {
return this->asNumber() == y.asNumber();
} // compare as numeric if both are numeric
return this->asString() == y.asString();
}
friend ostream &operator<<(ostream &os, const Var &p);
friend istream &operator>>(istream &is, const Var &p);
};
ostream &operator<<(ostream &os, const Var &p) {
os << p.asString();
return os;
}
istream &operator>>(istream &is, Var &p) {
string s;
is >> s;
p = Var(s);
return is;
}
Var letterOf(Var index, Var sourceString) {
/* index: 1-origined */
string str = sourceString.asString();
int idx = (int)(index.asNumber() - 1);
// seem to be dirty but Scratch seems to do like this.
// ex. letterOf(0.01, "world") == "w", letterOf(1.99, "world") == "w",
// letterOf(5.99, "world") == "d"
if (0 <= idx && idx < str.size())
return Var(str.substr(idx, 1));
return Var();
}
class VarList {
public:
vector<Var> data;
VarList(const vector<Var> &x) { data = x; }
void push_back(const Var &x) { data.push_back(x); }
void pop_back() { data.pop_back(); }
void clear() { data.clear(); }
int size() { return (int)data.size(); }
Var getLineOfList(const Var &index) const {
/* index: 1-origined */
int idx = (int)index.asNumber() - 1;
// (unlike 'letterOf', index==0.9 does not work.)
if (0 <= idx && idx < data.size())
return data[idx];
return Var();
}
void setLineOfListTo(const Var &index, const Var &v) {
/* index: 1-origined */
int idx = (int)index.asNumber() - 1;
if (0 <= idx && idx < data.size())
data[idx] = v;
}
void deleteLineOfList(const Var &index) {
/* index: 1-origined */
string kwd = index.asString();
if (kwd == "all") {
data.clear();
} else if (kwd == "last") {
data.pop_back();
} else {
int idx = (int)index.asNumber() - 1;
if (0 <= idx && idx < data.size())
data.erase(data.begin() + idx);
}
}
void insertAtIndexOfList(const Var &item, const Var &index) {
/* index: 1-origined */
int idx = (int)index.asNumber() - 1;
if (0 <= idx && idx <= data.size())
data.insert(data.begin() + idx, item);
}
void insertAtRandomOfList(const Var &item) {
int idx = rand() % (data.size() + 1);
data.insert(data.begin() + idx, item);
}
string asString() const {
/* concatenate elements of list with space */
// TODO: concatenated without spaces only if all elements are single
// characters. (Is it an official bug? (or feature?))
string ret;
for (int i = 0; i < data.size(); i++) {
if (i > 0)
ret += ' ';
ret += data[i].asString();
}
return ret;
}
int itemNumOfList(const Var &item) const {
auto itr = find(data.begin(), data.end(), item);
if (itr == data.end())
return 0;
return 1 + (int)(itr - data.begin());
/* index: 1-origined */
}
friend ostream &operator<<(ostream &os, const VarList &p);
};
ostream &operator<<(ostream &os, const VarList &p) {
os << p.asString();
return os;
}
long double randUniform(const long double x, const long double y) {
if (x > y)
return randUniform(y, x);
if (floor(x) == x && floor(y) == y) {
ll xi = (ll)round(x), yi = (ll)round(y);
return xi + rand() % (yi - xi + 1);
} else {
return x + (y - x) * (0.0 + rand()) / RAND_MAX;
}
}
Var buf_answer; // for "answer"
// ============================= Scripts =============================
// variable declaration
Var var_N(1);
Var var_K(0);
Var var_S(1);
Var var_length(1);
Var var_i(1);
Var var_sum(1);
Var var_max(1);
// list declaration
VarList list_Length({Var(1)});
VarList list_Char({Var(1)});
// prototype declaration of functions
int main();
int func__30e9_30f3_30ec_30f3_30b0_30b9_7b26_53f7_5316();
// contents of functions
int main() {
cin >> buf_answer;
var_N = buf_answer;
cin >> buf_answer;
var_K = buf_answer;
cin >> buf_answer;
var_S = buf_answer;
func__30e9_30f3_30ec_30f3_30b0_30b9_7b26_53f7_5316();
if ((list_Char.getLineOfList(Var(1)) == Var(0))) {
list_Char.insertAtIndexOfList(Var(1), Var(1));
list_Length.insertAtIndexOfList(Var(0), Var(1));
}
if ((list_Char.getLineOfList(Var(list_Char.size())) == Var(0))) {
list_Char.push_back(Var(1));
list_Length.push_back(Var(0));
}
if ((((Var(list_Char.size()) - Var(1)) / Var(2)) < var_K)) {
var_K = ((Var(list_Char.size()) - Var(1)) / Var(2));
}
var_sum = Var(0);
var_i = Var(1);
for (int cnt_0 = 0; cnt_0 < ((var_K * Var(2)) + Var(1)).asNumber(); cnt_0++) {
var_sum = (var_sum + list_Length.getLineOfList(var_i));
var_i += Var(1);
}
var_max = var_sum;
var_i = Var(1);
for (int cnt_1 = 0;
cnt_1 < (((Var(list_Char.size()) - Var(1)) / Var(2)) - var_K).asNumber();
cnt_1++) {
var_sum = (var_sum - list_Length.getLineOfList(var_i));
var_sum = (var_sum - list_Length.getLineOfList((var_i + Var(1))));
var_sum = (var_sum + list_Length.getLineOfList(
(((var_K * Var(2)) + Var(1)) + var_i)));
var_sum = (var_sum + list_Length.getLineOfList(
((((var_K * Var(2)) + Var(1)) + var_i) + Var(1))));
if ((var_max < var_sum)) {
var_max = var_sum;
}
var_i += Var(2);
}
cout << var_max << endl;
return 0;
}
int func__30e9_30f3_30ec_30f3_30b0_30b9_7b26_53f7_5316() {
list_Char.clear();
list_Length.clear();
var_length = Var(0);
var_i = Var(1);
for (int cnt_2 = 0; cnt_2 < Var(var_S.asString().size()).asNumber();
cnt_2++) {
if (((Var(1) < var_i) &&
(!(letterOf((var_i - Var(1)), var_S) == letterOf(var_i, var_S))))) {
list_Char.push_back(letterOf((var_i - Var(1)), var_S));
list_Length.push_back(var_length);
var_length = Var(0);
}
var_length += Var(1);
var_i += Var(1);
}
if ((Var(1) < var_i)) {
list_Char.push_back(letterOf((var_i - Var(1)), var_S));
list_Length.push_back(var_length);
}
return 0;
}
| [
"literal.number.change",
"call.arguments.change"
] | 884,908 | 884,909 | u141768747 | cpp |
p03074 | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long int
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n; i >= 0; i--)
#define REP(i, s, t) for (int i = s; i <= t; i++)
#define RREP(i, s, t) for (int i = s; i >= t; i--)
#define dump(x) cerr << #x << " = " << (x) << endl;
#define INF 2000000000
#define mod 1000000007
#define INF2 1000000000000000000
int sum[400020];
vector<int> v;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
string S;
cin >> S;
if (S[0] == '0')
v.push_back(0);
int len = 0;
rep(i, S.length()) {
if (len == 0 || S[i - 1] == S[i])
len++;
else if (i + 1 == S.length() || S[i - 1] != S[i]) {
v.push_back(len);
len = 1;
}
}
v.push_back(len);
rep(i, v.size()) sum[i + 1] += sum[i] + v[i];
rep(i, 400000) sum[i + 1] = max(sum[i + 1], sum[i]);
int ans = 0;
rep(i, 100010) { ans = max(ans, sum[i + 1 + K * 2] - sum[i]); }
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long int
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n; i >= 0; i--)
#define REP(i, s, t) for (int i = s; i <= t; i++)
#define RREP(i, s, t) for (int i = s; i >= t; i--)
#define dump(x) cerr << #x << " = " << (x) << endl;
#define INF 2000000000
#define mod 1000000007
#define INF2 1000000000000000000
int sum[400020];
vector<int> v;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
string S;
cin >> S;
if (S[0] == '0')
v.push_back(0);
int len = 0;
rep(i, S.length()) {
if (len == 0 || S[i - 1] == S[i])
len++;
else if (i + 1 == S.length() || S[i - 1] != S[i]) {
v.push_back(len);
len = 1;
}
}
v.push_back(len);
rep(i, v.size()) sum[i + 1] += sum[i] + v[i];
rep(i, 400000) sum[i + 1] = max(sum[i + 1], sum[i]);
int ans = 0;
rep(i, 50010) { ans = max(ans, sum[i * 2 + 1 + K * 2] - sum[i * 2]); }
cout << ans << endl;
return 0;
}
| [
"literal.number.change",
"call.arguments.change",
"assignment.change"
] | 884,910 | 884,911 | u965730380 | cpp |
p03073 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define limit(x, l, r) max(l, min(x, r))
#define lims(x, l, r) (x = max(l, min(x, r)))
#define isin(x, l, r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)), x.end())
#define snuke srand((unsigned)clock() + (unsigned)time(NULL));
#define show(x) cout << #x << " = " << x << endl;
#define PQ(T) priority_queue<T, v(T), greater<T>>
#define bn(x) ((1 << x) - 1)
#define dup(x, y) (((x) + (y)-1) / (y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() {
int x;
scanf("%d", &x);
return x;
}
template <typename T> inline istream &operator>>(istream &i, v(T) & v) {
rep(j, sz(v)) i >> v[j];
return i;
}
template <typename T> string join(const v(T) & v) {
stringstream s;
rep(i, sz(v)) s << ' ' << v[i];
return s.str().substr(1);
}
template <typename T> inline ostream &operator<<(ostream &o, const v(T) & v) {
if (sz(v))
o << join(v);
return o;
}
template <typename T1, typename T2>
inline istream &operator>>(istream &i, pair<T1, T2> &v) {
return i >> v.fi >> v.se;
}
template <typename T1, typename T2>
inline ostream &operator<<(ostream &o, const pair<T1, T2> &v) {
return o << v.fi << "," << v.se;
}
template <typename T> inline ll suma(const v(T) & a) {
ll res(0);
for (auto &&x : a)
res += x;
return res;
}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame \
{ \
puts("-1"); \
return 0; \
}
#define yn \
{ puts("Yes"); } \
else { \
puts("No"); \
}
const int MX = 200005;
#define RET(ans) \
{ \
cout << ans << endl; \
return 0; \
}
// 二次元ベクターの基本
/*
vector<vector<int>> dp; // 宣言
dp.resize(n); // 1次元めの要素数決定
dp[i].push_back(int); // プッシュバック
rep(i,n){
sort(dp[i].begin(),dp[i].end()); // 二次元めを昇順ソート
}
*/
// 整数スキャン（複数）
/*
int x,y,z;
scanf("%d%d%d",&x,&y,&z);
// n個の整数のスキャン
/*
ll a[n] = {};
rep(i,n){
scanf("%lld",&a[i]);
}
*/
// 文字列スキャン
/*
string s; cin >> s;
*/
// n個の文字列スキャン
/*
vector<string> slist;
rep(i,n){
string s; cin >> s;
slist.push_back(s);
}
*/
int main() {
string s;
cin >> s;
int a = 0;
int b = 0;
rep(i, s.size()) {
int x = 0;
if (s[i] == '1')
x = 1;
if (s[i] % 2 == x) {
a++;
} else {
b++;
}
}
cout << min(a, b) << endl;
return 0;
}
| #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define limit(x, l, r) max(l, min(x, r))
#define lims(x, l, r) (x = max(l, min(x, r)))
#define isin(x, l, r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)), x.end())
#define snuke srand((unsigned)clock() + (unsigned)time(NULL));
#define show(x) cout << #x << " = " << x << endl;
#define PQ(T) priority_queue<T, v(T), greater<T>>
#define bn(x) ((1 << x) - 1)
#define dup(x, y) (((x) + (y)-1) / (y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() {
int x;
scanf("%d", &x);
return x;
}
template <typename T> inline istream &operator>>(istream &i, v(T) & v) {
rep(j, sz(v)) i >> v[j];
return i;
}
template <typename T> string join(const v(T) & v) {
stringstream s;
rep(i, sz(v)) s << ' ' << v[i];
return s.str().substr(1);
}
template <typename T> inline ostream &operator<<(ostream &o, const v(T) & v) {
if (sz(v))
o << join(v);
return o;
}
template <typename T1, typename T2>
inline istream &operator>>(istream &i, pair<T1, T2> &v) {
return i >> v.fi >> v.se;
}
template <typename T1, typename T2>
inline ostream &operator<<(ostream &o, const pair<T1, T2> &v) {
return o << v.fi << "," << v.se;
}
template <typename T> inline ll suma(const v(T) & a) {
ll res(0);
for (auto &&x : a)
res += x;
return res;
}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame \
{ \
puts("-1"); \
return 0; \
}
#define yn \
{ puts("Yes"); } \
else { \
puts("No"); \
}
const int MX = 200005;
#define RET(ans) \
{ \
cout << ans << endl; \
return 0; \
}
// 二次元ベクターの基本
/*
vector<vector<int>> dp; // 宣言
dp.resize(n); // 1次元めの要素数決定
dp[i].push_back(int); // プッシュバック
rep(i,n){
sort(dp[i].begin(),dp[i].end()); // 二次元めを昇順ソート
}
*/
// 整数スキャン（複数）
/*
int x,y,z;
scanf("%d%d%d",&x,&y,&z);
// n個の整数のスキャン
/*
ll a[n] = {};
rep(i,n){
scanf("%lld",&a[i]);
}
*/
// 文字列スキャン
/*
string s; cin >> s;
*/
// n個の文字列スキャン
/*
vector<string> slist;
rep(i,n){
string s; cin >> s;
slist.push_back(s);
}
*/
int main() {
string s;
cin >> s;
int a = 0;
int b = 0;
rep(i, s.size()) {
int x = 0;
if (s[i] == '1')
x = 1;
if (i % 2 == x) {
a++;
} else {
b++;
}
}
cout << min(a, b) << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 884,926 | 884,927 | u791593901 | cpp |
p03073 | #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
int ans1 = 0;
int ans2 = 0;
int length = S.size();
for (int i = 0; i < length; ++i) {
if (i % 2 == S[i] - '0') {
ans1++;
} else if (i & 2 != S[i] - '0') {
ans2++;
}
}
cout << min(ans1, ans2) << endl;
}
| #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
int ans1 = 0;
int ans2 = 0;
int length = S.size();
for (int i = 0; i < length; ++i) {
if (i % 2 == S[i] - '0') {
ans1++;
} else if (i % 2 != S[i] - '0') {
ans2++;
}
}
cout << min(ans1, ans2) << endl;
}
| [
"control_flow.branch.if.condition.change"
] | 884,941 | 884,942 | u600743332 | cpp |
p03073 | #include <algorithm>
#include <ctype.h>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define N_MAX (100000)
#define LL_MAX_NUM (1LL << 60)
#define INF 1e7
typedef long long ll;
typedef long long int lli;
int main() {
string S;
int res = 0;
stack<char> Sstack;
cin >> S;
int Ssize = S.size();
for (int i = 0; i < Ssize; i++) {
if (Sstack.size() == 0) {
Sstack.push(S[0]);
} else {
if (S[i] == Sstack.top()) {
Sstack.pop();
res++;
} else {
Sstack.push(S[i]);
}
}
}
cout << res << endl;
return 0;
} | #include <algorithm>
#include <ctype.h>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define N_MAX (100000)
#define LL_MAX_NUM (1LL << 60)
#define INF 1e7
typedef long long ll;
typedef long long int lli;
int main() {
string S;
int res = 0;
stack<char> Sstack;
cin >> S;
int Ssize = S.size();
for (int i = 0; i < Ssize; i++) {
if (Sstack.size() == 0) {
Sstack.push(S[i]);
} else {
if (S[i] == Sstack.top()) {
Sstack.pop();
res++;
} else {
Sstack.push(S[i]);
}
}
}
cout << res << endl;
return 0;
} | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 884,943 | 884,944 | u221174888 | cpp |
p03073 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
typedef long long ll;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
pbds;
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#define ios \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define so sizeof
#define pb push_back
#define vl vector<ll>
#define el \
endl; \
cout.flush()
#define be begin()
#define fi first
#define se second
#define br break
#define sz size()
#define en end()
#define ro return 0
#define br break
#define con continue
#define um unordered_map<ll, ll>
#define ms(x) memset(x, 0, so x)
#define all(x) (x).be, (x).en
#define rall(x) (x).rbegin(), (x).rend()
#define acc(x) accumulate((x).be, (x).en, 0ll)
#define forn(i, a, b) for (ll i = a; i <= b; ++i)
#define forr(i, a, b) for (ll i = a; i < b; ++i)
#define rng_58 \
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
#define vll vector<pair<ll, ll>>
#define pll pair<ll, ll>
#define plll pair<ll, pair<ll, ll>>
#define plvl pair<pair<ll, ll>, ll>
#define mp make_pair
#define trace2(a, b) cerr << "a is " << a << " b is " << b << el;
#define trace3(a, b, c) \
cerr << "a is " << a << " b is " << b << " c is " << c << el;
#define trace4(a, b, c, d) \
cerr << "a is " << a << " b is " << b << " c is " << c << " d is " << d << el;
#define trace5(a, b, c, d, e) \
cerr << "a is " << a << " b is " << b << " c is " << c << " d is " << d \
<< " e is " << e << el;
#define trace6(a, b, c, d, e, f) \
cerr << "a is " << a << " b is " << b << " c is " << c << " d is " << d \
<< " e is " << e << " f is " << f << el;
int main() {
string s, s1 = "", s2 = "";
cin >> s;
ll n = s.length();
forn(i, 0, n - 1) {
if (i % 2) {
s1 = s1 + "0";
} else
s1 = s1 + "1";
}
forn(i, 0, n - 1) {
if (i % 2) {
s1 = s1 + "1";
} else
s2 = s2 + "0";
}
ll ans1 = 0, ans2 = 0;
forn(i, 0, n - 1) {
if (s[i] != s1[i])
++ans1;
}
forn(i, 0, n - 1) {
if (s[i] != s2[i])
++ans2;
}
cout << min(ans1, ans2);
cout << el;
ro;
}
| #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
typedef long long ll;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
pbds;
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#define ios \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define so sizeof
#define pb push_back
#define vl vector<ll>
#define el \
endl; \
cout.flush()
#define be begin()
#define fi first
#define se second
#define br break
#define sz size()
#define en end()
#define ro return 0
#define br break
#define con continue
#define um unordered_map<ll, ll>
#define ms(x) memset(x, 0, so x)
#define all(x) (x).be, (x).en
#define rall(x) (x).rbegin(), (x).rend()
#define acc(x) accumulate((x).be, (x).en, 0ll)
#define forn(i, a, b) for (ll i = a; i <= b; ++i)
#define forr(i, a, b) for (ll i = a; i < b; ++i)
#define rng_58 \
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
#define vll vector<pair<ll, ll>>
#define pll pair<ll, ll>
#define plll pair<ll, pair<ll, ll>>
#define plvl pair<pair<ll, ll>, ll>
#define mp make_pair
#define trace2(a, b) cerr << "a is " << a << " b is " << b << el;
#define trace3(a, b, c) \
cerr << "a is " << a << " b is " << b << " c is " << c << el;
#define trace4(a, b, c, d) \
cerr << "a is " << a << " b is " << b << " c is " << c << " d is " << d << el;
#define trace5(a, b, c, d, e) \
cerr << "a is " << a << " b is " << b << " c is " << c << " d is " << d \
<< " e is " << e << el;
#define trace6(a, b, c, d, e, f) \
cerr << "a is " << a << " b is " << b << " c is " << c << " d is " << d \
<< " e is " << e << " f is " << f << el;
int main() {
string s, s1 = "", s2 = "";
cin >> s;
ll n = s.length();
forn(i, 0, n - 1) {
if (i % 2) {
s1 = s1 + "0";
} else
s1 = s1 + "1";
}
forn(i, 0, n - 1) {
if (i % 2) {
s2 = s2 + "1";
} else
s2 = s2 + "0";
}
ll ans1 = 0, ans2 = 0;
forn(i, 0, n - 1) {
if (s[i] != s1[i])
++ans1;
}
forn(i, 0, n - 1) {
if (s[i] != s2[i])
++ans2;
}
cout << min(ans1, ans2);
cout << el;
ro;
}
| [
"assignment.variable.change",
"identifier.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 884,948 | 884,949 | u992394626 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a = 0;
string s;
cin >> s;
int l = s.size();
if (l == 1) {
a++;
cout << a << endl;
} else {
for (int i = 1; i < l; i++) {
if (s[i - 1] == s[i]) {
a++;
if (s[i] == '0') {
s[i] = '1';
} else {
s[i] = '0';
}
}
}
cout << a << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a = 0;
string s;
cin >> s;
int l = s.size();
if (l == 1) {
cout << a << endl;
} else {
for (int i = 1; i < l; i++) {
if (s[i - 1] == s[i]) {
a++;
if (s[i] == '0') {
s[i] = '1';
} else {
s[i] = '0';
}
// s[i] = '1' + '0' - s[i];
}
}
cout << a << endl;
}
}
| [
"expression.unary.arithmetic.remove"
] | 884,952 | 884,953 | u671802527 | cpp |
p03073 | #include <iostream>
using namespace std;
int main() {
string c, s1, s2;
cin >> c;
bool b = false;
for (int i = 0; i < c.size(); i++) {
s1.push_back(b ? '1' : '0');
s2.push_back(b ? '0' : '1');
b != b;
}
int ans1, ans2 = 0;
for (int i = 0; i < c.size(); i++) {
if (s1[i] != c[i]) {
ans1++;
}
if (s2[i] != c[i]) {
ans2++;
}
}
cout << min(ans1, ans2) << endl;
}
| #include <iostream>
using namespace std;
int main() {
string c, s1, s2;
cin >> c;
bool b = false;
for (int i = 0; i < c.size(); i++) {
s1.push_back(b ? '1' : '0');
s2.push_back(b ? '0' : '1');
b = !b;
}
int ans1 = 0, ans2 = 0;
for (int i = 0; i < c.size(); i++) {
if (s1[i] != c[i]) {
ans1++;
}
if (s2[i] != c[i]) {
ans2++;
}
}
cout << min(ans1, ans2) << endl;
}
| [
"expression.operation.binary.change",
"expression.operation.unary.add",
"variable_declaration.value.change"
] | 884,954 | 884,955 | u234531758 | cpp |
p03073 | #include <iostream>
using namespace std;
int main() {
string c, s1, s2;
cin >> c;
bool b = false;
for (int i = 0; i < c.size(); i++) {
s1.push_back(b ? '1' : '0');
s2.push_back(b ? '0' : '1');
b != b;
}
int ans1, ans2 = 0;
for (int i = 1; i < c.size(); i++) {
if (s1[i] != c[i]) {
ans1++;
}
if (s2[i] != c[i]) {
ans2++;
}
}
cout << min(ans1, ans2) << endl;
}
| #include <iostream>
using namespace std;
int main() {
string c, s1, s2;
cin >> c;
bool b = false;
for (int i = 0; i < c.size(); i++) {
s1.push_back(b ? '1' : '0');
s2.push_back(b ? '0' : '1');
b = !b;
}
int ans1 = 0, ans2 = 0;
for (int i = 0; i < c.size(); i++) {
if (s1[i] != c[i]) {
ans1++;
}
if (s2[i] != c[i]) {
ans2++;
}
}
cout << min(ans1, ans2) << endl;
}
| [
"expression.operation.binary.change",
"expression.operation.unary.add",
"variable_declaration.value.change",
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 884,956 | 884,955 | u234531758 | cpp |
p03073 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int count = 0;
string S;
cin >> S;
for (int i = 0; i < S.size(); i++) {
if (S[i] != (i % 2))
count++;
}
if (count > S.size() / 2)
cout << S.size() - count << endl;
else
cout << count << endl;
return 0;
} | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int count = 0;
string S;
cin >> S;
for (int i = 0; i < S.size(); i++) {
if (S[i] != (i % 2) + '0')
count++;
}
if (count > S.size() / 2)
cout << S.size() - count << endl;
else
cout << count << endl;
return 0;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 884,959 | 884,960 | u225891650 | cpp |
p03073 | #include <iostream>
using namespace std;
int main() {
int i, ans1 = 0, ans2 = 0;
char s[111111];
for (i = 0; i < 111111; i++)
s[i] = '2';
cin >> s;
for (i = 0; s[i] != '2'; i++) {
if (s[i] == '0') {
if (i % 2 == 0)
ans1++;
else
ans2++;
} else {
if (i % 2 == 1)
ans1++;
else
ans2++;
}
}
if (ans1 > ans2)
ans1 = ans2;
cout << ans1 << endl;
} | #include <iostream>
using namespace std;
int main() {
int i, ans1 = 0, ans2 = 0;
char s[111111];
for (i = 0; i < 111111; i++)
s[i] = '\0';
cin >> s;
for (i = 0; s[i] != '\0'; i++) {
if (s[i] == '0') {
if (i % 2 == 0)
ans1++;
else
ans2++;
} else {
if (i % 2 == 1)
ans1++;
else
ans2++;
}
}
if (ans1 > ans2)
ans1 = ans2;
cout << ans1 << endl;
}
| [
"literal.string.change",
"assignment.value.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 884,961 | 884,962 | u933068010 | cpp |
p03073 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int ans = 999999999;
string s;
cin >> s;
for (int i = 0; i < 2; i++) {
int count = 0;
for (int j = 0; j < s.size(); j++) {
if (s[i] - '0' != (i + j) % 2) {
count++;
}
}
ans = min(ans, count);
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int ans = 999999999;
string s;
cin >> s;
for (int i = 0; i < 2; i++) {
int count = 0;
for (int j = 0; j < s.size(); j++) {
if (s[j] - '0' != (i + j) % 2) {
count++;
}
}
ans = min(ans, count);
}
cout << ans << endl;
return 0;
} | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 884,982 | 884,983 | u114838227 | cpp |
p03073 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s1, s2;
cin >> s1;
int i, sum1 = 0, sum2 = 1;
s2 = s1;
if (s2[0] == '0')
s2[0] = '1';
else
s2[0] = '0';
for (i = 0; i < s1.size() - 1; i++) {
if (s1[i] == s1[i + 1]) {
sum1++;
if (s1[i] == '0')
s1[i + 1] = '1';
else
s1[i + 1] = '0';
}
if (s2[i] == s2[i + 1]) {
sum2++;
if (s2[i] == '0')
s2[i + 1] = '1';
else
s2[i + 1] = '0';
}
}
cout << max(sum1, sum2);
return 0;
}
| #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s1, s2;
cin >> s1;
int i, sum1 = 0, sum2 = 1;
s2 = s1;
if (s2[0] == '0')
s2[0] = '1';
else
s2[0] = '0';
for (i = 0; i < s1.size() - 1; i++) {
if (s1[i] == s1[i + 1]) {
sum1++;
if (s1[i] == '0')
s1[i + 1] = '1';
else
s1[i + 1] = '0';
}
if (s2[i] == s2[i + 1]) {
sum2++;
if (s2[i] == '0')
s2[i + 1] = '1';
else
s2[i + 1] = '0';
}
}
cout << min(sum1, sum2);
return 0;
}
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 884,984 | 884,985 | u543120093 | cpp |
p03073 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s1, s2;
cin >> s1;
int i, sum1 = 0, sum2 = 0;
s2 = s1;
if (s2[0] == '0')
s2[0] = '1';
else
s2[0] = '0';
for (i = 0; i < s1.size() - 1; i++) {
if (s1[i] == s1[i + 1]) {
sum1++;
if (s1[i] == '0')
s1[i + 1] = '1';
else
s1[i + 1] = '0';
}
if (s2[i] == s2[i + 1]) {
sum2++;
if (s2[i] == '0')
s2[i + 1] = '1';
else
s2[i + 1] = '0';
}
}
cout << min(sum1, sum2);
return 0;
}
| #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string s1, s2;
cin >> s1;
int i, sum1 = 0, sum2 = 1;
s2 = s1;
if (s2[0] == '0')
s2[0] = '1';
else
s2[0] = '0';
for (i = 0; i < s1.size() - 1; i++) {
if (s1[i] == s1[i + 1]) {
sum1++;
if (s1[i] == '0')
s1[i + 1] = '1';
else
s1[i + 1] = '0';
}
if (s2[i] == s2[i + 1]) {
sum2++;
if (s2[i] == '0')
s2[i + 1] = '1';
else
s2[i + 1] = '0';
}
}
cout << min(sum1, sum2);
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 884,986 | 884,985 | u543120093 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int ans = S.size();
for (int i = 0; i < 2; i++) {
int cnt = 0;
for (int j = 0; j < S.size(); j++) {
if (j % 2 == 0 && S[j] != (char)(i + '0'))
cnt++;
if (j % 2 == 1 && S[j] == (char)(i + '0'))
cnt++;
}
int ans = min(ans, cnt);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int ans = S.size();
for (int i = 0; i < 2; i++) {
int cnt = 0;
for (int j = 0; j < S.size(); j++) {
if (j % 2 == 0 && S[j] != (char)(i + '0'))
cnt++;
if (j % 2 == 1 && S[j] == (char)(i + '0'))
cnt++;
}
ans = min(ans, cnt);
}
cout << ans << endl;
return 0;
} | [] | 884,998 | 884,999 | u568419568 | cpp |
p03073 | #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
int cnt0, cnt1;
for (int i = 0; i < S.length(); i++) {
if ((i % 2 == 0 && S[i] == '0') || (i % 2 == 1 && S[i] == '1')) {
cnt0++;
}
if ((i % 2 == 0 && S[i] == '1') || (i % 2 == 1 && S[i] == '0')) {
cnt1++;
}
}
cout << min(cnt0, cnt1) << endl;
} | #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
int cnt0 = 0, cnt1 = 0;
for (int i = 0; i < S.length(); i++) {
if ((i % 2 == 0 && S[i] == '0') || (i % 2 == 1 && S[i] == '1')) {
cnt0++;
}
if ((i % 2 == 0 && S[i] == '1') || (i % 2 == 1 && S[i] == '0')) {
cnt1++;
}
}
cout << min(cnt0, cnt1) << endl;
} | [
"variable_declaration.value.change"
] | 885,004 | 885,005 | u864667985 | cpp |
p03073 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string S;
string S1;
string S2;
cin >> S;
S1 = S;
S2 = S;
int answer1 = 0;
int answer2 = 0;
for (int j = 0; j < S1.size() - 1; j++) {
if (S1.at(j) == S1.at(j + 1)) {
if (S1.at(j + 1) == '0') {
S1.at(j + 1) = '1';
} else {
S1.at(j + 1) = '0';
}
answer1++;
}
}
cout << min(answer1, answer2) << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string S;
string S1;
string S2;
cin >> S;
S1 = S;
S2 = S;
int answer1 = 0;
int answer2 = 0;
for (int j = 0; j < S1.size() - 1; j++) {
if (S1.at(j) == S1.at(j + 1)) {
if (S1.at(j + 1) == '0') {
S1.at(j + 1) = '1';
} else {
S1.at(j + 1) = '0';
}
answer1++;
}
}
cout << answer1 << endl;
return 0;
} | [
"call.remove",
"call.arguments.change"
] | 885,010 | 885,011 | u895225176 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
int main() {
string s;
cin >> s;
int l = s.length();
int a = 0, b = 0;
rep(i, l) {
if (i % 2) {
if (s[i] != '0')
a++;
if (s[i] != '1')
b++;
} else if (s[i] != '1')
a++;
if (s[i] != '0')
b++;
}
cout << min(a, b) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
int main() {
string s;
cin >> s;
int l = s.length();
int a = 0, b = 0;
rep(i, l) {
if (i % 2) {
if (s[i] != '0')
a++;
if (s[i] != '1')
b++;
} else {
if (s[i] != '1')
a++;
if (s[i] != '0')
b++;
}
}
cout << min(a, b) << endl;
return 0;
}
| [] | 885,012 | 885,013 | u970690920 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, s1 = "", s2 = "";
cin >> s;
int ans1 = 0, ans2 = 0;
int size = s.size();
s1 += '0';
s2 += '1';
for (int i = 0; i < size; i++) {
if (s1[i - 1] == '0') {
s1 += '1';
} else {
s1 += '0';
}
if (s2[i - 1] == '0') {
s2 += '1';
} else {
s2 += '0';
}
}
for (int i = 0; i < size; i++) {
if (s[i] != s1[i]) {
ans1++;
}
if (s2[i] != s[i]) {
ans2++;
}
}
// cout << s1 << " " << s2 << endl;
ans1 = min(ans1, ans2);
cout << ans1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, s1 = "", s2 = "";
cin >> s;
int ans1 = 0, ans2 = 0;
int size = s.size();
s1 += '0';
s2 += '1';
for (int i = 1; i < size; i++) {
if (s1[i - 1] == '0') {
s1 += '1';
} else {
s1 += '0';
}
if (s2[i - 1] == '0') {
s2 += '1';
} else {
s2 += '0';
}
}
for (int i = 0; i < size; i++) {
if (s[i] != s1[i]) {
ans1++;
}
if (s2[i] != s[i]) {
ans2++;
}
}
// cout << s1 << " " << s2 << endl;
ans1 = min(ans1, ans2);
cout << ans1 << endl;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 885,018 | 885,019 | u422827820 | cpp |
p03073 | #include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
int main() {
std::string S;
std::vector<char> S1;
std::vector<char> S2;
long long s = 0;
long long s1 = 0;
long long s2 = 0;
long long scale = 1;
int count = 0;
int count2 = 0;
std::cin >> S;
S1.reserve(S.size());
S2.reserve(S.size());
for (int i = 0; i < S.size(); i++) {
if (i % 2 == 0) {
S1.emplace_back('0');
} else if (i % 2 == 1) {
S1.emplace_back('1');
}
}
for (int i = 0; i < S.size(); i++) {
if (i % 2 == 0) {
S2.emplace_back('1');
} else if (i % 2 == 1) {
S2.emplace_back('0');
}
}
for (int i = S.size() - 1; i >= 0; i--) {
if (S[i] - S1[i] != 0) {
count++;
} else if (S[i] - S2[i] != 0) {
count2++;
}
}
if (count > count2) {
std::cout << count2;
} else if (count < count2) {
std::cout << count;
}
} | #include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
int main() {
std::string S;
std::vector<char> S1;
std::vector<char> S2;
long long s = 0;
long long s1 = 0;
long long s2 = 0;
long long scale = 1;
int count = 0;
int count2 = 0;
std::cin >> S;
S1.reserve(S.size());
S2.reserve(S.size());
for (int i = 0; i < S.size(); i++) {
if (i % 2 == 0) {
S1.emplace_back('0');
} else if (i % 2 == 1) {
S1.emplace_back('1');
}
}
for (int i = 0; i < S.size(); i++) {
if (i % 2 == 0) {
S2.emplace_back('1');
} else if (i % 2 == 1) {
S2.emplace_back('0');
}
}
for (int i = S.size() - 1; i >= 0; i--) {
if (S[i] - S1[i] != 0) {
count++;
} else if (S[i] - S2[i] != 0) {
count2++;
}
}
if (count >= count2) {
std::cout << count2;
} else if (count < count2) {
std::cout << count;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 885,026 | 885,027 | u329794618 | cpp |
p03073 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<ll, ll> P;
#define M 1000000007
int main() {
ll c = 0, cnt = 0, f = 0, b = 0;
string s;
cin >> s;
for (int i = 1; i < s.size(); i++) {
if (s[i] != s[i - 1]) {
c++;
if (s[i] == '1')
s[i] = '0';
else
s[i] = '1';
}
}
cout << c;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<ll, ll> P;
#define M 1000000007
int main() {
ll c = 0, cnt = 0, f = 0, b = 0;
string s;
cin >> s;
for (int i = 1; i < s.size(); i++) {
if (s[i] == s[i - 1]) {
c++;
if (s[i] == '1')
s[i] = '0';
else
s[i] = '1';
}
}
cout << c;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 885,030 | 885,031 | u987476436 | cpp |
p03073 | #include <algorithm>
#include <fstream>
#include <iostream>
#include <string>
#include <vector>
//#include <math.h>
//#include <istream>
//#include <sstream>
using namespace std;
int main() {
int ANS1 = 0;
int ANS2 = 0;
int ANS = 0;
string str;
vector<char> H;
getline(cin, str);
for (int i = 0; i < str.size(); i++) {
H.push_back(str[i]);
}
for (int i = 0; i < H.size(); i++) {
if (i % 2 == 0 && H[i] == '0') {
ANS1 = ANS;
}
if (i % 2 != 0 && H[i] == '1') {
ANS1 = ANS1;
}
if (i % 2 == 0 && H[i] == '1') {
ANS1 = ANS1 + 1;
}
if (i % 2 != 0 && H[i] == '0') {
ANS1 = ANS1 + 1;
}
}
for (int i = 0; i < H.size(); i++) {
if (i % 2 == 0 && H[i] == '0') {
ANS2 = ANS2 + 1;
}
if (i % 2 != 0 && H[i] == '1') {
ANS2 = ANS2 + 1;
}
if (i % 2 == 0 && H[i] == '1') {
ANS2 = ANS2;
}
if (i % 2 != 0 && H[i] == '0') {
ANS2 = ANS2;
}
}
ANS = min(ANS1, ANS2);
cout << ANS << endl;
} | #include <algorithm>
#include <fstream>
#include <iostream>
#include <string>
#include <vector>
//#include <math.h>
//#include <istream>
//#include <sstream>
using namespace std;
int main() {
int ANS1 = 0;
int ANS2 = 0;
int ANS = 0;
string str;
vector<char> H;
getline(cin, str);
for (int i = 0; i < str.size(); i++) {
H.push_back(str[i]);
}
for (int i = 0; i < H.size(); i++) {
if (i % 2 == 0 && H[i] == '0') {
ANS1 = ANS1;
}
if (i % 2 != 0 && H[i] == '1') {
ANS1 = ANS1;
}
if (i % 2 == 0 && H[i] == '1') {
ANS1 = ANS1 + 1;
}
if (i % 2 != 0 && H[i] == '0') {
ANS1 = ANS1 + 1;
}
}
for (int i = 0; i < H.size(); i++) {
if (i % 2 == 0 && H[i] == '0') {
ANS2 = ANS2 + 1;
}
if (i % 2 != 0 && H[i] == '1') {
ANS2 = ANS2 + 1;
}
if (i % 2 == 0 && H[i] == '1') {
ANS2 = ANS2;
}
if (i % 2 != 0 && H[i] == '0') {
ANS2 = ANS2;
}
}
ANS = min(ANS1, ANS2);
cout << ANS << endl;
} | [
"assignment.value.change",
"identifier.change"
] | 885,047 | 885,048 | u230139835 | cpp |
p03073 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define rrep(i, a, n) for (ll i = n; i >= a; i--)
#define elif else if
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 1e+17;
const ll MODcdf = 998244353;
bool pairCompare(const P &firstElof, const P &secondElof) {
return firstElof.first < secondElof.first;
}
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
string a;
cin >> a;
string s = a;
s.push_back('0');
ll ans0 = 0;
rrep(i, 0, s.size() - 2) {
if (s[i] == s[i + 1]) {
if (s[i] == '0')
s[i] = '1';
else
s[i] = '0';
ans0++;
}
}
a.push_back(0);
ll ans1 = 0;
rrep(i, 0, a.size() - 2) {
if (a[i] == a[i + 1]) {
if (a[i] == '0')
a[i] = '1';
else
a[i] = '0';
ans1++;
}
}
cout << min(ans1, ans0) << endl;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define rrep(i, a, n) for (ll i = n; i >= a; i--)
#define elif else if
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 1e+17;
const ll MODcdf = 998244353;
bool pairCompare(const P &firstElof, const P &secondElof) {
return firstElof.first < secondElof.first;
}
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
string a;
cin >> a;
string s = a;
s.push_back('0');
ll ans0 = 0;
rrep(i, 0, s.size() - 2) {
if (s[i] == s[i + 1]) {
if (s[i] == '0')
s[i] = '1';
else
s[i] = '0';
ans0++;
}
}
a.push_back('1');
ll ans1 = 0;
rrep(i, 0, a.size() - 2) {
if (a[i] == a[i + 1]) {
if (a[i] == '0')
a[i] = '1';
else
a[i] = '0';
ans1++;
}
}
cout << min(ans1, ans0) << endl;
}
| [
"call.arguments.change"
] | 885,056 | 885,057 | u119345557 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
using ll = long long;
string char_to_string(char val) { return string(1, val); }
int char_to_int(char val) { return val - '0'; }
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int vector_finder(std::vector<ll> vec, int number) {
auto itr = std::find(vec.begin(), vec.end(), number);
size_t index = std::distance(vec.begin(), itr);
if (index != vec.size()) { // 発見できたとき
return 1;
} else { // 発見できなかったとき
return 0;
}
}
struct edge {
ll to, cost;
};
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> tmp;
int cnt = 0;
if (S[0] == '0')
tmp.push_back(0);
REP(i, N) {
cnt++;
if (S[i] != S[i + 1]) {
tmp.push_back(cnt);
cnt = 0;
}
}
if (S[N - 1] == '0')
tmp.push_back(0);
vector<int> res(tmp.size() + 1, 0);
REP(i, tmp.size()) res[i + 1] = res[i] + tmp[i]; // 累積
int ans = 0;
for (int i = 0; i < res.size(); i = i + 2) {
int right = i + (2 * K + 1);
if (right >= N)
right = res.size() - 1;
ans = max(ans, (res[right] - res[i]));
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
using ll = long long;
string char_to_string(char val) { return string(1, val); }
int char_to_int(char val) { return val - '0'; }
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int vector_finder(std::vector<ll> vec, int number) {
auto itr = std::find(vec.begin(), vec.end(), number);
size_t index = std::distance(vec.begin(), itr);
if (index != vec.size()) { // 発見できたとき
return 1;
} else { // 発見できなかったとき
return 0;
}
}
struct edge {
ll to, cost;
};
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> tmp;
int cnt = 0;
if (S[0] == '0')
tmp.push_back(0);
REP(i, N) {
cnt++;
if (S[i] != S[i + 1]) {
tmp.push_back(cnt);
cnt = 0;
}
}
if (S[N - 1] == '0')
tmp.push_back(0);
vector<int> res(tmp.size() + 1, 0);
REP(i, tmp.size()) res[i + 1] = res[i] + tmp[i]; // 累積
int ans = 0;
for (int i = 0; i < res.size(); i = i + 2) {
int right = i + (2 * K + 1);
if (right >= res.size())
right = res.size() - 1;
ans = max(ans, (res[right] - res[i]));
}
cout << ans << endl;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add"
] | 885,061 | 885,062 | u308463793 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
typedef long double ld;
typedef long long ll;
const int MOD = 1000000007;
const int IINF = INT_MAX;
const ll INF = 1LL << 60;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
// 累積和
// 00010のように両端が0だったら「0個の1として」0を追加する
// 00010の場合は03110となる
V<int> v;
if (s[0] == '0')
v.push_back(0);
for (int i = 0; i < n; i++) {
int j = i;
while (j < n && s[j] == s[i])
j++;
v.push_back(j - i);
i = j;
}
if (s[n - 1] == '0')
v.push_back(0);
V<int> w((int)v.size() + 1, 0);
for (int i = 0; i < (int)v.size(); i++) {
w[i + 1] = w[i] + v[i];
}
// 偶数番目から長さ2k+1（以下）の区間の総和のうち最大値
// 最初が0でも上で「0個の1」を追加しているからi=0から始める
int ans = 0;
int m = w.size();
for (int i = 0; i < m; i += 2) {
int j = i + k * 2 + 1;
if (j >= m)
j = m - 1;
ans = max(ans, w[j] - w[i]);
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
typedef long double ld;
typedef long long ll;
const int MOD = 1000000007;
const int IINF = INT_MAX;
const ll INF = 1LL << 60;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
// 累積和
// 00010のように両端が0だったら「0個の1として」0を追加する
// 00010の場合は03110となる
V<int> v;
if (s[0] == '0')
v.push_back(0);
for (int i = 0; i < n;) {
int j = i;
while (j < n && s[j] == s[i])
j++;
v.push_back(j - i);
i = j;
}
if (s[n - 1] == '0')
v.push_back(0);
V<int> w((int)v.size() + 1, 0);
for (int i = 0; i < (int)v.size(); i++) {
w[i + 1] = w[i] + v[i];
}
// 偶数番目から長さ2k+1（以下）の区間の総和のうち最大値
// 最初が0でも上で「0個の1」を追加しているからi=0から始める
int ans = 0;
int m = w.size();
for (int i = 0; i < m; i += 2) {
int j = i + k * 2 + 1;
if (j >= m)
j = m - 1;
ans = max(ans, w[j] - w[i]);
}
cout << ans << endl;
return 0;
}
| [
"control_flow.loop.for.update.change"
] | 885,067 | 885,068 | u651235280 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
#define all(x) (x).begin(), (x).end()
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;
}
typedef long long ll;
const long long INF = 1LL << 60;
typedef pair<int, int> P;
int main() {
int N, K;
cin >> N >> K;
vector<int> A(N), cnts;
rep(i, N) {
char c;
cin >> c;
A[i] = c - '0';
}
int cnt = 1;
repd(i, 1, N) {
if (A[i] == A[i - 1])
cnt++;
else {
cnts.emplace_back(cnt);
cnt = 1;
}
}
cnts.emplace_back(cnt);
int ans = 0;
int r = 2 * K + A[0];
int len = (int)cnts.size();
rep(i, min(r, len)) { ans += cnts[i]; }
if (A[0] == 1 && len % 2 == 0)
cnts.emplace_back(0);
if (A[0] == 0 && len % 2)
cnts.emplace_back(0);
len = (int)cnts.size();
int res = ans;
for (int i = r; i < len; i += 2) {
res += cnts[i] + cnts[i + 1] - cnts[i - r] - cnts[i - r + 1];
if (A[0] == 0 && i - r == 0)
res += cnts[i - r + 1];
chmax(ans, res);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
#define all(x) (x).begin(), (x).end()
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;
}
typedef long long ll;
const long long INF = 1LL << 60;
typedef pair<int, int> P;
int main() {
int N, K;
cin >> N >> K;
vector<int> A(N), cnts;
rep(i, N) {
char c;
cin >> c;
A[i] = c - '0';
}
int cnt = 1;
repd(i, 1, N) {
if (A[i] == A[i - 1])
cnt++;
else {
cnts.emplace_back(cnt);
cnt = 1;
}
}
cnts.emplace_back(cnt);
int ans = 0;
int r = 2 * K + A[0];
int len = (int)cnts.size();
rep(i, min(r, len)) { ans += cnts[i]; }
if (A[0] == 1 && len % 2 == 0)
cnts.emplace_back(0);
if (A[0] == 0 && len % 2)
cnts.emplace_back(0);
len = (int)cnts.size();
int res = ans;
for (int i = r; i < len; i += 2) {
res += cnts[i] + cnts[i + 1] - cnts[i - r] - cnts[i - r + 1];
if (A[0] == 0 && i - r == 0) {
res += cnts[i - r + 1];
r++;
}
chmax(ans, res);
}
cout << ans << endl;
return 0;
} | [
"expression.unary.arithmetic.add"
] | 885,069 | 885,070 | u628332144 | cpp |
p03074 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
int ans = 0;
int right = 0;
int cn = 0;
if (s[0] == '0')
cn++;
for (int left = 0; left < n; ++left) {
while (cn <= k && right < k) {
if (right + 1 < n && s[right] == '1' && s[right + 1] == '0')
cn++;
++right;
}
/* break した状態で right は条件を満たす最大なので、何かする */
ans = max(ans, right - left);
if (left + 1 < n && s[left] == '0' && s[left + 1] == '1')
cn--;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
int ans = 0;
int right = 0;
int cn = 0;
if (s[0] == '0')
cn++;
for (int left = 0; left < n; ++left) {
while (cn <= k && right < n) {
if (right + 1 < n && s[right] == '1' && s[right + 1] == '0')
cn++;
++right;
}
/* break した状態で right は条件を満たす最大なので、何かする */
ans = max(ans, right - left);
if (left + 1 < n && s[left] == '0' && s[left + 1] == '1')
cn--;
}
cout << ans << endl;
} | [
"identifier.change",
"control_flow.loop.condition.change"
] | 885,073 | 885,074 | u233586402 | cpp |
p03074 |
// D - Handstand
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// const int INF = 2147483647;
// const ll INF = 9223372036854775807;
// const ll MOD = 1e9 + 7;
int main() {
int N, K;
string S;
cin >> N >> K;
cin >> S;
vector<int> T;
if (S[0] == '0') {
T.push_back(0);
}
int cnt = 1;
for (int i = 1; i < N; i++) {
if (S[i - 1] == S[i]) {
cnt++;
} else {
T.push_back(cnt);
cnt = 1;
}
}
T.push_back(cnt);
if (S[N - 1] == '0') {
T.push_back(0);
}
vector<int> U(T.size() + 1);
for (int i = 0; i < T.size(); i++) {
U[i + 1] = U[i] + T[i];
}
int ans = 0;
for (int l = 0; l < U.size(); l += 2) {
int r = min(l + (2 * K) + 1, (int)U.size());
ans = max(ans, U[r] - U[l]);
}
cout << ans << endl;
return 0;
} |
// D - Handstand
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// const int INF = 2147483647;
// const ll INF = 9223372036854775807;
// const ll MOD = 1e9 + 7;
int main() {
int N, K;
string S;
cin >> N >> K;
cin >> S;
vector<int> T;
if (S[0] == '0') {
T.push_back(0);
}
int cnt = 1;
for (int i = 1; i < N; i++) {
if (S[i - 1] == S[i]) {
cnt++;
} else {
T.push_back(cnt);
cnt = 1;
}
}
T.push_back(cnt);
if (S[N - 1] == '0') {
T.push_back(0);
}
vector<int> U(T.size() + 1);
for (int i = 0; i < T.size(); i++) {
U[i + 1] = U[i] + T[i];
}
int ans = 0;
for (int l = 0; l < U.size(); l += 2) {
int r = min(l + (2 * K) + 1, (int)U.size() - 1);
ans = max(ans, U[r] - U[l]);
}
cout << ans << endl;
return 0;
} | [
"assignment.change"
] | 885,080 | 885,081 | u790272146 | cpp |
p03074 | // C++ 14
#include <bits/stdc++.h>
using namespace std;
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "[";
for (int i = 0; i < v.size(); ++i) {
os << v[i];
if (i != v.size() - 1)
os << ", ";
}
os << "]" << endl;
return os;
}
#define ll long long
#define loop(__x, __start, __end) for (ll __x = __start; __x < __end; __x++)
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> A;
if (s[0] == '0')
A.push_back(0);
char prev = ' ';
for (auto &&c : s) {
if (prev != c) {
A.push_back(0);
prev = c;
}
A[A.size() - 1]++;
}
if (s[n - 1] == '0')
A.push_back(0);
int m = A.size();
vector<int> acc(m + 1, 0);
loop(i, 0, m) acc[i + 1] = acc[i] + A[i];
int len = 2 * k + 1;
int max_ = 1;
for (int l = 0; l + len <= m; l++) {
if (l % 2 == 1)
continue;
max_ = max(max_, acc[l + len] - acc[l]);
}
cout << max_ << endl;
return 0;
}
| // C++ 14
#include <bits/stdc++.h>
using namespace std;
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "[";
for (int i = 0; i < v.size(); ++i) {
os << v[i];
if (i != v.size() - 1)
os << ", ";
}
os << "]" << endl;
return os;
}
#define ll long long
#define loop(__x, __start, __end) for (ll __x = __start; __x < __end; __x++)
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> A;
if (s[0] == '0')
A.push_back(0);
char prev = ' ';
for (auto &&c : s) {
if (prev != c) {
A.push_back(0);
prev = c;
}
A[A.size() - 1]++;
}
if (s[n - 1] == '0')
A.push_back(0);
int m = A.size();
vector<int> acc(m + 1, 0);
loop(i, 0, m) acc[i + 1] = acc[i] + A[i];
int len = min(2 * k + 1, m);
int max_ = 1;
for (int l = 0; l + len <= m; l++) {
if (l % 2 == 1)
continue;
max_ = max(max_, acc[l + len] - acc[l]);
}
cout << max_ << endl;
return 0;
}
| [
"call.add",
"call.arguments.add"
] | 885,082 | 885,083 | u823862638 | cpp |
p03074 | #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <float.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
#define int long long
#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807LL
#define I64_MAX2 1223372036854775807LL
#define INF I64_MAX2
#define MOD 1000000007
// #define MOD 998244353
#define MEM_SIZE 10000
#define DEBUG_OUT true
#define ALL(x) (x).begin(), (x).end()
template <typename T> void DEBUG(T e) {
if (DEBUG_OUT == false)
return;
std::cout << e << " ";
}
template <typename T> void DEBUG(const std::vector<T> &v) {
if (DEBUG_OUT == false)
return;
for (const auto &e : v) {
std::cout << e << " ";
}
std::cout << std::endl;
}
template <typename T> void DEBUG(const std::vector<std::vector<T>> &vv) {
if (DEBUG_OUT == false)
return;
for (const auto &v : vv) {
DEBUG(v);
}
}
template <class T, class... Ts> void DEBUG(T d, Ts... e) {
if (DEBUG_OUT == false)
return;
DEBUG(d);
DEBUG(e...);
}
template <class T> void corner(bool flg, T hoge) {
if (flg) {
cout << hoge << endl;
abort();
}
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
return a > b && (a = b, true);
}
void solve(void) {
int N, K;
cin >> N;
cin >> K;
vector<pair<int, int>> vp;
vp.emplace_back(-1, 0);
for (int i = 0; i < N; i++) {
char X;
cin >> X;
int x = X - '0';
if (vp.empty() || vp.back().first != x) {
vp.push_back(make_pair(x, 1));
} else {
vp.back().second++;
}
}
for (int i = 0; i < N - 1; i++) {
vp[i + 1].second += vp[i].second;
}
// for (int i = 0; i < vp.size(); i++)
// {
// cout<<vp[i].first<<" "<<vp[i].second<<endl;
// }
int ANS = 0;
for (int i = 1; i <= (int)vp.size() - 1; i++) {
int l = i;
int r;
if (vp[i].first == 1) {
r = l + 2 * K;
} else {
r = l + 2 * (K)-1;
}
l--;
if (r >= vp.size())
r = (int)vp.size() - 1;
if (l >= vp.size())
l = (int)vp.size() - 1;
chmax(ANS, vp[r].second - vp[l].second);
}
cout << ANS << endl;
return;
}
int32_t main(int32_t argc, const char *argv[]) {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
std::cout << std::fixed;
std::cout << std::setprecision(11);
solve();
return 0;
}
| #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <float.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
#define int long long
#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807LL
#define I64_MAX2 1223372036854775807LL
#define INF I64_MAX2
#define MOD 1000000007
// #define MOD 998244353
#define MEM_SIZE 10000
#define DEBUG_OUT true
#define ALL(x) (x).begin(), (x).end()
template <typename T> void DEBUG(T e) {
if (DEBUG_OUT == false)
return;
std::cout << e << " ";
}
template <typename T> void DEBUG(const std::vector<T> &v) {
if (DEBUG_OUT == false)
return;
for (const auto &e : v) {
std::cout << e << " ";
}
std::cout << std::endl;
}
template <typename T> void DEBUG(const std::vector<std::vector<T>> &vv) {
if (DEBUG_OUT == false)
return;
for (const auto &v : vv) {
DEBUG(v);
}
}
template <class T, class... Ts> void DEBUG(T d, Ts... e) {
if (DEBUG_OUT == false)
return;
DEBUG(d);
DEBUG(e...);
}
template <class T> void corner(bool flg, T hoge) {
if (flg) {
cout << hoge << endl;
abort();
}
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
return a > b && (a = b, true);
}
void solve(void) {
int N, K;
cin >> N;
cin >> K;
vector<pair<int, int>> vp;
vp.emplace_back(-1, 0);
for (int i = 0; i < N; i++) {
char X;
cin >> X;
int x = X - '0';
if (vp.empty() || vp.back().first != x) {
vp.push_back(make_pair(x, 1));
} else {
vp.back().second++;
}
}
for (int i = 0; i < vp.size(); i++) {
vp[i + 1].second += vp[i].second;
}
// for (int i = 0; i < vp.size(); i++)
// {
// cout<<vp[i].first<<" "<<vp[i].second<<endl;
// }
int ANS = 0;
for (int i = 1; i <= (int)vp.size() - 1; i++) {
int l = i;
int r;
if (vp[i].first == 1) {
r = l + 2 * K;
} else {
r = l + 2 * (K)-1;
}
l--;
if (r >= vp.size())
r = (int)vp.size() - 1;
if (l >= vp.size())
l = (int)vp.size() - 1;
chmax(ANS, vp[r].second - vp[l].second);
}
cout << ANS << endl;
return;
}
int32_t main(int32_t argc, const char *argv[]) {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
std::cout << std::fixed;
std::cout << std::setprecision(11);
solve();
return 0;
}
| [
"control_flow.loop.for.condition.change",
"call.add"
] | 885,099 | 885,100 | u221285045 | 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++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int main() {
int N, K;
cin >> N >> K;
string s;
cin >> s;
vector<int> S;
char current = s[0];
if (current == '0') {
S.push_back(0);
}
int num = 0;
REP(i, N) {
if (current == s[i]) {
num++;
} else {
S.push_back(num);
num = 1;
current = s[i];
}
}
S.push_back(num);
if (S.size() % 2 == 0) {
S.push_back(0);
}
if (S.size() <= 2 * K + 1) {
cout << N << endl;
} else {
int ans = 0;
for (int i = 0; i < S.size(); i += 2) {
int cur = 0;
FOR(j, i, i + 2 * K + 1) { cur += S[j]; }
ans = max(ans, cur);
}
cout << ans << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int main() {
int N, K;
cin >> N >> K;
string s;
cin >> s;
vector<int> S;
char current = s[0];
if (current == '0') {
S.push_back(0);
}
int num = 0;
REP(i, N) {
if (current == s[i]) {
num++;
} else {
S.push_back(num);
num = 1;
current = s[i];
}
}
S.push_back(num);
if (S.size() % 2 == 0) {
S.push_back(0);
}
if (S.size() <= 2 * K + 1) {
cout << N << endl;
} else {
int ans = 0;
for (int i = 0; i < S.size() - 2 * K; i += 2) {
int cur = 0;
FOR(j, i, i + 2 * K + 1) { cur += S[j]; }
ans = max(ans, cur);
}
cout << ans << endl;
}
return 0;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 885,103 | 885,104 | u116774833 | cpp |
p03074 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> c;
int now = 1; //今見ている数
int cnt = 0; // nowがいくつ並んでいるか
rep(i, n) {
if (s[i] == (char)(now + '0'))
cnt++;
else {
c.push_back(cnt);
now = 1 - now; // 0と1を切り替えるときの計算
cnt = 1; //新しいのをカウントし始める
}
}
c.push_back(cnt);
// 1で始まって2で終わるようにしたいので終端が0だったら適当に1つ足す
if (c.size() % 2 == 0)
c.push_back(0);
int m = c.size();
vector<int> S(m + 1); // sが累積和のベクトル
rep(i, m) S[i + 1] = S[i] + S[i];
int ans = 0;
// 1-0-1...の1から始めるので偶数番目だけを見る
for (int i = 0; i < m; i += 2) {
int left = i;
int right = min(i + 2 * k + 1, m);
chmax(ans, S[right] - S[left]);
}
cout << ans << endl;
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> c;
int now = 1; //今見ている数
int cnt = 0; // nowがいくつ並んでいるか
rep(i, n) {
if (s[i] == (char)(now + '0'))
cnt++;
else {
c.push_back(cnt);
now = 1 - now; // 0と1を切り替えるときの計算
cnt = 1; //新しいのをカウントし始める
}
}
c.push_back(cnt);
// 1で始まって2で終わるようにしたいので終端が0だったら適当に1つ足す
if (c.size() % 2 == 0)
c.push_back(0);
int m = c.size();
vector<int> S(m + 1); // sが累積和のベクトル
rep(i, m) S[i + 1] = S[i] + c[i];
int ans = 0;
// 1-0-1...の1から始めるので偶数番目だけを見る
for (int i = 0; i < m; i += 2) {
int left = i;
int right = min(i + 2 * k + 1, m);
chmax(ans, S[right] - S[left]);
}
cout << ans << endl;
} | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 885,112 | 885,113 | u412057008 | cpp |
p03074 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> c;
int now = 1; //今見ている数
int cnt = 0; // nowがいくつ並んでいるか
rep(i, n) {
if (s[i] == (char)(now + '0'))
cnt++;
else {
c.push_back(cnt);
now = 1 - now; // 0と1を切り替えるときの計算
cnt = 1; //新しいのをカウントし始める
}
}
c.push_back(cnt);
// 1で始まって2で終わるようにしたいので終端が0だったら適当に1つ足す
if (c.size() % 2 == 0)
c.push_back(0);
int m = c.size();
vector<int> S(m + 1); // sが累積和のベクトル
rep(i, m) S[i + 1] = S[i] + S[i];
int ans = 0;
// 1-0-1...の1から始めるので偶数番目だけを見る
for (int i = 0; i < m; i += 2) {
int left = 1;
int right = min(i + 2 * k + 1, m);
chmax(ans, S[right] - S[left]);
}
cout << ans << endl;
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> c;
int now = 1; //今見ている数
int cnt = 0; // nowがいくつ並んでいるか
rep(i, n) {
if (s[i] == (char)(now + '0'))
cnt++;
else {
c.push_back(cnt);
now = 1 - now; // 0と1を切り替えるときの計算
cnt = 1; //新しいのをカウントし始める
}
}
c.push_back(cnt);
// 1で始まって2で終わるようにしたいので終端が0だったら適当に1つ足す
if (c.size() % 2 == 0)
c.push_back(0);
int m = c.size();
vector<int> S(m + 1); // sが累積和のベクトル
rep(i, m) S[i + 1] = S[i] + c[i];
int ans = 0;
// 1-0-1...の1から始めるので偶数番目だけを見る
for (int i = 0; i < m; i += 2) {
int left = i;
int right = min(i + 2 * k + 1, m);
chmax(ans, S[right] - S[left]);
}
cout << ans << endl;
} | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change",
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 885,114 | 885,113 | u412057008 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define vi vector<int>
#define vvi vector<vi>
#define read(a) \
for (int i = 0; i < n; i++) \
cin >> a[i];
#define print(a) \
for (int i = 0; i < n; i++) \
cout << a[i] << " ";
#define pb push_back
#define pql priority_queue<int>
#define pqs priority_queue<int, vi, greater<int>>
#define pqlv priority_queue<vi>
#define pqsv priority_queue<vi, vvi, greater<vi>>
#define endl '\n'
#define N 10000002
#define MOD 1000000007
signed main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
int i = 0, j = 0;
int ans = 0;
while (j < n) {
if (s[j] == '0') {
while (j < n && s[j] == '0')
j++;
k--;
} else {
while (j < n && s[j] == '1')
j++;
}
if (k < 0) {
if (s[i] == '0') {
while (i < n && s[i] == '0')
i++;
k++;
} else {
while (i < n && s[i] == '1')
i++;
}
}
ans = max(ans, j - i);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define vi vector<int>
#define vvi vector<vi>
#define read(a) \
for (int i = 0; i < n; i++) \
cin >> a[i];
#define print(a) \
for (int i = 0; i < n; i++) \
cout << a[i] << " ";
#define pb push_back
#define pql priority_queue<int>
#define pqs priority_queue<int, vi, greater<int>>
#define pqlv priority_queue<vi>
#define pqsv priority_queue<vi, vvi, greater<vi>>
#define endl '\n'
#define N 10000002
#define MOD 1000000007
signed main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
int i = 0, j = 0;
int ans = 0;
while (j < n) {
if (s[j] == '0') {
while (j < n && s[j] == '0')
j++;
k--;
} else {
while (j < n && s[j] == '1')
j++;
}
while (k < 0) {
if (s[i] == '0') {
while (i < n && s[i] == '0')
i++;
k++;
} else {
while (i < n && s[i] == '1')
i++;
}
}
ans = max(ans, j - i);
}
cout << ans << endl;
} | [
"control_flow.branch.while.replace.add",
"control_flow.loop.if.replace.remove"
] | 885,117 | 885,118 | u246401216 | cpp |
p03074 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
using P = pair<int, int>;
string runlength(string s) {
int cnt = 0;
char now = s.at(0);
string vec = "";
REP(i, s.size()) {
if (s.at(i) == now) {
cnt++;
} else {
vec.push_back(now);
vec.push_back(cnt + '0');
cnt = 1;
now = s.at(i);
}
}
vec.push_back(now);
vec.push_back(cnt + '0');
return vec;
}
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> vec;
int cnt = 0;
int now = 1;
REP(i, S.size()) {
if (now == S.at(i) - '0') {
cnt++;
} else {
vec.push_back(cnt);
cnt = 1;
now = 1 - now;
}
}
vec.push_back(cnt);
if (S.at(N - 1) == 0) {
vec.push_back(0);
}
vector<int> vec2;
vec2.push_back(0);
int sum = 0;
REP(i, vec.size()) {
sum += vec.at(i);
vec2.push_back(sum);
}
int MAX = 0;
if (K >= (vec.size() - 1) / 2) {
cout << N << endl;
} else {
REP(i, vec2.size()) {
if (i % 2 == 1 && i + K * 2 <= vec2.size() - 1) {
MAX = max(MAX, vec2.at(i + K * 2) - vec2.at(i - 1));
}
}
cout << MAX << endl;
}
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
using P = pair<int, int>;
string runlength(string s) {
int cnt = 0;
char now = s.at(0);
string vec = "";
REP(i, s.size()) {
if (s.at(i) == now) {
cnt++;
} else {
vec.push_back(now);
vec.push_back(cnt + '0');
cnt = 1;
now = s.at(i);
}
}
vec.push_back(now);
vec.push_back(cnt + '0');
return vec;
}
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> vec;
int cnt = 0;
int now = 1;
REP(i, S.size()) {
if (now == S.at(i) - '0') {
cnt++;
} else {
vec.push_back(cnt);
cnt = 1;
now = 1 - now;
}
}
vec.push_back(cnt);
if (S.at(N - 1) == '0') {
vec.push_back(0);
}
vector<int> vec2;
vec2.push_back(0);
int sum = 0;
REP(i, vec.size()) {
sum += vec.at(i);
vec2.push_back(sum);
}
int MAX = 0;
if (K >= (vec.size() - 1) / 2) {
cout << N << endl;
} else {
REP(i, vec2.size()) {
if (i % 2 == 1 && i + K * 2 <= vec2.size() - 1) {
MAX = max(MAX, vec2.at(i + K * 2) - vec2.at(i - 1));
}
}
cout << MAX << endl;
}
} | [
"control_flow.branch.if.condition.change"
] | 885,119 | 885,120 | u135626132 | cpp |
p03074 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
using P = pair<int, int>;
string runlength(string s) {
int cnt = 0;
char now = s.at(0);
string vec = "";
REP(i, s.size()) {
if (s.at(i) == now) {
cnt++;
} else {
vec.push_back(now);
vec.push_back(cnt + '0');
cnt = 1;
now = s.at(i);
}
}
vec.push_back(now);
vec.push_back(cnt + '0');
return vec;
}
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> vec;
int cnt = 0;
int now = 1;
REP(i, S.size()) {
if (now == S.at(i) - '0') {
cnt++;
} else {
vec.push_back(cnt);
cnt = 1;
now = 1 - now;
}
}
vec.push_back(cnt);
if (S.at(N - 1) == 0) {
vec.push_back(0);
}
vector<int> vec2;
vec2.push_back(0);
int sum = 0;
REP(i, vec.size()) {
sum += vec.at(i);
vec2.push_back(sum);
}
int MAX = 0;
if (K > (vec.size() - 1) / 2) {
cout << N << endl;
} else {
REP(i, vec2.size()) {
if (i % 2 == 1 && i + K * 2 <= vec2.size() - 1) {
MAX = max(MAX, vec2.at(i + K * 2) - vec2.at(i - 1));
}
}
cout << MAX << endl;
}
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
using P = pair<int, int>;
string runlength(string s) {
int cnt = 0;
char now = s.at(0);
string vec = "";
REP(i, s.size()) {
if (s.at(i) == now) {
cnt++;
} else {
vec.push_back(now);
vec.push_back(cnt + '0');
cnt = 1;
now = s.at(i);
}
}
vec.push_back(now);
vec.push_back(cnt + '0');
return vec;
}
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> vec;
int cnt = 0;
int now = 1;
REP(i, S.size()) {
if (now == S.at(i) - '0') {
cnt++;
} else {
vec.push_back(cnt);
cnt = 1;
now = 1 - now;
}
}
vec.push_back(cnt);
if (S.at(N - 1) == '0') {
vec.push_back(0);
}
vector<int> vec2;
vec2.push_back(0);
int sum = 0;
REP(i, vec.size()) {
sum += vec.at(i);
vec2.push_back(sum);
}
int MAX = 0;
if (K >= (vec.size() - 1) / 2) {
cout << N << endl;
} else {
REP(i, vec2.size()) {
if (i % 2 == 1 && i + K * 2 <= vec2.size() - 1) {
MAX = max(MAX, vec2.at(i + K * 2) - vec2.at(i - 1));
}
}
cout << MAX << endl;
}
} | [
"control_flow.branch.if.condition.change",
"expression.operator.compare.change"
] | 885,122 | 885,120 | u135626132 | cpp |
p03074 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long N, K;
cin >> N >> K;
string S;
cin >> S;
vector<long long> raw;
raw.push_back(0);
for (int i = 1; i < N; i++) {
if (S[i] != S[i - 1])
raw.push_back(i);
}
raw.push_back(N);
long long siz = raw.size() - 1;
long long ans = 0;
for (int i = 0; i < raw.size(); i++) {
if (S[i] == '0')
ans = max(ans, raw[min(i + 2 * K, siz)] - raw[i]);
else
ans = max(ans, raw[min(i + 2 * K + 1, siz)] - raw[i]);
}
cout << ans << endl;
} | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long N, K;
cin >> N >> K;
string S;
cin >> S;
vector<long long> raw;
raw.push_back(0);
for (int i = 1; i < N; i++) {
if (S[i] != S[i - 1])
raw.push_back(i);
}
raw.push_back(N);
long long siz = raw.size() - 1;
long long ans = 0;
for (int i = 0; i < raw.size(); i++) {
if (S[raw[i]] == '0')
ans = max(ans, raw[min(i + 2 * K, siz)] - raw[i]);
else
ans = max(ans, raw[min(i + 2 * K + 1, siz)] - raw[i]);
}
cout << ans << endl;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 885,123 | 885,124 | u503221936 | cpp |
p03074 | #include <iostream>
using namespace std;
int main() {
// D
int n, k;
string s;
cin >> n >> k;
cin >> s;
int seq[100001];
int i;
for (i = 0; i < 100001; i++) {
seq[i] = 0;
}
int seqnum = 0;
if (s[0] == '0') {
seq[0] = 0;
seqnum++;
}
i = 0;
int counter = 0;
int maxcounter;
char seqnow = s[0];
while (i < s.length()) {
if (s[i] == seqnow) {
seq[seqnum]++;
} else {
seqnum++;
seqnow = s[i];
seq[seqnum]++;
// seqnum++;
}
i++;
}
// for (i = 0; i <= seqnum; i++) {
// cout << seq[i] << endl;
//}
seq[seqnum + 1] = 0;
if (k >= (seqnum + (seqnum % 2)) / 2) {
cout << s.length() << endl;
return 0;
} else {
for (i = 0; i <= 2 * k; i++) {
counter = counter + seq[i];
// cout << counter << endl;
}
maxcounter = counter;
for (i = 0; i < (seqnum - (seqnum % 2)) / 2 - k; i++) {
counter = counter - seq[i * 2] - seq[i * 2 + 1];
counter = counter + seq[i * 2 + 2 * k + 1] + seq[i * 2 + 2 * k + 2];
// cout << counter << endl;
if (maxcounter < counter)
maxcounter = counter;
}
cout << maxcounter << endl;
return 0;
}
// C
/*string s;
int i;
int counter1 = 0, counter2 = 0;
cin >> s;
for (i = 0; i < s.size(); i++) {
if (i % 2 == 0) {
if (s[i] == '1') {
counter1++;
//cout << 'a';
}
else {
counter2++;
//cout << 'i';
}
}
else {
if (s[i] == '0') {
counter1++;
//cout << 'u';
}
else {
counter2++;
//cout << 'e';
}
}
}
if (counter1 < counter2) {
cout << counter1 << endl;
}
else {
cout << counter2 << endl;
}
return 0;
*/
// B
/*int n;
cin >> n;
int i;
int h[20];
for (i = 0; i < n; i++) {
cin >> h[i];
}
int maxh = 0;
int hcounter = 0;
maxh = h[0];
hcounter++;
for (i = 1; i < n; i++) {
if (h[i] >= maxh) {
maxh = h[i];
hcounter++;
}
}
cout << hcounter << endl;
return 0;*/
// A
/*
int a,b;
cin >> a >> b;
int x = 0;
for (int i = 0; i < 2; i++) {
if (a > b) {
x = x + a;
a--;
}
else {
x = x + b;
b--;
}
}
cout << x << endl;
return 0;
*/
} | #include <iostream>
using namespace std;
int main() {
// D
int n, k;
string s;
cin >> n >> k;
cin >> s;
int seq[100001];
int i;
for (i = 0; i < 100001; i++) {
seq[i] = 0;
}
int seqnum = 0;
if (s[0] == '0') {
seq[0] = 0;
seqnum++;
}
i = 0;
int counter = 0;
int maxcounter;
char seqnow = s[0];
while (i < s.length()) {
if (s[i] == seqnow) {
seq[seqnum]++;
} else {
seqnum++;
seqnow = s[i];
seq[seqnum]++;
// seqnum++;
}
i++;
}
// for (i = 0; i <= seqnum; i++) {
// cout << seq[i] << endl;
//}
seq[seqnum + 1] = 0;
if (k >= (seqnum + (seqnum % 2)) / 2) {
cout << s.length() << endl;
return 0;
} else {
for (i = 0; i <= 2 * k; i++) {
counter = counter + seq[i];
// cout << counter << endl;
}
maxcounter = counter;
for (i = 0; i < (seqnum + (seqnum % 2)) / 2 - k; i++) {
counter = counter - seq[i * 2] - seq[i * 2 + 1];
counter = counter + seq[i * 2 + 2 * k + 1] + seq[i * 2 + 2 * k + 2];
// cout << counter << endl;
if (maxcounter < counter)
maxcounter = counter;
}
cout << maxcounter << endl;
return 0;
}
// C
/*string s;
int i;
int counter1 = 0, counter2 = 0;
cin >> s;
for (i = 0; i < s.size(); i++) {
if (i % 2 == 0) {
if (s[i] == '1') {
counter1++;
//cout << 'a';
}
else {
counter2++;
//cout << 'i';
}
}
else {
if (s[i] == '0') {
counter1++;
//cout << 'u';
}
else {
counter2++;
//cout << 'e';
}
}
}
if (counter1 < counter2) {
cout << counter1 << endl;
}
else {
cout << counter2 << endl;
}
return 0;
*/
// B
/*int n;
cin >> n;
int i;
int h[20];
for (i = 0; i < n; i++) {
cin >> h[i];
}
int maxh = 0;
int hcounter = 0;
maxh = h[0];
hcounter++;
for (i = 1; i < n; i++) {
if (h[i] >= maxh) {
maxh = h[i];
hcounter++;
}
}
cout << hcounter << endl;
return 0;*/
// A
/*
int a,b;
cin >> a >> b;
int x = 0;
for (int i = 0; i < 2; i++) {
if (a > b) {
x = x + a;
a--;
}
else {
x = x + b;
b--;
}
}
cout << x << endl;
return 0;
*/
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 885,125 | 885,126 | u073015397 | cpp |
p03074 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<int> vi;
typedef vector<ll> vll;
const long long mod = 1000000007LL;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vi v;
int cnt0 = 0;
int cnt1 = 0;
rep(i, n) {
if (cnt1 > 0 && s[i] == '0') {
v.push_back(cnt1);
cnt1 = 0;
cnt0 = 1;
} else if (cnt0 > 0 && s[i] == '1') {
v.push_back(cnt0);
cnt0 = 0;
cnt1 = 1;
} else if (s[i] == '1')
cnt1++;
else
cnt0++;
}
if (cnt0 > 0)
v.push_back(cnt0);
else
v.push_back(cnt1);
if (s[0] == '1') {
int ans = 0;
int tmp = 0;
rep(i, 2 * k + 1) {
if (i >= v.size())
break;
tmp += v[i];
}
ans = tmp;
rep(i, v.size() - 2 * k - 1) {
if (i < 0 || 2 * k + 1 + i >= v.size())
break;
tmp -= v[i];
tmp -= v[i + 1];
tmp += v[2 * k + 1 + i];
if (2 * k + 2 + i < v.size())
tmp += v[2 * k + 2 + i];
ans = max(ans, tmp);
i++;
}
cout << ans << endl;
return 0;
} else {
int ans = 0;
int tmp = 0;
rep(i, 2 * k) {
if (i >= v.size())
break;
tmp += v[i];
}
ans = tmp;
rep(i, v.size() - 2 * k - 1) {
if (i == 0) {
tmp -= v[i];
if (2 * k + i < v.size())
tmp += v[2 * k + i];
if (2 * k + i + 1 < v.size())
tmp += v[2 * k + i + 1];
ans = max(ans, tmp);
continue;
}
if (i < 0 || 2 * k + 1 + i >= v.size())
break;
if (i == 0) {
tmp -= v[i];
tmp += v[2 * k + i];
tmp += v[2 * k + i + 1];
ans = max(ans, tmp);
continue;
}
tmp -= v[i];
tmp -= v[i + 1];
tmp += v[2 * k + 1 + i];
if (2 * k + 2 + i < v.size())
tmp += v[2 * k + 2 + i];
ans = max(ans, tmp);
i++;
}
cout << ans << endl;
return 0;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<int> vi;
typedef vector<ll> vll;
const long long mod = 1000000007LL;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vi v;
int cnt0 = 0;
int cnt1 = 0;
rep(i, n) {
if (cnt1 > 0 && s[i] == '0') {
v.push_back(cnt1);
cnt1 = 0;
cnt0 = 1;
} else if (cnt0 > 0 && s[i] == '1') {
v.push_back(cnt0);
cnt0 = 0;
cnt1 = 1;
} else if (s[i] == '1')
cnt1++;
else
cnt0++;
}
if (cnt0 > 0)
v.push_back(cnt0);
else
v.push_back(cnt1);
if (s[0] == '1') {
int ans = 0;
int tmp = 0;
rep(i, 2 * k + 1) {
if (i >= v.size())
break;
tmp += v[i];
}
ans = tmp;
rep(i, v.size() - 2 * k - 1) {
if (i < 0 || 2 * k + 1 + i >= v.size())
break;
tmp -= v[i];
tmp -= v[i + 1];
tmp += v[2 * k + 1 + i];
if (2 * k + 2 + i < v.size())
tmp += v[2 * k + 2 + i];
ans = max(ans, tmp);
i++;
}
cout << ans << endl;
return 0;
} else {
int ans = 0;
int tmp = 0;
rep(i, 2 * k) {
if (i >= v.size())
break;
tmp += v[i];
}
ans = tmp;
rep(i, v.size() - 2 * k) {
if (i == 0) {
tmp -= v[i];
if (2 * k + i < v.size())
tmp += v[2 * k + i];
if (2 * k + i + 1 < v.size())
tmp += v[2 * k + i + 1];
ans = max(ans, tmp);
continue;
}
if (i < 0 || 2 * k + 1 + i >= v.size())
break;
if (i == 0) {
tmp -= v[i];
tmp += v[2 * k + i];
tmp += v[2 * k + i + 1];
ans = max(ans, tmp);
continue;
}
tmp -= v[i];
tmp -= v[i + 1];
tmp += v[2 * k + 1 + i];
if (2 * k + 2 + i < v.size())
tmp += v[2 * k + 2 + i];
ans = max(ans, tmp);
i++;
}
cout << ans << endl;
return 0;
}
} | [
"expression.operation.binary.remove"
] | 885,127 | 885,128 | u615662061 | cpp |
p03074 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
typedef long long ll;
#define debug(x) cout << #x << '=' << x << endl;
#define debug_arr(a, n) \
for (ll i = 0; i < n; i++) \
cout << a[i] << ' '
#define inf 100000000000
#define loop(i, n) for (ll i = 0; i < n; i++)
#define graph vector<vector<ll>>
#define P pair<ll, ll>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
int revN = 0;
loop(i, n - 1) {
if (s[i] != s[i + 1])
revN++;
}
vector<int> a(revN + 2, 0);
int count;
if (s[0] == '1') {
count = 0;
a[0] = 1;
for (int i = 1; i < n; i++) {
if (s[i] != s[i - 1])
count++;
a[count]++;
}
} else {
a[0] = 0;
a[1] = 1;
count = 1;
for (int i = 1; i < n; i++) {
if (s[i] != s[i - 1])
count++;
a[count]++;
}
}
int result = 0;
int tmpSum = 0;
int l = 0, r = 2 * k;
if (r >= a.size()) {
cout << n << endl;
return 0;
}
for (int i = l; i <= r; i++) {
tmpSum += a[i];
}
result = tmpSum;
while (1) {
if (r + 2 >= a.size())
break;
tmpSum += a[r + 1] + a[r + 2];
tmpSum -= a[l] + a[l + 1];
result = max(result, tmpSum);
l += 2;
r += 2;
}
cout << result << endl;
} | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
typedef long long ll;
#define debug(x) cout << #x << '=' << x << endl;
#define debug_arr(a, n) \
for (ll i = 0; i < n; i++) \
cout << a[i] << ' '
#define inf 100000000000
#define loop(i, n) for (ll i = 0; i < n; i++)
#define graph vector<vector<ll>>
#define P pair<ll, ll>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
int revN = 0;
loop(i, n - 1) {
if (s[i] != s[i + 1])
revN++;
}
vector<int> a(revN + 3, 0);
int count;
if (s[0] == '1') {
count = 0;
a[0] = 1;
for (int i = 1; i < n; i++) {
if (s[i] != s[i - 1])
count++;
a[count]++;
}
} else {
a[0] = 0;
a[1] = 1;
count = 1;
for (int i = 1; i < n; i++) {
if (s[i] != s[i - 1])
count++;
a[count]++;
}
}
int result = 0;
int tmpSum = 0;
int l = 0, r = 2 * k;
if (r >= a.size()) {
cout << n << endl;
return 0;
}
for (int i = l; i <= r; i++) {
tmpSum += a[i];
}
result = tmpSum;
while (1) {
if (r + 2 >= a.size())
break;
tmpSum += a[r + 1] + a[r + 2];
tmpSum -= a[l] + a[l + 1];
result = max(result, tmpSum);
l += 2;
r += 2;
}
cout << result << endl;
} | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 885,129 | 885,130 | u071036035 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.