problem_id stringlengths 6 6 | language stringclasses 2
values | original_status stringclasses 3
values | original_src stringlengths 19 243k | changed_src stringlengths 19 243k | change stringclasses 3
values | i1 int64 0 8.44k | i2 int64 0 8.44k | j1 int64 0 8.44k | j2 int64 0 8.44k | error stringclasses 270
values | stderr stringlengths 0 226k |
|---|---|---|---|---|---|---|---|---|---|---|---|
p03074 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int n, k, i, bi, hs = 0, max;
string s;
vector<int> w;
cin >> n >> k >> s;
if (s[0] == '0')
w.push_back(0);
i = 0;
while (i < n) {
bi = i;
while (i < n && s[i + 1] == s[i])
... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int n, k, i, bi, hs = 0, max;
string s;
vector<int> w;
cin >> n >> k >> s;
if (s[0] == '0')
w.push_back(0);
i = 0;
while (i < n) {
bi = i;
while (i < n && s[i + 1] == s[i])
... | replace | 30 | 31 | 30 | 31 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repo(i, n) for (int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define lb lower_bound
#define ub upper_bound
#define... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repo(i, n) for (int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define lb lower_bound
#define ub upper_bound
#define... | replace | 79 | 80 | 79 | 80 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define INF 999999999999999999
#define rep(i, m, n) for (lli i = m; i < n; i++)
#define rrep(i, m, n) for (lli i = m - 1; i >= n; i--)
#define pb(n) push_back(n)
#define UE(N) N.erase(unique(N.begin(), N.end()), N... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define INF 999999999999999999
#define rep(i, m, n) for (lli i = m; i < n; i++)
#define rrep(i, m, n) for (lli i = m - 1; i >= n; i--)
#define pb(n) push_back(n)
#define UE(N) N.erase(unique(N.begin(), N.end()), N... | replace | 76 | 77 | 76 | 78 | 0 | |
p03074 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> Nums;
int now = 1;
int cnt = 0;
for (int i = 0; i < n; i++) {
if (s[i] == (char)('0' + now)) {
cnt++;
} else {
Nums.push_back(cnt);
now = 1 - now;... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> Nums;
int now = 1;
int cnt = 0;
for (int i = 0; i < n; i++) {
if (s[i] == (char)('0' + now)) {
cnt++;
} else {
Nums.push_back(cnt);
now = 1 - now;... | replace | 31 | 32 | 31 | 32 | 0 | |
p03074 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
#include <vector>
int main(void) {
int tmp, n, k;
char s[100001];
std::vector<int> v0;
std::vector<int> v1;
scanf("%d %d\n", &n, &k);
scanf("%s", s);
char *tmp1, *tmp2;
int m = 0;
tmp1 = s;
v1.push_back(0);
while (*... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
#include <vector>
int main(void) {
int tmp, n, k;
char s[100001];
std::vector<int> v0;
std::vector<int> v1;
scanf("%d %d\n", &n, &k);
scanf("%s", s);
char *tmp1, *tmp2;
int m = 0;
tmp1 = s;
v1.push_back(0);
while (*... | replace | 35 | 36 | 35 | 36 | 0 | |
p03074 | C++ | Runtime Error | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> cum_sum;
cum_sum.push_back(0);
int counter = 0;
char tmp_char = S[0];
if (tmp_char == '0')
cum_sum.push_back(0);
for (int i = 0; i < N; i++) {
... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> cum_sum;
cum_sum.push_back(0);
int counter = 0;
char tmp_char = S[0];
if (tmp_char == '0')
cum_sum.push_back(0);
for (int i = 0; i < N; i++) {
... | replace | 62 | 67 | 62 | 66 | 0 | |
p03074 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, k;
int ans = 0;
int block[100000] = {0};
string str;
cin >> n >> k;
cin >> str;
int pattern = 1;
int cnt = 0;
int index = 0;
for (int i = 0; i < (int)str.size(); i++) {
switch (pattern) {
ca... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, k;
int ans = 0;
int block[1000005] = {0};
string str;
cin >> n >> k;
cin >> str;
int pattern = 1;
int cnt = 0;
int index = 0;
for (int i = 0; i < (int)str.size(); i++) {
switch (pattern) {
c... | replace | 7 | 8 | 7 | 8 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string s;
cin >> s;
vector<int> num;
if (s[0] == '0')
num.push_back(0);
for (int left = 0; left < N;) {
int right = left;
while (right < N && s[right] == s[left]) {
right++;
}
num.push_back(righ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string s;
cin >> s;
vector<int> num;
if (s[0] == '0')
num.push_back(0);
for (int left = 0; left < N;) {
int right = left;
while (right < N && s[right] == s[left]) {
right++;
}
num.push_back(righ... | replace | 24 | 25 | 24 | 25 | 0 | |
p03074 | C++ | Runtime Error | #include <iostream>
#include <numeric>
#include <vector>
using namespace std;
static const int N = 100000;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
string s;
cin >> n >> k;
cin >> s;
vector<int> v(100100);
int vidx = 2;
for (int i = 0; i < n; i++) {
if (s[i] - '0' == v... | #include <iostream>
#include <numeric>
#include <vector>
using namespace std;
static const int N = 100000;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
string s;
cin >> n >> k;
cin >> s;
vector<int> v(2 * N);
int vidx = 2;
for (int i = 0; i < n; i++) {
if (s[i] - '0' == vi... | replace | 17 | 18 | 17 | 18 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<pair<char, int>> HF;
char now = S[0];
int count = 1;
for (int i = 1; i < N; i++) {
char pre = now;
now = S[i];
if (pre == now)
count++;
else {
HF.push_back(make_pai... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<pair<char, int>> HF;
char now = S[0];
int count = 1;
for (int i = 1; i < N; i++) {
char pre = now;
now = S[i];
if (pre == now)
count++;
else {
HF.push_back(make_pai... | replace | 31 | 32 | 31 | 32 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define MEM(a, b) memset(a, (b), sizeof(a))
#define FORN(i, a, n) for (int i = a; i < n; i++)
#define FRON(i, a, n) for (int i = a; i > n; i--)
#define FOR(i, n) for (int i = 0; i < n; i++)
#define FRO(i, a) for (int i = a; i > -1; i--)
#define mp make_pair
#define pb push... | #include <bits/stdc++.h>
using namespace std;
#define MEM(a, b) memset(a, (b), sizeof(a))
#define FORN(i, a, n) for (int i = a; i < n; i++)
#define FRON(i, a, n) for (int i = a; i > n; i--)
#define FOR(i, n) for (int i = 0; i < n; i++)
#define FRO(i, a) for (int i = a; i > -1; i--)
#define mp make_pair
#define pb push... | insert | 167 | 167 | 167 | 169 | 0 | [zero]:
[3, 1]
[one]:
[0, 1, 0]
[temp]: 2
|
p03074 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string s;
cin >> s;
int c = 1;
int acc = 0;
vector<int> r;
for (int i = 0; i < N; ++i) {
if (s[i] == '0' + c) {
++acc;
if (i == N - 1)
r.push_back(acc);
} else {
c = 1 - ... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string s;
cin >> s;
int c = 1;
int acc = 0;
vector<int> r;
for (int i = 0; i < N; ++i) {
if (s[i] == '0' + c) {
++acc;
if (i == N - 1)
r.push_back(acc);
} else {
c = 1 - ... | insert | 28 | 28 | 28 | 37 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vvvi = vector<vector<vector<int>>>;
using mii = map<int, int>;
using msi = map<string, int>;
using pii =... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vvvi = vector<vector<vector<int>>>;
using mii = map<int, int>;
using msi = map<string, int>;
using pii =... | replace | 37 | 38 | 37 | 38 | 0 | |
p03074 | C++ | Runtime Error | #include <cstdio>
char s[300000];
int t[300000];
int main(void) {
int n, k;
scanf("%d%d", &n, &k);
k = 2 * k + 1;
scanf("%s", s);
char last = '0';
int j = 2;
for (int i = 0; i < n; i++) {
if (s[i] == last) {
t[j]++;
} else {
t[++j] = 1;
last = s[i];
}
}
++j;
j += 2 *... | #include <cstdio>
char s[200000];
int t[500000];
int main(void) {
int n, k;
scanf("%d%d", &n, &k);
k = 2 * k + 1;
scanf("%s", s);
char last = '0';
int j = 2;
for (int i = 0; i < n; i++) {
if (s[i] == last) {
t[j]++;
} else {
t[++j] = 1;
last = s[i];
}
}
++j;
j += 2 *... | replace | 2 | 4 | 2 | 4 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i, s, n) for (int i = s; i < n; i++)
#define NUM 2520
#define INF (1LL << 50)
#define DEBUG 0
#define mp(a, b) make_pair(a, b)
#define SORT(V) sort(V.begin(), V.end())
#define PI (3.141592653589794)
#define TO_STRING(VariableName) #Var... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i, s, n) for (int i = s; i < n; i++)
#define NUM 2520
#define INF (1LL << 50)
#define DEBUG 0
#define mp(a, b) make_pair(a, b)
#define SORT(V) sort(V.begin(), V.end())
#define PI (3.141592653589794)
#define TO_STRING(VariableName) #Var... | replace | 64 | 65 | 64 | 65 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> nums;
int now = 1;
int count = 0;
for (int i = 0; i < n; i++) {
if (s[i] == ('0' + now))
count++;
else {
nums.push_back(count);
now = 1 -... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> nums;
int now = 1;
int count = 0;
for (int i = 0; i < n; i++) {
if (s[i] == ('0' + now))
count++;
else {
nums.push_back(count);
now = 1 -... | replace | 31 | 32 | 31 | 32 | 0 | |
p03074 | C++ | Runtime Error | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
string s;
cin >> n >> k;
cin >> s;
vector<int> size(n + k + 1, 0);
int c = 0;
int group_num = 0;
bool is_zero_first = s[0] == '0';
bool is_zero_group = is_zero_first;
for (int i = 0; i < n; i++) {... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
string s;
cin >> n >> k;
cin >> s;
vector<int> size(n + 2 * k + 1, 0);
int c = 0;
int group_num = 0;
bool is_zero_first = s[0] == '0';
bool is_zero_group = is_zero_first;
for (int i = 0; i < n; i+... | replace | 12 | 13 | 12 | 13 | 0 | |
p03074 | C++ | Runtime Error | #include <iostream>
using namespace std;
char input[10010];
int main() {
input[0] = '1';
int n, k;
cin >> n >> k;
cin >> &input[1];
char *start, *cur;
start = cur = input;
int max = 0;
while (*cur) {
while (*cur && *cur == '1')
cur++;
if (!k)
break;
while (*cur && *cur == '0'... | #include <iostream>
using namespace std;
char input[100010];
int main() {
input[0] = '1';
int n, k;
cin >> n >> k;
cin >> &input[1];
char *start, *cur;
start = cur = input;
int max = 0;
while (*cur) {
while (*cur && *cur == '1')
cur++;
if (!k)
break;
while (*cur && *cur == '0... | replace | 3 | 4 | 3 | 4 | 0 | |
p03074 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
string s;
cin >> n >>... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
string s;
cin >> n >>... | replace | 47 | 48 | 47 | 48 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, b) FOR(i, 0, b)
#define RFOR(i, a, b) for (int i = a - 1; i >= b; i--)
#define RREP(i, a) RFOR(i, a, 0)
#define REPALL(i, v) for (int i = 0; i < v.size(); i++)
#define RREPALL(i, v) for (int i = v.size() - 1; i... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, b) FOR(i, 0, b)
#define RFOR(i, a, b) for (int i = a - 1; i >= b; i--)
#define RREP(i, a) RFOR(i, a, 0)
#define REPALL(i, v) for (int i = 0; i < v.size(); i++)
#define RREPALL(i, v) for (int i = v.size() - 1; i... | replace | 52 | 53 | 52 | 53 | 0 | |
p03074 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
scanf("%d %d", &n, &k);
string s;
cin >> s;
vector<int> s_array;
s_array.push_back(0);
char num = '1';
for (int i = 0; i < n; i++) {
if ((char)s[i] != num) {
s_array.push_back(1);
num = (num == '0' ? '1'... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
scanf("%d %d", &n, &k);
string s;
cin >> s;
vector<int> s_array;
s_array.push_back(0);
char num = '1';
for (int i = 0; i < n; i++) {
if ((char)s[i] != num) {
s_array.push_back(1);
num = (num == '0' ? '1'... | replace | 25 | 26 | 25 | 26 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int main() {
int N, K;
cin >> N >> K;
str... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int main() {
int N, K;
cin >> N >> K;
str... | replace | 40 | 41 | 40 | 41 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string s;
int n, k, c = 0;
vector<int> a;
cin >> n >> k >> s;
rep(i, n) {
int j = i;
while (s[j + 1] == s[j] && j + 1 < n)
j++;
a.push_back(j - i + 1);
i = j;
}
reverse(a.b... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string s;
int n, k, c = 0;
vector<int> a;
cin >> n >> k >> s;
rep(i, n) {
int j = i;
while (s[j + 1] == s[j] && j + 1 < n)
j++;
a.push_back(j - i + 1);
i = j;
}
reverse(a.b... | replace | 21 | 22 | 21 | 22 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
#define itn int
#define REP(i, n) for (int i = 0; i < n; i++)
#define IREP(i, n) for (int i = n - 1; i >= 0; i--)
#define REPEACH(i, k) for (auto &i : k)
#define all(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
signed main()... | #include <bits/stdc++.h>
#define itn int
#define REP(i, n) for (int i = 0; i < n; i++)
#define IREP(i, n) for (int i = n - 1; i >= 0; i--)
#define REPEACH(i, k) for (auto &i : k)
#define all(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
signed main()... | replace | 31 | 32 | 31 | 32 | 0 | |
p03074 | C++ | Runtime Error | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, n) for (int i = 0; i... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, n) for (int i = 0; i... | replace | 56 | 57 | 56 | 57 | 0 | |
p03074 | C++ | Runtime Error | /*{{{*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define SZ(X) ((int)(X).size())
#defin... | /*{{{*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define SZ(X) ((int)(X).size())
#defin... | replace | 112 | 113 | 112 | 113 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, st, n) for (int i = st; i < n; ++i)
using pii = pair<int, int>;
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define inf (int)1e9 + 7
#define eb emplace_back
template... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, st, n) for (int i = st; i < n; ++i)
using pii = pair<int, int>;
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define inf (int)1e9 + 7
#define eb emplace_back
template... | replace | 44 | 45 | 44 | 45 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, st, n) for (int i = st; i < n; ++i)
using pii = pair<int, int>;
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define inf (int)1e9 + 7
#define eb emplace_back
template... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, st, n) for (int i = st; i < n; ++i)
using pii = pair<int, int>;
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define inf (int)1e9 + 7
#define eb emplace_back
template... | replace | 45 | 46 | 45 | 46 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, st, n) for (int i = st; i < n; ++i)
using pii = pair<int, int>;
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define inf (int)1e9 + 7
#define eb emplace_back
template... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, st, n) for (int i = st; i < n; ++i)
using pii = pair<int, int>;
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define inf (int)1e9 + 7
#define eb emplace_back
template... | replace | 53 | 54 | 53 | 58 | 0 | |
p03074 | C++ | Runtime Error | /*Function Template*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define IOS \
ios::s... | /*Function Template*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define IOS \
ios::s... | replace | 146 | 147 | 146 | 147 | -6 | free(): invalid pointer
|
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
bool one_start = (S.at(0) == '1');
vector<int> arr(100000);
int idx = 0;
char pre = '1';
if (S.at(0) == '0') { // 0スタートだった
idx++;
arr.at(0) = 0; // 1が0個あることにする
pre... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
bool one_start = (S.at(0) == '1');
vector<int> arr(1000000);
int idx = 0;
char pre = '1';
if (S.at(0) == '0') { // 0スタートだった
idx++;
arr.at(0) = 0; // 1が0個あることにする
pr... | replace | 10 | 11 | 10 | 11 | 0 | |
p03074 | C++ | Runtime Error | #include <algorithm>
#include <fstream>
#include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
typedef long long ll;
int main() {
std::ifstream in("input.txt");
std::cin.rdbuf(in.rdbuf());
ll N, K;
... | #include <algorithm>
#include <fstream>
#include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
typedef long long ll;
int main() {
ll N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> numbers;
... | delete | 16 | 19 | 16 | 16 | -11 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
static const ll MAX = 1000000000000000;
static const int NIL = -1;
using namespace std;
const long double EPS = 0.0000000001;
const long double PI = (acos(-1));
const ll MOD = 1e9 + 7;
#pragma GCC target("avx2")
#pra... | #include <bits/stdc++.h>
#define ll long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
static const ll MAX = 1000000000000000;
static const int NIL = -1;
using namespace std;
const long double EPS = 0.0000000001;
const long double PI = (acos(-1));
const ll MOD = 1e9 + 7;
#pragma GCC target("avx2")
#pra... | insert | 36 | 36 | 36 | 40 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
const int N = 1e5 + 5, M = 1e9 + 7;
const ull base = 13331;
const double Pi = acos(-1.0);
const ll C = 299792458;
char a[N];
struct node {
int x, v;
} h[N];
int main() {
ios::sync_with_stdio(false);
int n, k;
cin >... | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
const int N = 1e6 + 5, M = 1e9 + 7;
const ull base = 13331;
const double Pi = acos(-1.0);
const ll C = 299792458;
char a[N];
struct node {
int x, v;
} h[N];
int main() {
ios::sync_with_stdio(false);
int n, k;
cin >... | replace | 4 | 5 | 4 | 5 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
const ll MOD = 1000000007;
const ll nmax = 8;
const ll INF = 1e9;
bool graph[nmax][nmax];
vector<vector<ll>> di... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
const ll MOD = 1000000007;
const ll nmax = 8;
const ll INF = 1e9;
bool graph[nmax][nmax];
vector<vector<ll>> di... | replace | 117 | 118 | 117 | 118 | 0 | |
p03074 | C++ | Runtime Error |
#include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <float.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <... |
#include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <float.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <... | replace | 99 | 100 | 99 | 100 | 0 | |
p03074 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <float.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#inclu... | #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <float.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#inclu... | replace | 98 | 99 | 98 | 99 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define all(v) v.begin(), v.end()
#define mod 1000000007
//'A' = 65, 'Z' = 90, 'a' = 97, 'z' = 122
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> t;
int now = 1;
in... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define all(v) v.begin(), v.end()
#define mod 1000000007
//'A' = 65, 'Z' = 90, 'a' = 97, 'z' = 122
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> t;
int now = 1;
in... | replace | 34 | 35 | 34 | 35 | 0 | |
p03074 | C++ | Runtime Error | /*
* Matheus Oliveira
* 01:55:36 14/04/2019
* abc124d.cpp
*/
#include <bits/stdc++.h>
using namespace std;
#define EPS
#define INF
#define MAXN 100100
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define debug(x) printf("%s: %d\n", #x, x);
#define debugarr(x, ini, fim) ... | /*
* Matheus Oliveira
* 01:55:36 14/04/2019
* abc124d.cpp
*/
#include <bits/stdc++.h>
using namespace std;
#define EPS
#define INF
#define MAXN 100100
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define debug(x) printf("%s: %d\n", #x, x);
#define debugarr(x, ini, fim) ... | replace | 76 | 77 | 76 | 77 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(false);
cout.precision(20);
}
} fast;
/* define */
#define FOR(I, X, Y) for (long long(I) = (X); (I) < (Y); (I)++)
#define REP(I, X, Y) for (long long(I) = (Y)-1; (I) >= (X); (I)--)
#define ALL(X)... | #include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(false);
cout.precision(20);
}
} fast;
/* define */
#define FOR(I, X, Y) for (long long(I) = (X); (I) < (Y); (I)++)
#define REP(I, X, Y) for (long long(I) = (Y)-1; (I) >= (X); (I)--)
#define ALL(X)... | replace | 96 | 97 | 96 | 97 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> nums;
int tmp = 1;
int cnt = 0;
for (int i = 0; i < N; i++) {
if (S[i] == (char)('0' + tmp)) {
cnt++;
} else {
nums.push_back(cnt);
cnt = 1;
tmp = 1 - t... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> nums;
int tmp = 1;
int cnt = 0;
for (int i = 0; i < N; i++) {
if (S[i] == (char)('0' + tmp)) {
cnt++;
} else {
nums.push_back(cnt);
cnt = 1;
tmp = 1 - t... | replace | 31 | 32 | 31 | 32 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
int main() {
int n, k, sum = 0;
int ans = 0;
cin >> n >> k;
string s;
cin >> s;
vector<int> a;
int count = 1;
if (s[0] == '0')
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
int main() {
int n, k, sum = 0;
int ans = 0;
cin >> n >> k;
string s;
cin >> s;
vector<int> a;
int count = 1;
if (s[0] == '0')
... | insert | 34 | 34 | 34 | 39 | 0 | |
p03074 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> Nums;
// 1-0-1-0-1-0を作りたい。
int now = 1;
int cnt = 0;
for (int i = 0; i < N; i++) {
if (S[i] == (char)('0' + now))
cnt++;
else {
Nums.push_back(cnt);
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> Nums;
// 1-0-1-0-1-0を作りたい。
int now = 1;
int cnt = 0;
for (int i = 0; i < N; i++) {
if (S[i] == (char)('0' + now))
cnt++;
else {
Nums.push_back(cnt);
... | replace | 47 | 48 | 47 | 48 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// types
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
typedef vector<ll> vll;
// macros
#define ALL(a) a.begin(), a.end()
#define SZ(a) ((int)a.size())
#define FI first
#define SE second
#def... | #include <bits/stdc++.h>
using namespace std;
// types
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
typedef vector<ll> vll;
// macros
#define ALL(a) a.begin(), a.end()
#define SZ(a) ((int)a.size())
#define FI first
#define SE second
#def... | replace | 66 | 67 | 66 | 67 | 0 | |
p03074 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
const int64_t cc = pow(10, 9) + 7;
int main() {
int64_t a, b, c, d;
std::cin >> a;
std::cin >> b;
std::string str;
std::cin >> str;
std:... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
const int64_t cc = pow(10, 9) + 7;
int main() {
int64_t a, b, c, d;
std::cin >> a;
std::cin >> b;
std::string str;
std::cin >> str;
std:... | replace | 53 | 54 | 53 | 54 | 0 | |
p03074 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(false);
int n, k, z = 0;
vector<int> a = {0};
string s;
cin >> n >> k >> s;
if (... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(false);
int n, k, z = 0;
vector<int> a = {0};
string s;
cin >> n >> k >> s;
if (... | replace | 25 | 26 | 25 | 26 | 0 | |
p03074 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string.h>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
string s;
... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string.h>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
string s;
... | replace | 45 | 46 | 45 | 46 | 0 | |
p03074 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i < (int)n; i++)
#define FOR(i, m, n) for (int i = (int)m; i < (int)n; i++)
#defi... | #include <algorithm>
#include <climits>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i < (int)n; i++)
#define FOR(i, m, n) for (int i = (int)m; i < (int)n; i++)
#defi... | insert | 63 | 63 | 63 | 65 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> a;
a.push_back(0);
for (int i = 0; i < N;) {
int cnt = 0;
if (S[i] == '0') {
while (i < N && S[i] == '0') {
i++;
cnt--;
}
} else... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> a;
a.push_back(0);
for (int i = 0; i < N;) {
int cnt = 0;
if (S[i] == '0') {
while (i < N && S[i] == '0') {
i++;
cnt--;
}
} else... | replace | 37 | 38 | 37 | 38 | 0 | |
p03074 | C++ | Runtime Error | #include <algorithm>
#include <assert.h>
#include <chrono>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string.h>
#include <time.h>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#define rnd mt1... | #include <algorithm>
#include <assert.h>
#include <chrono>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string.h>
#include <time.h>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#define rnd mt1... | replace | 54 | 55 | 54 | 55 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LLINF = 1e18;
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define ANS(n) cout << (n) << endl
#define FOR(i, a, b) for (int i = (a); i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LLINF = 1e18;
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define ANS(n) cout << (n) << endl
#define FOR(i, a, b) for (int i = (a); i... | replace | 43 | 44 | 43 | 44 | 0 | |
p03074 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <set>
#include <string>
#include <vector>
#define MOD 1000000007
using namespace std;
int main() {
int n, k;
string s;
cin >> n >> k;
cin >> s;
vector<int> Nums;
int now = 1;
int cnt = 0;
for (int i = 0; i < n; i++) {
if (... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <set>
#include <string>
#include <vector>
#define MOD 1000000007
using namespace std;
int main() {
int n, k;
string s;
cin >> n >> k;
cin >> s;
vector<int> Nums;
int now = 1;
int cnt = 0;
for (int i = 0; i < n; i++) {
if (... | replace | 48 | 49 | 48 | 53 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repp(i, a, b) for (int i = a; i <= (b); ++i)
#define repr(i, a, b) for (int i = a; i >= (b); --i)
typedef long long ll;
cons... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repp(i, a, b) for (int i = a; i <= (b); ++i)
#define repr(i, a, b) for (int i = a; i >= (b); --i)
typedef long long ll;
cons... | replace | 57 | 58 | 57 | 58 | 0 | |
p03074 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <type_traits>
#include <vector>
using namespace std;
#define INF (1ll << 60)
#define INFint (1 << 30)
#define MOD 10... | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <type_traits>
#include <vector>
using namespace std;
#define INF (1ll << 60)
#define INFint (1 << 30)
#define MOD 10... | replace | 93 | 94 | 93 | 94 | 0 | |
p03074 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> Nums;
int now = 1; // 今見ている数
int cnt = 0; // nowがいくつ並んでいるか
for (int i = 0; i < N; i++) {
if (S[i] == (char)('0' + now))
cnt+... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> Nums;
int now = 1; // 今見ている数
int cnt = 0; // nowがいくつ並んでいるか
for (int i = 0; i < N; i++) {
if (S[i] == (char)('0' + now))
cnt+... | replace | 39 | 40 | 39 | 40 | 0 | |
p03074 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> Nums;
int now = 1; // 今見ている数
int cnt = 0; // nowがいくつ並んでいるか
for (int i = 0; i < N; i++) {
if (S[i] == (char)('0' + now))
cnt+... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> Nums;
int now = 1; // 今見ている数
int cnt = 0; // nowがいくつ並んでいるか
for (int i = 0; i < N; i++) {
if (S[i] == (char)('0' + now))
cnt+... | replace | 41 | 42 | 41 | 42 | 0 | |
p03074 | C++ | Runtime Error | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> a;
int b = (s[0] == '0' ? 0 : 1);
a.push_back(1);
for (int i = 1; i < n; ++i) {
if (s[i] == s[i - 1]) {
++a.back();
} else {
a.push_ba... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> a;
int b = (s[0] == '0' ? 0 : 1);
a.push_back(1);
for (int i = 1; i < n; ++i) {
if (s[i] == s[i - 1]) {
++a.back();
} else {
a.push_ba... | replace | 24 | 25 | 24 | 25 | 0 | |
p03074 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
ll count = 1, ans = 0;
vector<ll> stand, handstand;
for (int i = 1; i < N; i++) {
if (S[i] != S[i - 1]) {
if (S[i - 1] == '1') {
handstand.push_back(count);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
ll count = 1, ans = 0;
vector<ll> stand, handstand;
for (int i = 1; i < N; i++) {
if (S[i] != S[i - 1]) {
if (S[i - 1] == '1') {
handstand.push_back(count);
... | replace | 41 | 42 | 41 | 42 | TLE | |
p03074 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
int n, k, a[100005];
vector<int> v, av;
int main(void) {
scanf("%d %d", &n, &k);
for (int i = 1; i <= n; i++)
scanf("%1d", &a[i]);
if (a[1] == 0)
v.push_back(0);
int len = 0;
for (int i = 1; i <= n; i++) {
if (i > 1 &&... | #include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
int n, k, a[100005];
vector<int> v, av;
int main(void) {
scanf("%d %d", &n, &k);
for (int i = 1; i <= n; i++)
scanf("%1d", &a[i]);
if (a[1] == 0)
v.push_back(0);
int len = 0;
for (int i = 1; i <= n; i++) {
if (i > 1 &&... | replace | 23 | 24 | 23 | 24 | 0 | |
p03074 | C++ | Runtime Error | #include <algorithm>
#include <cstdint>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, s, t) for (int i ... | #include <algorithm>
#include <cstdint>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, s, t) for (int i ... | replace | 177 | 178 | 177 | 179 | 0 | |
p03074 | C++ | Runtime Error | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define str to_string
#define endl "\n"
#define PI 3.141592653589
using namespace std;
using lint = long long;
template <class T> ostream &operator<<(ostream &o, const vector<T> &v) {
o << "{";
for (int i = 0;... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define str to_string
#define endl "\n"
#define PI 3.141592653589
using namespace std;
using lint = long long;
template <class T> ostream &operator<<(ostream &o, const vector<T> &v) {
o << "{";
for (int i = 0;... | replace | 93 | 94 | 93 | 96 | -6 | /usr/include/c++/12/debug/vector:442:
In function:
std::debug::vector<_Tp, _Allocator>::reference std::debug::vector<_Tp,
_Allocator>::operator[](size_type) [with _Tp = int; _Allocator =
std::allocator<int>; reference = int&; size_type = long unsigned int]
Error: attempt to subscript container with out-o... |
p03074 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <vector>
using namespace std;
int N;
int K;
char hito[200000];
int renzoku[20000];
int kotae;
int kotae2;
int main() {
cin >> N >> K;
for (int i = 0; i < N; i++) {
cin >> hi... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <vector>
using namespace std;
int N;
int K;
char hito[200000];
int renzoku[200000];
int kotae;
int kotae2;
int main() {
cin >> N >> K;
for (int i = 0; i < N; i++) {
cin >> h... | replace | 14 | 15 | 14 | 15 | 0 | |
p03074 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> vec;
// 0,2,4,,番目に連続する1の個数を、1,3,5,,,番目に連続する0の個数をpush_backする
if (S[0] == '0') {
vec.push_back(0);
} // 最初の連続する1の個数は０
int head = 0;
while (head < N) {
// headは0(または１）の連続する個数を数え... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<int> vec;
// 0,2,4,,番目に連続する1の個数を、1,3,5,,,番目に連続する0の個数をpush_backする
if (S[0] == '0') {
vec.push_back(0);
} // 最初の連続する1の個数は０
int head = 0;
while (head < N) {
// headは0(または１）の連続する個数を数え... | replace | 19 | 20 | 19 | 20 | TLE | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define INF 2147483647
#define INFF 9223372036854775807
#define ll long long
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, m, n) for (int i = m; i < n; i++)
#define ALL(N) (N.begin(), N.end())
#define de cout << "debug" << endl;
#define pb push_back
template... | #include <bits/stdc++.h>
using namespace std;
#define INF 2147483647
#define INFF 9223372036854775807
#define ll long long
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, m, n) for (int i = m; i < n; i++)
#define ALL(N) (N.begin(), N.end())
#define de cout << "debug" << endl;
#define pb push_back
template... | insert | 73 | 73 | 73 | 77 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, s, n) for (int i = s; i < (n); ++i)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
static const int INTINF = (2147483647);
static const ll LLINF = (9223372036854775807);
static const int MAX = 1... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, s, n) for (int i = s; i < (n); ++i)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
static const int INTINF = (2147483647);
static const ll LLINF = (9223372036854775807);
static const int MAX = 1... | replace | 103 | 104 | 103 | 104 | 0 | |
p03074 | C++ | Runtime Error |
#include <algorithm>
#include <bits/stdc++.h>
#include <deque>
#include <iomanip>
#include <limits>
#include <map>
#include <math.h>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
#define... |
#include <algorithm>
#include <bits/stdc++.h>
#include <deque>
#include <iomanip>
#include <limits>
#include <map>
#include <math.h>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
#define... | delete | 46 | 53 | 46 | 46 | 0 | |
p03074 | C++ | Runtime Error |
#include <algorithm>
#include <fstream>
#include <functional>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define rep(i, start, end) for (int i = (int)(start); i < (int)(end); i++)
#define charToInt(c) c - 'a'
int main(int argc, const char *argv[]) {
std::ifstream in("/Users/tolem... |
#include <algorithm>
#include <fstream>
#include <functional>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define rep(i, start, end) for (int i = (int)(start); i < (int)(end); i++)
#define charToInt(c) c - 'a'
int main(int argc, const char *argv[]) {
int n, k;
cin >> n >> k;
... | delete | 15 | 17 | 15 | 15 | -11 | |
p03074 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define endl "\n"
using namespac... | #include <bits/stdc++.h>
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define endl "\n"
using namespac... | replace | 28 | 39 | 28 | 53 | TLE | |
p03074 | C++ | Time Limit Exceeded | #include <iostream>
#include <string>
#include <vector>
std::vector<int64_t> calc_seq(std::vector<int64_t> &xs) {
auto seq = std::vector<int64_t>{};
auto count = 1;
for (size_t i = 0; i < xs.size() - 1; i++) {
if (xs[i] == xs[i + 1]) {
count++;
} else {
seq.push_back(count);
count = 1;
... | #include <iostream>
#include <string>
#include <vector>
std::vector<int64_t> calc_seq(std::vector<int64_t> &xs) {
auto seq = std::vector<int64_t>{};
auto count = 1;
for (size_t i = 0; i < xs.size() - 1; i++) {
if (xs[i] == xs[i + 1]) {
count++;
} else {
seq.push_back(count);
count = 1;
... | replace | 50 | 52 | 50 | 52 | TLE | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int n, k;
string s;
P p[505];
int main(void) {
scanf("%d%d", &n, &k);
cin >> s;
int prev = (s[0] - '0');
int cnt = 0;
int sz = 0;
for (int i = 0; i < n; i++) {
if (prev != (s[i] - '0'... | #include <bits/stdc++.h>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int n, k;
string s;
P p[100005];
int main(void) {
scanf("%d%d", &n, &k);
cin >> s;
int prev = (s[0] - '0');
int cnt = 0;
int sz = 0;
for (int i = 0; i < n; i++) {
if (prev != (s[i] - ... | replace | 8 | 9 | 8 | 9 | 0 | |
p03074 | C++ | Runtime Error | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
string str;
cin >> N >> K >> str;
vector<int> vec;
if (str[0] == '0')
vec.push_back(0);
int cnt = 1;
for (int i = 1; i < N; i++) {
if (str[i - 1] == str[i]) {
cnt++;
} else {
vec.p... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
string str;
cin >> N >> K >> str;
vector<int> vec;
if (str[0] == '0')
vec.push_back(0);
int cnt = 1;
for (int i = 1; i < N; i++) {
if (str[i - 1] == str[i]) {
cnt++;
} else {
vec.p... | replace | 25 | 26 | 25 | 26 | 0 | |
p03074 | Python | Runtime Error | from itertools import groupby, accumulate
# 入力
N, K = map(int, input().split())
S = input()
# 連続する0または1の数に関する累積和
A = list(accumulate(len(list(seq)) for _, seq in groupby(S))) + [N]
m = 1 if S[0] == "0" else 0
# 累積和を用いて解を求める
ans = (
max(
A[2 * K - 1],
A[-1] - A[-(2 * K)],
max((a - b for a, ... | from itertools import groupby, accumulate
# 入力
N, K = map(int, input().split())
S = input()
# 連続する0または1の数に関する累積和
A = list(accumulate(len(list(seq)) for _, seq in groupby(S))) + [N]
m = 1 if S[0] == "0" else 0
# 累積和を用いて解を求める
ans = (
max(
A[min(2 * K - 1, len(A) - 1)],
A[-1] - A[max(-(2 * K), -len(A... | replace | 12 | 14 | 12 | 14 | 0 | |
p03074 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstdlib>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using name... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstdlib>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using name... | replace | 222 | 223 | 222 | 223 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
const ll INF = (ll)1 << 60;
int main() {
int N, K;
string S;
cin >> N >> K;
cin >> S;
vector<int> Nums;
int now = 1;
int cnt = 0;
rep(i, N) {
if (S[i] == (char)('0') + now)
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
const ll INF = (ll)1 << 60;
int main() {
int N, K;
string S;
cin >> N >> K;
cin >> S;
vector<int> Nums;
int now = 1;
int cnt = 0;
rep(i, N) {
if (S[i] == (char)('0') + now)
... | replace | 33 | 34 | 33 | 34 | 0 | |
p03074 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
#define INF (1e9)
int N, K;
int main() {
cin >> N >> K;
string S;
cin >> S;
vi change(0);
if (S[0]... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
#define INF (1e9)
int N, K;
int main() {
cin >> N >> K;
string S;
cin >> S;
vi change(0);
if (S[0]... | replace | 36 | 37 | 36 | 38 | 0 | |
p03074 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int n, k;
string s;
cin >> n >> k >> s;
vector<int> Nums;
int now = 1;
int cnt = 0;
rep(i, ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int n, k;
string s;
cin >> n >> k >> s;
vector<int> Nums;
int now = 1;
int cnt = 0;
rep(i, ... | replace | 37 | 38 | 37 | 38 | 0 | |
p03074 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typ... | replace | 74 | 75 | 74 | 75 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define d(x) cerr << #x ":" << x << endl;
#define dd(x, y) cerr << "(" #x "," #y "):(" << x << "," << y << ")" << endl
#define rep(i, n) for (int i = (int)(0); i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define dump(v) ... | #include <bits/stdc++.h>
using namespace std;
#define d(x) cerr << #x ":" << x << endl;
#define dd(x, y) cerr << "(" #x "," #y "):(" << x << "," << y << ")" << endl
#define rep(i, n) for (int i = (int)(0); i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define dump(v) ... | replace | 56 | 58 | 56 | 58 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, K;
cin >> n >> K;
string s;
cin >> s;
vector<P> v;
for (char c : s) {
int tar = (c - '0');
if (v.empty()) {
v.emplace_back(tar, 1);
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, K;
cin >> n >> K;
string s;
cin >> s;
vector<P> v;
for (char c : s) {
int tar = (c - '0');
if (v.empty()) {
v.emplace_back(tar, 1);
... | replace | 33 | 34 | 33 | 34 | 0 | |
p03074 | C++ | Runtime Error | #include <iostream>
#include <numeric>
#include <string>
#include <vector>
int main() {
int n, k;
std::cin >> n >> k;
std::string s;
std::cin >> s;
s += 'E';
std::vector<int> a;
int i = 0;
while (i < n) {
int x = 0;
while (s[i] == '1') {
x++;
i++;
}
a.push_back(x);
int y ... | #include <iostream>
#include <numeric>
#include <string>
#include <vector>
int main() {
int n, k;
std::cin >> n >> k;
std::string s;
std::cin >> s;
s += 'E';
std::vector<int> a;
int i = 0;
while (i < n) {
int x = 0;
while (s[i] == '1') {
x++;
i++;
}
a.push_back(x);
int y ... | insert | 27 | 27 | 27 | 28 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, d, n) for (int i = (d); i < (n); ++i)
#define all(v) v.begin(), v.end()
using ll = long long;
using P = pair<char, int>;
int main() {
int n, k;
string s;
cin >> n >> k >> s;
vector<P> vp;
if (s[0] =... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, d, n) for (int i = (d); i < (n); ++i)
#define all(v) v.begin(), v.end()
using ll = long long;
using P = pair<char, int>;
int main() {
int n, k;
string s;
cin >> n >> k >> s;
vector<P> vp;
if (s[0] =... | insert | 30 | 30 | 30 | 35 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define For(i, n, k) for (ll i = (n); i < (k); i++)
ll n, k, ans = 0;
string s;
void Main() {
cin >> n >> k >> s;
vector<ll> bound;
bound.push_back(0);
For(i, 1, n) {
if (s.at(i - 1) != s.at(i)) {
bound.push_back(i);
}
}
ll l ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define For(i, n, k) for (ll i = (n); i < (k); i++)
ll n, k, ans = 0;
string s;
void Main() {
cin >> n >> k >> s;
vector<ll> bound;
bound.push_back(0);
For(i, 1, n) {
if (s.at(i - 1) != s.at(i)) {
bound.push_back(i);
}
}
ll l ... | replace | 16 | 17 | 16 | 17 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
#define all(x) begin(x), end(x)
#define dbg(x) cerr << #x << " = " << x << endl
#define _ << ' ' <<
using namespace std;
using ll = long long;
using vi = vector<int>;
int n, k;
string s;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> k >> s;
vi v;
s += 'x';
int ... | #include <bits/stdc++.h>
#define all(x) begin(x), end(x)
#define dbg(x) cerr << #x << " = " << x << endl
#define _ << ' ' <<
using namespace std;
using ll = long long;
using vi = vector<int>;
int n, k;
string s;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> k >> s;
vi v;
s += 'x';
int ... | replace | 31 | 32 | 31 | 32 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, m, n) for (int i = m; i < n; ++i)
#define rem(i, m, n) for (int i = m; i >= n; --i)
typedef long long ll;
#define mod 1000000007
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> boo... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, m, n) for (int i = m; i < n; ++i)
#define rem(i, m, n) for (int i = m; i >= n; --i)
typedef long long ll;
#define mod 1000000007
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> boo... | insert | 52 | 52 | 52 | 56 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int n, k;
string s;
cin >> n >> k >> s;
vector<int> a;
int x = 0;
rep(i, n) if (s[i] == '1') x++;
if (x == s.size()) {
cout << x << endl;
return 0;
}
if (s[0] == '0... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int n, k;
string s;
cin >> n >> k >> s;
vector<int> a;
int x = 0;
rep(i, n) if (s[i] == '1') x++;
if (x == s.size()) {
cout << x << endl;
return 0;
}
if (s[0] == '0... | replace | 31 | 33 | 31 | 33 | 0 | |
p03074 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
conste... | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
conste... | replace | 40 | 41 | 40 | 41 | 0 | |
p03074 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define P pair<int, int>
using ll = int64_t;
using namespace std;
#define ketasuu(n) fixed << setprecision(n)
#define btoe(p) p.begin(), p.end()
#define etob(p) p.rbegin(), p.rend()
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define P pair<int, int>
using ll = int64_t;
using namespace std;
#define ketasuu(n) fixed << setprecision(n)
#define btoe(p) p.begin(), p.end()
#define etob(p) p.rbegin(), p.rend()
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s... | insert | 46 | 46 | 46 | 48 | TLE | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
string s;
cin >> n >> k;
cin >> s;
vector<int> cnt;
cnt.push_back(0);
char prev = '1';
for (int i = 0; i < n; ++i) {
if (s[i] == prev)
++cnt.back();
else {
prev = s[i];
cnt.push_back(1);
}
}
if (prev... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
string s;
cin >> n >> k;
cin >> s;
vector<int> cnt;
cnt.push_back(0);
char prev = '1';
for (int i = 0; i < n; ++i) {
if (s[i] == prev)
++cnt.back();
else {
prev = s[i];
cnt.push_back(1);
}
}
if (prev... | replace | 33 | 34 | 33 | 34 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int INF = 1e9;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> a;
int cnt = 1;
bool flag;
if (s[0] == '... | #include <bits/stdc++.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int INF = 1e9;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> a;
int cnt = 1;
bool flag;
if (s[0] == '... | replace | 54 | 56 | 54 | 58 | 0 | |
p03074 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<ll, ll> l_l;
const int INF = 1001001000;
const int mINF = -1001001000;
const ll LINF = 1010010010010010000;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
int cnt = 0;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<ll, ll> l_l;
const int INF = 1001001000;
const int mINF = -1001001000;
const ll LINF = 1010010010010010000;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
int cnt = 0;
... | replace | 34 | 35 | 34 | 35 | 0 | |
p03075 | Python | Runtime Error | def solve(string):
a, *_, e, k = map(int, string.split())
return "Yay!" if e - a <= k else ":("
if __name__ == "__main__":
print(solve(input()))
| def solve(string):
a, *_, e, k = map(int, string.split())
return "Yay!" if e - a <= k else ":("
if __name__ == "__main__":
print(solve("\n".join([input() for _ in range(6)])))
| replace | 6 | 7 | 6 | 7 | ValueError: not enough values to unpack (expected at least 3, got 1) | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03075/Python/s621656186.py", line 7, in <module>
print(solve(input()))
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03075/Python/s621656186.py", line 2, in solve
a, *_, e, k = map(... |
p03075 | C++ | Time Limit Exceeded | #include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int p[5];
int k;
for (int i = 0; i < 5; ++i)
cin >> p[i];
cin >> k;
string ans = "Yay!";
for (int i = 0; i < 6; ++i) {
for (int j = 0; j < 6; ++j) {
if (abs(p[i] - p[j]) > k)
ans = ":(";
}
... | #include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int p[5];
int k;
for (int i = 0; i < 5; ++i)
cin >> p[i];
cin >> k;
if (abs(p[0] - p[4]) > k)
cout << ":(" << endl;
else
cout << "Yay!" << endl;
}
| replace | 13 | 22 | 13 | 17 | TLE | |
p03075 | C++ | Runtime Error | #include <cstring>
#include <iostream>
using namespace std;
int main() {
int num = 5;
int input[num], k;
for (int i = 0; i < num; i++) {
cin >> input[i];
}
cin >> k;
for (int i = 0; i < num; i++) {
for (int j = i + 1; j < num; j++) {
if (input[j] - input[i] > k) {
cout << ":(" << end... | #include <cstring>
#include <iostream>
using namespace std;
int main() {
int num = 5;
int input[num], k;
for (int i = 0; i < num; i++) {
cin >> input[i];
}
cin >> k;
for (int i = 0; i < num; i++) {
for (int j = i + 1; j < num; j++) {
if (input[j] - input[i] > k) {
cout << ":(" << end... | replace | 16 | 17 | 16 | 17 | 0 | |
p03075 | C++ | Runtime Error | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define bit(x) (1L << (x))
using ll = long long;
using namespace std;
template <typename T> vector<T> make_v(size_t a, T b) {
return vector<T>(a, b);
}
template <typenam... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define bit(x) (1L << (x))
using ll = long long;
using namespace std;
template <typename T> vector<T> make_v(size_t a, T b) {
return vector<T>(a, b);
}
template <typenam... | replace | 17 | 18 | 17 | 18 | -11 | |
p03075 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> code;
for (int i = 0; i < 5; i++) {
cin >> code.at(i);
}
int K;
cin >> K;
int dif;
for (int i = 0; i < 4; i++) {
for (int j = 1; j < 5; j++) {
dif = code.at(j) - code.at(i);
if (dif > K) {
cout << ":(" << e... | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> code(5);
for (int i = 0; i < 5; i++) {
cin >> code.at(i);
}
int K;
cin >> K;
int dif;
for (int i = 0; i < 4; i++) {
for (int j = 1; j < 5; j++) {
dif = code.at(j) - code.at(i);
if (dif > K) {
cout << ":(" <... | replace | 4 | 5 | 4 | 5 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 0) >= this->size() (which is 0)
|
p03075 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const unsigned int MOD = 1000000007;
#define ll long long
#define PI 3.1416
string day[] = {"SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"};
vector<string> v;
void dfs(string str, string t = "", int cnt = 0) {
if (cnt == 2) {
v.push_back(t);
return;
} else {
... | #include <bits/stdc++.h>
using namespace std;
const unsigned int MOD = 1000000007;
#define ll long long
#define PI 3.1416
string day[] = {"SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"};
vector<string> v;
void dfs(string str, string t = "", int cnt = 0) {
if (cnt == 2) {
v.push_back(t);
return;
} else {
... | replace | 20 | 38 | 20 | 23 | TLE | |
p03075 | C++ | Runtime Error | #include <stdio.h>
int main(void) {
int num[6] = {0};
for (int i = 0; i < 6; i++) {
scanf("%d", num[i]);
getchar();
}
if (num[4] - num[0] > num[5]) {
printf(":(\n");
} else {
printf("Yay!\n");
}
return 0;
} | #include <stdio.h>
int main(void) {
int num[6] = {0};
for (int i = 0; i < 6; i++) {
scanf("%d", &num[i]);
getchar();
}
if (num[4] - num[0] > num[5]) {
printf(":(\n");
} else {
printf("Yay!\n");
}
return 0;
} | replace | 4 | 5 | 4 | 5 | -11 | |
p03075 | C++ | Time Limit Exceeded | #include <iostream>
#include <stdio.h>
using namespace std;
int main(void) {
int antennas[5];
int k;
for (int i = 0; i < 5; i++) {
scanf("%d", &antennas[i]);
}
scanf("%d", &k);
string ans = "Yay!";
for (int i = 1; i <= 5; i++) {
if (antennas[i] - antennas[i - 1] > k)
ans = ":(";
}
cout ... | #include <iostream>
#include <stdio.h>
using namespace std;
int main(void) {
int antennas[5];
int k;
for (int i = 0; i < 5; i++) {
scanf("%d", &antennas[i]);
}
scanf("%d", &k);
printf(antennas[4] - antennas[0] <= k ? "Yay!\n" : ":(\n");
return 0;
}
| replace | 11 | 17 | 11 | 12 | TLE | |
p03075 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> x;
int k;
for (int i = 0; i < 5; i++) {
cin >> x.at(i);
}
cin >> k;
sort(x.begin(), x.end());
if (x.at(4) - x.at(0) <= k) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> x(5);
int k;
for (int i = 0; i < 5; i++) {
cin >> x.at(i);
}
cin >> k;
sort(x.begin(), x.end());
if (x.at(4) - x.at(0) <= k) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
} | replace | 4 | 5 | 4 | 5 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 0) >= this->size() (which is 0)
|
p03075 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> a(5);
for (int i = 0; i < 5; i++) {
cin >> a.at(i);
}
sort(a.begin(), a.end());
int k;
cin >> k;
if ((a.at(5) - a.at(0)) <= k) {
cout << "Yey!" << endl;
} else {
cout << ":(" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> a(5);
for (int i = 0; i < 5; i++) {
cin >> a.at(i);
}
sort(a.begin(), a.end());
int k;
cin >> k;
if ((a.at(4) - a.at(0)) <= k) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
}
| replace | 10 | 12 | 10 | 12 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 5) >= this->size() (which is 5)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.