problem_id stringlengths 6 6 | language stringclasses 2 values | original_status stringclasses 3 values | original_src stringlengths 19 243k | changed_src stringlengths 19 243k | change stringclasses 3 values | i1 int64 0 8.44k | i2 int64 0 8.44k | j1 int64 0 8.44k | j2 int64 0 8.44k | error stringclasses 270 values | stderr stringlengths 0 226k |
|---|---|---|---|---|---|---|---|---|---|---|---|
p03071 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define fr(i, a, b) for (int i = (a), _b = (b); i <= _b; i++)
#define frr(i, a, b) for (int i = (a), _b = (b); i >= _b; i--)
#define rep(i, n) for (long long i = 0, _n = (n); i < _n; i++)
#define repr(i, n) for (long long i = (n)-1; i >= 0; i--)
#define foreach(it, ar) \
for (typeof(ar.begin()) it = ar.begin(); it != ar.end(); it++)
#define fill(ar, val) memset(ar, val, sizeof(ar))
#define fill0(ar) fill((ar), 0)
#define fillinf(ar, n) fr(i, 0, (n)) ar[i] = INF
#define debug(x) cout << #x << ": " << x << endl
#define arr1d(a, n) \
cout << #a << " : "; \
fr(_, 1, n) cout << a[_] << ' '; \
cout << endl;
#define arr1d0(a, n) \
cout << #a << " : "; \
rep(_, n) cout << a[_] << ' '; \
cout << endl;
#define arr2d(a, n, m) \
cout << #a << " :" << endl; \
fr(_, 1, n) { \
fr(__, 1, m) cout << a[_][__] << ' '; \
cout << endl; \
}
#define arr2d0(a, n, m) \
cout << #a << " :" << endl; \
rep(_, n) { \
rep(__, m) cout << a[_][__] << ' '; \
cout << endl; \
}
/*Author Ritick Goenka || ritick(codechef) ||ritick(codeforces) */
/*IIT Roorkee = <3 */
#define ull unsigned long long
#define ll long long
#define ld double
#define ui unsigned int
#define all(ar) ar.begin(), ar.end()
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define y0 yyyyyy0
auto clk = clock();
#define y1 yyyyyy1
#define BIT(n) (1 << (n))
#define SQR(x) ((x) * (x))
#define CUBE(x) ((x) * (x) * (x))
#define LSOne(S) (S) & (-S)
inline bool EQ(double a, double b) { return fabs(a - b) < 1e-9; }
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef vector<string> vs;
template <typename T> inline T gcd(T a, T b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
template <typename T> inline T lcm(T a, T b) { return (a * b) / gcd(a, b); }
template <typename T> string toStr(T x) {
stringstream st;
st << x;
string s;
st >> s;
return s;
}
template <class T> void splitStr(const string &s, vector<T> &out) {
istringstream in(s);
out.clear();
copy(istream_iterator<T>(in), istream_iterator<T>(), back_inserter(out));
}
inline int two(int n) { return 1 << n; }
inline int isOnBit(int n, int b) { return (n >> b) & 1; }
inline void onBit(int &n, int b) { n |= two(b); }
inline void offBit(int &n, int b) { n &= ~two(b); }
inline int lastBit(int n) { return n & (-n); }
inline int cntBit(int n) {
int res = 0;
while (n && ++res)
n -= n & (-n);
return res;
}
const int dx4[] = {-1, 0, 1, 0};
const int dy4[] = {0, 1, 0, -1};
const int dx8[] = {-1, 0, 1, 0, -1, -1, 1, 1};
const int dy8[] = {0, 1, 0, -1, -1, 1, -1, 1};
#define INP "test.inp"
#define OUT "test.out"
#define PI 3.1415926535897932385
#define INF 1000111222
#define EPS 1e-7
#define MAXN 100000
#define MOD 1000000007
#define dec decr
// END OF COMPETITVE PROGRAMMING TEMPLATE
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ll gcd(ll a, ll b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
ll modexp(ll x, ll y, ll p) {
ll res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ll x, y;
cin >> x >> y;
ll a = max(x, y);
if (a == x)
x--;
else
y--;
a = a + max(x, y);
cout << a << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define fr(i, a, b) for (int i = (a), _b = (b); i <= _b; i++)
#define frr(i, a, b) for (int i = (a), _b = (b); i >= _b; i--)
#define rep(i, n) for (long long i = 0, _n = (n); i < _n; i++)
#define repr(i, n) for (long long i = (n)-1; i >= 0; i--)
#define foreach(it, ar) \
for (typeof(ar.begin()) it = ar.begin(); it != ar.end(); it++)
#define fill(ar, val) memset(ar, val, sizeof(ar))
#define fill0(ar) fill((ar), 0)
#define fillinf(ar, n) fr(i, 0, (n)) ar[i] = INF
#define debug(x) cout << #x << ": " << x << endl
#define arr1d(a, n) \
cout << #a << " : "; \
fr(_, 1, n) cout << a[_] << ' '; \
cout << endl;
#define arr1d0(a, n) \
cout << #a << " : "; \
rep(_, n) cout << a[_] << ' '; \
cout << endl;
#define arr2d(a, n, m) \
cout << #a << " :" << endl; \
fr(_, 1, n) { \
fr(__, 1, m) cout << a[_][__] << ' '; \
cout << endl; \
}
#define arr2d0(a, n, m) \
cout << #a << " :" << endl; \
rep(_, n) { \
rep(__, m) cout << a[_][__] << ' '; \
cout << endl; \
}
/*Author Ritick Goenka || ritick(codechef) ||ritick(codeforces) */
/*IIT Roorkee = <3 */
#define ull unsigned long long
#define ll long long
#define ld double
#define ui unsigned int
#define all(ar) ar.begin(), ar.end()
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define y0 yyyyyy0
auto clk = clock();
#define y1 yyyyyy1
#define BIT(n) (1 << (n))
#define SQR(x) ((x) * (x))
#define CUBE(x) ((x) * (x) * (x))
#define LSOne(S) (S) & (-S)
inline bool EQ(double a, double b) { return fabs(a - b) < 1e-9; }
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef vector<string> vs;
template <typename T> inline T gcd(T a, T b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
template <typename T> inline T lcm(T a, T b) { return (a * b) / gcd(a, b); }
template <typename T> string toStr(T x) {
stringstream st;
st << x;
string s;
st >> s;
return s;
}
template <class T> void splitStr(const string &s, vector<T> &out) {
istringstream in(s);
out.clear();
copy(istream_iterator<T>(in), istream_iterator<T>(), back_inserter(out));
}
inline int two(int n) { return 1 << n; }
inline int isOnBit(int n, int b) { return (n >> b) & 1; }
inline void onBit(int &n, int b) { n |= two(b); }
inline void offBit(int &n, int b) { n &= ~two(b); }
inline int lastBit(int n) { return n & (-n); }
inline int cntBit(int n) {
int res = 0;
while (n && ++res)
n -= n & (-n);
return res;
}
const int dx4[] = {-1, 0, 1, 0};
const int dy4[] = {0, 1, 0, -1};
const int dx8[] = {-1, 0, 1, 0, -1, -1, 1, 1};
const int dy8[] = {0, 1, 0, -1, -1, 1, -1, 1};
#define INP "test.inp"
#define OUT "test.out"
#define PI 3.1415926535897932385
#define INF 1000111222
#define EPS 1e-7
#define MAXN 100000
#define MOD 1000000007
#define dec decr
// END OF COMPETITVE PROGRAMMING TEMPLATE
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ll gcd(ll a, ll b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
ll modexp(ll x, ll y, ll p) {
ll res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll x, y;
cin >> x >> y;
ll a = max(x, y);
if (a == x)
x--;
else
y--;
a = a + max(x, y);
cout << a << endl;
return 0;
} | replace | 129 | 133 | 129 | 130 | 0 | |
p03071 | C++ | Runtime Error | /*author: hyperion_1724
date:
*/
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("INPUT.txt", "r", stdin);
// freopen ("OUTPUT.txt" , "w" , stdout);
#endif
int A, B;
cin >> A >> B;
int ans = 0;
if (A > B) {
ans = ans + A;
A--;
} else {
ans = ans + B;
B--;
}
if (A > B) {
ans = ans + A;
A--;
} else {
ans = ans + B;
B--;
}
cout << ans << endl;
return 0;
} | /*author: hyperion_1724
date:
*/
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int A, B;
cin >> A >> B;
int ans = 0;
if (A > B) {
ans = ans + A;
A--;
} else {
ans = ans + B;
B--;
}
if (A > B) {
ans = ans + A;
A--;
} else {
ans = ans + B;
B--;
}
cout << ans << endl;
return 0;
} | delete | 9 | 13 | 9 | 9 | 0 | |
p03071 | C++ | Runtime Error | /*coderanant*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define f1(i, a, b) for (i = a; i < b; i++)
#define f2(i, a, b) for (i = a; i >= b; i--)
#define endl '\n'
#define pb push_back
#define gp " "
#define ff first
#define ss second
#define mp make_pair
const int mod = 1000000007;
int i, j;
ll temp;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
int a, b;
cin >> a >> b;
int ans = a + b;
if (2 * a - 1 > ans)
ans = 2 * a - 1;
if (2 * b - 1 > ans)
ans = 2 * b - 1;
cout << ans;
return 0;
} | /*coderanant*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define f1(i, a, b) for (i = a; i < b; i++)
#define f2(i, a, b) for (i = a; i >= b; i--)
#define endl '\n'
#define pb push_back
#define gp " "
#define ff first
#define ss second
#define mp make_pair
const int mod = 1000000007;
int i, j;
ll temp;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// #ifndef ONLINE_JUDGE
// freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
// #endif
int a, b;
cin >> a >> b;
int ans = a + b;
if (2 * a - 1 > ans)
ans = 2 * a - 1;
if (2 * b - 1 > ans)
ans = 2 * b - 1;
cout << ans;
return 0;
} | replace | 22 | 26 | 22 | 26 | 0 | |
p03071 | C++ | Runtime Error | // #include </Users/kmudda/Downloads/Karthik/stdc++.h>
#include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
#define ll long long int
#define ld long double
#define vl vector<ll>
#define vi vector<int>
#define vvl vector<vl>
#define vvi vector<vi>
#define pb push_back
#define mp make_pair
#define max_int_value 2147483647
#define max_long_value 9223372036854775807
#define min_long_value -9223372036854775806
#define ii pair<ll, ll>
#define F first
#define S second
#define fast_io \
ios_base::sync_with_stdio(0); \
cin.tie(0)
#define CLR(v, d) memset(v, d, sizeof(v))
template <typename T> T gcd(T a, T b) { return (b ? __gcd(a, b) : a); }
template <typename T> T lcm(T a, T b) { return (a * (b / gcd(a, b))); }
template <typename T> T mod(T a, T b) { return (a < b ? a : a % b); }
template <typename T> T mod_neg(T a, T b) { return ((a % b) + b) % b; }
ll mulmod(ll a, ll b, ll m) {
ll q = (ll)(((ld)a * (ld)b) / (ld)m);
ll r = a * b - q * m;
if (r > m)
r %= m;
if (r < 0)
r += m;
return r;
}
template <typename T> T expo(T e, T n) {
T x = 1, p = e;
while (n) {
if (n & 1)
x = x * p;
p = p * p;
n >>= 1;
}
return x;
}
template <typename T> T power(T e, T n, T m) {
T x = 1, p = e;
while (n) {
if (n & 1)
x = mod(x * p, m);
p = mod(p * p, m);
n >>= 1;
}
return x;
}
template <typename T> T extended_euclid(T a, T b, T &x, T &y) {
T xx = 0, yy = 1;
y = 0;
x = 1;
while (b) {
T q = a / b, t = b;
b = a % b;
a = t;
t = xx;
xx = x - q * xx;
x = t;
t = yy;
yy = y - q * yy;
y = t;
}
return a;
}
template <typename T> T mod_inverse(T a, T n) {
T x, y;
T d = extended_euclid(a, n, x, y);
return (d > 1 ? -1 : mod_neg(x, n));
}
using namespace std;
string IntToString(int a) {
ostringstream temp;
temp << a;
return temp.str();
}
int StringToInt(string str) {
int xx;
stringstream ss;
ss << str;
ss >> xx;
return xx;
}
ll powerwithmodulus(ll base, ll exponent, ll modulus) {
ll result = 1;
base %= modulus;
while (exponent > 0) {
if (exponent % 2 == 1)
result = (result * base) % modulus;
exponent = exponent >> 1;
base = (base * base) % modulus;
}
return result;
}
/* NCR using DP
for(int n = 0; n <= 1000; n++)
for(int r = 0; r <= n; r++)
if(r == 0 || n == r) ncr[n][r] = 1;
else ncr[n][r] = (ncr[n-1][r-1] + ncr[n-1][r]) % mod;
*/
ll largestPowerOf2(ll n) { return (ll)pow(2, floor(log(n) / log(2))); }
inline bool cmp1(pair<ll, ll> &p1, pair<ll, ll> &p2) {
if (p1.F == p2.F)
return p1.S < p2.S;
else
return p1.F < p2.F;
}
// lower case std::transform(str.begin(), str.end(), str.begin(), ::tolower);
// Ascii A-65 Z-90 a-97 z-122 0-48 9-57
int cal(int pow, int val, int MOD) {
if (pow <= 0)
return 1;
int v = cal(pow / 2, val, MOD);
if (pow % 2 == 0)
return (v * v) % MOD;
else
return (((v * val) % MOD) * v) % MOD;
}
ll t, n, m, sum = 0, coun = 0, m1, m2, m3, i, j, k, sum1, sum2, p, q, r, p1, q1;
bool flag2;
int main() {
fast_io;
freopen("inputf.in", "r", stdin);
freopen("outputf.in", "w", stdout);
cin >> n >> m;
if (abs(n - m) >= 2) {
cout << max(n, m) + (max(n, m) - 1) << endl;
} else {
cout << (n + m) << endl;
}
}
| // #include </Users/kmudda/Downloads/Karthik/stdc++.h>
#include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
#define ll long long int
#define ld long double
#define vl vector<ll>
#define vi vector<int>
#define vvl vector<vl>
#define vvi vector<vi>
#define pb push_back
#define mp make_pair
#define max_int_value 2147483647
#define max_long_value 9223372036854775807
#define min_long_value -9223372036854775806
#define ii pair<ll, ll>
#define F first
#define S second
#define fast_io \
ios_base::sync_with_stdio(0); \
cin.tie(0)
#define CLR(v, d) memset(v, d, sizeof(v))
template <typename T> T gcd(T a, T b) { return (b ? __gcd(a, b) : a); }
template <typename T> T lcm(T a, T b) { return (a * (b / gcd(a, b))); }
template <typename T> T mod(T a, T b) { return (a < b ? a : a % b); }
template <typename T> T mod_neg(T a, T b) { return ((a % b) + b) % b; }
ll mulmod(ll a, ll b, ll m) {
ll q = (ll)(((ld)a * (ld)b) / (ld)m);
ll r = a * b - q * m;
if (r > m)
r %= m;
if (r < 0)
r += m;
return r;
}
template <typename T> T expo(T e, T n) {
T x = 1, p = e;
while (n) {
if (n & 1)
x = x * p;
p = p * p;
n >>= 1;
}
return x;
}
template <typename T> T power(T e, T n, T m) {
T x = 1, p = e;
while (n) {
if (n & 1)
x = mod(x * p, m);
p = mod(p * p, m);
n >>= 1;
}
return x;
}
template <typename T> T extended_euclid(T a, T b, T &x, T &y) {
T xx = 0, yy = 1;
y = 0;
x = 1;
while (b) {
T q = a / b, t = b;
b = a % b;
a = t;
t = xx;
xx = x - q * xx;
x = t;
t = yy;
yy = y - q * yy;
y = t;
}
return a;
}
template <typename T> T mod_inverse(T a, T n) {
T x, y;
T d = extended_euclid(a, n, x, y);
return (d > 1 ? -1 : mod_neg(x, n));
}
using namespace std;
string IntToString(int a) {
ostringstream temp;
temp << a;
return temp.str();
}
int StringToInt(string str) {
int xx;
stringstream ss;
ss << str;
ss >> xx;
return xx;
}
ll powerwithmodulus(ll base, ll exponent, ll modulus) {
ll result = 1;
base %= modulus;
while (exponent > 0) {
if (exponent % 2 == 1)
result = (result * base) % modulus;
exponent = exponent >> 1;
base = (base * base) % modulus;
}
return result;
}
/* NCR using DP
for(int n = 0; n <= 1000; n++)
for(int r = 0; r <= n; r++)
if(r == 0 || n == r) ncr[n][r] = 1;
else ncr[n][r] = (ncr[n-1][r-1] + ncr[n-1][r]) % mod;
*/
ll largestPowerOf2(ll n) { return (ll)pow(2, floor(log(n) / log(2))); }
inline bool cmp1(pair<ll, ll> &p1, pair<ll, ll> &p2) {
if (p1.F == p2.F)
return p1.S < p2.S;
else
return p1.F < p2.F;
}
// lower case std::transform(str.begin(), str.end(), str.begin(), ::tolower);
// Ascii A-65 Z-90 a-97 z-122 0-48 9-57
int cal(int pow, int val, int MOD) {
if (pow <= 0)
return 1;
int v = cal(pow / 2, val, MOD);
if (pow % 2 == 0)
return (v * v) % MOD;
else
return (((v * val) % MOD) * v) % MOD;
}
ll t, n, m, sum = 0, coun = 0, m1, m2, m3, i, j, k, sum1, sum2, p, q, r, p1, q1;
bool flag2;
int main() {
fast_io;
// freopen("inputf.in", "r", stdin);
// freopen("outputf.in", "w", stdout);
cin >> n >> m;
if (abs(n - m) >= 2) {
cout << max(n, m) + (max(n, m) - 1) << endl;
} else {
cout << (n + m) << endl;
}
}
| replace | 148 | 150 | 148 | 150 | 0 | |
p03071 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
int b;
cin >> b;
if (a == b)
return cout << a + b, 0;
return (max(a, b) * 2) - 1;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
int b;
cin >> b;
if (a == b)
return cout << a + b, 0;
cout << (max(a, b) * 2) - 1;
} | replace | 10 | 11 | 10 | 11 | 9 | |
p03071 | C++ | Runtime Error | /****************************************************
* Template for coding contests *
* Author : Sanjeev Sharma *
* Email : thedevelopersanjeev@gmail.com *
*****************************************************/
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("no-stack-protector,fast-math")
#pragma GCC target("sse4")
#pragma comment(linker, "/stack:200000000")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define deb(x) cout << #x << " is " << x << "\n";
#define int long long
#define mod 1000000007
const double PI = 2 * acos(0.0);
const long long INF = 1e18L + 5;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int a, b;
cin >> a >> b;
cout << max({(2 * a) - 1, (2 * b) - 1, a + b});
return 0;
}
| /****************************************************
* Template for coding contests *
* Author : Sanjeev Sharma *
* Email : thedevelopersanjeev@gmail.com *
*****************************************************/
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("no-stack-protector,fast-math")
#pragma GCC target("sse4")
#pragma comment(linker, "/stack:200000000")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define deb(x) cout << #x << " is " << x << "\n";
#define int long long
#define mod 1000000007
const double PI = 2 * acos(0.0);
const long long INF = 1e18L + 5;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int a, b;
cin >> a >> b;
cout << max({(2 * a) - 1, (2 * b) - 1, a + b});
return 0;
}
| delete | 32 | 36 | 32 | 32 | 0 | |
p03071 | Python | Runtime Error | a, b = map(int, input().split())
if a >= b:
tmp1 = a
a -= 1
else:
tmp2 = b
b -= 1
if a >= b:
tmp2 = a
else:
tmp2 = b
print(tmp1 + tmp2)
| a, b = map(int, input().split())
if a >= b:
tmp1 = a
a -= 1
else:
tmp1 = b
b -= 1
if a >= b:
tmp2 = a
else:
tmp2 = b
print(tmp1 + tmp2)
| replace | 6 | 7 | 6 | 7 | 0 | |
p03071 | Python | Runtime Error | A = input()
B = input()
A = int(A)
B = int(B)
if A > B:
X = A
A = A - 1
else:
X = B
B = B - 1
if A > B:
X = X + A
else:
X = X + B
print(X)
| A, B = input().split(" ")
A = int(A)
B = int(B)
if A > B:
X = A
A = A - 1
else:
X = B
B = B - 1
if A > B:
X = X + A
else:
X = X + B
print(X)
| replace | 0 | 2 | 0 | 1 | EOFError: EOF when reading a line | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03071/Python/s679306910.py", line 2, in <module>
B = input()
EOFError: EOF when reading a line
|
p03071 | C++ | Time Limit Exceeded | #include <cstdio>
int main() {
int a, b;
int ans[21][21] = {
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 6, 7, 9, 11, 13, 15,
17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 0, 0, 0, 7, 8, 9,
11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 0, 0, 0,
9, 9, 10, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39,
0, 0, 0, 11, 11, 11, 12, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33,
35, 37, 39, 0, 0, 0, 13, 13, 13, 13, 14, 15, 17, 19, 21, 23, 25, 27,
29, 31, 33, 35, 37, 39, 0, 0, 0, 15, 15, 15, 15, 15, 16, 17, 19, 21,
23, 25, 27, 29, 31, 33, 35, 37, 39, 0, 0, 0, 17, 17, 17, 17, 17, 17,
18, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 0, 0, 0, 19, 19, 19,
19, 19, 19, 19, 20, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 0, 0, 0,
21, 21, 21, 21, 21, 21, 21, 21, 22, 23, 25, 27, 29, 31, 33, 35, 37, 39,
0, 0, 0, 23, 23, 23, 23, 23, 23, 23, 23, 23, 24, 25, 27, 29, 31, 33,
35, 37, 39, 0, 0, 0, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 26, 27,
29, 31, 33, 35, 37, 39, 0, 0, 0, 27, 27, 27, 27, 27, 27, 27, 27, 27,
27, 27, 28, 29, 31, 33, 35, 37, 39, 0, 0, 0, 29, 29, 29, 29, 29, 29,
29, 29, 29, 29, 29, 29, 30, 31, 33, 35, 37, 39, 0, 0, 0, 31, 31, 31,
31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 32, 33, 35, 37, 39, 0, 0, 0,
33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 34, 35, 37, 39,
0, 0, 0, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35,
36, 37, 39, 0, 0, 0, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37,
37, 37, 37, 37, 38, 39, 0, 0, 0, 39, 39, 39, 39, 39, 39, 39, 39, 39,
39, 39, 39, 39, 39, 39, 39, 39, 40};
/*int aa, ab, bb;
for (int i = 3; i < 21; ++i)
{
for (int j = 3; j < 21; ++j)
{
res = 0;
aa = i + i - 1;
ab = i + j;
bb = j + j - 1;
res = max(res, aa);
res = max(res, ab);
res = max(res, bb);
ans[i][j] = res;
}
}
for (int i = 0; i < 21; ++i)
{
for (int j = 0; j < 21; ++j)
{
cout << ans[i][j] << ",";
}
}*/
while (scanf("%d%d", &a, &b)) {
printf("%d\n", ans[a][b]);
}
return 0;
} | #include <cstdio>
int main() {
int a, b;
int ans[21][21] = {
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 6, 7, 9, 11, 13, 15,
17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 0, 0, 0, 7, 8, 9,
11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 0, 0, 0,
9, 9, 10, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39,
0, 0, 0, 11, 11, 11, 12, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33,
35, 37, 39, 0, 0, 0, 13, 13, 13, 13, 14, 15, 17, 19, 21, 23, 25, 27,
29, 31, 33, 35, 37, 39, 0, 0, 0, 15, 15, 15, 15, 15, 16, 17, 19, 21,
23, 25, 27, 29, 31, 33, 35, 37, 39, 0, 0, 0, 17, 17, 17, 17, 17, 17,
18, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 0, 0, 0, 19, 19, 19,
19, 19, 19, 19, 20, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 0, 0, 0,
21, 21, 21, 21, 21, 21, 21, 21, 22, 23, 25, 27, 29, 31, 33, 35, 37, 39,
0, 0, 0, 23, 23, 23, 23, 23, 23, 23, 23, 23, 24, 25, 27, 29, 31, 33,
35, 37, 39, 0, 0, 0, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 26, 27,
29, 31, 33, 35, 37, 39, 0, 0, 0, 27, 27, 27, 27, 27, 27, 27, 27, 27,
27, 27, 28, 29, 31, 33, 35, 37, 39, 0, 0, 0, 29, 29, 29, 29, 29, 29,
29, 29, 29, 29, 29, 29, 30, 31, 33, 35, 37, 39, 0, 0, 0, 31, 31, 31,
31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 32, 33, 35, 37, 39, 0, 0, 0,
33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 34, 35, 37, 39,
0, 0, 0, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35,
36, 37, 39, 0, 0, 0, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37,
37, 37, 37, 37, 38, 39, 0, 0, 0, 39, 39, 39, 39, 39, 39, 39, 39, 39,
39, 39, 39, 39, 39, 39, 39, 39, 40};
/*int aa, ab, bb;
for (int i = 3; i < 21; ++i)
{
for (int j = 3; j < 21; ++j)
{
res = 0;
aa = i + i - 1;
ab = i + j;
bb = j + j - 1;
res = max(res, aa);
res = max(res, ab);
res = max(res, bb);
ans[i][j] = res;
}
}
for (int i = 0; i < 21; ++i)
{
for (int j = 0; j < 21; ++j)
{
cout << ans[i][j] << ",";
}
}*/
while (scanf("%d%d", &a, &b) != EOF) {
printf("%d\n", ans[a][b]);
}
return 0;
} | replace | 52 | 53 | 52 | 53 | TLE | |
p03071 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f(i, x, n) for (int i = x; i < (int)(n); ++i)
#define speed \
ios::sync_with_stdio(0); \
cin.tie(0);
int const N = 2 * 1e5 + 2;
int a[N], cnt[101], ans;
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
#endif
speed int a, b;
cin >> a >> b;
if (a == b)
return cout << a + b, 0;
int mx = max(a, b);
cout << mx * 2 - 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f(i, x, n) for (int i = x; i < (int)(n); ++i)
#define speed \
ios::sync_with_stdio(0); \
cin.tie(0);
int const N = 2 * 1e5 + 2;
int a[N], cnt[101], ans;
int main() {
speed int a, b;
cin >> a >> b;
if (a == b)
return cout << a + b, 0;
int mx = max(a, b);
cout << mx * 2 - 1 << endl;
} | delete | 13 | 16 | 13 | 13 | 0 | |
p03072 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstring>
#include <chrono>
#include <complex>
#define endl "\n"
#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define mod 1000000007
#define inf 1000000000000000001;
#define all(c) c.begin(), c.end()
#define mp(x, y) make_pair(x, y)
#define mem(a, val) memset(a, val, sizeof(a))
#define eb emplace_back
#define f first
#define s second
using namespace std;
int main() {
#ifndef ONLINE_JUDGE
// for getting input from input.txt
freopen("inputf.txt", "r", stdin);
// for writing output to output.txt
freopen("outputf.txt", "w", stdout);
#endif
std::ios::sync_with_stdio(false);
// cin.ignore(); must be there when using getline(cin, s)
int n, m = 0, d, ans = 0;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> d;
m = max(d, m);
if (m == d)
ans++;
}
cout << ans;
} | #include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstring>
#include <chrono>
#include <complex>
#define endl "\n"
#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define mod 1000000007
#define inf 1000000000000000001;
#define all(c) c.begin(), c.end()
#define mp(x, y) make_pair(x, y)
#define mem(a, val) memset(a, val, sizeof(a))
#define eb emplace_back
#define f first
#define s second
using namespace std;
int main() {
std::ios::sync_with_stdio(false);
// cin.ignore(); must be there when using getline(cin, s)
int n, m = 0, d, ans = 0;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> d;
m = max(d, m);
if (m == d)
ans++;
}
cout << ans;
} | delete | 25 | 31 | 25 | 25 | 0 | |
p03072 | C++ | Runtime Error | /*
* J1K7_7
*
* You can use my contents on a Creative Commons - Attribution 4.0
* International - CC BY 4.0 License. XD
* - JASKAMAL KAINTH
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<long long> vll;
#define left(x) (x << 1)
#define right(x) (x << 1) + 1
#define mid(l, r) ((l + r) >> 1)
#define mp make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define debug(x) \
{ cerr << #x << " = " << x << "\n"; }
#define debug2(x, y) \
{ cerr << #x << " = " << x << ", " << #y << " = " << y << "\n"; }
#define debug3(x, y, z) \
{ \
cerr << #x << " = " << x << ", " << #y << " = " << y << ", " << #z \
<< " = " << z << "\n"; \
}
#define debug4(x, y, z, w) \
{ \
cerr << #x << " = " << x << ", " << #y << " = " << y << ", " << #z \
<< " = " << z << ", " << #w << " = " << w << "\n"; \
}
#define ss second
#define ff first
#define m0(x) memset(x, 0, sizeof(x))
inline int nextint() {
int x;
scanf("%d", &x);
return x;
}
inline ll nextll() {
ll x;
scanf("%lld", &x);
return x;
}
#define gc getchar
template <typename T> void scanint(T &x) {
T c = gc();
while (((c < 48) || (c > 57)) && (c != '-'))
c = gc();
bool neg = false;
if (c == '-')
neg = true;
x = 0;
for (; c < 48 || c > 57; c = gc())
;
for (; c > 47 && c < 58; c = gc())
x = (x * 10) + (c - 48);
if (neg)
x = -x;
}
// variadics
template <typename T> T min_(T a, T b) { return a > b ? b : a; }
template <typename T, typename... Ts> T min_(T first, Ts... last) {
return min_(first, min_(last...));
}
// lambda exp auto square = [](int inp) { return inp * inp; } ;
template <class T, class S>
std::ostream &operator<<(std::ostream &os, const std::pair<T, S> &t) {
os << "(" << t.first << ", " << t.second << ")";
return os;
}
template <typename T> ostream &operator<<(ostream &out, const vector<T> &v) {
out << "[";
size_t last = v.size() - 1;
for (size_t i = 0; i < v.size(); ++i) {
out << v[i];
if (i != last)
out << ", ";
}
out << "]";
return out;
}
ll pwr(ll base, ll p, ll mod) {
ll ans = 1;
while (p) {
if (p & 1)
ans = (ans * base) % mod;
base = (base * base) % mod;
p /= 2;
}
return ans;
}
ll gcd(ll a, ll b) { return b == 0 ? a : gcd(b, a % b); }
ll lcm(ll a, ll b) { return a * (b / gcd(a, b)); }
const long double PI = (long double)(3.1415926535897932384626433832795);
const ll mx_ll = numeric_limits<ll>::max();
const int mx_int = numeric_limits<int>::max();
const int mod = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
freopen("test.in", "rb", stdin);
int n;
cin >> n;
vector<int> a;
a.resize(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int fans = 1;
for (int i = 1; i < n; i++) {
bool ok = true;
for (int j = 0; j < i; j++) {
if (a[j] > a[i]) {
ok = false;
}
}
if (ok)
fans += 1;
}
cout << fans << "\n";
return 0;
}
| /*
* J1K7_7
*
* You can use my contents on a Creative Commons - Attribution 4.0
* International - CC BY 4.0 License. XD
* - JASKAMAL KAINTH
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<long long> vll;
#define left(x) (x << 1)
#define right(x) (x << 1) + 1
#define mid(l, r) ((l + r) >> 1)
#define mp make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define debug(x) \
{ cerr << #x << " = " << x << "\n"; }
#define debug2(x, y) \
{ cerr << #x << " = " << x << ", " << #y << " = " << y << "\n"; }
#define debug3(x, y, z) \
{ \
cerr << #x << " = " << x << ", " << #y << " = " << y << ", " << #z \
<< " = " << z << "\n"; \
}
#define debug4(x, y, z, w) \
{ \
cerr << #x << " = " << x << ", " << #y << " = " << y << ", " << #z \
<< " = " << z << ", " << #w << " = " << w << "\n"; \
}
#define ss second
#define ff first
#define m0(x) memset(x, 0, sizeof(x))
inline int nextint() {
int x;
scanf("%d", &x);
return x;
}
inline ll nextll() {
ll x;
scanf("%lld", &x);
return x;
}
#define gc getchar
template <typename T> void scanint(T &x) {
T c = gc();
while (((c < 48) || (c > 57)) && (c != '-'))
c = gc();
bool neg = false;
if (c == '-')
neg = true;
x = 0;
for (; c < 48 || c > 57; c = gc())
;
for (; c > 47 && c < 58; c = gc())
x = (x * 10) + (c - 48);
if (neg)
x = -x;
}
// variadics
template <typename T> T min_(T a, T b) { return a > b ? b : a; }
template <typename T, typename... Ts> T min_(T first, Ts... last) {
return min_(first, min_(last...));
}
// lambda exp auto square = [](int inp) { return inp * inp; } ;
template <class T, class S>
std::ostream &operator<<(std::ostream &os, const std::pair<T, S> &t) {
os << "(" << t.first << ", " << t.second << ")";
return os;
}
template <typename T> ostream &operator<<(ostream &out, const vector<T> &v) {
out << "[";
size_t last = v.size() - 1;
for (size_t i = 0; i < v.size(); ++i) {
out << v[i];
if (i != last)
out << ", ";
}
out << "]";
return out;
}
ll pwr(ll base, ll p, ll mod) {
ll ans = 1;
while (p) {
if (p & 1)
ans = (ans * base) % mod;
base = (base * base) % mod;
p /= 2;
}
return ans;
}
ll gcd(ll a, ll b) { return b == 0 ? a : gcd(b, a % b); }
ll lcm(ll a, ll b) { return a * (b / gcd(a, b)); }
const long double PI = (long double)(3.1415926535897932384626433832795);
const ll mx_ll = numeric_limits<ll>::max();
const int mx_int = numeric_limits<int>::max();
const int mod = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
// reopen("test.in", "rb", stdin);
int n;
cin >> n;
vector<int> a;
a.resize(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int fans = 1;
for (int i = 1; i < n; i++) {
bool ok = true;
for (int j = 0; j < i; j++) {
if (a[j] > a[i]) {
ok = false;
}
}
if (ok)
fans += 1;
}
cout << fans << "\n";
return 0;
}
| replace | 137 | 138 | 137 | 138 | TLE | |
p03072 | C++ | Runtime Error | // Gaurav Aggarwal
/*
useful stl
array<ll,size> ar; //size(),front(),back(),fill(),empty()
deque<ll> d //push_back(),push_front(),pop_front(),pop_back()
vector<ll> v(size,val);
//push_back(),*max_element(v.begin(),v.end()),accumulate(v.begin(),v.end(),0)
stack<ll> g; //push(),pop(),top(),size(),empty() LIFO
queue<ll> q; //push(),size(),front(),back(),empty() FIFO
priority_queue<ll> pq
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> ipair;
typedef pair<long, long> lpair;
typedef pair<double, double> pdd;
#define scan(x) \
do { \
while ((x = getchar_unlocked()) < '0') \
; \
for (x -= '0'; '0' <= (_ = getchar_unlocked()); \
x = (x << 3) + (x << 1) + _ - '0') \
; \
} while (0)
char _;
#define For(i, a, b) for (__typeof(a) i = a; i <= b; i++)
#define mod 1000000007
#define PI 3.141592653589793238462643383279502884
#define debug1(a) cout << a << "\n";
#define debug2(a, b) cout << a << " " << b << "\n";
#define debug3(a, b, c) cout << a << " " << b << " " << c << "\n";
#define debug_arr(a, n) \
{ \
for (__typeof(n) i = 0; i < n; ++i) { \
cout << a[i] << " "; \
} \
}
#define inp_arr(a, n) \
for (__typeof(n) i = 0; i < n; ++i) { \
cin >> a[i]; \
}
#define beg_arr(a, n) \
for (__typeof(n) i = 0; i < n; ++i) { \
a[i] = 0; \
}
ll power(ll x, ll y) {
ll res = 1;
while (y > 0) {
if (y & 1)
res = (res * x) % mod;
y = y >> 1;
x = (x * x) % mod;
}
return res % mod;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
int n;
cin >> n;
int a[n];
inp_arr(a, n);
int maxi = a[0];
int ans = 1;
for (int i = 1; i < n; ++i) {
int f = 0;
for (int j = 0; j < i; ++j) {
if (a[j] > a[i]) {
f = 1;
break;
}
}
if (!f)
++ans;
}
cout << ans;
return 0;
} | // Gaurav Aggarwal
/*
useful stl
array<ll,size> ar; //size(),front(),back(),fill(),empty()
deque<ll> d //push_back(),push_front(),pop_front(),pop_back()
vector<ll> v(size,val);
//push_back(),*max_element(v.begin(),v.end()),accumulate(v.begin(),v.end(),0)
stack<ll> g; //push(),pop(),top(),size(),empty() LIFO
queue<ll> q; //push(),size(),front(),back(),empty() FIFO
priority_queue<ll> pq
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> ipair;
typedef pair<long, long> lpair;
typedef pair<double, double> pdd;
#define scan(x) \
do { \
while ((x = getchar_unlocked()) < '0') \
; \
for (x -= '0'; '0' <= (_ = getchar_unlocked()); \
x = (x << 3) + (x << 1) + _ - '0') \
; \
} while (0)
char _;
#define For(i, a, b) for (__typeof(a) i = a; i <= b; i++)
#define mod 1000000007
#define PI 3.141592653589793238462643383279502884
#define debug1(a) cout << a << "\n";
#define debug2(a, b) cout << a << " " << b << "\n";
#define debug3(a, b, c) cout << a << " " << b << " " << c << "\n";
#define debug_arr(a, n) \
{ \
for (__typeof(n) i = 0; i < n; ++i) { \
cout << a[i] << " "; \
} \
}
#define inp_arr(a, n) \
for (__typeof(n) i = 0; i < n; ++i) { \
cin >> a[i]; \
}
#define beg_arr(a, n) \
for (__typeof(n) i = 0; i < n; ++i) { \
a[i] = 0; \
}
ll power(ll x, ll y) {
ll res = 1;
while (y > 0) {
if (y & 1)
res = (res * x) % mod;
y = y >> 1;
x = (x * x) % mod;
}
return res % mod;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
// #endif
int n;
cin >> n;
int a[n];
inp_arr(a, n);
int maxi = a[0];
int ans = 1;
for (int i = 1; i < n; ++i) {
int f = 0;
for (int j = 0; j < i; ++j) {
if (a[j] > a[i]) {
f = 1;
break;
}
}
if (!f)
++ans;
}
cout << ans;
return 0;
} | replace | 66 | 70 | 66 | 70 | -11 | |
p03072 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
vector<int> H(N);
for (int i = 0; i < N; i++) {
cin >> H[i];
}
int M = H[0];
int count = 0;
for (int i = 0; i < N; i++) {
if (H[i] >= M) {
count++;
}
M = max(M, H[i]);
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> H(N);
for (int i = 0; i < N; i++) {
cin >> H[i];
}
int M = H[0];
int count = 0;
for (int i = 0; i < N; i++) {
if (H[i] >= M) {
count++;
}
M = max(M, H[i]);
}
cout << count << endl;
} | insert | 5 | 5 | 5 | 6 | 0 | |
p03072 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
// const ll INF = 1LL<<60;
const long long INF = 1LL << 60; // 仮想的な無限大の値
int main() {
ll N;
cin >> N;
vector<ll> H(N);
rep(i, N) cin >> H[i];
vector<ll> S(N, 0);
rep(i, N) S[i + 1] = max(S[i], H[i]);
ll ans = 0;
rep(i, N) if (H[i] >= S[i + 1]) ans++;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
// const ll INF = 1LL<<60;
const long long INF = 1LL << 60; // 仮想的な無限大の値
int main() {
ll N;
cin >> N;
vector<ll> H(N);
rep(i, N) cin >> H[i];
vector<ll> S(N + 1, 0);
rep(i, N) S[i + 1] = max(S[i], H[i]);
ll ans = 0;
rep(i, N) if (H[i] >= S[i + 1]) ans++;
cout << ans << endl;
return 0;
} | replace | 14 | 15 | 14 | 15 | 0 | |
p03072 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
#define LL long long
#define PB push_back
#define MP make_pair
#define MOD 1e9 + 7
int main() {
int N;
int M = -1;
int ans = 0;
cin >> N;
int i = 0;
while (i < N) {
int H;
cin >> H;
if (H >= M)
ans++;
M = max(M, H);
}
cout << ans << endl;
} | #include "bits/stdc++.h"
using namespace std;
#define LL long long
#define PB push_back
#define MP make_pair
#define MOD 1e9 + 7
int main() {
int N;
int M = -1;
int ans = 0;
cin >> N;
int i = 0;
while (i < N) {
int H;
cin >> H;
if (H >= M)
ans++;
M = max(M, H);
i++;
}
cout << ans << endl;
} | insert | 19 | 19 | 19 | 20 | TLE | |
p03072 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> H;
for (int i = 0; i < N; i++) {
cin >> H.at(i);
}
int count = 0;
for (int i = 1; i < N; i++) {
bool flg = true;
for (int j = 0; j < i; j++) {
if (H.at(i) < H.at(j)) {
flg = false;
}
}
if (flg)
count++;
}
cout << count + 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> H(N);
for (int i = 0; i < N; i++) {
cin >> H.at(i);
}
int count = 0;
for (int i = 1; i < N; i++) {
bool flg = true;
for (int j = 0; j < i; j++) {
if (H.at(i) < H.at(j)) {
flg = false;
}
}
if (flg)
count++;
}
cout << count + 1 << endl;
} | replace | 7 | 8 | 7 | 8 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 0) >= this->size() (which is 0)
|
p03072 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> H(N);
for (int i = 0; i < N; i++)
cin >> H.at(i);
int count = 1;
int maxH = H.at(1);
for (int i = 1; i < N; i++) {
if (maxH <= H.at(i)) {
count++;
maxH = H.at(i);
}
}
cout << count << endl;
} | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> H(N);
for (int i = 0; i < N; i++)
cin >> H.at(i);
int count = 1;
int maxH = H.at(0);
for (int i = 1; i < N; i++) {
if (maxH <= H.at(i)) {
count++;
maxH = H.at(i);
}
}
cout << count << endl;
} | replace | 12 | 13 | 12 | 13 | 0 | |
p03072 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n, i, h[i];
cin >> n;
for (i = 0; i < n; i++) {
cin >> h[i];
}
int count = 0, max = h[0];
for (i = 1; i < n; i++) {
if (h[i] >= max) {
count++;
max = h[i];
}
}
cout << count + 1 << endl;
}
| #include <iostream>
using namespace std;
int main() {
int n, i, h[25];
cin >> n;
for (i = 0; i < n; i++) {
cin >> h[i];
}
int count = 0, max = h[0];
for (i = 1; i < n; i++) {
if (h[i] >= max) {
count++;
max = h[i];
}
}
cout << count + 1 << endl;
}
| replace | 5 | 6 | 5 | 6 | 0 | |
p03072 | C++ | Runtime Error | #include <cstdio>
using namespace std;
int main() {
int N;
scanf("%d", &N);
int m = 0;
int cnt = 0;
for (int i = 0; i < N; ++i) {
int H;
scanf("%d", &H);
if (i == 0) {
++cnt;
m = H;
continue;
}
if (H >= m) {
++cnt;
m = H;
}
}
printf("%d", cnt);
fflush(stdout);
return cnt;
}
| #include <cstdio>
using namespace std;
int main() {
int N;
scanf("%d", &N);
int m = 0;
int cnt = 0;
for (int i = 0; i < N; ++i) {
int H;
scanf("%d", &H);
if (i == 0) {
++cnt;
m = H;
continue;
}
if (H >= m) {
++cnt;
m = H;
}
}
printf("%d", cnt);
fflush(stdout);
return 0;
}
| replace | 24 | 25 | 24 | 25 | 3 | |
p03072 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
int MAX = A[0];
int cnt = 0;
for (int i = 0; i < N; i++) {
if (MAX < A[i])
MAX = A[i];
if (MAX <= A[i])
cnt++;
}
cout << cnt << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
int MAX = A[0];
int cnt = 0;
for (int i = 0; i < N; i++) {
if (MAX < A[i])
MAX = A[i];
if (MAX <= A[i])
cnt++;
}
cout << cnt << endl;
}
| insert | 4 | 4 | 4 | 5 | 0 | |
p03072 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> H(N);
vector<int> J;
for (int i = 0; i < N; i++) {
cin >> H[i];
}
if (N == 1) {
cout << 1 << endl;
} else {
int max_height = 0;
for (int i = 0; i < N; i++) {
max_height = max(H[i], max_height);
J[i] = max_height;
}
int cnt = 1;
for (int j = 1; j < N; j++) {
if (J[j - 1] <= H[j]) {
cnt++;
}
}
cout << cnt << endl;
}
return 0;
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> H(N, 0);
vector<int> J(N - 1, 0);
for (int i = 0; i < N; i++) {
cin >> H[i];
}
if (N == 1) {
cout << 1 << endl;
} else {
int max_height = 0;
for (int i = 0; i < N; i++) {
max_height = max(H[i], max_height);
J[i] = max_height;
}
int cnt = 1;
for (int j = 1; j < N; j++) {
if (J[j - 1] <= H[j]) {
cnt++;
}
}
cout << cnt << endl;
}
return 0;
}
| replace | 9 | 11 | 9 | 11 | -11 | |
p03072 | Python | Runtime Error | def solve(string):
n, *h = map(int, string.split())
count = 1
for i in range(1, n):
if max(h[:i]) <= h[i]:
count += 1
return str(count)
if __name__ == "__main__":
print(solve(input()))
| def solve(string):
n, *h = map(int, string.split())
count = 1
for i in range(1, n):
if max(h[:i]) <= h[i]:
count += 1
return str(count)
if __name__ == "__main__":
print(solve("\n".join([input(), input()])))
| replace | 10 | 11 | 10 | 11 | ValueError: max() arg is an empty sequence | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03072/Python/s857847161.py", line 11, in <module>
print(solve(input()))
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03072/Python/s857847161.py", line 5, in solve
if max(h[:i]) <= h[i]:
ValueError: max() arg is an empty sequence
|
p03072 | Python | Runtime Error | n = int(input())
h = [int(x) for x in input().split()]
c = 0
for i in range(n):
if h[i] >= max(h[:i]):
c += 1
print(c)
| n = int(input())
h = [int(x) for x in input().split()]
c = 1
for i in range(1, n):
if h[i] >= max(h[:i]):
c += 1
print(c)
| replace | 2 | 4 | 2 | 5 | ValueError: max() arg is an empty sequence | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03072/Python/s836485359.py", line 5, in <module>
if h[i] >= max(h[:i]):
ValueError: max() arg is an empty sequence
|
p03072 | Python | Runtime Error | n = int(input())
h = map(int, input().split())
total = 1
max_value = h[0]
for i in range(1, n):
if max_value <= h[i]:
total += 1
max_value = max(max_value, h[i])
print(total)
| n = int(input())
h = list(map(int, input().split()))
total = 1
max_value = h[0]
for i in range(1, n):
if max_value <= h[i]:
total += 1
max_value = max(max_value, h[i])
print(total)
| replace | 1 | 2 | 1 | 2 | TypeError: 'map' object is not subscriptable | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03072/Python/s924267077.py", line 4, in <module>
max_value = h[0]
TypeError: 'map' object is not subscriptable
|
p03072 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n;
vector<int> h(n);
cin >> n;
rep(i, n) { cin >> h[i]; }
int max = 0, cnt = 0;
rep(i, n) {
if (h[i] >= max) {
cnt++;
max = h[i];
}
}
cout << cnt << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n;
int h[20];
cin >> n;
rep(i, n) { cin >> h[i]; }
int max = 0, cnt = 0;
rep(i, n) {
if (h[i] >= max) {
cnt++;
max = h[i];
}
}
cout << cnt << endl;
}
| replace | 8 | 9 | 8 | 9 | 0 | |
p03072 | C++ | Runtime Error | #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)
#define sc1(a) scanf("%d", &a)
#define sc2(a, b) scanf("%d %d", &a, &b)
#define sc3(a, b, c) scanf("%d %d %d", &a, &b, &c)
int main() {
int n, m = 0, ans = 0;
int h[n];
sc1(n);
rep(i, n) sc1(h[i]);
rep(i, n) {
if (h[i] >= m) {
m = h[i];
ans++;
}
}
printf("%d\n", ans);
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)
#define sc1(a) scanf("%d", &a)
#define sc2(a, b) scanf("%d %d", &a, &b)
#define sc3(a, b, c) scanf("%d %d %d", &a, &b, &c)
int main() {
int n, m = 0, ans = 0;
int h[25];
sc1(n);
rep(i, n) sc1(h[i]);
rep(i, n) {
if (h[i] >= m) {
m = h[i];
ans++;
}
}
printf("%d\n", ans);
return 0;
}
| replace | 11 | 12 | 11 | 12 | 0 | |
p03072 | C++ | Runtime Error | #include <algorithm>
#include <functional>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define All(x) (x).begin(), (x).end()
using namespace std;
using pii = pair<int, int>;
typedef long long ll;
#define MOD 1000000007
#define EPS 10e-8
int main() {
int a, b[100000009], ma, c;
ma = c = 0;
cin >> a;
rep(i, a) {
cin >> b[i];
if (b[i] >= ma) {
ma = b[i];
c++;
}
}
cout << c << endl;
}
| #include <algorithm>
#include <functional>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define All(x) (x).begin(), (x).end()
using namespace std;
using pii = pair<int, int>;
typedef long long ll;
#define MOD 1000000007
#define EPS 10e-8
int main() {
int a, b[1009], ma, c;
ma = c = 0;
cin >> a;
rep(i, a) {
cin >> b[i];
if (b[i] >= ma) {
ma = b[i];
c++;
}
}
cout << c << endl;
}
| replace | 17 | 18 | 17 | 18 | -11 | |
p03073 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int i = stoi(s, 0, 2);
cerr << hex << i;
int sum1 = (i & 0x55555555) + ((i >> 1) & 0x55555555);
sum1 = (sum1 & 0x33333333) + ((sum1 >> 2) & 0x33333333);
sum1 = (sum1 & 0x0f0f0f0f) + ((sum1 >> 4) & 0x0f0f0f0f);
sum1 = (sum1 & 0x00ff00ff) + ((sum1 >> 8) & 0x00ff00ff);
sum1 = (sum1 & 0x0000ffff) + (sum1 >> 16);
cout << min(sum1, int(s.length()) - sum1);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.length(), cnt = 0;
for (int i = 0; i < n; i++)
if (s[i] - '0' == i % 2)
cnt++;
cout << min(cnt, n - cnt);
return 0;
}
| replace | 5 | 14 | 5 | 10 | 0 | 0 |
p03073 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.length();
int ans01 = 0;
int ans10 = 0;
int ans;
string S01, S10;
for (int i = 0; i < N; i++) {
if (i % 2 == 0) {
S01[i] = '0';
S10[i] = '1';
} else {
S01[i] = '1';
S10[i] = '0';
}
}
for (int i = 0; i < N; i++) {
if (S[i] != S01[i]) {
ans01++;
}
if (S[i] != S10[i]) {
ans10++;
}
}
ans = min(ans01, ans10);
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.length();
int ans01 = 0;
int ans10 = 0;
int ans;
char S01[N], S10[N];
for (int i = 0; i < N; i++) {
if (i % 2 == 0) {
S01[i] = '0';
S10[i] = '1';
} else {
S01[i] = '1';
S10[i] = '0';
}
}
for (int i = 0; i < N; i++) {
if (S[i] != S01[i]) {
ans01++;
}
if (S[i] != S10[i]) {
ans10++;
}
}
ans = min(ans01, ans10);
cout << ans << endl;
return 0;
} | replace | 15 | 16 | 15 | 16 | 0 | |
p03073 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, cnt = 0, cnt1 = 0;
string s, s1;
cin >> n >> s;
for (int i = 0; i < n; i++) {
if (i % 2 == 0 && s[i] == '0')
cnt++;
else if (i % 2 && s[i] == '1')
cnt++;
if (i % 2 == 0 && s[i] == '1')
cnt1++;
else if (i % 2 && s[i] == '0')
cnt1++;
}
cout << min(cnt, cnt1) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int cnt = 0, cnt1 = 0;
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (i % 2 == 0 && s[i] == '0')
cnt++;
else if (i % 2 && s[i] == '1')
cnt++;
if (i % 2 == 0 && s[i] == '1')
cnt1++;
else if (i % 2 && s[i] == '0')
cnt1++;
}
cout << min(cnt, cnt1) << endl;
return 0;
}
| replace | 4 | 8 | 4 | 8 | 0 | |
p03073 | C++ | Runtime Error | #include <bits/stdc++.h>
#define register rg
#define file(a) \
freopen(a ".in", "r", stdin); \
freopen(a ".out", "w", stdout)
using namespace std;
typedef long long ll;
char a[10];
int main() {
cin >> a;
int c = 0, ans = 0, ans1 = 0;
for (int i = 0; i < strlen(a); i++) {
if (a[i] - '0' != c)
ans++;
c ^= 1;
}
c = 1;
for (int i = 0; i < strlen(a); i++) {
if (a[i] - '0' != c)
ans1++;
c ^= 1;
}
printf("%lld\n", min(ans1, ans));
// file("a");
return 0;
}
| #include <bits/stdc++.h>
#define register rg
#define file(a) \
freopen(a ".in", "r", stdin); \
freopen(a ".out", "w", stdout)
using namespace std;
typedef long long ll;
char a[1000001];
int main() {
cin >> a;
int c = 0, ans = 0, ans1 = 0;
for (int i = 0; i < strlen(a); i++) {
if (a[i] - '0' != c)
ans++;
c ^= 1;
}
c = 1;
for (int i = 0; i < strlen(a); i++) {
if (a[i] - '0' != c)
ans1++;
c ^= 1;
}
printf("%lld\n", min(ans1, ans));
// file("a");
return 0;
}
| replace | 7 | 8 | 7 | 8 | 0 | |
p03073 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s;
int n = s.size();
int c1 = 0;
for (int i = 0; i < n - 1; i++) {
if (s.at(i) == s.at(i + 1)) {
c1++;
if (s.at(i) == '0') {
s.at(i + 1) = '1';
} else {
s.at(i + 1) = '0';
}
}
}
int c2 = 0;
for (int i = 0; i < n - 1; i++) {
if (t.at(n - 1 - i) == t.at(n - 1 - i - 1)) {
c2++;
if (t.at(n - 1 - i) == '0') {
t.at(n - 1 - i - 1) = '1';
} else {
t.at(n - 1 - i - 1) = '0';
}
}
}
cout << min(c1, c2) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s;
t = s;
int n = s.size();
int c1 = 0;
for (int i = 0; i < n - 1; i++) {
if (s.at(i) == s.at(i + 1)) {
c1++;
if (s.at(i) == '0') {
s.at(i + 1) = '1';
} else {
s.at(i + 1) = '0';
}
}
}
int c2 = 0;
for (int i = 0; i < n - 1; i++) {
if (t.at(n - 1 - i) == t.at(n - 1 - i - 1)) {
c2++;
if (t.at(n - 1 - i) == '0') {
t.at(n - 1 - i - 1) = '1';
} else {
t.at(n - 1 - i - 1) = '0';
}
}
}
cout << min(c1, c2) << endl;
}
| insert | 6 | 6 | 6 | 7 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::at: __n (which is 2) >= this->size() (which is 0)
|
p03073 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
int num = stoi(S);
bitset<100000> A(S), P1(0), P2(0);
for (int i = 0; i < S.size(); i++) {
if (i % 2 == 0) {
P1.set(i);
}
}
P2 = ~P1;
for (int i = S.size(); i < 100000; i++) {
P2.reset(i);
}
P1 ^= A;
P2 ^= A;
// cout << A << endl;
// cout << P2 << endl;
cout << min(P1.count(), P2.count()) << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
// int num = stoi(S);
bitset<100000> A(S), P1(0), P2(0);
for (int i = 0; i < S.size(); i++) {
if (i % 2 == 0) {
P1.set(i);
}
}
P2 = ~P1;
for (int i = S.size(); i < 100000; i++) {
P2.reset(i);
}
P1 ^= A;
P2 ^= A;
// cout << A << endl;
// cout << P2 << endl;
cout << min(P1.count(), P2.count()) << endl;
return 0;
}
| replace | 10 | 11 | 10 | 11 | 0 | |
p03073 | C++ | Runtime Error | #include <stdio.h>
#include <string.h>
int main() {
char a[10005];
int k = 0;
scanf("%s", a);
if (strlen(a) == 1) {
printf("0");
return 0;
}
for (int i = 0; i < strlen(a); i++) {
if (a[i] == '0' && a[i + 1] == '0') {
a[i + 1] = '1';
k++;
}
if (a[i] == '1' && a[i + 1] == '1') {
a[i + 1] = '0';
k++;
}
}
printf("%d", k);
return 0;
} | #include <stdio.h>
#include <string.h>
int main() {
char a[100005];
int k = 0;
scanf("%s", a);
if (strlen(a) == 1) {
printf("0");
return 0;
}
for (int i = 0; i < strlen(a); i++) {
if (a[i] == '0' && a[i + 1] == '0') {
a[i + 1] = '1';
k++;
}
if (a[i] == '1' && a[i + 1] == '1') {
a[i + 1] = '0';
k++;
}
}
printf("%d", k);
return 0;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p03073 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
const int MAX_N = 100000;
char s[MAX_N];
for (int i = 0; i < MAX_N; i++)
s[i] = '2';
cin >> s;
int n = 0;
for (int i = 0; i >= 0; i++) {
if (s[i] != '2')
n++;
else
break;
}
n = n - 1; // 文字数 配列は文字数-1がMAX
int ans = 0;
for (int i = 1; i < n; i++) {
if (s[i - 1] == s[i]) {
if (s[i] == '0')
s[i] = '1';
else if (s[i] == '1')
s[i] = '0';
ans++;
}
}
cout << ans;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
const int MAX_N = 1000000;
char s[MAX_N];
for (int i = 0; i < MAX_N; i++)
s[i] = '2';
cin >> s;
int n = 0;
for (int i = 0; i >= 0; i++) {
if (s[i] != '2')
n++;
else
break;
}
n = n - 1; // 文字数 配列は文字数-1がMAX
int ans = 0;
for (int i = 1; i < n; i++) {
if (s[i - 1] == s[i]) {
if (s[i] == '0')
s[i] = '1';
else if (s[i] == '1')
s[i] = '0';
ans++;
}
}
cout << ans;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p03073 | C++ | Runtime Error | #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 = 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;
}
| #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;
}
| replace | 5 | 6 | 5 | 6 | 0 | |
p03073 | C++ | Runtime Error | #include <stdio.h>
#include <string.h>
int main() {
int i = 0, d = 0, n = 0, n2;
char s[10001];
scanf("%s", s);
n2 = strlen(s);
for (i = 0; i < n2; i++) {
if (s[i] == '0')
if (s[i + 1] == '0') {
s[i + 1] = '1';
n++;
}
if (s[i] == '1')
if (s[i + 1] == '1') {
n++;
s[i + 1] = '0';
}
}
printf("%d", n);
return 0;
} | #include <stdio.h>
#include <string.h>
int main() {
int i = 0, n = 0, n2;
char s[100001];
scanf("%s", s);
n2 = strlen(s);
for (i = 0; i < n2; i++) {
if (s[i] == '0')
if (s[i + 1] == '0') {
s[i + 1] = '1';
n++;
}
if (s[i] == '1')
if (s[i + 1] == '1') {
n++;
s[i + 1] = '0';
}
}
printf("%d", n);
return 0;
} | replace | 3 | 5 | 3 | 5 | 0 | |
p03073 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int numN = 0, numT = 0, ans;
string S, N, T;
cin >> S;
for (int i = 0; i < S.size(); i++) {
if (i % 2) {
N[i] = '0';
} else {
N[i] = '1';
}
}
for (int i = 0; i < S.size(); i++) {
if (!(i % 2)) {
T[i] = '0';
} else {
T[i] = '1';
}
}
for (int i = 0; i < S.size(); i++) {
if (S[i] != N[i])
numN++;
if (S[i] != T[i])
numT++;
}
ans = min(numN, numT);
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int numN = 0, numT = 0, ans;
string S, N, T;
cin >> S;
N = S;
T = S;
for (int i = 0; i < S.size(); i++) {
if (i % 2) {
N[i] = '0';
} else {
N[i] = '1';
}
}
for (int i = 0; i < S.size(); i++) {
if (!(i % 2)) {
T[i] = '0';
} else {
T[i] = '1';
}
}
for (int i = 0; i < S.size(); i++) {
if (S[i] != N[i])
numN++;
if (S[i] != T[i])
numT++;
}
ans = min(numN, numT);
cout << ans << endl;
return 0;
}
| insert | 8 | 8 | 8 | 10 | 0 | |
p03073 | Python | Runtime Error | t1 = ["0", "1"] * 25000
t2 = ["1", "0"] * 25000
s = input()
sl = list(s)
a1 = 0
a2 = 0
for i in range(len(sl)):
if sl[i] != t1[i]:
a1 += 1
if sl[i] != t2[i]:
a2 += 1
print(min(a1, a2))
| t1 = ["0", "1"] * 50000
t2 = ["1", "0"] * 50000
s = input()
sl = list(s)
a1 = 0
a2 = 0
for i in range(len(sl)):
if sl[i] != t1[i]:
a1 += 1
if sl[i] != t2[i]:
a2 += 1
print(min(a1, a2))
| replace | 0 | 2 | 0 | 2 | 0 | |
p03073 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
char s[10005];
cin >> s;
int ans1 = 0, ans2 = 0;
int n;
for (int i = 0; i < strlen(s); ++i) {
if (s[i] == '1')
n = 1;
else
n = 0;
if (n == i % 2)
ans1++;
else
ans2++;
}
cout << min(ans1, ans2) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
char s[100005];
cin >> s;
int ans1 = 0, ans2 = 0;
int n;
for (int i = 0; i < strlen(s); ++i) {
if (s[i] == '1')
n = 1;
else
n = 0;
if (n == i % 2)
ans1++;
else
ans2++;
}
cout << min(ans1, ans2) << endl;
return 0;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p03073 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int i, ans1, ans2;
string t1, t2;
for (i = 0; i < s.size(); ++i) {
if (i % 2 == 0) {
t1.at(i) = '0';
t2.at(i) = '1';
}
if (i % 2 == 1) {
t1.at(i) = '1';
t2.at(i) = '0';
}
}
for (i = 0; i < s.size(); ++i) {
if (t1.at(i) == s.at(i))
ans1++;
if (t2.at(i) == s.at(i))
ans2++;
}
if (ans1 > ans2)
cout << s.size() - ans1;
else
cout << s.size() - ans2;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int i, ans1, ans2;
ans1 = 0;
ans2 = 0;
vector<char> t1(s.size()), t2(s.size());
for (i = 0; i < s.size(); ++i) {
if (i % 2 == 0) {
t1.at(i) = '0';
t2.at(i) = '1';
}
if (i % 2 == 1) {
t1.at(i) = '1';
t2.at(i) = '0';
}
}
for (i = 0; i < s.size(); ++i) {
if (t1.at(i) == s.at(i))
ans1++;
if (t2.at(i) == s.at(i))
ans2++;
}
if (ans1 > ans2)
cout << s.size() - ans1;
else
cout << s.size() - ans2;
return 0;
} | replace | 6 | 7 | 6 | 9 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::at: __n (which is 0) >= this->size() (which is 0)
|
p03073 | C++ | Time Limit Exceeded | // キョウプロ.cpp : コンソール アプリケーションのエントリ ポイントを定義します。
//
#pragma once
#include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
long long A, B, C, D, M, N, X, Y, Z;
long long a[10000];
char ch;
string S;
int main() {
cin >> S;
M = 0;
C = 0;
D = 0;
for (int i = 0; i < S.size(); i++) {
if (M != S[i] - '0') {
C++;
}
A /= 10;
M++;
M %= 2;
}
M = 1;
for (int i = 0; i < S.size(); i++) {
A = atoi(S.c_str());
if (M != S[i] - '0') {
D++;
}
M++;
M %= 2;
}
cout << min(C, D) << endl;
return 0;
}
| // キョウプロ.cpp : コンソール アプリケーションのエントリ ポイントを定義します。
//
#pragma once
#include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
long long A, B, C, D, M, N, X, Y, Z;
long long a[10000];
char ch;
string S;
int main() {
cin >> S;
M = 0;
C = 0;
D = 0;
for (int i = 0; i < S.size(); i++) {
if (M != S[i] - '0') {
C++;
}
A /= 10;
M++;
M %= 2;
}
M = 1;
for (int i = 0; i < S.size(); i++) {
if (M != S[i] - '0') {
D++;
}
M++;
M %= 2;
}
cout << min(C, D) << endl;
return 0;
}
| delete | 42 | 43 | 42 | 42 | TLE | |
p03073 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mem(a, b) memset(a, b, sizeof(a))
#define INF 0X3f3f3f3f
const ll MAXN = 5000 + 7;
const ll MOD = 1e9 + 7;
//-------------------------------------------//
char s[MAXN];
int ans = 0;
int main() {
scanf("%s", s);
for (int i = 1; s[i] != '\0'; i++) {
if (s[i] == s[i - 1]) {
s[i] = !(s[i - 1] - '0') + '0';
ans++;
}
}
printf("%d\n", ans);
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mem(a, b) memset(a, b, sizeof(a))
#define INF 0X3f3f3f3f
const ll MAXN = 300000 + 7;
const ll MOD = 1e9 + 7;
//-------------------------------------------//
char s[MAXN];
int ans = 0;
int main() {
scanf("%s", s);
for (int i = 1; s[i] != '\0'; i++) {
if (s[i] == s[i - 1]) {
s[i] = !(s[i - 1] - '0') + '0';
ans++;
}
}
printf("%d\n", ans);
} | replace | 7 | 8 | 7 | 8 | 0 | |
p03073 | C++ | Runtime Error | #include <cstring>
#include <iostream>
using namespace std;
int main(void) {
string color;
char colortype[100000];
int res1 = 0;
int res2 = 0;
cin >> color;
strcpy(colortype, color.c_str());
if (color.length() == 1) {
cout << res1;
exit(0);
}
for (int i = 1; i < color.length(); ++i) {
if (colortype[i] == colortype[i - 1]) {
res1++;
if (colortype[i] == '0') {
colortype[i] = '1';
} else {
colortype[i] = '0';
}
}
}
strcpy(colortype, color.c_str());
for (int i = 1; i < color.length(); ++i) {
if (colortype[i] == colortype[i - 1]) {
res2++;
if (colortype[i] == '0') {
colortype[i] = '1';
} else {
colortype[i] = '0';
}
}
}
if (res1 < res2) {
cout << res1;
} else {
cout << res2;
}
} | #include <cstring>
#include <iostream>
using namespace std;
int main(void) {
string color;
char colortype[1000000];
int res1 = 0;
int res2 = 0;
cin >> color;
strcpy(colortype, color.c_str());
if (color.length() == 1) {
cout << res1;
exit(0);
}
for (int i = 1; i < color.length(); ++i) {
if (colortype[i] == colortype[i - 1]) {
res1++;
if (colortype[i] == '0') {
colortype[i] = '1';
} else {
colortype[i] = '0';
}
}
}
strcpy(colortype, color.c_str());
for (int i = 1; i < color.length(); ++i) {
if (colortype[i] == colortype[i - 1]) {
res2++;
if (colortype[i] == '0') {
colortype[i] = '1';
} else {
colortype[i] = '0';
}
}
}
if (res1 < res2) {
cout << res1;
} else {
cout << res2;
}
} | replace | 5 | 6 | 5 | 6 | 0 | |
p03073 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main(int argc, const char *argv[]) {
string s;
cin >> s;
int len = s.size();
string result1;
string result2;
for (int i = 0; i < len; i++) {
if (i % 2 == 0) {
result1[i] = '0';
result2[i] = '1';
} else {
result1[i] = '1';
result2[i] = '0';
}
}
int count1 = 0;
int count2 = 0;
for (int i = 0; i < len; i++) {
if (s[i] != result1[i]) {
count1++;
}
if (s[i] != result2[i]) {
count2++;
}
}
int ans = min(count1, count2);
cout << ans;
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main(int argc, const char *argv[]) {
string s;
cin >> s;
int len = s.size();
string result1;
string result2;
result1.resize(len, '0');
result2.resize(len, '0');
for (int i = 0; i < len; i++) {
if (i % 2 == 0) {
result1[i] = '0';
result2[i] = '1';
} else {
result1[i] = '1';
result2[i] = '0';
}
}
int count1 = 0;
int count2 = 0;
for (int i = 0; i < len; i++) {
if (s[i] != result1[i]) {
count1++;
}
if (s[i] != result2[i]) {
count2++;
}
}
int ans = min(count1, count2);
cout << ans;
return 0;
}
| insert | 13 | 13 | 13 | 15 | 0 | |
p03073 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// #define ONLINE_JUDGE
#define ll long long
#define PI 3.14159265359
#define fore(i, l, r) for (int i = int(l); i < int(r); ++i)
#define pb(a) push_back(a)
//////////// Solution /////////////////////////////////
const int MAXN = 1e5 + 1;
char s1[MAXN], s2[MAXN];
void solve() {
string s;
cin >> s;
int n = (int)s.length();
char c = 0;
for (int i = 0; i < n; ++i) {
s1[i] = (char)('0' + c);
s2[i] = (char)('0' + (1 - c));
c = 1 - c;
}
int n1 = 0, n2 = 0;
for (int i = 0; i < n; ++i) {
if (s[i] != s1[i]) {
++n1;
}
if (s[i] != s2[i]) {
++n2;
}
}
cout << min(n1, n2) << '\n';
}
/////////// End Solution ///////////////////////////////////////
//////// Initialization ////////////////////////////////////
int main() {
#ifndef ONLINE_JUDGE
FILE *FIN = freopen("/home/danil/prog/input.txt", "r", stdin);
clock_t time_start = clock();
#endif
ios::sync_with_stdio(false);
cin.tie(NULL);
solve();
#ifndef ONLINE_JUDGE
fclose(FIN);
cerr << "\x1b[031m\n-----------------\nTime="
<< (ll)((double)(clock() - time_start) / CLOCKS_PER_SEC * 1000)
<< "ms\n\x1b[0m";
#endif
return 0;
}
//////// End Initialization /////////////////////////////////////// | #include <bits/stdc++.h>
using namespace std;
#define ONLINE_JUDGE
#define ll long long
#define PI 3.14159265359
#define fore(i, l, r) for (int i = int(l); i < int(r); ++i)
#define pb(a) push_back(a)
//////////// Solution /////////////////////////////////
const int MAXN = 1e5 + 1;
char s1[MAXN], s2[MAXN];
void solve() {
string s;
cin >> s;
int n = (int)s.length();
char c = 0;
for (int i = 0; i < n; ++i) {
s1[i] = (char)('0' + c);
s2[i] = (char)('0' + (1 - c));
c = 1 - c;
}
int n1 = 0, n2 = 0;
for (int i = 0; i < n; ++i) {
if (s[i] != s1[i]) {
++n1;
}
if (s[i] != s2[i]) {
++n2;
}
}
cout << min(n1, n2) << '\n';
}
/////////// End Solution ///////////////////////////////////////
//////// Initialization ////////////////////////////////////
int main() {
#ifndef ONLINE_JUDGE
FILE *FIN = freopen("/home/danil/prog/input.txt", "r", stdin);
clock_t time_start = clock();
#endif
ios::sync_with_stdio(false);
cin.tie(NULL);
solve();
#ifndef ONLINE_JUDGE
fclose(FIN);
cerr << "\x1b[031m\n-----------------\nTime="
<< (ll)((double)(clock() - time_start) / CLOCKS_PER_SEC * 1000)
<< "ms\n\x1b[0m";
#endif
return 0;
}
//////// End Initialization /////////////////////////////////////// | replace | 3 | 4 | 3 | 4 | -11 | |
p03073 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
using namespace std;
int comp(const void *a, const void *b) { return *(int *)a - *(int *)b; }
int main() {
string s;
cin >> s;
// 初期値は大きい値
int ans = s.size();
// iは最初に使う色（０か１）
for (int i = 0; i < 2; i++) {
int cnt = 0;
for (int j = 0; i < s.size(); j++) {
if (j % 2 == 0 && s[i] != (char)(i + '0'))
cnt++;
if (j % 2 == 1 && s[j] == (char)(i + '0'))
cnt++;
}
ans = min(ans, cnt);
}
cout << ans << endl;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
using namespace std;
int comp(const void *a, const void *b) { return *(int *)a - *(int *)b; }
int main() {
string s;
cin >> s;
// 初期値は大きい値
int ans = s.size();
// iは最初に使う色（０か１）
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++;
}
ans = min(ans, cnt);
}
cout << ans << endl;
} | replace | 20 | 24 | 20 | 22 | -11 | |
p03073 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
vector<char> s(10000);
int i, one_count, zero_count;
i = 0;
while ((s[i] = getchar()) != '\n') {
i++;
}
s[i] = -1;
i = 0;
one_count = 0;
zero_count = 0;
while (s[i] != -1) {
if (s[i] != (i % 2 ? '0' : '1')) {
one_count++;
}
if (s[i] != (i % 2 ? '1' : '0')) {
zero_count++;
}
i++;
}
if (one_count > zero_count)
cout << zero_count << endl;
else
cout << one_count << endl;
return 0;
} | #include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
vector<char> s(100000);
int i, one_count, zero_count;
i = 0;
while ((s[i] = getchar()) != '\n') {
i++;
}
s[i] = -1;
i = 0;
one_count = 0;
zero_count = 0;
while (s[i] != -1) {
if (s[i] != (i % 2 ? '0' : '1')) {
one_count++;
}
if (s[i] != (i % 2 ? '1' : '0')) {
zero_count++;
}
i++;
}
if (one_count > zero_count)
cout << zero_count << endl;
else
cout << one_count << endl;
return 0;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p03073 | C++ | Runtime Error | #include <bits/stdc++.h>
#define all(a) a.begin(), a.end()
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef pair<ll, ll> P;
constexpr ll mod = 1000000007;
int main() {
char s[10001];
cin >> s;
ll i, ch = 0;
for (i = 0; i < strlen(s); i++) {
if ((s[i] == '1' && i % 2 == 1) || (s[i] == '0' && i % 2 == 0)) {
} else
ch++;
}
if (ch * 2 >= i)
cout << i - ch;
else
cout << ch;
} | #include <bits/stdc++.h>
#define all(a) a.begin(), a.end()
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef pair<ll, ll> P;
constexpr ll mod = 1000000007;
int main() {
char s[100000];
cin >> s;
ll i, ch = 0;
for (i = 0; i < strlen(s); i++) {
if ((s[i] == '1' && i % 2 == 1) || (s[i] == '0' && i % 2 == 0)) {
} else
ch++;
}
if (ch * 2 >= i)
cout << i - ch;
else
cout << ch;
} | replace | 8 | 9 | 8 | 9 | 0 | |
p03073 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
char a[11111];
cin >> a;
int count = 0, n = strlen(a);
for (int i = 0; i < strlen(a); i++) {
if (i % 2 == 0 && a[i] == '0')
count++;
if (i % 2 == 1 && a[i] == '1')
count++;
}
cout << min(count, n - count) << endl;
return (0);
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
char a[111111];
cin >> a;
int count = 0, n = strlen(a);
for (int i = 0; i < strlen(a); i++) {
if (i % 2 == 0 && a[i] == '0')
count++;
if (i % 2 == 1 && a[i] == '1')
count++;
}
cout << min(count, n - count) << endl;
return (0);
}
| replace | 3 | 4 | 3 | 4 | 0 | |
p03073 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) FOR(i, 0, n)
#define SORT(c) sort((c).begin(), (c).end())
#define INF (ll)1e18
#define MOD (ll)1e9 + 7
#define pb push_back
typedef long long ll;
typedef long long int llt;
typedef pair<int, int> P;
typedef vector<int> V;
typedef map<int, int> M;
char dif = 'A' - 'a';
int mod = 1e9 + 7;
ll inf = 1e18;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
int n = s.size();
char t[12345], u[12345];
for (int i = 0; i < n; i++) {
if (i % 2 == 0) {
t[i] = '1', u[i] = '0';
} else
t[i] = '0', u[i] = '1';
}
int a = 0, b = 0;
for (int i = 0; i < n; i++) {
if (s[i] != t[i])
a++;
if (s[i] != u[i])
b++;
}
cout << min(a, b) << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) FOR(i, 0, n)
#define SORT(c) sort((c).begin(), (c).end())
#define INF (ll)1e18
#define MOD (ll)1e9 + 7
#define pb push_back
typedef long long ll;
typedef long long int llt;
typedef pair<int, int> P;
typedef vector<int> V;
typedef map<int, int> M;
char dif = 'A' - 'a';
int mod = 1e9 + 7;
ll inf = 1e18;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
int n = s.size();
char t[112345], u[112345];
for (int i = 0; i < n; i++) {
if (i % 2 == 0) {
t[i] = '1', u[i] = '0';
} else
t[i] = '0', u[i] = '1';
}
int a = 0, b = 0;
for (int i = 0; i < n; i++) {
if (s[i] != t[i])
a++;
if (s[i] != u[i])
b++;
}
cout << min(a, b) << endl;
return 0;
} | replace | 41 | 42 | 41 | 42 | 0 | |
p03073 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
char ch[100];
scanf("%s", &ch);
int len = strlen(ch), cnt = 0;
if (len == 1) {
printf("0\n");
return 0;
}
for (int i = 0; i < len - 1; i++) {
if (ch[i] == ch[i + 1]) {
if (ch[i] == '0') {
ch[i + 1] = '1';
++cnt;
} else if (ch[i] == '1') {
ch[i + 1] = '0';
++cnt;
}
}
}
printf("%d\n", cnt);
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
char ch[100000];
scanf("%s", &ch);
int len = strlen(ch), cnt = 0;
if (len == 1) {
printf("0\n");
return 0;
}
for (int i = 0; i < len - 1; i++) {
if (ch[i] == ch[i + 1]) {
if (ch[i] == '0') {
ch[i + 1] = '1';
++cnt;
} else if (ch[i] == '1') {
ch[i + 1] = '0';
++cnt;
}
}
}
printf("%d\n", cnt);
}
| replace | 3 | 4 | 3 | 4 | 0 | |
p03073 | Python | Runtime Error | a = list(input())
b = a[::2].index("0") + a[1::2].index("1")
c = min(b, len(a) - b)
print(c)
| a = list(input())
b = a[::2].count("0") + a[1::2].count("1")
c = min(b, len(a) - b)
print(c)
| replace | 1 | 2 | 1 | 2 | ValueError: '1' is not in list | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03073/Python/s422030970.py", line 2, in <module>
b = a[::2].index('0') + a[1::2].index('1')
ValueError: '1' is not in list
|
p03073 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
char S[10001];
scanf("%s", S);
int len = strlen(S);
int ans1 = 0, ans2 = 0;
for (int i = 0; i < len; i++) {
if (i % 2 == S[i] - '0') {
// 黒色スタート時の塗り替え数を検証
ans1++;
} else {
// 白色スタート時の塗り替え数を検証
ans2++;
}
}
printf("%d", min(ans1, ans2));
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
char S[100010];
scanf("%s", S);
int len = strlen(S);
int ans1 = 0, ans2 = 0;
for (int i = 0; i < len; i++) {
if (i % 2 == S[i] - '0') {
// 黒色スタート時の塗り替え数を検証
ans1++;
} else {
// 白色スタート時の塗り替え数を検証
ans2++;
}
}
printf("%d", min(ans1, ans2));
return 0;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p03073 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
char ch[200], temp;
scanf("%s", &ch);
int len = strlen(ch), cnt = 0;
if (len == 1) {
printf("0\n");
return 0;
}
for (int i = 0; i < len - 1; i++) {
if (ch[i] == ch[i + 1]) {
if (ch[i] == '0') {
temp = ch[i + 1];
ch[i + 1] = '1';
++cnt;
} else if (ch[i] == '1') {
temp = ch[i + 1];
ch[i + 1] = '0';
++cnt;
}
}
}
printf("%d\n", cnt);
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
char ch[100009], temp;
scanf("%s", &ch);
int len = strlen(ch), cnt = 0;
if (len == 1) {
printf("0\n");
return 0;
}
for (int i = 0; i < len - 1; i++) {
if (ch[i] == ch[i + 1]) {
if (ch[i] == '0') {
temp = ch[i + 1];
ch[i + 1] = '1';
++cnt;
} else if (ch[i] == '1') {
temp = ch[i + 1];
ch[i + 1] = '0';
++cnt;
}
}
}
printf("%d\n", cnt);
}
| replace | 3 | 4 | 3 | 4 | 0 | |
p03074 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> K;
cin >> S;
int a[100002];
int prev = 0;
int ans = 0;
a[0] = 1;
for (int i = 1; i < N + 2; i++) {
a[i] = 0;
}
int cnt = 0;
for (int i = 1; i < N; i++) {
if (S[i] == S[i - 1])
a[cnt]++;
else {
cnt++;
a[cnt]++;
}
}
if (2 * K > cnt) {
cout << N << endl;
return 0;
}
if (S[0] == '0') {
for (int i = 0; i < 2 * K; i++)
ans += a[i];
for (int i = 1; i < cnt + 1; i += 2) {
for (int j = i; j < 2 * K + 1 + i; j++)
prev += a[j];
if (prev > ans)
ans = prev;
prev = 0;
}
} else {
for (int i = 0; i < cnt + 1; i += 2) {
for (int j = i; j < 2 * K + 1 + i; j++)
prev += a[j];
if (prev > ans)
ans = prev;
prev = 0;
}
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> K;
cin >> S;
int a[200000];
int prev = 0;
int ans = 0;
a[0] = 1;
for (int i = 1; i < N + 2; i++) {
a[i] = 0;
}
int cnt = 0;
for (int i = 1; i < N; i++) {
if (S[i] == S[i - 1])
a[cnt]++;
else {
cnt++;
a[cnt]++;
}
}
if (2 * K > cnt) {
cout << N << endl;
return 0;
}
if (S[0] == '0') {
for (int i = 0; i < 2 * K; i++)
ans += a[i];
for (int i = 1; i < cnt + 1; i += 2) {
for (int j = i; j < 2 * K + 1 + i; j++)
prev += a[j];
if (prev > ans)
ans = prev;
prev = 0;
}
} else {
for (int i = 0; i < cnt + 1; i += 2) {
for (int j = i; j < 2 * K + 1 + i; j++)
prev += a[j];
if (prev > ans)
ans = prev;
prev = 0;
}
}
cout << ans << endl;
return 0;
} | replace | 10 | 11 | 10 | 11 | 0 | |
p03074 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <time.h>
#include <typeinfo>
#include <vector>
using namespace std;
#define rep(i, m, n) for (int i = m; i < n; ++i)
#define llrep(i, m, n) for (ll i = m; i < n; ++i)
#define inf 1000000000
#define llinf 1000000000000000000
#define MOD 1000000007
#define ll long long
#define mp make_pair
#define all(v) v.begin(), v.end()
vector<int> v0, v1;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
if (s[0] == '0') {
v1.push_back(0);
}
int hoge = 1;
rep(i, 1, n) {
if (s[i] != s[i - 1]) {
if (s[i - 1] == '0') {
v0.push_back(hoge);
} else {
v1.push_back(hoge);
}
hoge = 1;
} else {
hoge++;
}
}
if (s[n - 1] == '0') {
v1.push_back(0);
v0.push_back(hoge);
} else {
v1.push_back(hoge);
}
if (v0.size() == 0) {
cout << n << endl;
return 0;
}
rep(i, 1, v0.size()) { v0[i] += v0[i - 1]; }
rep(i, 1, v1.size()) { v1[i] += v1[i - 1]; }
int ans = 0;
v0.insert(v0.begin(), 0);
v1.insert(v1.begin(), 0);
rep(i, 0, v0.size() - k) {
ans = max(ans, v1[k + i + 1] - v1[i] + v0[k + i] - v0[i]);
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <time.h>
#include <typeinfo>
#include <vector>
using namespace std;
#define rep(i, m, n) for (int i = m; i < n; ++i)
#define llrep(i, m, n) for (ll i = m; i < n; ++i)
#define inf 1000000000
#define llinf 1000000000000000000
#define MOD 1000000007
#define ll long long
#define mp make_pair
#define all(v) v.begin(), v.end()
vector<int> v0, v1;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
if (s[0] == '0') {
v1.push_back(0);
}
int hoge = 1;
rep(i, 1, n) {
if (s[i] != s[i - 1]) {
if (s[i - 1] == '0') {
v0.push_back(hoge);
} else {
v1.push_back(hoge);
}
hoge = 1;
} else {
hoge++;
}
}
if (s[n - 1] == '0') {
v1.push_back(0);
v0.push_back(hoge);
} else {
v1.push_back(hoge);
}
if (v0.size() < k) {
cout << n << endl;
return 0;
}
rep(i, 1, v0.size()) { v0[i] += v0[i - 1]; }
rep(i, 1, v1.size()) { v1[i] += v1[i - 1]; }
int ans = 0;
v0.insert(v0.begin(), 0);
v1.insert(v1.begin(), 0);
rep(i, 0, v0.size() - k) {
ans = max(ans, v1[k + i + 1] - v1[i] + v0[k + i] - v0[i]);
}
cout << ans << endl;
return 0;
} | replace | 56 | 57 | 56 | 57 | 0 | |
p03074 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstring>
#include <fstream>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
string s;
vector<pair<int, int>> v;
ifstream cin("testcase_01.in");
cin >> n >> k;
cin >> s;
int res = 0;
int cnt = 0;
int front = -1, end = -1;
bool flag = false;
for (int i = 0; i < n; i++) {
if (flag == false) {
if (s[i] == '1') {
cnt++;
} else {
res = max(res, cnt);
cnt = 0;
front = i;
flag = true;
}
} else {
if (s[i] == '1') {
end = i - 1;
v.push_back(make_pair(front, end));
flag = false;
cnt = 1;
}
}
}
if (flag == false) {
res = max(res, cnt);
} else {
v.push_back(make_pair(front, n - 1));
}
// cout << ' ' << k << ' '<< v.size() << '\n';
int start = 0;
for (int i = 0; i < v.size(); i++) {
int idx = i + k;
if (idx < v.size()) {
// cout << i << ' ' << k << ' ' << idx << '\n';
int end = v[idx].first - 1;
res = max(res, end - start + 1);
start = v[i].second + 1;
} else if (idx == v.size()) {
int end = n - 1;
res = max(res, end - start + 1);
}
}
if (k >= v.size()) {
res = max(res, n);
}
cout << res << '\n';
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstring>
#include <fstream>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
string s;
vector<pair<int, int>> v;
cin >> n >> k;
cin >> s;
int res = 0;
int cnt = 0;
int front = -1, end = -1;
bool flag = false;
for (int i = 0; i < n; i++) {
if (flag == false) {
if (s[i] == '1') {
cnt++;
} else {
res = max(res, cnt);
cnt = 0;
front = i;
flag = true;
}
} else {
if (s[i] == '1') {
end = i - 1;
v.push_back(make_pair(front, end));
flag = false;
cnt = 1;
}
}
}
if (flag == false) {
res = max(res, cnt);
} else {
v.push_back(make_pair(front, n - 1));
}
// cout << ' ' << k << ' '<< v.size() << '\n';
int start = 0;
for (int i = 0; i < v.size(); i++) {
int idx = i + k;
if (idx < v.size()) {
// cout << i << ' ' << k << ' ' << idx << '\n';
int end = v[idx].first - 1;
res = max(res, end - start + 1);
start = v[i].second + 1;
} else if (idx == v.size()) {
int end = n - 1;
res = max(res, end - start + 1);
}
}
if (k >= v.size()) {
res = max(res, n);
}
cout << res << '\n';
return 0;
}
| delete | 17 | 18 | 17 | 17 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define all(a) a.begin(), a.end()
#define pb push_back
typedef long long ll;
typedef pair<ll, ll> P;
// #define rep(i,a,b) for(int i=a ; i<b ; i++)
const int max_n = 1e5;
const ll mod = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> v;
if (s[0] == '0')
v.pb(0);
for (int i = 0; i < n;) {
int j = i;
while (s[i] == s[j] && j < n) {
j++;
}
v.pb(j - i);
i = j;
}
if (s.back() == '0')
v.pb(0);
vector<int> sums((int)v.size() + 1, 0);
for (int i = 0; i < sums.size(); i++) {
sums[i + 1] = sums[i] + v[i];
}
int res = 0;
for (int left = 0; left < sums.size(); left += 2) {
int right = left + 2 * k + 1;
if (right >= sums.size())
right = (int)sums.size() - 1;
res = max(res, sums[right] - sums[left]);
}
cout << res << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define all(a) a.begin(), a.end()
#define pb push_back
typedef long long ll;
typedef pair<ll, ll> P;
// #define rep(i,a,b) for(int i=a ; i<b ; i++)
const int max_n = 1e5;
const ll mod = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> v;
if (s[0] == '0')
v.pb(0);
for (int i = 0; i < n;) {
int j = i;
while (s[i] == s[j] && j < n) {
j++;
}
v.pb(j - i);
i = j;
}
if (s.back() == '0')
v.pb(0);
vector<int> sums((int)v.size() + 1, 0);
for (int i = 0; i < v.size(); i++) {
sums[i + 1] = sums[i] + v[i];
}
int res = 0;
for (int left = 0; left < sums.size(); left += 2) {
int right = left + 2 * k + 1;
if (right >= sums.size())
right = (int)sums.size() - 1;
res = max(res, sums[right] - sums[left]);
}
cout << res << endl;
return 0;
}
| replace | 30 | 31 | 30 | 31 | 0 | |
p03074 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
// ascending order
#define vsort(v) sort(v.begin(), v.end())
// descending order
#define vsort_r(v) sort(v.begin(), v.end(), greater<int>())
#define vunique(v) unique(v.begin(), v.end())
#define mp make_pair
#define ts(x) to_string(x)
#define rep(i, a, b) for (int i = (int)a; i < (int)b; i++)
#define repm(i, a, b) for (int i = (int)a; i > (int)b; i--)
#define bit(a) bitset<8>(a)
#define des_priority_queue priority_queue<int, vector<int>, greater<int>>
#define all(v) (v).begin(), (v).end()
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1ll << 60;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> A;
ll num = 0;
bool flag_a = true;
rep(i, 0, S.size()) {
if (flag_a) {
if (S[i] == '1')
num++;
else {
A.push_back(num);
num = 1;
flag_a = false;
}
} else {
if (S[i] == '1') {
A.push_back(num);
num = 1;
flag_a = true;
} else {
num++;
}
}
}
if (num > 0)
A.push_back(num);
if (A.size() % 2 == 0)
A.push_back(0);
int Add = 2 * K + 1;
vector<int> sum(A.size() + 1);
rep(i, 0, sum.size()) sum[i + 1] = sum[i] + A[i];
ll rsl = 0;
for (int i = 0; i < A.size(); i += 2) {
int left = i, right = min(i + Add, (int)A.size());
ll tmp = sum[right] - sum[left];
chmax(rsl, tmp);
}
cout << rsl << endl;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
// ascending order
#define vsort(v) sort(v.begin(), v.end())
// descending order
#define vsort_r(v) sort(v.begin(), v.end(), greater<int>())
#define vunique(v) unique(v.begin(), v.end())
#define mp make_pair
#define ts(x) to_string(x)
#define rep(i, a, b) for (int i = (int)a; i < (int)b; i++)
#define repm(i, a, b) for (int i = (int)a; i > (int)b; i--)
#define bit(a) bitset<8>(a)
#define des_priority_queue priority_queue<int, vector<int>, greater<int>>
#define all(v) (v).begin(), (v).end()
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1ll << 60;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> A;
ll num = 0;
bool flag_a = true;
rep(i, 0, S.size()) {
if (flag_a) {
if (S[i] == '1')
num++;
else {
A.push_back(num);
num = 1;
flag_a = false;
}
} else {
if (S[i] == '1') {
A.push_back(num);
num = 1;
flag_a = true;
} else {
num++;
}
}
}
if (num > 0)
A.push_back(num);
if (A.size() % 2 == 0)
A.push_back(0);
int Add = 2 * K + 1;
vector<int> sum(A.size() + 1);
rep(i, 0, A.size()) sum[i + 1] = sum[i] + A[i];
ll rsl = 0;
for (int i = 0; i < A.size(); i += 2) {
int left = i, right = min(i + Add, (int)A.size());
ll tmp = sum[right] - sum[left];
chmax(rsl, tmp);
}
cout << rsl << endl;
}
| replace | 83 | 84 | 83 | 84 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
int main(void) {
int N, K;
string S;
cin >> N >> K >> S;
int ans = 0, left_idx = 0, right_idx = 0, count = 0;
for (int i = 0; i < N - 1; i++) {
if (i == 0 && S[i] == '0')
count++;
else if (S[i] == '1' && S[i + 1] == '0')
count++;
if (count > K) {
right_idx = i;
break;
}
}
if (right_idx == 0)
right_idx == N - 1;
ans = right_idx - left_idx + 1;
while (right_idx != N - 1) {
while (!(S[left_idx] == '0' && S[left_idx + 1] == '1')) {
left_idx++;
// cout << S[left_idx] << " "<< S[left_idx+1] << " " << (S[left_idx] ==
// '0' && S[left_idx+1] == '1') << endl;
}
left_idx++;
right_idx++;
while (!(S[right_idx] == '1' && S[right_idx + 1] == '0') &&
right_idx != N - 1) {
right_idx++;
if (right_idx == N - 1)
break;
}
ans = max(ans, right_idx - left_idx + 1);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
int main(void) {
int N, K;
string S;
cin >> N >> K >> S;
int ans = 0, left_idx = 0, right_idx = 0, count = 0;
for (int i = 0; i < N - 1; i++) {
if (i == 0 && S[i] == '0')
count++;
else if (S[i] == '1' && S[i + 1] == '0')
count++;
if (count > K) {
right_idx = i;
break;
}
}
if (right_idx == 0)
right_idx = N - 1;
ans = right_idx - left_idx + 1;
while (right_idx != N - 1) {
while (!(S[left_idx] == '0' && S[left_idx + 1] == '1')) {
left_idx++;
// cout << S[left_idx] << " "<< S[left_idx+1] << " " << (S[left_idx] ==
// '0' && S[left_idx+1] == '1') << endl;
}
left_idx++;
right_idx++;
while (!(S[right_idx] == '1' && S[right_idx + 1] == '0') &&
right_idx != N - 1) {
right_idx++;
if (right_idx == N - 1)
break;
}
ans = max(ans, right_idx - left_idx + 1);
}
cout << ans << endl;
} | replace | 23 | 24 | 23 | 24 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> i_i;
typedef pair<ll, ll> l_l;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
const ll mod = 1000000007;
int n, k;
string s;
int main() {
cin >> n >> k >> s;
bool is_zero = false;
int cnt = 0;
int start = 0, i = 0;
int mx = 0;
while (i < n) {
while (true) {
if (s[i] == '0') {
if (!is_zero)
cnt++;
is_zero = true;
} else {
is_zero = false;
}
// cout << "cnt" << cnt << endl;
if (cnt > k)
break;
i++;
if (i == n)
break;
}
mx = max(mx, i - start);
bool flg = false;
while (true) {
if (s[start] == '0') {
flg = true;
} else {
if (flg)
break;
}
start++;
}
cnt--;
if (start == i)
break;
}
cout << mx << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> i_i;
typedef pair<ll, ll> l_l;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
const ll mod = 1000000007;
int n, k;
string s;
int main() {
cin >> n >> k >> s;
bool is_zero = false;
int cnt = 0;
int start = 0, i = 0;
int mx = 0;
while (i < n) {
while (true) {
if (s[i] == '0') {
if (!is_zero)
cnt++;
is_zero = true;
} else {
is_zero = false;
}
// cout << "cnt" << cnt << endl;
if (cnt > k)
break;
i++;
if (i == n)
break;
}
mx = max(mx, i - start);
bool flg = false;
while (true) {
if (s[start] == '0') {
flg = true;
} else {
if (flg)
break;
}
start++;
if (start == i)
break;
}
cnt--;
if (start == i)
break;
}
cout << mx << endl;
} | insert | 50 | 50 | 50 | 52 | 0 | |
p03074 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int number, manipulate_number;
cin >> number >> manipulate_number;
string s;
cin >> s;
vector<int> nums;
int now = 1;
int cnt = 0;
for (int i = 0; i < number; i++) {
if (s[i] == (char)('0' + now))
cnt++;
else {
nums.emplace_back(cnt);
now ^= 1;
cnt = 1;
}
}
if (cnt != 0)
nums.emplace_back(cnt);
if (nums.size() % 2 == 0)
nums.emplace_back(0);
int add_range = 2 * manipulate_number + 1;
vector<int> sum(nums.size() + 1);
for (int i = 0; i < sum.size(); i++) {
sum[i + 1] = sum[i] + nums[i];
}
int ans = 0;
for (int i = 0; i < nums.size(); i += 2) {
int left = i;
int right = min(i + add_range, (int)nums.size());
int tmp = sum[right] - sum[left];
ans = max(tmp, ans);
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int number, manipulate_number;
cin >> number >> manipulate_number;
string s;
cin >> s;
vector<int> nums;
int now = 1;
int cnt = 0;
for (int i = 0; i < number; i++) {
if (s[i] == (char)('0' + now))
cnt++;
else {
nums.emplace_back(cnt);
now ^= 1;
cnt = 1;
}
}
if (cnt != 0)
nums.emplace_back(cnt);
if (nums.size() % 2 == 0)
nums.emplace_back(0);
int add_range = 2 * manipulate_number + 1;
vector<int> sum(nums.size() + 1);
for (int i = 0; i < nums.size(); i++) {
sum[i + 1] = sum[i] + nums[i];
}
int ans = 0;
for (int i = 0; i < nums.size(); i += 2) {
int left = i;
int right = min(i + add_range, (int)nums.size());
int tmp = sum[right] - sum[left];
ans = max(tmp, ans);
}
cout << ans << endl;
return 0;
} | replace | 33 | 34 | 33 | 34 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) FOR(i, 0, n)
typedef long long ll;
int main() {
int n, k;
string s;
cin >> n >> k >> s;
vector<int> V;
int cnt = 1;
rep(i, n - 1) {
if (s[i + 1] == s[i]) {
cnt++;
} else {
V.push_back(cnt);
cnt = 1;
}
}
V.push_back(cnt);
// rep(i, (int)V.size()) {
// cout << V[i] << " ";
// }
int ma = 0;
if (s[0] == '1') {
for (int beg = 0; beg < (int)V.size(); beg += 2) {
int end = min((int)V.size() - 1, beg + 2 * k);
int tem = 0;
for (int i = beg; i <= end; i++) {
tem += V[i];
}
ma = max(tem, ma);
}
} else {
for (int i = 0; i <= 2 * k - 1; i++) {
ma += V[i];
}
for (int beg = 1; beg < (int)V.size(); beg += 2) {
int end = min((int)V.size() - 1, beg + 2 * k);
int tem = 0;
for (int i = beg; i <= end; i++) {
tem += V[i];
}
ma = max(tem, ma);
}
}
cout << ma << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) FOR(i, 0, n)
typedef long long ll;
int main() {
int n, k;
string s;
cin >> n >> k >> s;
vector<int> V;
int cnt = 1;
rep(i, n - 1) {
if (s[i + 1] == s[i]) {
cnt++;
} else {
V.push_back(cnt);
cnt = 1;
}
}
V.push_back(cnt);
// rep(i, (int)V.size()) {
// cout << V[i] << " ";
// }
int ma = 0;
if (s[0] == '1') {
for (int beg = 0; beg < (int)V.size(); beg += 2) {
int end = min((int)V.size() - 1, beg + 2 * k);
int tem = 0;
for (int i = beg; i <= end; i++) {
tem += V[i];
}
ma = max(tem, ma);
}
} else {
int en = min((int)V.size() - 1, 2 * k - 1);
for (int i = 0; i <= en; i++) {
ma += V[i];
}
for (int beg = 1; beg < (int)V.size(); beg += 2) {
int end = min((int)V.size() - 1, beg + 2 * k);
int tem = 0;
for (int i = beg; i <= end; i++) {
tem += V[i];
}
ma = max(tem, ma);
}
}
cout << ma << endl;
}
| replace | 38 | 39 | 38 | 40 | 0 | |
p03074 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
using namespace std;
string s;
int n, k;
bool f[10111];
int a[10111], b[10111];
int main() {
cin >> n >> k;
cin >> s;
int ans = 0, ans1 = 0, tt = 1, ttt = 1, zero = 0, one = 0, cnt = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '1')
ans++;
else {
if (ans != 0) {
b[tt++] = ans;
one += ans;
ans = 0;
}
}
if (i == n - 1) {
if (ans != 0) {
b[tt++] = ans;
one += ans;
ans = 0;
}
}
if (s[i] == '0')
ans1++;
else {
if (ans1 != 0) {
a[ttt++] = ans1;
zero += ans1;
ans1 = 0;
}
}
if (i == n - 1) {
if (ans1 != 0) {
a[ttt++] = ans1;
zero += ans1;
ans1 = 0;
}
}
}
// for (int i=1;i<=tt;i++) cout<<b[i]<<endl;
if (k == 0) {
for (int i = 1; i <= tt - 1; i++)
if (b[i] > cnt)
cnt = b[i];
} else if (k >= zero) {
cnt = s.size();
} else if (k > ttt - 1)
cnt = s.size();
else {
int i = 1;
while (i + k - 1 <= ttt - 1) {
int q = 0;
if (s[0] == '1') {
for (int j = i; j <= i + k - 1; j++)
q += b[j] + a[j];
q += b[i + k];
} else {
for (int j = i; j <= i + k - 1; j++)
q += b[j] + a[j];
q += b[i - 1];
}
// cout<<q<<endl;
if (q > cnt)
cnt = q;
i++;
}
}
cout << cnt << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
using namespace std;
string s;
int n, k;
bool f[201011];
int a[201101], b[201101];
int main() {
cin >> n >> k;
cin >> s;
int ans = 0, ans1 = 0, tt = 1, ttt = 1, zero = 0, one = 0, cnt = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '1')
ans++;
else {
if (ans != 0) {
b[tt++] = ans;
one += ans;
ans = 0;
}
}
if (i == n - 1) {
if (ans != 0) {
b[tt++] = ans;
one += ans;
ans = 0;
}
}
if (s[i] == '0')
ans1++;
else {
if (ans1 != 0) {
a[ttt++] = ans1;
zero += ans1;
ans1 = 0;
}
}
if (i == n - 1) {
if (ans1 != 0) {
a[ttt++] = ans1;
zero += ans1;
ans1 = 0;
}
}
}
// for (int i=1;i<=tt;i++) cout<<b[i]<<endl;
if (k == 0) {
for (int i = 1; i <= tt - 1; i++)
if (b[i] > cnt)
cnt = b[i];
} else if (k >= zero) {
cnt = s.size();
} else if (k > ttt - 1)
cnt = s.size();
else {
int i = 1;
while (i + k - 1 <= ttt - 1) {
int q = 0;
if (s[0] == '1') {
for (int j = i; j <= i + k - 1; j++)
q += b[j] + a[j];
q += b[i + k];
} else {
for (int j = i; j <= i + k - 1; j++)
q += b[j] + a[j];
q += b[i - 1];
}
// cout<<q<<endl;
if (q > cnt)
cnt = q;
i++;
}
}
cout << cnt << endl;
return 0;
}
| replace | 7 | 9 | 7 | 9 | 0 | |
p03074 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef vector<ll> V;
typedef vector<V> VV;
int main() {
// Happy hacking!
ll n, k;
string s;
cin >> n >> k;
cin >> s;
V blk_size;
V blk_dist;
ll t_size = 0;
ll t_dist = 0;
bool is_in_blk = false;
if (s[0] == '0') {
is_in_blk = false;
blk_size.push_back(0);
} else {
is_in_blk = true;
}
for (ll i = 0; i < n; i++) {
char c = s[i];
if (is_in_blk) {
if (c == '0') {
is_in_blk = false;
blk_size.push_back(t_size);
t_dist = 1;
} else {
t_size++;
}
} else {
if (c == '0') {
t_dist++;
} else {
is_in_blk = true;
blk_dist.push_back(t_dist);
t_size = 1;
}
}
}
if (is_in_blk) {
blk_size.push_back(t_size);
blk_dist.push_back(0);
} else {
blk_dist.push_back(t_dist);
}
ll score_max = 0;
// calc initial score
ll score_prev = 0;
ll init_idx = 0;
for (; init_idx < k; init_idx++) {
if (init_idx >= blk_size.size())
break;
score_prev += blk_size[init_idx] + blk_dist[init_idx];
}
if (init_idx < blk_size.size()) {
score_prev += blk_size[init_idx];
}
score_max = score_prev;
for (ll i = 1; i < blk_size.size() - k + 1; i++) {
ll score = score_prev;
score -= blk_size[i - 1] + blk_dist[i - 1]; // remove the head block
score += blk_dist[i + k - 1]; // expand
if (i + k < blk_size.size()) {
score += blk_size[i + k];
}
if (score > score_max) {
score_max = score;
}
score_prev = score;
}
cout << score_max << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef vector<ll> V;
typedef vector<V> VV;
int main() {
// Happy hacking!
ll n, k;
string s;
cin >> n >> k;
cin >> s;
V blk_size;
V blk_dist;
ll t_size = 0;
ll t_dist = 0;
bool is_in_blk = false;
if (s[0] == '0') {
is_in_blk = false;
blk_size.push_back(0);
} else {
is_in_blk = true;
}
for (ll i = 0; i < n; i++) {
char c = s[i];
if (is_in_blk) {
if (c == '0') {
is_in_blk = false;
blk_size.push_back(t_size);
t_dist = 1;
} else {
t_size++;
}
} else {
if (c == '0') {
t_dist++;
} else {
is_in_blk = true;
blk_dist.push_back(t_dist);
t_size = 1;
}
}
}
if (is_in_blk) {
blk_size.push_back(t_size);
blk_dist.push_back(0);
} else {
blk_dist.push_back(t_dist);
}
ll score_max = 0;
// calc initial score
ll score_prev = 0;
ll init_idx = 0;
for (; init_idx < k; init_idx++) {
if (init_idx >= blk_size.size())
break;
score_prev += blk_size[init_idx] + blk_dist[init_idx];
}
if (init_idx < blk_size.size()) {
score_prev += blk_size[init_idx];
}
score_max = score_prev;
for (ll i = 1; i < ((ll)blk_size.size()) - k + 1; i++) {
ll score = score_prev;
score -= blk_size[i - 1] + blk_dist[i - 1]; // remove the head block
score += blk_dist[i + k - 1]; // expand
if (i + k < blk_size.size()) {
score += blk_size[i + k];
}
if (score > score_max) {
score_max = score;
}
score_prev = score;
}
cout << score_max << endl;
return 0;
}
| replace | 70 | 71 | 70 | 71 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
const char sp = ' ';
const char cmm = ',';
const int MOD = 1e9 + 7;
const int INF = 1e9;
const ll LINF = 1e18;
ll mod(ll a, ll b) { return (a % b + b) % b; }
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
void Yes() { cout << "Yes" << endl; }
void No() { cout << "No" << endl; }
void Judge(bool b) { b ? Yes() : No(); }
void YES() { cout << "YES" << endl; }
void NO() { cout << "NO" << endl; }
void JUDGE(bool b) { b ? YES() : NO(); }
ll powMod(ll b, ll e, ll m) {
ll r = 1;
while (e > 0) {
if (e & 1)
r = (r % m) * (b % m) % m;
b = (b % m) * (b % m) % m;
e >>= 1;
}
return r;
}
double distance(ll x1, ll y1, ll x2, ll y2) {
return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}
template <typename T> void ppp(T n) { cout << n << endl; }
template <typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &p) {
return s << "(" << p.first << ", " << p.second << ")";
}
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v) {
int len = v.size();
cout << '[';
for (int i = 0; i < len; ++i) {
s << v[i];
if (i < len - 1)
s << ", ";
}
cout << ']';
return s;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, k;
cin >> n >> k;
string s;
cin >> s;
s += '2';
vector<ll> a;
char head = s[0];
ll num = 1;
for (int i = 1; i <= n; ++i) {
if (s[i] == head) {
++num;
continue;
}
if (s[i] != head or s[i] == '2') {
if (head == '0') {
a.push_back(-num);
} else {
a.push_back(num);
}
head = s[i];
num = 1;
}
}
ll r = 0;
ll cnt = 0;
ll sum = 0;
ll ans = 0;
for (int l = 0; l < n; ++l) {
while (r < n and (cnt < k or a[r] >= 0)) {
if (a[r] < 0)
++cnt;
sum += abs(a[r]);
++r;
}
ans = max(ans, sum);
if (l == r)
++r;
else {
if (a[l] < 0) {
--cnt;
}
sum -= abs(a[l]);
}
}
ppp(ans);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
const char sp = ' ';
const char cmm = ',';
const int MOD = 1e9 + 7;
const int INF = 1e9;
const ll LINF = 1e18;
ll mod(ll a, ll b) { return (a % b + b) % b; }
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
void Yes() { cout << "Yes" << endl; }
void No() { cout << "No" << endl; }
void Judge(bool b) { b ? Yes() : No(); }
void YES() { cout << "YES" << endl; }
void NO() { cout << "NO" << endl; }
void JUDGE(bool b) { b ? YES() : NO(); }
ll powMod(ll b, ll e, ll m) {
ll r = 1;
while (e > 0) {
if (e & 1)
r = (r % m) * (b % m) % m;
b = (b % m) * (b % m) % m;
e >>= 1;
}
return r;
}
double distance(ll x1, ll y1, ll x2, ll y2) {
return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}
template <typename T> void ppp(T n) { cout << n << endl; }
template <typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &p) {
return s << "(" << p.first << ", " << p.second << ")";
}
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v) {
int len = v.size();
cout << '[';
for (int i = 0; i < len; ++i) {
s << v[i];
if (i < len - 1)
s << ", ";
}
cout << ']';
return s;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, k;
cin >> n >> k;
string s;
cin >> s;
s += '2';
vector<ll> a;
char head = s[0];
ll num = 1;
for (int i = 1; i <= n; ++i) {
if (s[i] == head) {
++num;
continue;
}
if (s[i] != head or s[i] == '2') {
if (head == '0') {
a.push_back(-num);
} else {
a.push_back(num);
}
head = s[i];
num = 1;
}
}
ll r = 0;
ll cnt = 0;
ll sum = 0;
ll ans = 0;
for (int l = 0; l < a.size(); ++l) {
while (r < a.size() and (cnt < k or a[r] >= 0)) {
if (a[r] < 0)
++cnt;
sum += abs(a[r]);
++r;
}
ans = max(ans, sum);
if (l == r)
++r;
else {
if (a[l] < 0) {
--cnt;
}
sum -= abs(a[l]);
}
}
ppp(ans);
return 0;
}
| replace | 89 | 91 | 89 | 91 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> a;
rep(i, n) {
if (i == 0) {
if (s[i] == '0')
a.push_back(0);
a.push_back(1);
} else {
if (s[i - 1] == s[i])
a[a.size() - 1]++;
else
a.push_back(1);
}
if (i == n - 1 && s[i] == '0')
a.push_back(0);
}
int m = a.size();
int ans = 0;
if (m <= 2 * k + 1)
ans = n;
else {
vector<vector<int>> asum(2 * k + 1, vector<int>(m, 0));
asum[0] = a;
for (int i = 1; i < 2 * k + 1; i++) {
rep(j, m) {
if (i + j >= m)
continue;
asum[i][j] = asum[i - 1][j] + a[j + i];
}
}
for (int i = 0; i < m - 2 * k; i += 2) {
ans = max(ans, asum[2 * k][i]);
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> a;
rep(i, n) {
if (i == 0) {
if (s[i] == '0')
a.push_back(0);
a.push_back(1);
} else {
if (s[i - 1] == s[i])
a[a.size() - 1]++;
else
a.push_back(1);
}
if (i == n - 1 && s[i] == '0')
a.push_back(0);
}
int m = a.size();
int ans = 0;
if (m <= 2 * k + 1)
ans = n;
int b = 0;
rep(i, m) {
b += a[i];
if (i - 2 * k - 1 >= 0)
b -= a[i - 2 * k - 1];
if (i % 2 == 0)
ans = max(ans, b);
}
cout << ans << endl;
}
| replace | 28 | 41 | 28 | 35 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const double PI = 3.14159265358979;
const ll INF = pow(10, 18);
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, n) FOR(i, 0, n)
string abc = "abcdefghijklmnopqrstuvwxyz";
string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int main() {
ll n, k;
cin >> n >> k;
string s;
cin >> s;
vl a(n + 5, 0);
ll j = 0;
if (s[0] == '0') {
j++;
}
a[j]++;
FOR(i, 1, n) {
if (s[i] == s[i - 1]) {
a[j]++;
} else {
j++;
a[j]++;
}
}
ll t = 0;
rep(i, 2 * k + 1) { t += a[i]; }
ll ans = t;
for (ll i = 0; 2 * k + i < n; i += 2) {
t -= a[i] + a[i + 1];
t += a[2 * k + 1 + i] + a[2 * k + 2 + i];
ans = max(ans, t);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const double PI = 3.14159265358979;
const ll INF = pow(10, 18);
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, n) FOR(i, 0, n)
string abc = "abcdefghijklmnopqrstuvwxyz";
string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int main() {
ll n, k;
cin >> n >> k;
string s;
cin >> s;
vl a(n + 2 * k + 5, 0);
ll j = 0;
if (s[0] == '0') {
j++;
}
a[j]++;
FOR(i, 1, n) {
if (s[i] == s[i - 1]) {
a[j]++;
} else {
j++;
a[j]++;
}
}
ll t = 0;
rep(i, 2 * k + 1) { t += a[i]; }
ll ans = t;
for (ll i = 0; 2 * k + i < n; i += 2) {
t -= a[i] + a[i + 1];
t += a[2 * k + 1 + i] + a[2 * k + 2 + i];
ans = max(ans, t);
}
cout << ans << endl;
} | replace | 19 | 20 | 19 | 20 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef pair<P, int> T;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define sz(x) ((int)(x).size())
#define fi first
#define sec second
#define all(x) (x).begin(), (x).end()
#define sq(x) ((x) * (x))
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); (i)++)
#define repn(i, a, n) for (int(i) = (a); (i) < (int)(n); (i)++)
#define EQ(a, b) (abs((a) - (b)) < eps)
template <class T> void chmin(T &a, const T &b) {
if (a > b)
a = b;
}
template <class T> void chmax(T &a, const T &b) {
if (a < b)
a = b;
}
int N, K;
string s;
deque<P> q;
void push_back(int v) {
if (q.empty())
q.push_back(P(v, 1));
else if (q.back().fi == v)
q.back().sec++;
else
q.push_back(P(v, 1));
}
void pop_front() {
assert(!q.empty());
if (q.front().sec == 1)
q.pop_front();
else
q.front().sec--;
}
void clear() {
while (!q.empty())
q.pop_back();
}
bool check(int k) {
clear();
for (int i = 0; i < N; i++) {
if (i >= k)
pop_front();
push_back(s[i] - '0');
if (i >= k - 1) {
int sz = q.size();
if (q.front().fi == 1)
sz--;
if (sz != 0 && q.back().fi == 1)
sz--;
assert(sz % 2 == 1);
if ((sz + 1) / 2 <= K)
return true;
}
}
return false;
}
int main() {
cin >> N >> K;
cin >> s;
int l = 1, r = N + 1;
while (r - l > 1) {
int mid = (l + r) / 2;
if (check(mid))
l = mid;
else
r = mid;
}
cout << l << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef pair<P, int> T;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define sz(x) ((int)(x).size())
#define fi first
#define sec second
#define all(x) (x).begin(), (x).end()
#define sq(x) ((x) * (x))
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); (i)++)
#define repn(i, a, n) for (int(i) = (a); (i) < (int)(n); (i)++)
#define EQ(a, b) (abs((a) - (b)) < eps)
template <class T> void chmin(T &a, const T &b) {
if (a > b)
a = b;
}
template <class T> void chmax(T &a, const T &b) {
if (a < b)
a = b;
}
int N, K;
string s;
deque<P> q;
void push_back(int v) {
if (q.empty())
q.push_back(P(v, 1));
else if (q.back().fi == v)
q.back().sec++;
else
q.push_back(P(v, 1));
}
void pop_front() {
assert(!q.empty());
if (q.front().sec == 1)
q.pop_front();
else
q.front().sec--;
}
void clear() {
while (!q.empty())
q.pop_back();
}
bool check(int k) {
clear();
for (int i = 0; i < N; i++) {
if (i >= k)
pop_front();
push_back(s[i] - '0');
if (i >= k - 1) {
int sz = q.size();
if (q.front().fi == 1)
sz--;
if (sz != 0 && q.back().fi == 1)
sz--;
if ((sz + 1) / 2 <= K)
return true;
}
}
return false;
}
int main() {
cin >> N >> K;
cin >> s;
int l = 1, r = N + 1;
while (r - l > 1) {
int mid = (l + r) / 2;
if (check(mid))
l = mid;
else
r = mid;
}
cout << l << endl;
return 0;
} | delete | 61 | 62 | 61 | 61 | 0 | |
p03074 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <queue>
using namespace std;
int main() {
int N, K;
string line;
cin >> N >> K;
cin >> line;
int now = 1;
int cnt = 0;
vector<int> lines;
for (int i = 0; i < N; i++) {
if (line[i] == (char)('0' + now)) {
cnt++;
} else {
lines.push_back(cnt);
now = 1 - now;
cnt = 1;
}
}
if (cnt != 0) {
lines.push_back(cnt);
}
if (lines.size() % 2 == 0) {
lines.push_back(0); // 1-0-1-0-1-...-0-1
}
int add = 2 * K + 1;
int ans = 0;
/// normal
// 1-0-1... start from even number
/*for (int i = 0; i < lines.size(); i+=2) {
int tmp = 0;
int left = i;
int right = min(i + add, (int)lines.size());
for (int j = left; j < right; j++) {
tmp += lines[j];
}
ans = max(tmp, ans);
}*/
/// syakutori-method
/*
* int left = 0, right = 0;
* int tmp = 0; // sum of [left, right)
* for (int i = 0; i < lines.size(); i+=2) {
* int next_left = i;
* int next_right = min(i+add, (int)lines.size());
*
* while (next_left > left) {
* tmp -= lines[left];
* left++;
* }
* while (next_right > right) {
* tmp += lines[right];
* right++;
* }
* ans = max(tmp, ans);
* }
*/
/// ruisekiwa
// 0 1 2 3 4 5 6
// 0 1 2 3 4 5
vector<int> sum(lines.size() + 1);
for (int i = 0; i < sum.size(); i++) {
sum[i + 1] = sum[i] + lines[i];
}
for (int i = 0; i < lines.size(); i += 2) {
int left = i;
int right = min(i + add, (int)lines.size());
int tmp = sum[right] - sum[left];
ans = max(tmp, ans);
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <queue>
using namespace std;
int main() {
int N, K;
string line;
cin >> N >> K;
cin >> line;
int now = 1;
int cnt = 0;
vector<int> lines;
for (int i = 0; i < N; i++) {
if (line[i] == (char)('0' + now)) {
cnt++;
} else {
lines.push_back(cnt);
now = 1 - now;
cnt = 1;
}
}
if (cnt != 0) {
lines.push_back(cnt);
}
if (lines.size() % 2 == 0) {
lines.push_back(0); // 1-0-1-0-1-...-0-1
}
int add = 2 * K + 1;
int ans = 0;
/// normal
// 1-0-1... start from even number
/*for (int i = 0; i < lines.size(); i+=2) {
int tmp = 0;
int left = i;
int right = min(i + add, (int)lines.size());
for (int j = left; j < right; j++) {
tmp += lines[j];
}
ans = max(tmp, ans);
}*/
/// syakutori-method
/*
* int left = 0, right = 0;
* int tmp = 0; // sum of [left, right)
* for (int i = 0; i < lines.size(); i+=2) {
* int next_left = i;
* int next_right = min(i+add, (int)lines.size());
*
* while (next_left > left) {
* tmp -= lines[left];
* left++;
* }
* while (next_right > right) {
* tmp += lines[right];
* right++;
* }
* ans = max(tmp, ans);
* }
*/
/// ruisekiwa
// 0 1 2 3 4 5 6
// 0 1 2 3 4 5
vector<int> sum(lines.size() + 1);
for (int i = 0; i < lines.size(); i++) {
sum[i + 1] = sum[i] + lines[i];
}
for (int i = 0; i < lines.size(); i += 2) {
int left = i;
int right = min(i + add, (int)lines.size());
int tmp = sum[right] - sum[left];
ans = max(tmp, ans);
}
cout << ans << endl;
return 0;
}
| replace | 67 | 68 | 67 | 68 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
#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 ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define ssrep(i, s, t) for (int i = s; i <= t; ++i)
#define rng(a) a.begin(), a.end()
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define chmax(x, y) (x = max(x, y))
#define chmin(x, y) (x = min(x, y))
using pi = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using ld = long double;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "{";
rep(i, (int)v.size()) {
if (i)
os << ",";
os << v[i];
}
os << "}";
return os;
}
template <typename T, size_t S> void printArray(const T (&array)[S]) {
for (auto val : array)
std::cout << val << ", ";
std::cout << "\n";
}
const int mod = 1e9 + 7;
const int inf = 1e9 + 5;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << std::setprecision(10);
int n, k;
std::cin >> n >> k;
string s;
std::cin >> s;
vi cnt;
rep(i, n) {
int sum = 0;
while (i < n && s[i] == s[i + 1])
i++, sum++;
sum++;
cnt.pb(sum);
}
int start = (s[0] == '1'), len = cnt.size();
srep(i, 1, n) cnt[i] += cnt[i - 1];
int ans = (s[0] == '1' ? cnt[0] : 0);
for (int i = start; i < len; i += 2) {
int l = max(0, i - 1), r = min(len - 1, i + 2 * (k - 1) + 1);
if (l - 1 >= 0)
chmax(ans, cnt[r] - cnt[l - 1]);
else
chmax(ans, cnt[r]);
}
std::cout << ans << "\n";
}
| #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
#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 ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define ssrep(i, s, t) for (int i = s; i <= t; ++i)
#define rng(a) a.begin(), a.end()
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define chmax(x, y) (x = max(x, y))
#define chmin(x, y) (x = min(x, y))
using pi = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using ld = long double;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "{";
rep(i, (int)v.size()) {
if (i)
os << ",";
os << v[i];
}
os << "}";
return os;
}
template <typename T, size_t S> void printArray(const T (&array)[S]) {
for (auto val : array)
std::cout << val << ", ";
std::cout << "\n";
}
const int mod = 1e9 + 7;
const int inf = 1e9 + 5;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << std::setprecision(10);
int n, k;
std::cin >> n >> k;
string s;
std::cin >> s;
vi cnt;
rep(i, n) {
int sum = 0;
while (i < n && s[i] == s[i + 1])
i++, sum++;
sum++;
cnt.pb(sum);
}
int start = (s[0] == '1'), len = cnt.size();
srep(i, 1, len) cnt[i] += cnt[i - 1];
int ans = (s[0] == '1' ? cnt[0] : 0);
for (int i = start; i < len; i += 2) {
int l = max(0, i - 1), r = min(len - 1, i + 2 * (k - 1) + 1);
if (l - 1 >= 0)
chmax(ans, cnt[r] - cnt[l - 1]);
else
chmax(ans, cnt[r]);
}
std::cout << ans << "\n";
}
| replace | 71 | 72 | 71 | 72 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
vector<ll> sum;
ll i;
void pre_process(vector<ll> &a, vector<ll> &s) { // 累積和のvector
ll n = (ll)a.size();
s.assign(n + 1, 0);
for (i = 0; i < n; i++) {
s[i + 1] = s[i] + a[i];
}
}
ll query(ll i, ll j, vector<ll> &s) { // 区間[i,j]の和
return s[j] - s[i];
}
int main() {
ll n, k;
cin >> n >> k;
string s;
cin >> s;
vector<ll> a;
if (n == 1) {
cout << "1" << endl;
return 0;
}
vector<ll> Nums;
int now = 1; // 今見ている数
int cnt = 0; // nowがいくつ並んでいるか
for (i = 0; i < n; i++) {
if (s[i] == (char)('0' + now)) {
cnt++;
} else {
Nums.push_back(cnt); // 最初に1がなければ0が追加される
now = 1 - now; // 0 1の交換
cnt = 1; // 新しいのをカウント
}
}
if (cnt != 0) {
Nums.push_back(cnt);
}
// 0で終わっていたらたす
if (Nums.size() % 2 == 0) {
Nums.push_back(0);
}
// 1で始まり1で終わる
pre_process(Nums, sum);
ll add = 2 * k + 1;
ll ans = -1;
for (i = 1; i <= sum.size() - add; i += 2) {
if (i + add - 1 > sum.size()) {
cout << n << endl;
}
ans = max(ans, query(i - 1, i + add - 1, sum));
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
vector<ll> sum;
ll i;
void pre_process(vector<ll> &a, vector<ll> &s) { // 累積和のvector
ll n = (ll)a.size();
s.assign(n + 1, 0);
for (i = 0; i < n; i++) {
s[i + 1] = s[i] + a[i];
}
}
ll query(ll i, ll j, vector<ll> &s) { // 区間[i,j]の和
return s[j] - s[i];
}
int main() {
ll n, k;
cin >> n >> k;
string s;
cin >> s;
vector<ll> a;
if (n == 1) {
cout << "1" << endl;
return 0;
}
vector<ll> Nums;
int now = 1; // 今見ている数
int cnt = 0; // nowがいくつ並んでいるか
for (i = 0; i < n; i++) {
if (s[i] == (char)('0' + now)) {
cnt++;
} else {
Nums.push_back(cnt); // 最初に1がなければ0が追加される
now = 1 - now; // 0 1の交換
cnt = 1; // 新しいのをカウント
}
}
if (cnt != 0) {
Nums.push_back(cnt);
}
// 0で終わっていたらたす
if (Nums.size() % 2 == 0) {
Nums.push_back(0);
}
// 1で始まり1で終わる
pre_process(Nums, sum);
ll add = 2 * k + 1;
ll ans = -1;
for (i = 1; i <= sum.size() - add; i += 2) {
if (i + add - 1 > sum.size()) {
cout << n << endl;
return 0;
}
ans = max(ans, query(i - 1, i + add - 1, sum));
}
cout << ans << endl;
return 0;
} | insert | 58 | 58 | 58 | 59 | 0 | |
p03074 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const int N = 100010;
int n, k;
char a[N];
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i];
int maxx = 0;
for (int i = 1; i <= n; i++) {
int o = k, ans = 0, j = i;
while (o > 0 && j <= n) {
while (a[j] == '1' && j <= n)
ans++, j++;
o--;
while (a[j] == '0' && j <= n)
ans++, j++;
}
while (a[j] == '1' && j <= n)
ans++, j++;
maxx = max(maxx, ans);
}
cout << maxx;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int N = 100010;
int n, k;
char a[N];
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i];
int maxx = 0, h = 1, t = 1, ans = 0;
for (int i = 1; i <= k; i++) {
for (; a[t] == '1'; t++)
ans++;
for (; a[t] == '0'; t++)
ans++;
}
for (; a[t] == '1'; t++)
ans++;
maxx = ans;
for (; a[h] == '1'; h++)
ans--;
for (; a[t] == '1'; t++)
ans++;
maxx = max(maxx, ans);
while (h <= t && h <= n) {
for (; a[h] == '0'; h++)
ans--;
for (; a[t] == '0' && t <= n; t++)
ans++;
for (; a[t] == '1' && t <= n; t++)
ans++;
maxx = max(ans, maxx);
for (; a[h] == '1'; h++)
ans--;
for (; a[t] == '1' && t <= n; t++)
ans++;
maxx = max(maxx, ans);
}
cout << maxx;
return 0;
} | replace | 9 | 21 | 9 | 36 | TLE | |
p03074 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
string s;
cin >> n >> k;
cin >> s;
vector<int> Nums;
int cnt = 0;
int now = 1;
for (int i = 0; i < n; i++) {
if (s[i] == (char)('0' + now))
cnt++;
else {
Nums.push_back(cnt);
now = 1 - now;
cnt = 1;
}
}
if (cnt != 0)
Nums.push_back(cnt);
if (Nums.size() % 2 == 0)
Nums.push_back(0);
int Add = 2 * k + 1;
vector<int> sum(Nums.size() + 1);
for (int i = 0; i < sum.size(); i++) {
sum[i + 1] = sum[i] + Nums[i];
}
int ans = 0;
int temp = 0;
for (int i = 0; i < Nums.size(); i += 2) {
int left = i;
int right = min(i + Add, (int)Nums.size());
int temp = sum[right] - sum[left];
ans = max(ans, temp);
}
cout << ans << '\n';
}
| #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
string s;
cin >> n >> k;
cin >> s;
vector<int> Nums;
int cnt = 0;
int now = 1;
for (int i = 0; i < n; i++) {
if (s[i] == (char)('0' + now))
cnt++;
else {
Nums.push_back(cnt);
now = 1 - now;
cnt = 1;
}
}
if (cnt != 0)
Nums.push_back(cnt);
if (Nums.size() % 2 == 0)
Nums.push_back(0);
int Add = 2 * k + 1;
vector<int> sum(Nums.size() + 1);
for (int i = 0; i < Nums.size(); i++) {
sum[i + 1] = sum[i] + Nums[i];
}
int ans = 0;
int temp = 0;
for (int i = 0; i < Nums.size(); i += 2) {
int left = i;
int right = min(i + Add, (int)Nums.size());
int temp = sum[right] - sum[left];
ans = max(ans, temp);
}
cout << ans << '\n';
}
| replace | 34 | 35 | 34 | 35 | 0 | |
p03074 | C++ | Runtime Error | #define DEBUG 0
/**
* File : D.cpp
* Author : Kazune Takahashi
* Created : 4/13/2019, 9:08:24 PM
* Powered by Visual Studio Code
*/
#include <algorithm> // do { } while ( next_permutation(A, A+xxx) ) ;
#include <chrono> // std::chrono::system_clock::time_point start_time, end_time;
#include <complex>
#include <functional>
#include <iomanip> // << fixed << setprecision(xxx)
#include <iostream>
#include <map> // if (M.find(key) != M.end()) { }
#include <queue>
#include <random> // auto rd = bind(uniform_int_distribution<int>(0, 9), mt19937(10101010));
#include <set>
#include <stack>
#include <string> // to_string(nnn) // substr(m, n) // stoi(nnn)
#include <tuple>
#include <vector>
// start = std::chrono::system_clock::now();
// double elapsed =
// std::chrono::duration_cast<std::chrono::milliseconds>(end_time-start_time).count();
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
using namespace std;
typedef long long ll;
// const int dx[4] = {1, 0, -1, 0};
// const int dy[4] = {0, 1, 0, -1};
// const int C = 1e6+10;
// const ll M = 1000000007;
int N, K;
string S;
vector<int> V;
int main() {
cin >> N >> K >> S;
bool one = true;
int t = 0;
for (auto i = 0; i < N; i++) {
if (S[i] == '0' && one) {
V.push_back(t);
one = false;
t = 1;
} else if (S[i] == '1' && one) {
t++;
} else if (S[i] == '0' && !one) {
t++;
} else {
V.push_back(t);
one = true;
t = 1;
}
}
V.push_back(t);
if (!one) {
V.push_back(0);
}
#if DEBUG == 1
for (auto x : V) {
cerr << x << " ";
}
cerr << endl;
#endif
vector<int> imos(V.size() + 1, 0);
for (auto i = 0; i < N; i++) {
imos[i + 1] = imos[i] + V[i];
}
#if DEBUG == 1
for (auto x : imos) {
cerr << x << " ";
}
cerr << endl;
#endif
int seg = min(2 * K + 1, (int)V.size());
int ans = 0;
for (auto i = 0; i + seg <= (int)V.size(); i++) {
if (i % 2 == 0) {
ans = max(ans, imos[i + seg] - imos[i]);
}
}
cout << ans << endl;
} | #define DEBUG 0
/**
* File : D.cpp
* Author : Kazune Takahashi
* Created : 4/13/2019, 9:08:24 PM
* Powered by Visual Studio Code
*/
#include <algorithm> // do { } while ( next_permutation(A, A+xxx) ) ;
#include <chrono> // std::chrono::system_clock::time_point start_time, end_time;
#include <complex>
#include <functional>
#include <iomanip> // << fixed << setprecision(xxx)
#include <iostream>
#include <map> // if (M.find(key) != M.end()) { }
#include <queue>
#include <random> // auto rd = bind(uniform_int_distribution<int>(0, 9), mt19937(10101010));
#include <set>
#include <stack>
#include <string> // to_string(nnn) // substr(m, n) // stoi(nnn)
#include <tuple>
#include <vector>
// start = std::chrono::system_clock::now();
// double elapsed =
// std::chrono::duration_cast<std::chrono::milliseconds>(end_time-start_time).count();
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
using namespace std;
typedef long long ll;
// const int dx[4] = {1, 0, -1, 0};
// const int dy[4] = {0, 1, 0, -1};
// const int C = 1e6+10;
// const ll M = 1000000007;
int N, K;
string S;
vector<int> V;
int main() {
cin >> N >> K >> S;
bool one = true;
int t = 0;
for (auto i = 0; i < N; i++) {
if (S[i] == '0' && one) {
V.push_back(t);
one = false;
t = 1;
} else if (S[i] == '1' && one) {
t++;
} else if (S[i] == '0' && !one) {
t++;
} else {
V.push_back(t);
one = true;
t = 1;
}
}
V.push_back(t);
if (!one) {
V.push_back(0);
}
#if DEBUG == 1
for (auto x : V) {
cerr << x << " ";
}
cerr << endl;
#endif
vector<int> imos(V.size() + 1, 0);
for (auto i = 0; i < (int)V.size(); i++) {
imos[i + 1] = imos[i] + V[i];
}
#if DEBUG == 1
for (auto x : imos) {
cerr << x << " ";
}
cerr << endl;
#endif
int seg = min(2 * K + 1, (int)V.size());
int ans = 0;
for (auto i = 0; i + seg <= (int)V.size(); i++) {
if (i % 2 == 0) {
ans = max(ans, imos[i + seg] - imos[i]);
}
}
cout << ans << endl;
} | replace | 75 | 76 | 75 | 76 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#ifdef DEBUG
freopen("in.txt", "r", stdin);
#endif
vector<int> zero, one;
vector<pii> v;
int n, k;
string s;
cin >> n >> k >> s;
if (n == 1) {
cout << 1 << '\n';
return 0;
}
int cnt = 1;
if (s[0] == '0')
one.push_back(0);
for (int i = 1; i < s.length(); i++) {
if (s[i] != s[i - 1]) {
if (s[i - 1] == '0')
zero.push_back(cnt);
else
one.push_back(cnt);
cnt = 0;
}
cnt++;
}
if (s[s.length() - 1] == '0') {
one.push_back(0);
zero.push_back(cnt);
} else
one.push_back(cnt);
for (int i = 0; i < zero.size(); i++) {
v.push_back(pii(zero[i] + one[i] + one[i + 1], zero[i] + one[i + 1]));
}
k = min(k, (int)zero.size());
int m = -1;
for (int i = 0; i < v.size() - k + 1; i++) {
int tmp = v[i].first;
for (int j = i + 1; j < i + k; j++) {
tmp += v[j].second;
}
m = max(m, tmp);
}
cout << m << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#ifdef DEBUG
freopen("in.txt", "r", stdin);
#endif
vector<int> zero, one;
vector<pii> v;
int n, k;
string s;
cin >> n >> k >> s;
if (n == 1) {
cout << 1 << '\n';
return 0;
}
int cnt = 1;
if (s[0] == '0')
one.push_back(0);
for (int i = 1; i < s.length(); i++) {
if (s[i] != s[i - 1]) {
if (s[i - 1] == '0')
zero.push_back(cnt);
else
one.push_back(cnt);
cnt = 0;
}
cnt++;
}
if (s[s.length() - 1] == '0') {
one.push_back(0);
zero.push_back(cnt);
} else
one.push_back(cnt);
for (int i = 0; i < zero.size(); i++) {
v.push_back(pii(zero[i] + one[i] + one[i + 1], zero[i] + one[i + 1]));
}
k = min(k, (int)v.size());
if (v.size() == 0) {
cout << n << '\n';
return 0;
}
int m = -1;
for (int i = 0; i < v.size() - k + 1; i++) {
int tmp = v[i].first;
for (int j = i + 1; j < i + k; j++) {
tmp += v[j].second;
}
m = max(m, tmp);
}
cout << m << '\n';
return 0;
}
| replace | 48 | 49 | 48 | 54 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("../../a.in", "r", stdin);
freopen("../../a.out", "w", stdout);
#endif
int n, k, ct = 1;
vector<int> v;
cin >> n >> k;
string s;
cin >> s;
for (int i = 1; i < n; i++) {
if (s[i] != s[i - 1]) {
v.push_back(ct);
ct = 1;
} else
++ct;
}
v.push_back(ct);
if (s[0] == '0') {
long long mx = 0;
for (int i = 0; i < v.size(); i += 2) {
long long sum = 0;
for (int j = i, nl = 0; nl < k && j < v.size(); j += 2, nl++) {
if (j == i && j - 1 >= 0)
sum += v[j - 1];
if (j + 1 < v.size())
sum += v[j] + v[j + 1];
else
sum += v[j];
}
mx = max(mx, sum);
}
cout << mx << "\n";
} else {
long long mx = 0;
for (int i = 1; i < v.size(); i += 2) {
long long sum = 0;
for (int j = i, nl = 0; nl < k && j < v.size(); j += 2, nl++) {
if (j == i && j - 1 >= 0)
sum += v[j - 1];
if (j + 1 < v.size())
sum += v[j] + v[j + 1];
else
sum += v[j];
}
mx = max(mx, sum);
}
if (mx == 0)
mx = v.front();
cout << mx << "\n";
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// #ifndef ONLINE_JUDGE
// freopen("../../a.in","r",stdin);
// freopen("../../a.out","w",stdout);
// #endif
int n, k, ct = 1;
vector<int> v;
cin >> n >> k;
string s;
cin >> s;
for (int i = 1; i < n; i++) {
if (s[i] != s[i - 1]) {
v.push_back(ct);
ct = 1;
} else
++ct;
}
v.push_back(ct);
if (s[0] == '0') {
long long mx = 0;
for (int i = 0; i < v.size(); i += 2) {
long long sum = 0;
for (int j = i, nl = 0; nl < k && j < v.size(); j += 2, nl++) {
if (j == i && j - 1 >= 0)
sum += v[j - 1];
if (j + 1 < v.size())
sum += v[j] + v[j + 1];
else
sum += v[j];
}
mx = max(mx, sum);
}
cout << mx << "\n";
} else {
long long mx = 0;
for (int i = 1; i < v.size(); i += 2) {
long long sum = 0;
for (int j = i, nl = 0; nl < k && j < v.size(); j += 2, nl++) {
if (j == i && j - 1 >= 0)
sum += v[j - 1];
if (j + 1 < v.size())
sum += v[j] + v[j + 1];
else
sum += v[j];
}
mx = max(mx, sum);
}
if (mx == 0)
mx = v.front();
cout << mx << "\n";
}
} | replace | 8 | 12 | 8 | 12 | -11 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP1(i, n) for (int i = 1, i##_len = (n); i < i##_len; ++i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define pow(x) x *x
#define ll long long
static const ll MAX = 1000000;
static const ll INFTY = 1e12;
static const ll MOD = 1000000007;
template <typename T> inline string toString(const T &a) {
ostringstream oss;
oss << a;
return oss.str();
};
struct edge {
ll to, cost;
};
using Graph = vector<vector<int>>;
using _Graph = vector<vector<edge>>;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
// 深さ優先探索
vector<bool> seen;
vector<int> colors;
int H, W, N;
int sx, sy, gx, gy;
vector<vector<char>> field;
vector<vector<int>> dist;
// vector<pair<int, int>> gx, gy;
deque<pair<int, int>> que;
typedef vector<vector<int>> Matrix;
const int INF = 100000000;
int main() {
ll N, K;
string S;
cin >> N >> K;
cin >> S;
vector<int> num;
int pos = 0;
REP(i, S.length() - 1) {
if (S[i] != S[i + 1]) {
num.push_back(i - pos + 1);
pos = i + 1;
}
}
num.push_back(S.length() - pos);
if (S[0] == '0')
num.insert(num.begin(), 0);
if (S[S.length() - 1] == '0')
num.push_back(0);
int span = 2 * K + 1;
// if(span >= num.size()-1)span=num.size()-1;
vector<int> sum(num.size() + 1, 0);
REP(i, num.size() + 1) { sum[i + 1] = sum[i] + num[i]; }
int max_ = 0;
for (int i = sum.size() - 1; i >= 0; i -= 2) {
// cout << span << endl;
if (i - span < 0) {
max_ = max(max_, sum[i] - sum[0]);
} else {
max_ = max(max_, sum[i] - sum[i - span]);
}
// cout << max_ << endl;
}
// REP(i, sum.size()){
// cout << sum[i] << " ";
// }
cout << max_ << endl;
}
/*
_ooOoo_
o8888888o
88" . "88
(| -_- |)
O\ = /O
____/`---'\____
.' \\| |// `.
/ \\||| : |||// \
/ _||||| -:- |||||- \
| | \\\ - /// | |
| \_| ''\---/'' | |
\ .-\__ `-` ___/-. /
___`. .' /--.--\ `. . __
."" '< `.___\_<|>_/___.' >'"".
| | : `- \`.;`\ _ /`;.`/ - ` : | |
\ \ `-. \_ __\ /__ _/ .-` / /
======`-.____`-.___\_____/___.-`____.-'======
`=---='
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
pass System Test!
*/
| #include <bits/stdc++.h>
using namespace std;
#define REP1(i, n) for (int i = 1, i##_len = (n); i < i##_len; ++i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define pow(x) x *x
#define ll long long
static const ll MAX = 1000000;
static const ll INFTY = 1e12;
static const ll MOD = 1000000007;
template <typename T> inline string toString(const T &a) {
ostringstream oss;
oss << a;
return oss.str();
};
struct edge {
ll to, cost;
};
using Graph = vector<vector<int>>;
using _Graph = vector<vector<edge>>;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
// 深さ優先探索
vector<bool> seen;
vector<int> colors;
int H, W, N;
int sx, sy, gx, gy;
vector<vector<char>> field;
vector<vector<int>> dist;
// vector<pair<int, int>> gx, gy;
deque<pair<int, int>> que;
typedef vector<vector<int>> Matrix;
const int INF = 100000000;
int main() {
ll N, K;
string S;
cin >> N >> K;
cin >> S;
vector<int> num;
int pos = 0;
REP(i, S.length() - 1) {
if (S[i] != S[i + 1]) {
num.push_back(i - pos + 1);
pos = i + 1;
}
}
num.push_back(S.length() - pos);
if (S[0] == '0')
num.insert(num.begin(), 0);
if (S[S.length() - 1] == '0')
num.push_back(0);
int span = 2 * K + 1;
// if(span >= num.size()-1)span=num.size()-1;
vector<int> sum(num.size() + 1, 0);
REP(i, num.size()) { sum[i + 1] = sum[i] + num[i]; }
int max_ = 0;
for (int i = sum.size() - 1; i >= 0; i -= 2) {
// cout << span << endl;
if (i - span < 0) {
max_ = max(max_, sum[i] - sum[0]);
} else {
max_ = max(max_, sum[i] - sum[i - span]);
}
// cout << max_ << endl;
}
// REP(i, sum.size()){
// cout << sum[i] << " ";
// }
cout << max_ << endl;
}
/*
_ooOoo_
o8888888o
88" . "88
(| -_- |)
O\ = /O
____/`---'\____
.' \\| |// `.
/ \\||| : |||// \
/ _||||| -:- |||||- \
| | \\\ - /// | |
| \_| ''\---/'' | |
\ .-\__ `-` ___/-. /
___`. .' /--.--\ `. . __
."" '< `.___\_<|>_/___.' >'"".
| | : `- \`.;`\ _ /`;.`/ - ` : | |
\ \ `-. \_ __\ /__ _/ .-` / /
======`-.____`-.___\_____/___.-`____.-'======
`=---='
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
pass System Test!
*/
| replace | 68 | 69 | 68 | 69 | 0 | |
p03074 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
const int MAX = 700000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
/*第二引数で第一引数を割ったときの切り上げの計算*/
long long int maxtime(long long int x, long long int y) {
return (x + y - 1) / y;
}
/*最大公約数*/
long long int lcm(long long int number1, long long int number2) {
long long int m = number1;
long long int n = number2;
if (number2 > number1) {
m = number2;
n = number1;
}
long long int s = -1;
while (s != 0) {
s = m % n;
m = n;
n = s;
}
return m;
}
/*最大公倍数*/
long long int gcd(long long int number1, long long int number2) {
long long int m = number1;
long long int n = number2;
return m / lcm(m, n) * n;
}
int main() {
int n, k;
cin >> n >> k;
string s;
vector<int> length;
vector<int> check;
cin >> s;
int renzoku = 0;
char buck = ' ';
for (int i = 0; i < s.size(); i++) {
if (i == 0) {
renzoku = 1;
buck = s[i];
continue;
}
if (buck == s[i]) {
renzoku++;
} else {
length.push_back(renzoku);
if (buck == '0') {
check.push_back(1);
} else {
check.push_back(0);
}
renzoku = 1;
buck = s[i];
}
}
length.push_back(renzoku);
if (buck == '0') {
check.push_back(1);
} else {
check.push_back(0);
}
vector<int> a;
vector<int> b;
a.push_back(0);
b.push_back(0);
for (int i = 0; i < check.size(); i++) {
int t = a[i] + check[i];
a.push_back(t);
}
for (int i = 0; i < length.size(); i++) {
int t = b[i] + length[i];
b.push_back(t);
}
if (k >= a[a.size() - 1]) {
cout << b[b.size() - 1];
return 0;
}
int ans = 0;
for (int f = k; f <= k + k + 1; f++) {
for (int i = 0; i < length.size(); i++) {
if (f + i > a.size() - 1) {
if (a[a.size() - 1] - a[i] > k) {
continue;
}
ans = max(ans, b[a.size() - 1] - b[i]);
continue;
}
if (a[i + f] - a[i] > k) {
continue;
}
ans = max(ans, b[i + f] - b[i]);
}
}
cout << ans;
} | #include "bits/stdc++.h"
using namespace std;
const int MAX = 700000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
/*第二引数で第一引数を割ったときの切り上げの計算*/
long long int maxtime(long long int x, long long int y) {
return (x + y - 1) / y;
}
/*最大公約数*/
long long int lcm(long long int number1, long long int number2) {
long long int m = number1;
long long int n = number2;
if (number2 > number1) {
m = number2;
n = number1;
}
long long int s = -1;
while (s != 0) {
s = m % n;
m = n;
n = s;
}
return m;
}
/*最大公倍数*/
long long int gcd(long long int number1, long long int number2) {
long long int m = number1;
long long int n = number2;
return m / lcm(m, n) * n;
}
int main() {
int n, k;
cin >> n >> k;
string s;
vector<int> length;
vector<int> check;
cin >> s;
int renzoku = 0;
char buck = ' ';
for (int i = 0; i < s.size(); i++) {
if (i == 0) {
renzoku = 1;
buck = s[i];
continue;
}
if (buck == s[i]) {
renzoku++;
} else {
length.push_back(renzoku);
if (buck == '0') {
check.push_back(1);
} else {
check.push_back(0);
}
renzoku = 1;
buck = s[i];
}
}
length.push_back(renzoku);
if (buck == '0') {
check.push_back(1);
} else {
check.push_back(0);
}
vector<int> a;
vector<int> b;
a.push_back(0);
b.push_back(0);
for (int i = 0; i < check.size(); i++) {
int t = a[i] + check[i];
a.push_back(t);
}
for (int i = 0; i < length.size(); i++) {
int t = b[i] + length[i];
b.push_back(t);
}
if (k >= a[a.size() - 1]) {
cout << b[b.size() - 1];
return 0;
}
int ans = 0;
int z[3];
z[0] = k;
z[1] = k + k;
z[2] = k + k + 1;
for (int n = 0; n <= 2; n++) {
int f = z[n];
for (int i = 0; i < length.size(); i++) {
if (f + i > a.size() - 1) {
if (a[a.size() - 1] - a[i] > k) {
continue;
}
ans = max(ans, b[a.size() - 1] - b[i]);
continue;
}
if (a[i + f] - a[i] > k) {
continue;
}
ans = max(ans, b[i + f] - b[i]);
}
}
cout << ans;
} | replace | 105 | 106 | 105 | 111 | TLE | |
p03074 | C++ | Runtime Error | #include <algorithm>
#include <assert.h>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <time.h>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (i = 0; i < n; i++)
#define P pair<int, int>
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> Nums;
int now = 1;
int cnt = 0;
for (int i = 0; i < n; i++) {
if (s[i] == (char)('0' + now)) {
cnt++;
} else {
now = 1 - now;
Nums.push_back(cnt);
cnt = 1;
}
}
Nums.push_back(cnt);
if (Nums.size() % 2 == 0) {
Nums.push_back(0);
}
int ans = 0;
int Add = 2 * k + 1;
int left = 0;
int right = 0;
int tmp = 0; // [left, right)のsum
for (int i = 0; i < Nums.size(); i += 2) {
int Nextleft = i;
int Nextright = min(i + Add, n);
while (Nextleft > left) {
tmp -= Nums[left];
left++;
}
while (Nextright > right) {
tmp += Nums[right];
right++;
}
ans = max(ans, tmp);
}
cout << ans << endl;
}
| #include <algorithm>
#include <assert.h>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <time.h>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (i = 0; i < n; i++)
#define P pair<int, int>
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> Nums;
int now = 1;
int cnt = 0;
for (int i = 0; i < n; i++) {
if (s[i] == (char)('0' + now)) {
cnt++;
} else {
now = 1 - now;
Nums.push_back(cnt);
cnt = 1;
}
}
Nums.push_back(cnt);
if (Nums.size() % 2 == 0) {
Nums.push_back(0);
}
int ans = 0;
int Add = 2 * k + 1;
int left = 0;
int right = 0;
int tmp = 0; // [left, right)のsum
for (int i = 0; i < Nums.size(); i += 2) {
int Nextleft = i;
int Nextright = min(i + Add, (int)Nums.size());
while (Nextleft > left) {
tmp -= Nums[left];
left++;
}
while (Nextright > right) {
tmp += Nums[right];
right++;
}
ans = max(ans, tmp);
}
cout << ans << endl;
}
| replace | 52 | 53 | 52 | 53 | 0 | |
p03074 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <queue>
using namespace std;
int main() {
int N, K;
string line;
cin >> N >> K;
cin >> line;
int now = 1;
int cnt = 0;
vector<int> lines;
for (int i = 0; i < N; i++) {
if (line[i] == (char)('0' + now)) {
cnt++;
} else {
lines.push_back(cnt);
now = 1 - now;
cnt = 1;
}
}
if (cnt != 0) {
lines.push_back(cnt);
}
if (lines.size() % 2 == 0) {
lines.push_back(0); // 1-0-1-0-1-...-0-1
}
///
int add = 2 * K + 1;
int ans = 0;
for (int i = 0; i < lines.size(); i += 2) {
int tmp = 0;
int left = i;
int right = i + add;
for (int j = left; j < right; j++) {
tmp += lines[j];
}
ans = max(tmp, ans);
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <queue>
using namespace std;
int main() {
int N, K;
string line;
cin >> N >> K;
cin >> line;
int now = 1;
int cnt = 0;
vector<int> lines;
for (int i = 0; i < N; i++) {
if (line[i] == (char)('0' + now)) {
cnt++;
} else {
lines.push_back(cnt);
now = 1 - now;
cnt = 1;
}
}
if (cnt != 0) {
lines.push_back(cnt);
}
if (lines.size() % 2 == 0) {
lines.push_back(0); // 1-0-1-0-1-...-0-1
}
///
int add = 2 * K + 1;
int ans = 0;
for (int i = 0; i < lines.size(); i += 2) {
int tmp = 0;
int left = i;
int right = min(i + add, (int)lines.size());
for (int j = left; j < right; j++) {
tmp += lines[j];
}
ans = max(tmp, ans);
}
cout << ans << endl;
return 0;
}
| replace | 34 | 35 | 34 | 35 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> nums;
int now = 1;
int cnt = 0;
for (int i = 0; i < N; i++) {
if (S[i] == (char)('0' + now))
cnt++;
else {
nums.push_back(cnt);
now = 1 - now;
cnt = 1;
}
}
nums.push_back(cnt);
if (nums.size() % 2 == 0)
nums.push_back(0);
// rep(i, nums.size()) {
// cout << nums[i] << endl;
// }
// return 0;
int add = 2 * K + 1;
int ans = 0;
for (int i = 0; i < nums.size(); i += 2) {
int tmp = 0;
int left = i;
int right = i + add;
for (int j = left; j < right; j++) {
tmp += nums[j];
}
ans = max(tmp, ans);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> nums;
int now = 1;
int cnt = 0;
for (int i = 0; i < N; i++) {
if (S[i] == (char)('0' + now))
cnt++;
else {
nums.push_back(cnt);
now = 1 - now;
cnt = 1;
}
}
nums.push_back(cnt);
if (nums.size() % 2 == 0)
nums.push_back(0);
// rep(i, nums.size()) {
// cout << nums[i] << endl;
// }
// return 0;
int add = 2 * K + 1;
int ans = 0;
for (int i = 0; i < nums.size(); i += 2) {
int tmp = 0;
int left = i;
int right = min(i + add, (int)nums.size());
for (int j = left; j < right; j++) {
tmp += nums[j];
}
ans = max(tmp, ans);
}
cout << ans << endl;
} | replace | 42 | 43 | 42 | 43 | 0 | |
p03074 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> nums;
int now = 1;
int cnt = 0;
for (size_t i = 0; i < n; i++) {
if (s[i] == (char)('0' + now))
cnt++;
else {
nums.push_back(cnt);
now = 1 - now;
cnt = 1;
}
}
if (cnt != 0) {
nums.push_back(cnt);
}
if (nums.size() % 2 == 0)
nums.push_back(0);
int ans = 0;
int add = 2 * k + 1;
for (size_t i = 0; i < nums.size(); i += 2) {
int tmp = 0;
int left = i;
int right = i + add;
for (size_t j = left; j < right; j++) {
tmp += nums[j];
}
ans = max(ans, tmp);
}
cout << ans << endl;
}
| #include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> nums;
int now = 1;
int cnt = 0;
for (size_t i = 0; i < n; i++) {
if (s[i] == (char)('0' + now))
cnt++;
else {
nums.push_back(cnt);
now = 1 - now;
cnt = 1;
}
}
if (cnt != 0) {
nums.push_back(cnt);
}
if (nums.size() % 2 == 0)
nums.push_back(0);
int ans = 0;
int add = 2 * k + 1;
for (size_t i = 0; i < nums.size(); i += 2) {
int tmp = 0;
int left = i;
int right = min(i + add, nums.size());
for (size_t j = left; j < right; j++) {
tmp += nums[j];
}
ans = max(ans, tmp);
}
cout << ans << endl;
}
| replace | 51 | 52 | 51 | 52 | 0 | |
p03074 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> Nums;
int now = 1;
int cnt = 0;
for (int i = 0; i < N; i++) {
if (S[i] == (char)('0' + now))
cnt++;
else {
Nums.push_back(cnt);
now = 1 - now;
cnt = 1;
}
}
if (cnt != 0)
Nums.push_back(cnt);
if (Nums.size() % 2 == 0)
Nums.push_back(0);
int Add = 2 * K + 1;
vector<int> sum(Nums.size() + 1);
sum[0] = 0;
for (int i = 0; i < sum.size(); i++) {
sum[i + 1] = sum[i] + Nums[i];
}
int ans = 0;
for (int i = 0; i < Nums.size(); i += 2) {
int left = i;
int right = min(i + Add, (int)Nums.size());
int tmp = sum[right] - sum[left];
ans = max(ans, tmp);
}
cout << ans << endl;
}
| #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> Nums;
int now = 1;
int cnt = 0;
for (int i = 0; i < N; i++) {
if (S[i] == (char)('0' + now))
cnt++;
else {
Nums.push_back(cnt);
now = 1 - now;
cnt = 1;
}
}
if (cnt != 0)
Nums.push_back(cnt);
if (Nums.size() % 2 == 0)
Nums.push_back(0);
int Add = 2 * K + 1;
vector<int> sum(Nums.size() + 1);
sum[0] = 0;
for (int i = 0; i < Nums.size(); i++) {
sum[i + 1] = sum[i] + Nums[i];
}
int ans = 0;
for (int i = 0; i < Nums.size(); i += 2) {
int left = i;
int right = min(i + Add, (int)Nums.size());
int tmp = sum[right] - sum[left];
ans = max(ans, tmp);
}
cout << ans << endl;
} | replace | 31 | 32 | 31 | 32 | 0 | |
p03074 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> Nums;
int now = 1;
int cnt = 0;
for (int i = 0; i < N; i++) {
if (S[i] == (char)('0' + now))
cnt++;
else {
Nums.push_back(cnt);
now = 1 - now;
cnt = 1;
}
}
if (cnt != 0)
Nums.push_back(cnt);
if (Nums.size() % 2 == 0)
Nums.push_back(0);
int Add = 2 * K + 1;
int ans = 0;
int left = 0;
int right = 0;
for (int i = 0; i < Nums.size(); i += 2) {
int tmp = 0;
int left = i;
int right = i + Add;
for (int j = left; j < right; j++) {
tmp += Nums[j];
}
ans = max(ans, tmp);
}
cout << ans << endl;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> Nums;
int now = 1;
int cnt = 0;
for (int i = 0; i < N; i++) {
if (S[i] == (char)('0' + now))
cnt++;
else {
Nums.push_back(cnt);
now = 1 - now;
cnt = 1;
}
}
if (cnt != 0)
Nums.push_back(cnt);
if (Nums.size() % 2 == 0)
Nums.push_back(0);
int Add = 2 * K + 1;
int ans = 0;
int left = 0;
int right = 0;
for (int i = 0; i < Nums.size(); i += 2) {
int tmp = 0;
int left = i;
int right = min(i + Add, (int)Nums.size());
for (int j = left; j < right; j++) {
tmp += Nums[j];
}
ans = max(ans, tmp);
}
cout << ans << endl;
}
| replace | 35 | 36 | 35 | 36 | 0 | |
p03074 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> mp;
#define inf 1e9
int main() {
int n, k;
cin >> n >> k;
vector<mp> a;
int p, c = 1;
string s;
cin >> s;
p = s[0] - '0';
int f = p;
for (int i = 1; i < n; i++) {
int b = s[i] - '0';
if (b != p) {
a.push_back(mp(c, p));
c = 0;
}
c++;
p = b;
}
a.push_back(mp(c, p));
// for(int i=0;i<a.size();i++)cout<<a[i].first<<'
//'<<a[i].second<<endl;;
int sum = 0;
for (int i = 0; i < a.size(); i++) {
int cnt = 0;
int res = 0;
for (int j = 0; i + j < a.size() && cnt <= k; j++) {
if (a[i + j].second == 0)
cnt++;
if (cnt == k + 1)
break;
res += a[i + j].first;
}
sum = max(sum, res);
}
cout << sum << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> mp;
#define inf 1e9
int main() {
int n, k;
cin >> n >> k;
vector<mp> a;
int p, c = 1;
string s;
cin >> s;
p = s[0] - '0';
int f = p;
for (int i = 1; i < n; i++) {
int b = s[i] - '0';
if (b != p) {
a.push_back(mp(c, p));
c = 0;
}
c++;
p = b;
}
a.push_back(mp(c, p));
// for(int i=0;i<a.size();i++)cout<<a[i].first<<'
//'<<a[i].second<<endl;;
int sum = 0;
int cnt = 0;
int res = 0;
int last = 0;
for (int j = 0; j < a.size() && cnt <= k; j++) {
if (a[j].second == 0)
cnt++;
if (cnt == k + 1)
break;
res += a[j].first;
last = j;
}
sum = max(sum, res);
int st = 0;
if (a[0].second == 0) {
st++;
res -= a[0].first;
if (last + 1 < a.size()) {
res += a[last + 1].first;
last++;
}
if (last + 1 < a.size()) {
res += a[last + 1].first;
last++;
}
}
sum = max(sum, res);
for (int i = st; i < a.size() && last < a.size(); i += 2) {
res -= a[i].first;
res -= a[i + 1].first;
if (last + 1 < a.size()) {
res += a[last + 1].first;
last++;
}
if (last + 1 < a.size()) {
res += a[last + 1].first;
last++;
}
sum = max(sum, res);
}
cout << sum << endl;
return 0;
}
| replace | 29 | 38 | 29 | 65 | TLE | |
p03074 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int n, k, i;
int ans = 0;
std::cin >> n >> k;
string s;
std::cin >> s;
int num = 0;
int a[n];
if (s[0] == '0') {
a[0] = 0;
num++;
}
for (i = 1; i < n; i++) {
if (s[i - 1] == '0' && s[i] == '1') {
a[num] = i;
num++;
}
if (s[i - 1] == '1' && s[i] == '0') {
a[num] = i;
num++;
}
}
if (s[n - 1] == '1') {
a[num] = n;
num++;
}
if (s[n - 1] == '0') {
a[num] = n;
num++;
a[num] = n;
num++;
}
// for (i=0;i<num;i++){std::cout << a[i] << std::endl;}
if (num - 1 <= 2 * k)
std::cout << n << std::endl;
else {
for (i = 0; i < num - 2 * k - 1; i++) {
if (i == 0)
ans = a[2 * k];
else {
if (a[2 * (k + i)] - a[2 * i - 1] > ans)
ans = a[2 * (k + i)] - a[2 * i - 1];
}
}
std::cout << ans << std::endl;
}
}
| #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int n, k, i;
int ans = 0;
std::cin >> n >> k;
string s;
std::cin >> s;
int num = 0;
int a[n];
if (s[0] == '0') {
a[0] = 0;
num++;
}
for (i = 1; i < n; i++) {
if (s[i - 1] == '0' && s[i] == '1') {
a[num] = i;
num++;
}
if (s[i - 1] == '1' && s[i] == '0') {
a[num] = i;
num++;
}
}
if (s[n - 1] == '1') {
a[num] = n;
num++;
}
if (s[n - 1] == '0') {
a[num] = n;
num++;
a[num] = n;
num++;
}
// for (i=0;i<num;i++){std::cout << a[i] << std::endl;}
if (num - 1 <= 2 * k)
std::cout << n << std::endl;
else {
for (i = 0; i < (num - 2 * k + 1) / 2; i++) {
if (i == 0)
ans = a[2 * k];
else {
if (a[2 * (k + i)] - a[2 * i - 1] > ans)
ans = a[2 * (k + i)] - a[2 * i - 1];
}
}
std::cout << ans << std::endl;
}
}
| replace | 39 | 40 | 39 | 40 | 0 | |
p03074 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <set>
#include <string.h>
#include <vector>
using namespace std;
int main() {
int N, K;
string S;
vector<int> v;
cin >> N >> K >> S;
char now = '1';
int cnt = 0;
for (int i = 0; i < N; i++) {
if (now == S[i]) {
cnt++;
} else {
v.push_back(cnt);
cnt = 1;
now = S[i];
}
}
if (cnt != 0)
v.push_back(cnt);
if (now == '0')
v.push_back(0);
int ans = 0;
if (2 * K + 1 >= v.size()) {
ans = N;
} else {
vector<int> sum(v.size());
sum[0] = v[0];
for (int i = 1; i < v.size(); i++) {
sum[i] = sum[i - 1] + v[i];
}
for (int i = 0; 2 * K - i + 1 < v.size(); i += 2) {
if (i == 0) {
ans = max(ans, sum[2 * K + i]);
} else {
ans = max(ans, sum[2 * K + i] - sum[i - 1]);
}
}
}
cout << ans << endl;
} | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <set>
#include <string.h>
#include <vector>
using namespace std;
int main() {
int N, K;
string S;
vector<int> v;
cin >> N >> K >> S;
char now = '1';
int cnt = 0;
for (int i = 0; i < N; i++) {
if (now == S[i]) {
cnt++;
} else {
v.push_back(cnt);
cnt = 1;
now = S[i];
}
}
if (cnt != 0)
v.push_back(cnt);
if (now == '0')
v.push_back(0);
int ans = 0;
if (2 * K + 1 >= v.size()) {
ans = N;
} else {
vector<int> sum(v.size());
sum[0] = v[0];
for (int i = 1; i < v.size(); i++) {
sum[i] = sum[i - 1] + v[i];
}
for (int i = 0; 2 * K + i < v.size(); i += 2) {
if (i == 0) {
ans = max(ans, sum[2 * K + i]);
} else {
ans = max(ans, sum[2 * K + i] - sum[i - 1]);
}
}
}
cout << ans << endl;
} | replace | 41 | 42 | 41 | 42 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define reps(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) reps(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define INF (1000000000)
#define MOD (1000000007)
#define PI (acos(-1))
int main() {
int n, k;
string s;
cin >> n >> k >> s;
vector<int> Nums;
int now = 1; // いま見ている数
int cnt = 0; // nowがいくつ並ぶか
rep(i, n) {
if (s[i] == (char)('0' + now))
cnt++;
else {
Nums.push_back(cnt);
now = 1 - now; // 1と0切り替え
cnt = 1;
}
}
if (cnt != 0)
Nums.push_back(cnt);
// 連続する1の数-連続する0の数-…ってかんじの配列
// 1-0-1-0-…-0-1のように1でおわりにする
if (Nums.size() % 2 == 0)
Nums.push_back(0);
int ans = 0;
for (int i = 0; i < Nums.size(); i += 2) {
int tmp = 0;
int left = i;
int right = i + 2 * k + 1;
reps(j, left, right) { tmp += Nums[j]; }
ans = max(tmp, ans);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define reps(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) reps(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define INF (1000000000)
#define MOD (1000000007)
#define PI (acos(-1))
int main() {
int n, k;
string s;
cin >> n >> k >> s;
vector<int> Nums;
int now = 1; // いま見ている数
int cnt = 0; // nowがいくつ並ぶか
rep(i, n) {
if (s[i] == (char)('0' + now))
cnt++;
else {
Nums.push_back(cnt);
now = 1 - now; // 1と0切り替え
cnt = 1;
}
}
if (cnt != 0)
Nums.push_back(cnt);
// 連続する1の数-連続する0の数-…ってかんじの配列
// 1-0-1-0-…-0-1のように1でおわりにする
if (Nums.size() % 2 == 0)
Nums.push_back(0);
int ans = 0;
for (int i = 0; i < Nums.size(); i += 2) {
int tmp = 0;
int left = i;
int right = min(i + 2 * k + 1, (int)Nums.size());
reps(j, left, right) { tmp += Nums[j]; }
ans = max(tmp, ans);
}
cout << ans << endl;
} | replace | 40 | 41 | 40 | 41 | 0 | |
p03074 | C++ | Runtime Error | // g++ -std=c++14 test.cpp -o test.out
#include <algorithm>
#include <cassert>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <stdlib.h>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
int N, K;
string S;
int ans = 0;
void solve() {
vector<int>
segment; // segmentには 1の数、0の数、1の数、0の数......1の数 と記録する
if (S[0] == '0')
segment.push_back(0);
int left_index = 0;
for (int right_index = 0; right_index < N;) {
while (right_index < N) {
if (S[left_index] == S[right_index])
right_index++;
else
break;
}
segment.push_back(right_index - left_index);
left_index = right_index;
}
if (S[N - 1] == '0')
segment.push_back(0);
// for(int i=0;i<segment.size();i++){
// cout << segment[i] << " ";
// }
// cout << endl;
int sumof1 = segment[0];
for (int i = 1; i <= K; i++) {
if (2 * i - 1 >= N) {
ans = sumof1;
return;
}
sumof1 += (segment[2 * i - 1] + segment[2 * i]);
}
ans = sumof1;
for (int i = 2 * K + 1; i < segment.size(); i += 2) {
sumof1 += (segment[i] + segment[i + 1]);
sumof1 -= (segment[i - (2 * K + 1)] + segment[i + 1 - (2 * K + 1)]);
if (ans < sumof1)
ans = sumof1;
}
}
int main() {
cin >> N >> K;
cin >> S;
solve();
cout << ans << endl;
return 0;
}
| // g++ -std=c++14 test.cpp -o test.out
#include <algorithm>
#include <cassert>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <stdlib.h>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
int N, K;
string S;
int ans = 0;
void solve() {
vector<int>
segment; // segmentには 1の数、0の数、1の数、0の数......1の数 と記録する
if (S[0] == '0')
segment.push_back(0);
int left_index = 0;
for (int right_index = 0; right_index < N;) {
while (right_index < N) {
if (S[left_index] == S[right_index])
right_index++;
else
break;
}
segment.push_back(right_index - left_index);
left_index = right_index;
}
if (S[N - 1] == '0')
segment.push_back(0);
// for(int i=0;i<segment.size();i++){
// cout << segment[i] << " ";
// }
// cout << endl;
int sumof1 = segment[0];
for (int i = 1; i <= K; i++) {
if (2 * i - 1 >= segment.size()) {
ans = sumof1;
return;
}
sumof1 += (segment[2 * i - 1] + segment[2 * i]);
}
ans = sumof1;
for (int i = 2 * K + 1; i < segment.size(); i += 2) {
sumof1 += (segment[i] + segment[i + 1]);
sumof1 -= (segment[i - (2 * K + 1)] + segment[i + 1 - (2 * K + 1)]);
if (ans < sumof1)
ans = sumof1;
}
}
int main() {
cin >> N >> K;
cin >> S;
solve();
cout << ans << endl;
return 0;
}
| replace | 47 | 48 | 47 | 48 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> VI;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
char prev = '1';
vector<int> a;
int ctr = 0;
rep(i, s.size()) {
switch (s[i]) {
case '0':
if (prev == '1') {
a.push_back(ctr);
ctr = 0;
}
prev = '0';
ctr++;
break;
case '1':
if (prev == '0') {
a.push_back(ctr);
ctr = 0;
}
ctr++;
prev = '1';
break;
}
}
a.push_back(ctr);
if (s[s.size() - 1] == '0') {
a.push_back(0);
}
vector<int> b(a.size() + 1);
b[0] = 0;
rep(i, s.size()) { b[i + 1] = b[i] + a[i]; }
if (k * 2 + 1 >= b.size()) {
cout << n << endl;
exit(0);
}
int ans = 0;
rep(i, 2 * k + 1, b.size()) {
int p = b[i] - b[i - (2 * k + 1)];
chmax(ans, p);
i++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> VI;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
char prev = '1';
vector<int> a;
int ctr = 0;
rep(i, s.size()) {
switch (s[i]) {
case '0':
if (prev == '1') {
a.push_back(ctr);
ctr = 0;
}
prev = '0';
ctr++;
break;
case '1':
if (prev == '0') {
a.push_back(ctr);
ctr = 0;
}
ctr++;
prev = '1';
break;
}
}
a.push_back(ctr);
if (s[s.size() - 1] == '0') {
a.push_back(0);
}
vector<int> b(a.size() + 1);
b[0] = 0;
rep(i, a.size()) { b[i + 1] = b[i] + a[i]; }
if (k * 2 + 1 >= b.size()) {
cout << n << endl;
exit(0);
}
int ans = 0;
rep(i, 2 * k + 1, b.size()) {
int p = b[i] - b[i - (2 * k + 1)];
chmax(ans, p);
i++;
}
cout << ans << endl;
} | replace | 60 | 61 | 60 | 61 | 0 | |
p03074 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <sstream>
#include <stdio.h>
#include <vector>
#define FORi(N) for (int i = 0; i < N; ++i)
#define FORj(N) for (int j = 0; j < N; ++j)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
ll gcd(ll m, ll n) {
if (n == 0)
return abs(m);
return (gcd(n, m % n));
}
void putYN(bool b) {
if (b) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
int main() {
ll N, K;
cin >> N >> K;
vector<ll> _01 = {0, 0}; // 累積和
string S;
cin >> S;
bool flag = false;
ll n = 0;
// if(S[0]=='1')_01.push_back(0);
FORi(S.size()) {
bool b = S[i] == '0';
if (flag)
b = !b;
if (!b) {
flag = !flag;
_01.push_back(i);
}
}
_01.push_back(S.size());
_01.push_back(S.size());
// 最後が0と仮定というか
if (_01.size() % 2 == 0)
_01.push_back(S.size());
ll ma = 0;
// ll tsize= K*2+1;
// if(tsize>_01.size()/2)tsize=_01.size()/2;
// cout<<_01.size()/2-tsize+1;
for (int i = 1; i < _01.size() - K * 2; i += 2) {
// cout<<"a"<<i;
ll tmp = _01[i + K * 2] - _01[i - 1];
if (ma < tmp)
ma = tmp;
}
for (auto a : _01) {
// cout<<a<<endl;
}
cout << ma << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <sstream>
#include <stdio.h>
#include <vector>
#define FORi(N) for (int i = 0; i < N; ++i)
#define FORj(N) for (int j = 0; j < N; ++j)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
ll gcd(ll m, ll n) {
if (n == 0)
return abs(m);
return (gcd(n, m % n));
}
void putYN(bool b) {
if (b) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
int main() {
ll N, K;
cin >> N >> K;
vector<ll> _01 = {0, 0}; // 累積和
string S;
cin >> S;
bool flag = false;
ll n = 0;
// if(S[0]=='1')_01.push_back(0);
FORi(S.size()) {
bool b = S[i] == '0';
if (flag)
b = !b;
if (!b) {
flag = !flag;
_01.push_back(i);
}
}
_01.push_back(S.size());
_01.push_back(S.size());
// 最後が0と仮定というか
if (_01.size() % 2 == 0)
_01.push_back(S.size());
ll ma = 0;
// ll tsize= K*2+1;
// if(tsize>_01.size()/2)tsize=_01.size()/2;
// cout<<-tsize+1;
if (K * 2 >= _01.size())
K = _01.size() / 2 - 1;
for (int i = 1; i < (int)_01.size() - K * 2; i += 2) {
// cout<<"a"<<i;
ll tmp = _01[i + K * 2] - _01[i - 1];
if (ma < tmp)
ma = tmp;
}
for (auto a : _01) {
// cout<<a<<endl;
}
cout << ma << endl;
return 0;
}
| replace | 55 | 57 | 55 | 59 | 0 | |
p03074 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> K;
cin >> S;
vector<int> l;
int i = 0, tmp = 0;
while (i < N) {
tmp = 0;
if (S[i] == '1') {
while (S[i] == '1') {
tmp++;
i++;
}
} else {
while (S[i] == '0') {
tmp++;
i++;
}
}
l.push_back(tmp);
}
int hp;
int ans = 0;
for (int i = 0; i < (int)l.size(); i++) {
tmp = 0;
hp = K;
if ((S[0] == '1' && i % 2 == 0) || (S[0] == '0' && i % 2 == 1)) {
hp = hp * 2 + 1;
hp = min(hp, (int)l.size() - i);
for (int j = i; j < i + hp; j++) {
tmp += l[j];
}
} else {
hp = hp * 2;
hp = min(hp, (int)l.size() - i);
for (int j = i; j < i + hp; j++) {
tmp += l[j];
}
}
ans = max(ans, tmp);
if (ans == N) {
break;
}
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> K;
cin >> S;
vector<int> l;
int i = 0, tmp = 0;
while (i < N) {
tmp = 0;
if (S[i] == '1') {
while (S[i] == '1') {
tmp++;
i++;
}
} else {
while (S[i] == '0') {
tmp++;
i++;
}
}
l.push_back(tmp);
}
int hp;
int ans = 0;
for (int i = 0; i < (int)l.size(); i++) {
tmp = 0;
hp = K;
if ((S[0] == '1' && i % 2 == 0) || (S[0] == '0' && i % 2 == 1)) {
hp = hp * 2 + 1;
hp = min(hp, (int)l.size() - i);
for (int j = i; j < i + hp; j++) {
tmp += l[j];
}
} else {
if (i == 0) {
hp = hp * 2;
hp = min(hp, (int)l.size() - i);
for (int j = i; j < i + hp; j++) {
tmp += l[j];
}
}
}
ans = max(ans, tmp);
if (ans == N) {
break;
}
}
cout << ans << endl;
return 0;
} | replace | 40 | 44 | 40 | 46 | TLE | |
p03074 | C++ | Runtime Error | //
// Created on 2019-02-09.
//
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
template <class T> bool INRANGE(T x, T a, T b) { return a <= x && x <= b; }
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(v) (v).begin(), (v).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
#define PB push_back
#define INF 1e9
#define MOD 1e9 + 7
#define EPS 1e-9
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
string s;
cin >> N >> K >> s;
vector<ll> v;
ll num__continuous = 0;
char count_ch = '1';
REP(i, s.length()) {
if (s[i] == count_ch) {
num__continuous++;
} else {
v.emplace_back(num__continuous);
num__continuous = 1;
count_ch = s[i];
}
}
if (num__continuous != 0)
v.push_back(num__continuous);
if (v.size() % 2 == 0)
v.push_back(0);
ll ans = 0;
int num_cnt = 2 * K + 1;
for (int i = 0; i < v.size(); i += 2) {
ll cnt = 0;
REP(j, min(i + num_cnt, (int)v.size())) cnt += v[i + j];
ans = max(ans, cnt);
}
cout << ans << endl;
return 0;
} | //
// Created on 2019-02-09.
//
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
template <class T> bool INRANGE(T x, T a, T b) { return a <= x && x <= b; }
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(v) (v).begin(), (v).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
#define PB push_back
#define INF 1e9
#define MOD 1e9 + 7
#define EPS 1e-9
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
string s;
cin >> N >> K >> s;
vector<ll> v;
ll num__continuous = 0;
char count_ch = '1';
REP(i, s.length()) {
if (s[i] == count_ch) {
num__continuous++;
} else {
v.emplace_back(num__continuous);
num__continuous = 1;
count_ch = s[i];
}
}
if (num__continuous != 0)
v.push_back(num__continuous);
if (v.size() % 2 == 0)
v.push_back(0);
ll ans = 0;
int num_cnt = 2 * K + 1;
for (int i = 0; i < v.size(); i += 2) {
ll cnt = 0;
int left = i;
int right = min(i + num_cnt, (int)v.size());
for (int j = left; j < right; j++) {
cnt += v[j];
}
ans = max(ans, cnt);
}
cout << ans << endl;
return 0;
} | replace | 57 | 58 | 57 | 63 | 0 | |
p03074 | C++ | Runtime Error | #include <iostream>
#define maxn 100010
using namespace std;
int n, k;
int m = 1;
string s;
struct t {
int num, dir;
} a[maxn];
void work1() {
int ans = -1, sum = 0;
for (int i = 1; i <= 2 * k + 1; i++)
sum += a[i].num;
// cout << sum << endl;
ans = sum;
for (int i = 2 * k + 2; i <= m; i += 2) {
sum += a[i].num + a[i + 1].num - a[i - k * 2 - 1].num - a[i - k * 2].num;
if (sum > ans)
ans = sum;
// cout << sum << endl;
}
cout << ans;
}
void work2() {
int ans = -1, sum = 0;
for (int i = 1; i <= 2 * k; i++)
sum += a[i].num;
// cout << sum << endl;
ans = sum;
sum += a[2 * k + 1].num + a[2 * k + 2].num - a[1].num;
if (sum > ans)
ans = sum;
for (int i = 2 * k + 3; i <= m; i += 2) {
sum += a[i].num + a[i + 1].num - a[i - k * 2 - 1].num - a[i - k * 2].num;
if (sum > ans)
ans = sum;
// cout << sum << endl;
}
cout << ans;
}
// 11 2
// 01010110011
void work3() {
int ans = -1, sum = 0;
for (int i = 1; i <= 2 * k + 1; i++)
sum += a[i].num;
// cout << sum << endl;
ans = sum;
for (int i = 2 * k + 2; i < m; i += 2) {
sum += a[i].num + a[i + 1].num - a[i - k * 2 - 1].num - a[i - k * 2].num;
if (sum > ans)
ans = sum;
// cout << sum << endl;
}
sum += a[m].num - a[m - k * 2 - 1].num - a[m - k * 2].num;
if (sum > ans)
ans = sum;
cout << ans;
}
// 15 2
// 111010101100000
void work4() {
t b[maxn];
b[1].num = 0;
b[1].dir = 1;
for (int i = 1; i <= m; i++) {
b[i + 1].num = a[i].num;
b[i + 1].dir = a[i].dir;
}
b[m + 2].num = 0;
b[m + 2].dir = 1;
for (int i = 1; i <= m + 2; i++) {
a[i].num = b[i].num;
a[i].dir = b[i].dir;
}
m += 2;
work1();
}
int main() {
cin >> n >> k;
cin >> s;
a[1].num = 1;
a[1].dir = s[0] - '0';
for (int i = 1; i < n; i++)
if (s[i] - '0' == a[m].dir)
a[m].num++;
else {
a[++m].dir = s[i] - '0';
a[m].num = 1;
}
if (a[1].dir == 1 && a[m].dir == 1)
work1();
if (a[1].dir == 0 && a[m].dir == 1)
work2();
if (a[1].dir == 1 && a[m].dir == 0)
work3();
if (a[1].dir == 0 && a[m].dir == 0)
work4();
} | #include <iostream>
#define maxn 1000000
using namespace std;
int n, k;
int m = 1;
string s;
struct t {
int num, dir;
} a[maxn];
void work1() {
int ans = -1, sum = 0;
for (int i = 1; i <= 2 * k + 1; i++)
sum += a[i].num;
// cout << sum << endl;
ans = sum;
for (int i = 2 * k + 2; i <= m; i += 2) {
sum += a[i].num + a[i + 1].num - a[i - k * 2 - 1].num - a[i - k * 2].num;
if (sum > ans)
ans = sum;
// cout << sum << endl;
}
cout << ans;
}
void work2() {
int ans = -1, sum = 0;
for (int i = 1; i <= 2 * k; i++)
sum += a[i].num;
// cout << sum << endl;
ans = sum;
sum += a[2 * k + 1].num + a[2 * k + 2].num - a[1].num;
if (sum > ans)
ans = sum;
for (int i = 2 * k + 3; i <= m; i += 2) {
sum += a[i].num + a[i + 1].num - a[i - k * 2 - 1].num - a[i - k * 2].num;
if (sum > ans)
ans = sum;
// cout << sum << endl;
}
cout << ans;
}
// 11 2
// 01010110011
void work3() {
int ans = -1, sum = 0;
for (int i = 1; i <= 2 * k + 1; i++)
sum += a[i].num;
// cout << sum << endl;
ans = sum;
for (int i = 2 * k + 2; i < m; i += 2) {
sum += a[i].num + a[i + 1].num - a[i - k * 2 - 1].num - a[i - k * 2].num;
if (sum > ans)
ans = sum;
// cout << sum << endl;
}
sum += a[m].num - a[m - k * 2 - 1].num - a[m - k * 2].num;
if (sum > ans)
ans = sum;
cout << ans;
}
// 15 2
// 111010101100000
void work4() {
t b[maxn];
b[1].num = 0;
b[1].dir = 1;
for (int i = 1; i <= m; i++) {
b[i + 1].num = a[i].num;
b[i + 1].dir = a[i].dir;
}
b[m + 2].num = 0;
b[m + 2].dir = 1;
for (int i = 1; i <= m + 2; i++) {
a[i].num = b[i].num;
a[i].dir = b[i].dir;
}
m += 2;
work1();
}
int main() {
cin >> n >> k;
cin >> s;
a[1].num = 1;
a[1].dir = s[0] - '0';
for (int i = 1; i < n; i++)
if (s[i] - '0' == a[m].dir)
a[m].num++;
else {
a[++m].dir = s[i] - '0';
a[m].num = 1;
}
if (a[1].dir == 1 && a[m].dir == 1)
work1();
if (a[1].dir == 0 && a[m].dir == 1)
work2();
if (a[1].dir == 1 && a[m].dir == 0)
work3();
if (a[1].dir == 0 && a[m].dir == 0)
work4();
} | replace | 1 | 2 | 1 | 2 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define For(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) For(i, 0, n)
#define debug(x) cerr << #x << " = " << (x) << endl;
#define leftunique(a) \
{ \
sort((a).begin(), (a).end()); \
(a).erase(unique((a).begin(), (a).end()), (a).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;
}
static const ll INF = 1LL << 60;
// Write From this Line
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
// 1-0-1-0-1を作りたい, 1スタートにしたいからnow = 1 ; にする
vector<int> Nums;
int now = 1; // 今見ている数
int cnt = 0; // now がいくつ並んでいるか
rep(i, n) {
if (s[i] == char('0' + now))
cnt++;
else {
Nums.push_back(cnt);
now = 1 - now;
cnt = 1; // 新しいのをカウントし始めるk
}
}
if (cnt != 0)
Nums.push_back(cnt);
// 1-0-1-0-1 つまり要素数は奇数
// 1-0-1-0 みたいに0で終わってたら適当に1つ足す
if (Nums.size() % 2 == 0)
Nums.push_back(0);
// どこまで見るか
int Add = 2 * k + 1;
// 累積わを作る
vector<int> sum(Nums.size() + 1);
for (int i = 0; i < sum.size(); i++) {
sum[i + 1] = sum[i] + Nums[i];
}
int ans = 0;
// 1-0-1..の１から始めるので偶数番目だけ見る。
for (int i = 0; i < Nums.size(); i += 2) {
int left = i;
int right = min(i + Add, (int)Nums.size());
int tmp = sum[right] - sum[left];
ans = max(tmp, ans);
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define For(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) For(i, 0, n)
#define debug(x) cerr << #x << " = " << (x) << endl;
#define leftunique(a) \
{ \
sort((a).begin(), (a).end()); \
(a).erase(unique((a).begin(), (a).end()), (a).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;
}
static const ll INF = 1LL << 60;
// Write From this Line
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
// 1-0-1-0-1を作りたい, 1スタートにしたいからnow = 1 ; にする
vector<int> Nums;
int now = 1; // 今見ている数
int cnt = 0; // now がいくつ並んでいるか
rep(i, n) {
if (s[i] == char('0' + now))
cnt++;
else {
Nums.push_back(cnt);
now = 1 - now;
cnt = 1; // 新しいのをカウントし始めるk
}
}
if (cnt != 0)
Nums.push_back(cnt);
// 1-0-1-0-1 つまり要素数は奇数
// 1-0-1-0 みたいに0で終わってたら適当に1つ足す
if (Nums.size() % 2 == 0)
Nums.push_back(0);
// どこまで見るか
int Add = 2 * k + 1;
// 累積わを作る
vector<int> sum(Nums.size() + 1);
for (int i = 0; i < Nums.size(); i++) {
sum[i + 1] = sum[i] + Nums[i];
}
int ans = 0;
// 1-0-1..の１から始めるので偶数番目だけ見る。
for (int i = 0; i < Nums.size(); i += 2) {
int left = i;
int right = min(i + Add, (int)Nums.size());
int tmp = sum[right] - sum[left];
ans = max(tmp, ans);
}
cout << ans << endl;
}
| replace | 59 | 60 | 59 | 60 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
string s;
cin >> n >> k >> s;
vector<int> nums;
int now = 1;
int cnt = 0;
for (int i = 0; i < s.length(); i++) {
if (s[i] - '0' != now) {
nums.push_back(cnt);
now = 1 - now;
cnt = 1;
} else {
cnt++;
}
}
if (cnt > 0) {
nums.push_back(cnt);
}
// 1の数 - 0の数 - 1の数 - 0の数 - 1の数 という配列を作りたい
// 0で終わってたら最後に1のやつを加える
if (nums.size() % 2 == 0) {
nums.push_back(0);
}
// for (auto a : nums) {
// cout << a << " ";
// }
// cout << endl;
// TLEするバージョン
int ans = nums[0];
for (int i = 0; i < nums.size() / 2 - k + 1; i++) {
int left = i * 2;
int right = min(left + k * 2, (int)nums.size() - 1);
// cout << left << " " << right << endl;
int a = 0;
for (int j = left; j <= right; j++) {
a += nums[j];
}
ans = max(ans, a);
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
string s;
cin >> n >> k >> s;
vector<int> nums;
int now = 1;
int cnt = 0;
for (int i = 0; i < s.length(); i++) {
if (s[i] - '0' != now) {
nums.push_back(cnt);
now = 1 - now;
cnt = 1;
} else {
cnt++;
}
}
if (cnt > 0) {
nums.push_back(cnt);
}
// 1の数 - 0の数 - 1の数 - 0の数 - 1の数 という配列を作りたい
// 0で終わってたら最後に1のやつを加える
if (nums.size() % 2 == 0) {
nums.push_back(0);
}
// for (auto a : nums) {
// cout << a << " ";
// }
// cout << endl;
// TLEするバージョン
int ans = nums[0];
for (int i = 0; i < nums.size(); i += 2) {
int left = i;
int right = min(left + k * 2, (int)nums.size() - 1);
// cout << left << " " << right << endl;
int a = 0;
for (int j = left; j <= right; j++) {
a += nums[j];
}
ans = max(ans, a);
}
cout << ans << endl;
return 0;
}
| replace | 41 | 43 | 41 | 43 | 0 | |
p03074 | C++ | Time Limit Exceeded | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, k, cnt = 0, mx = 0;
string s;
cin >> n >> k >> s;
char cur = s[0], curr = 0, curl = 0;
while (curr < n) {
while (cnt < k && curr < n) {
curr++;
if (curr == n)
break;
if (s[curr] == '1' && s[curr - 1] == '0') {
cnt++;
}
}
while (curr < n) {
curr++;
if (s[curr] == '0' && s[curr - 1] == '1') {
break;
}
}
mx = max(mx, curr - curl);
if (cnt < k)
break;
while (cnt >= k && curl < n) {
curl++;
if (s[curl] == '1' && s[curl - 1] == '0') {
cnt--;
}
}
}
cout << mx << endl;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, k, cnt = 0, mx = 0;
string s;
cin >> n >> k >> s;
int curr = 0, curl = 0;
while (curr < n) {
while (cnt < k && curr < n) {
curr++;
if (curr == n)
break;
if (s[curr] == '1' && s[curr - 1] == '0') {
cnt++;
}
}
while (curr < n) {
curr++;
if (s[curr] == '0' && s[curr - 1] == '1') {
break;
}
}
mx = max(mx, curr - curl);
if (cnt < k)
break;
while (cnt >= k && curl < n) {
curl++;
if (s[curl] == '1' && s[curl - 1] == '0') {
cnt--;
}
}
}
cout << mx << endl;
} | replace | 9 | 10 | 9 | 10 | TLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.