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) ... | #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) ... | 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) ... | /*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;
... | 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 =... | /*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 =... | 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... | // #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... | 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 optimi... | /****************************************************
* Template for coding contests *
* Author : Sanjeev Sharma *
* Email : thedevelopersanjeev@gmail.com *
*****************************************************/
#pragma GCC optimize("O3")
#pragma GCC optimi... | 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... | #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... | 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... | #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... | 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... | #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... | 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 <deq... | /*
* 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 <deq... | 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()... | // 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()... | 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] = m... | #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]... | 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 << en... | #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 << ... | 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;
... | #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;
... | 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);
}
}
... | #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);
}
}
... | 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);
ffl... | #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);
ffl... | 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++) {
... | #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;... | 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]) <= ... |
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];
... | #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];
... | 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 ... | #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 ... | 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 & ... | #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';
... | #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';
... | 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 && ... | #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] ... | 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;
... | #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 >... | 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';
}
}
}
... | #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';
}
... | 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(); ... | #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(... | 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') ... | #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')... | 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... | #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がMA... | 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 =... | #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 ... | 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+... | #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++;
... | 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';
}... | #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)) {
... | 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;
... | #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;
... | 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... | #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'... | 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;
s... | // キョウプロ.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;
s... | 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", ... | #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"... | 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 (... | #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 ... | 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... | #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) {
... | 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 s... | #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 solv... | 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;... | #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;... | 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 ? ... | #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 ?... | 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] ... | #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]... | 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(... | #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(... | 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;
... | #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;
... | 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++;
}
}
prin... | #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++;
}
}
pri... | 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[... | #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];
... | 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])
... | #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])
... | 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;
#defi... | #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;
#defi... | 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... | #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;
in... | 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;
... | #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;
... | 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())
// d... | #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())
// d... | 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++;
... | #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++;
... | 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 = ... | #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 = ... | 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] == (cha... | #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] == (cha... | 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 {
... | #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 {
... | 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]... | #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... | 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;
... | #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;
... | 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 ... | #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 ... | 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 -... | #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 -... | 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 ... | #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 ... | 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
#def... | #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
#def... | 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_ba... | #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_ba... | 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 (in... | #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 (in... | 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... | #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... | 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)
... | #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+... | 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.... | #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.... | 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>
#includ... | #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>
#includ... | 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) {
... | #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) {
... | 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 =... | #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... | 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;
... | #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;
... | 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 ... | #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 ... | 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(... | #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(... | 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_ba... | #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_ba... | 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++) {... | #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++) {... | 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 <ut... | #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 <ut... | 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.pu... | #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.pu... | 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.pu... | #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.pu... | 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) {
... | #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) {
... | 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] ... | #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] ... | 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 (no... | #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 (no... | 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 >... | #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 >... | 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;
s... | // 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;
s... | 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;
}... | #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;
}... | 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;
usin... | #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;
usin... | 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... | #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... | 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)... | //
// 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)... | 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) {
su... | #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) {
s... | 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) \
{ ... | #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) \
{ ... | 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++;
... | #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++;
... | 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]... | #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') {
... | 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.