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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p03086 | Python | Runtime Error | s = input()
ans = []
acgt = ["A", "C", "G", "T"]
cnt = 0
for i in range(len(s)):
if s[i] in acgt:
cnt += 1
else:
ans.append(cnt)
cnt = 0
print(max(ans))
| s = input()
ans = []
acgt = ["A", "C", "G", "T"]
cnt = 0
for i in range(len(s)):
if s[i] in acgt:
cnt += 1
else:
ans.append(cnt)
cnt = 0
ans.append(cnt)
print(max(ans))
| insert | 11 | 11 | 11 | 12 | 0 | |
p03086 | Python | Runtime Error | s = input()
s.append("X")
pat = ["A", "C", "G", "T"]
mx = 0
count = 0
for i in range(len(s)):
if s[i] in pat:
count += 1
else:
if count > mx:
mx = count
count = 0
print(mx)
| s = input()
s += "X"
pat = ["A", "C", "G", "T"]
mx = 0
count = 0
for i in range(len(s)):
if s[i] in pat:
count += 1
else:
if count > mx:
mx = count
count = 0
print(mx)
| replace | 2 | 3 | 2 | 3 | AttributeError: 'str' object has no attribute 'append' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03086/Python/s975280686.py", line 3, in <module>
s.append("X")
AttributeError: 'str' object has no attribute 'append'
|
p03086 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B = 0, C = 1, D = 0, E;
string S, K;
cin >> S;
A = S.size();
for (int i = 0; i < A; i++) {
for (int j = A; j > 0; j++) {
K = S.substr(i, j);
B = K.size();
C = 1;
for (int l = 0; l < B; l++) {
if (C) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int B = 1, C = 0, D = 0, F, G = 0, H = 0, I = 0, S;
string A;
cin >> A;
S = A.size();
for (int i = 0; i < S; i++) {
C = 0;
for (int j = i; j < S; j++) {
if (A[j] == 'A' || A[j] == 'T' || A[j] == 'G' || A[j] == 'C') {
C++;
... | replace | 3 | 23 | 3 | 16 | TLE | |
p03086 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
vector<int> count(S.size());
int answer = 0;
for (int i = 0; i <= S.size(); i++) {
if (S[i] == 'A' || S[i] == 'C' || S[i] == 'G' || S[i] == 'T') {
if (i == 0) {
count[i] = 1;
} else {
count[i] =... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
vector<int> count(S.size());
int answer = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == 'A' || S[i] == 'C' || S[i] == 'G' || S[i] == 'T') {
if (i == 0) {
count[i] = 1;
} else {
count[i] = ... | replace | 12 | 13 | 12 | 13 | 0 | |
p03086 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
vector<char> acgt = {'A', 'C', 'G', 'T'};
vector<int> max;
int num = 0;
for (int i = 0; i < s.size(); i++) {
if (!(count(acgt.begin(), acgt.end(), s[i]))) {
max.push_back(num);
num = 0;
} else {
num+... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
vector<char> acgt = {'A', 'C', 'G', 'T'};
vector<int> max;
int num = 0;
for (int i = 0; i < s.size(); i++) {
if (!(count(acgt.begin(), acgt.end(), s[i]))) {
max.push_back(num);
num = 0;
} else {
num+... | insert | 21 | 21 | 21 | 23 | 0 | |
p03086 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int cou = 0;
int ans = 0;
string T = "AGCT";
for (int i = 0; i < S.size(); i++) {
bool isAGCT = false;
for (int j = 0; j < 4; j++) {
if (S.at(i) == S.at(j))
isAGCT = true;
}
if (!isAGCT)
cou = ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int cou = 0;
int ans = 0;
string T = "AGCT";
for (int i = 0; i < S.size(); i++) {
bool isAGCT = false;
for (int j = 0; j < 4; j++) {
if (S.at(i) == T.at(j))
isAGCT = true;
}
if (!isAGCT)
cou = ... | replace | 11 | 12 | 11 | 12 | 0 | |
p03086 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int x = 0;
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s.at(i) == 'A' || s.at(i) == 'C' || s.at(i) == 'G' || s.at(i) == 'T') {
int j = 0;
while (s.at(i + j) == 'A' || s.at(i + j) == 'C' || s.at(i + j) == 'G' ||
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int x = 0;
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s.at(i) == 'A' || s.at(i) == 'C' || s.at(i) == 'G' || s.at(i) == 'T') {
int j = 0;
while (i + j < s.size() && (s.at(i + j) == 'A' || s.at(i + j) == 'C' ||
... | replace | 9 | 11 | 9 | 11 | 0 | |
p03086 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ALL(l) (l).begin(), (l).end()
#define rep(i, n) for (ll(i) = 0; (i) < (n); (i)++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n + 1); i++)
using namespace std;
typedef long long ll;
// const ll mod = 1000000007;
// const ll maxn = 1000000000;
//---------------------------------... | #include <bits/stdc++.h>
#define ALL(l) (l).begin(), (l).end()
#define rep(i, n) for (ll(i) = 0; (i) < (n); (i)++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n + 1); i++)
using namespace std;
typedef long long ll;
// const ll mod = 1000000007;
// const ll maxn = 1000000000;
//---------------------------------... | replace | 32 | 40 | 32 | 43 | 0 | |
p03086 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
int cnt = 0;
vector<int> len;
for (auto i = 0; i < S.length(); i++) {
if (S[i] == 'A' || S[i] == 'T' || S[i] == 'C' || S[i] == 'G') {
cnt++;
} else {
len.pus... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
int cnt = 0;
vector<int> len;
for (auto i = 0; i < S.length(); i++) {
if (S[i] == 'A' || S[i] == 'T' || S[i] == 'C' || S[i] == 'G') {
cnt++;
if (i == S.length() ... | insert | 15 | 15 | 15 | 17 | 0 | |
p03087 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
using namespace std;
void need_enter() {
while (getchar() != '\n')
;
while (getchar() != '\n')
;
}
int main() {
int N, Q;
cin >> N >> Q;
string str;
cin >> str;
str = " " + str;
int *count = new int[N + 1];
count[0] ... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
using namespace std;
void need_enter() {
while (getchar() != '\n')
;
while (getchar() != '\n')
;
}
int main() {
int N, Q;
cin >> N >> Q;
string str;
cin >> str;
str = " " + str;
int *count = new int[N + 1];
count[0] ... | delete | 31 | 32 | 31 | 31 | TLE | |
p03087 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
int *counter;
counter = new int(N + 1);
int i;
counter[0] = 0;
for (i = 0; i < N; i++) {
counter[i + 1] = counter[i] + ((S[i] == 'A' && S[i + 1] == 'C') ? 1 :... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
int *counter;
counter = new int[N + 1];
int i;
counter[0] = 0;
for (i = 0; i < N; i++) {
counter[i + 1] = counter[i] + ((S[i] == 'A' && S[i + 1] == 'C') ? 1 :... | replace | 12 | 13 | 12 | 13 | -6 | malloc(): corrupted top size
|
p03087 | C++ | Runtime Error | #include "bits/stdc++.h"
#define sp << " "
#define el << "\n"
#define S second
#define F first
#define mp make_pair
#define pb push_back
#define pf push_front
#define pob pop_back
#define obit __builtin_popcount
#define pof pop_front
#define mod (int)1e9 + 7
#define For(i, a, n) for (i = a; i < n; i++)
using namespac... | #include "bits/stdc++.h"
#define sp << " "
#define el << "\n"
#define S second
#define F first
#define mp make_pair
#define pb push_back
#define pf push_front
#define pob pop_back
#define obit __builtin_popcount
#define pof pop_front
#define mod (int)1e9 + 7
#define For(i, a, n) for (i = a; i < n; i++)
using namespac... | replace | 39 | 43 | 39 | 43 | -11 | |
p03087 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
int l[q][2];
for (int i = 0; i < q; ++i) {
cin >> l[i][0] >> l[i][1];
}
vector<int> cnt(n);
int c = 0;
for (int i = 0; i < n; ++i) {
cnt.at(i) = c;
if (s.at(i) != 'A')
continue... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
int l[q][2];
for (int i = 0; i < q; ++i) {
cin >> l[i][0] >> l[i][1];
}
vector<int> cnt(n);
int c = 0;
for (int i = 0; i < n; ++i) {
cnt.at(i) = c;
if (s.at(i) != 'A')
continue... | insert | 19 | 19 | 19 | 21 | 0 | |
p03087 | C++ | Runtime Error | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
vector<int> sum(N + 1, 0);
for (int i = 0; i < N + 1; ++i) {
sum[i + 2] = sum[i + 1];
if (S[i] == 'A' && S[i + 1] == 'C') {
sum[i + 2]++;
}
}
i... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
vector<int> sum(N + 1, 0);
for (int i = 0; i < N; ++i) {
sum[i + 2] = sum[i + 1];
if (S[i] == 'A' && S[i + 1] == 'C') {
sum[i + 2]++;
}
}
int l... | replace | 13 | 14 | 13 | 14 | -6 | Fatal glibc error: malloc assertion failure in sysmalloc: (old_top == initial_top (av) && old_size == 0) || ((unsigned long) (old_size) >= MINSIZE && prev_inuse (old_top) && ((unsigned long) old_end & (pagesize - 1)) == 0)
|
p03087 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string.h>
#include <string>
using namespace std;
int main() {
int N, Q, l[10000] = {}, r[10000] = {}, count[10001] = {}, ans = 0;
char s[100001];
cin >> N >> Q;
cin >> s;
for (int i = 0; i < Q; i++) {
cin >> l[i] >> r[i];
// cout <<... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string.h>
#include <string>
using namespace std;
int main() {
int N, Q, l[100000] = {}, r[100000] = {}, count[100001] = {}, ans = 0;
char s[100001];
cin >> N >> Q;
cin >> s;
for (int i = 0; i < Q; i++) {
cin >> l[i] >> r[i];
// cout... | replace | 8 | 9 | 8 | 9 | 0 | |
p03087 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
set<char> se = {'A', 'T', 'C', 'G'};
char s[100005];
int ans[10005];
int main() {
int n, q;
cin ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
set<char> se = {'A', 'T', 'C', 'G'};
char s[100005];
int ans[100005];
int main() {
int n, q;
cin... | replace | 16 | 17 | 16 | 17 | 0 | |
p03087 | Python | Runtime Error | # 累積和
n, q = map(int, input().split())
s = input()
arr = [0] * (2 * 10**5 + 10)
idx = 1
while idx <= len(s):
if s[idx - 1] == "A" and s[idx] == "C":
arr[idx] += 1
idx += 1
for i in range(1, len(arr)):
arr[i] += arr[i - 1]
for _ in range(q):
l, r = map(int, input().split())
print(arr[r - 1] -... | # 累積和
n, q = map(int, input().split())
s = input()
arr = [0] * (2 * 10**5 + 10)
idx = 1
while idx < len(s):
if s[idx - 1] == "A" and s[idx] == "C":
arr[idx] += 1
idx += 1
for i in range(1, len(arr)):
arr[i] += arr[i - 1]
for _ in range(q):
l, r = map(int, input().split())
print(arr[r - 1] - ... | replace | 5 | 6 | 5 | 6 | 0 | |
p03087 | Python | Time Limit Exceeded | n, q = map(int, input().split())
s = input()
# lr = [list(map(int, input().split())) for _ in range(q)]
# 愚直な計算時間
# ループn回
# リスト切り取りO(n)
# O(n^2)
# 計算リミットが2000msで、n<=10^5
# 0(n)でn=10^6くらいが限度
# O8n^2)だと、n=3000くらい
# 先に回数を数える。累積和的に
hoge = [s[0 : (i + 1)].count("AC") for i in range(n)]
for _ in range(q):
l, r = map(... | n, q = map(int, input().split())
s = input()
# lr = [list(map(int, input().split())) for _ in range(q)]
# 愚直な計算時間
# ループn回
# リスト切り取りO(n)
# O(n^2)
# 計算リミットが2000msで、n<=10^5
# 0(n)でn=10^6くらいが限度
# O8n^2)だと、n=3000くらい
# 先に回数を数える。累積和的に
# ここで結構時間かかる
# hoge = [s[0:(i + 1)].count('AC') for i in range(n)]
# 修正ver
hoge = [0]
cn... | replace | 14 | 15 | 14 | 24 | TLE | |
p03087 | Python | Runtime Error | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readline_s = sys.stdin.readline
readlines = sys.stdin.buffer.readlines
def main():
N, Q = map(int, readline().split())
S = list(readline_s().rstrip())
ac_check = [0] * (N)
tsum = [0] * (N + 1)
for i in range(N - 1):
... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readline_s = sys.stdin.readline
readlines = sys.stdin.buffer.readlines
def main():
N, Q = map(int, readline().split())
S = list(readline().rstrip().decode())
ac_check = [0] * (N)
tsum = [0] * (N + 1)
for i in range(N - ... | replace | 10 | 11 | 10 | 11 | ValueError: not enough values to unpack (expected 2, got 0) | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03087/Python/s527773077.py", line 36, in <module>
main()
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03087/Python/s527773077.py", line 26, in main
l, r = map(int, readline().split... |
p03087 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
vector<int> ans(10010);
vector<int> memo(10010);
int main() {
// 8 3
// ACACTACG
// 3 7
// 2 3
// 1 8
int N, Q;
int l, r;
string s;
cin >> N >> Q;
cin >> s;
i... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
vector<int> ans(100100);
vector<int> memo(100100);
int main() {
// 8 3
// ACACTACG
// 3 7
// 2 3
// 1 8
int N, Q;
int l, r;
string s;
cin >> N >> Q;
cin >> s;
... | replace | 9 | 11 | 9 | 11 | 0 | |
p03087 | C++ | Runtime Error | // ,O,i=0,Q=YUKU(f);static f*P;static FILE*t;static cons
// char*o[]={//bad"
// "\n\40\"8oCan\40not\40open %s\n\0\n\40\"8oCan\40not\40open
// %s\n#e(bad/bad",
// "a6if(p==b*5&&O){p-=b;O--;}}return 0U;if(p==b*5&&O){p-=b;O--;}}return
// 0U;:b"",
// "e&a6if(p==b*... | // ,O,i=0,Q=YUKU(f);static f*P;static FILE*t;static cons
// char*o[]={//bad"
// "\n\40\"8oCan\40not\40open %s\n\0\n\40\"8oCan\40not\40open
// %s\n#e(bad/bad",
// "a6if(p==b*5&&O){p-=b;O--;}}return 0U;if(p==b*5&&O){p-=b;O--;}}return
// 0U;:b"",
// "e&a6if(p==b*... | replace | 54 | 55 | 54 | 55 | 0 | |
p03087 | 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 Rep(i, n) for (int i = 1; i <= n; i++)
const ll MOD = 1000000007;
struct edge {
int to, weight;
edge(int to, int weight) : to(to), weight(weight) {}
};
using Graph = vector<vector<int>>;
using ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
#define Rep(i, n) for (int i = 1; i <= n; i++)
const ll MOD = 1000000007;
struct edge {
int to, weight;
edge(int to, int weight) : to(to), weight(weight) {}
};
using Graph = vector<vector<int>>;
using ... | replace | 51 | 53 | 51 | 52 | 0 | |
p03087 | C++ | Runtime Error | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, Q;
string S;
cin >> N >> Q >> S;
vector<int> l(Q), r(Q);
for (int i = 0; i < Q; i++)
cin >> l[i] >> r[i];
vector<int> A(N - 1);
for (int i = 0; i < N - 1; i++) {
if (S[i] == 'A' && S[i + 1] == 'C') ... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, Q;
string S;
cin >> N >> Q >> S;
vector<int> l(Q), r(Q);
for (int i = 0; i < Q; i++)
cin >> l[i] >> r[i];
vector<int> A(N - 1);
for (int i = 0; i < N - 1; i++) {
if (S[i] == 'A' && S[i + 1] == 'C') ... | replace | 25 | 29 | 25 | 29 | -11 | |
p03087 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
int Q;
scanf("%d%d", &N, &Q);
string S;
vector<int> accumulate(Q + 1);
cin >> S;
int cnt = 0;
for (int i = 0; i < N; i++) {
if (S[i] == 'A' && S[i + 1] == 'C') {
cnt++;
}
accumulate[i + 1] = cnt;
}
for (int i = ... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
int Q;
scanf("%d%d", &N, &Q);
string S;
vector<int> accumulate(N + 2);
cin >> S;
int cnt = 0;
for (int i = 0; i < N; i++) {
if (S[i] == 'A' && S[i + 1] == 'C') {
cnt++;
}
accumulate[i + 1] = cnt;
}
for (int i = ... | replace | 7 | 8 | 7 | 8 | -6 | malloc(): corrupted top size
|
p03087 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, Q, count = 0, l, r;
string S;
cin >> N >> Q >> S;
vector<int> vec(N, 0);
for (int i = 0; i < N - 1; i++) {
if (S.at(i) == 'A' && S.at(i + 1) == 'C')
vec.at(i + 1) = vec.at(i) + 1;
else
vec.at(i + 1) = vec.at(i);
}
for... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, Q, count = 0, l, r;
string S;
cin >> N >> Q >> S;
vector<int> vec(N, 0);
for (int i = 0; i < N - 1; i++) {
if (S.at(i) == 'A' && S.at(i + 1) == 'C')
vec.at(i + 1) = vec.at(i) + 1;
else
vec.at(i + 1) = vec.at(i);
}
for... | replace | 18 | 19 | 18 | 19 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 8) >= this->size() (which is 8)
|
p03087 | C++ | Time Limit Exceeded | // https://atcoder.jp/contests/abc122/tasks/abc122_c
#include <algorithm>
#include <array>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <regex>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll, l... | // https://atcoder.jp/contests/abc122/tasks/abc122_c
#include <algorithm>
#include <array>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <regex>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll, l... | replace | 61 | 65 | 61 | 68 | TLE | |
p03087 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll dx[4] = {-1, 1, 0, 0};
const ll dy[4] = {0, 0, -1, 1};
const ll MAX = 1e5 + 50;
const ll oo = 1e16;
#define pb push_back
#define f first
#define s second
#define all(v) v.begin(), v.end()
long long gcd(long long a, long... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll dx[4] = {-1, 1, 0, 0};
const ll dy[4] = {0, 0, -1, 1};
const ll MAX = 1e5 + 50;
const ll oo = 1e16;
#define pb push_back
#define f first
#define s second
#define all(v) v.begin(), v.end()
long long gcd(long long a, long... | replace | 15 | 16 | 15 | 16 | 0 | |
p03087 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <uno... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <uno... | replace | 31 | 32 | 31 | 32 | 0 | |
p03087 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, q;
string s;
vector<int> ac(10005);
cin >> n >> q >> s;
vector<int> l(q);
vector<int> r(q);
for (int i = 1; i <= q; i++) {
cin >> l[i] >> r[i];
}
int ac_c = 0;
for (int i = 1; i <= n; i++) {
ac[i] = ac_c;
if (i == n) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, q;
string s;
vector<int> ac(100005);
cin >> n >> q >> s;
vector<int> l(q);
vector<int> r(q);
for (int i = 1; i <= q; i++) {
cin >> l[i] >> r[i];
}
int ac_c = 0;
for (int i = 1; i <= n; i++) {
ac[i] = ac_c;
if (i == n) {... | replace | 6 | 7 | 6 | 7 | 0 | |
p03087 | C++ | Runtime Error | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#includ... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#includ... | replace | 33 | 34 | 33 | 34 | -6 | munmap_chunk(): invalid pointer
|
p03087 | C++ | Runtime Error | #include <iostream>
#include <stdio.h>
#include <string>
#include <utility>
using namespace std;
int main() {
int n, q;
int sum = 0;
int ans[10003] = {};
cin >> n >> q;
string s;
cin >> s;
for (int i = 1; i <= n; i++) {
if (s[i - 1] == 'A' && s[i] == 'C') {
sum++;
}
ans[i] += sum;
}
... | #include <iostream>
#include <stdio.h>
#include <string>
#include <utility>
using namespace std;
int main() {
int n, q;
int sum = 0;
int ans[100003] = {};
cin >> n >> q;
string s;
cin >> s;
for (int i = 1; i <= n; i++) {
if (s[i - 1] == 'A' && s[i] == 'C') {
sum++;
}
ans[i] += sum;
}
... | replace | 9 | 10 | 9 | 10 | 0 | |
p03087 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n); i > 0; i++)
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, q;
cin >> n >> q;
string s;
cin >> s;
auto ans = [&](int l, int r) ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n); i > 0; i++)
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<int> num(n);
rep(i, n... | replace | 14 | 27 | 14 | 27 | TLE | |
p03087 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vl;
typedef vector<pair<ll, ll>> vp;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
#define all(v) v.begin(), v.end()
#define inputv(v, n) \
rep(i, n) { ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vl;
typedef vector<pair<ll, ll>> vp;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
#define all(v) v.begin(), v.end()
#define inputv(v, n) \
rep(i, n) { ... | replace | 36 | 37 | 36 | 37 | 0 | |
p03087 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n, q, l, r;
vector<int> a;
string s;
int main() {
cin >> n >> q;
cin >> s;
for (int i = 1; i < n; i++) {
if (s[i] == 'C' && s[i - 1] == 'A')
a[i]++;
a[i] += a[i - 1];
}
for (int i = 1; i <= q; i++) {
cin >> l >> r;
l--, r--;
cout << a... | #include <bits/stdc++.h>
using namespace std;
int n, q, l, r;
int a[100005];
string s;
int main() {
cin >> n >> q;
cin >> s;
for (int i = 1; i < n; i++) {
if (s[i] == 'C' && s[i - 1] == 'A')
a[i]++;
a[i] += a[i - 1];
}
for (int i = 1; i <= q; i++) {
cin >> l >> r;
l--, r--;
cout << a... | replace | 3 | 4 | 3 | 4 | -11 | |
p03087 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<int> l(q), r(q);
for (int i = 0; i < q; i++)
cin >> l[i] >> r[i];
vector<int> accum(n + 1, 0);
accum[0] = 0;
for (int i = 1; i <= n; i++) {
accum[i] += accum[i - 1];
if (s.at... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<int> l(q), r(q);
for (int i = 0; i < q; i++)
cin >> l[i] >> r[i];
vector<int> accum(n + 1, 0);
accum[0] = 0;
for (int i = 1; i < n; i++) {
accum[i] += accum[i - 1];
if (s.at(... | replace | 15 | 16 | 15 | 16 | 0 | |
p03087 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<ll>;
using vii = vector<vi>;
using Pll = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(v) v.begin(), v.end()
#define sz(x) ((int)x.size())
#define pb push_back
#define mp make_pair
#define mt make_tuple
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<ll>;
using vii = vector<vi>;
using Pll = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(v) v.begin(), v.end()
#define sz(x) ((int)x.size())
#define pb push_back
#define mp make_pair
#define mt make_tuple
... | replace | 32 | 33 | 32 | 33 | 0 | |
p03087 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(), (x).end()
#define COUT(x) cout << (x) << "\n"
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(), (x).end()
#define COUT(x) cout << (x) << "\n"
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); ... | replace | 50 | 51 | 50 | 51 | 0 | |
p03087 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
vector<int> l(N), r(N);
for (int i = 0; i < Q; ++i) {
cin >> l.at(i) >> r.at(i);
}
vector<int> ac(N);
int count = 0;
for (int i = 0; i < N; ++i) {
if (S.at(i) == 'A') {
if (i < N -... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
vector<int> l(Q), r(Q);
for (int i = 0; i < Q; ++i) {
cin >> l.at(i) >> r.at(i);
}
vector<int> ac(N);
int count = 0;
for (int i = 0; i < N; ++i) {
if (S.at(i) == 'A') {
if (i < N -... | replace | 8 | 9 | 8 | 9 | 0 | |
p03087 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int t[10001], v[10001];
char a[10001];
int main() {
int n, m, k = 0, l, r, ans, i;
scanf("%d%d", &n, &m);
scanf("%s", a);
for (i = 0; i < n; i++) {
if (a[i] == 'A' && a[i + 1] == 'C')
v[i + 1] = 1;
}
for (i = 1; i <= n; i++)
t[i] = t[i - 1] + v[i];... | #include <bits/stdc++.h>
using namespace std;
int t[100001], v[100001];
char a[100001];
int main() {
int n, m, k = 0, l, r, ans, i;
scanf("%d%d", &n, &m);
scanf("%s", a);
for (i = 0; i < n; i++) {
if (a[i] == 'A' && a[i + 1] == 'C')
v[i + 1] = 1;
}
for (i = 1; i <= n; i++)
t[i] = t[i - 1] + v[... | replace | 2 | 4 | 2 | 4 | 0 | |
p03087 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int k[10005];
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
for (int i = 1; i < s.size(); i++) {
if (s[i] == 'C' && s[i - 1] == 'A')
k[i] = k[i - 1] + 1;
else
k[i] = k[i - 1];
}
for (int i = 0; i < q; i++) {
int a, b;
c... | #include <bits/stdc++.h>
using namespace std;
int k[100005];
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
for (int i = 1; i < s.size(); i++) {
if (s[i] == 'C' && s[i - 1] == 'A')
k[i] = k[i - 1] + 1;
else
k[i] = k[i - 1];
}
for (int i = 0; i < q; i++) {
int a, b;
... | replace | 3 | 4 | 3 | 4 | 0 | |
p03087 | 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)
#define MAX 10003
typedef long long ll;
int dp[MAX] = {};
int n, q;
string s;
void make() {
int i = 0;
dp[0] = 0;
while (1) {
if (s[i] == 'A' && s[i + 1] == 'C') {
dp[i + 1... | #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)
#define MAX 100003
typedef long long ll;
int dp[MAX] = {};
int n, q;
string s;
void make() {
int i = 0;
dp[0] = 0;
while (1) {
if (s[i] == 'A' && s[i + 1] == 'C') {
dp[i + ... | replace | 4 | 5 | 4 | 5 | 0 | |
p03087 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define co(a) cout << a << endl
#define sz size()
#define bgn begin()
#define en end()
#... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define co(a) cout << a << endl
#define sz size()
#define bgn begin()
#define en end()
#... | replace | 239 | 243 | 239 | 245 | 0 | |
p03087 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, cc, n) for (int i = cc; i < n; ++i)
#define lrep(i, cc, n) for (long long i = cc; i < n; ++i)
#define rrep(i, cc, n) for (long i = cc; i > n; --i)
#define pii pair<int, int>
#define pll pair<long long, long long>
using ll = long long;
const ll inf = 10010010... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, cc, n) for (int i = cc; i < n; ++i)
#define lrep(i, cc, n) for (long long i = cc; i < n; ++i)
#define rrep(i, cc, n) for (long i = cc; i > n; --i)
#define pii pair<int, int>
#define pll pair<long long, long long>
using ll = long long;
const ll inf = 10010010... | replace | 28 | 31 | 28 | 44 | TLE | |
p03087 | C++ | Runtime Error | #include <iostream>
#include <string>
#include <vector>
#define MAX_N 10000
using namespace std;
int dp[MAX_N + 1];
int main() {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
vector<int> l(Q), r(Q);
for (int i = 0; i < Q; ++i)
cin >> l[i] >> r[i];
dp[0] = 0;
for (int j = 0; j < N - 1; ++j) {
d... | #include <iostream>
#include <string>
#include <vector>
#define MAX_N 100000
using namespace std;
int dp[MAX_N + 1];
int main() {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
vector<int> l(Q), r(Q);
for (int i = 0; i < Q; ++i)
cin >> l[i] >> r[i];
dp[0] = 0;
for (int j = 0; j < N - 1; ++j) {
... | replace | 3 | 4 | 3 | 4 | 0 | |
p03087 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
#define MOD 1000000007
#define int long long
signed main() {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
vector<int> A;
rep(i, 1, N) {
if (S.at(i) == 'C') {
if (S.at(i - 1) == 'A')
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
#define MOD 1000000007
#define int long long
signed main() {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
vector<int> A;
rep(i, 1, N) {
if (S.at(i) == 'C') {
if (S.at(i - 1) == 'A')
... | replace | 20 | 28 | 20 | 22 | TLE | |
p03087 | C++ | Runtime Error | #include <algorithm>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, q;
string s;
cin >> n >> q >> s;
int ar[n];
bool aFlag = false;
ar[0] = 0;
for (int i = 0; i < n; i++) {
if (aFlag && s[i] == '... | #include <algorithm>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, q;
string s;
cin >> n >> q >> s;
int ar[n + 1];
bool aFlag = false;
ar[0] = 0;
for (int i = 0; i < n; i++) {
if (aFlag && s[i] ... | replace | 13 | 14 | 13 | 14 | 0 | |
p03087 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, q;
string s;
vector<int> rep(n, 0);
cin >> n >> q >> s;
for (int i = 0; i < n - 1; i++) {
if (s.substr(i, 2) == "AC") {
rep[i + 1] = 1;
}
}
for (int i = 0; i < n - 1; i++) {
rep[i + 1] += rep[i];
}
for (int i = 0... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, q;
string s;
vector<int> rep(n, 0);
cin >> n >> q >> s;
for (int i = 0; i < n - 1; i++) {
if (s[i] == 'A' && s[i + 1] == 'C') {
rep[i + 1] = 1;
}
}
for (int i = 0; i < n - 1; i++) {
rep[i + 1] += rep[i];
}
for (i... | replace | 12 | 13 | 12 | 13 | 0 | |
p03087 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int cnt[10];
int main() {
int N, Q;
cin >> N >> Q;
string s;
cin >> s;
cnt[0] = 0;
for (int i = 1; i < N; i++) {
if (s[i - 1] == 'A' && s[i] == 'C')
cnt[i] = cnt[i - 1] + 1;
else
cnt[i] = cnt[i - 1];
}
for (int i = 0... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int cnt[100001];
int main() {
int N, Q;
cin >> N >> Q;
string s;
cin >> s;
cnt[0] = 0;
for (int i = 1; i < N; i++) {
if (s[i - 1] == 'A' && s[i] == 'C')
cnt[i] = cnt[i - 1] + 1;
else
cnt[i] = cnt[i - 1];
}
for (int i... | replace | 3 | 4 | 3 | 4 | 0 | |
p03087 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int l[10010], r[10010];
int t[10010];
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
for (int i = 0; i < q; ++i) {
cin >> l[i] >> r[i];
}
t[0] = 0;
for (int i = 0; i < n - 1; ++i) {
if ((s[i] == 'A') && (s[i + 1] == 'C')) {
t[i + 1]... | #include <bits/stdc++.h>
using namespace std;
int l[100010], r[100010];
int t[100010];
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
for (int i = 0; i < q; ++i) {
cin >> l[i] >> r[i];
}
t[0] = 0;
for (int i = 0; i < n - 1; ++i) {
if ((s[i] == 'A') && (s[i + 1] == 'C')) {
t[i +... | replace | 3 | 5 | 3 | 5 | 0 | |
p03087 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main(void) {
int n, q;
char s[10010];
cin >> n >> q;
cin >> s;
vector<int> a(n, 0);
for (int i = 0; i < n - 1; i++) {
a[i + 1] = a[i];
if (s[i] == 'A' && s[i + 1] == 'C')
... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main(void) {
int n, q;
char s[100010];
cin >> n >> q;
cin >> s;
vector<int> a(n, 0);
for (int i = 0; i < n - 1; i++) {
a[i + 1] = a[i];
if (s[i] == 'A' && s[i + 1] == 'C')
... | replace | 9 | 10 | 9 | 10 | 0 | |
p03087 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fw(p) for (int w = 0; w < (p); w++)
#define fx(p) for (int x = 0; x < (p); x++)
#define fy(p) for (int y = 0; y < (p); y++)
#define fz(p) for (int z = 0; z < (p); z++)
#define fyg(p, g) for (int y = (g); y < (p); y++)
#define fzg(p, g) for (int ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fw(p) for (int w = 0; w < (p); w++)
#define fx(p) for (int x = 0; x < (p); x++)
#define fy(p) for (int y = 0; y < (p); y++)
#define fz(p) for (int z = 0; z < (p); z++)
#define fyg(p, g) for (int y = (g); y < (p); y++)
#define fzg(p, g) for (int ... | replace | 71 | 72 | 71 | 72 | 0 | |
p03087 | C++ | Runtime Error | #include <algorithm>
#include <complex>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <time.h> //for clock
#include <unordered_map>
#include <vector>
#define rep(i, a) for (int i = 0; i < (a); i++)
using namespace std;
using ll = long long;
int main(... | #include <algorithm>
#include <complex>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <time.h> //for clock
#include <unordered_map>
#include <vector>
#define rep(i, a) for (int i = 0; i < (a); i++)
using namespace std;
using ll = long long;
int main(... | replace | 20 | 21 | 20 | 21 | 0 | |
p03087 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, q;
string s;
cin >> n >> q;
cin >> s;
int check[10000] = {};
int check100[100] = {};
for (int i = 0; i < n - 1; i++) {
if (s[i] == 'A' && s[i + 1] == 'C')
check[i] = 1;
}
for (int i = 0; i <... | #include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, q;
string s;
cin >> n >> q;
cin >> s;
int check[100000] = {};
int check100[1000] = {};
for (int i = 0; i < n - 1; i++) {
if (s[i] == 'A' && s[i + 1] == 'C')
check[i] = 1;
}
for (int i = 0; i... | replace | 12 | 14 | 12 | 14 | 0 | |
p03087 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
int l[Q];
int r[Q];
for (int i = 0; i < Q; i++) {
cin >> l[i] >> r[i];
}
int L[N];
int R[N];
int A = 0;
int count = 0;
for (int i = 0; i < N; i++) {
if (A == 1 && S[i] == 'C')
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
int l[Q];
int r[Q];
for (int i = 0; i < Q; i++) {
cin >> l[i] >> r[i];
}
int L[N];
int R[N];
int A = 0;
int count = 0;
for (int i = 0; i < N; i++) {
if (A == 1 && S[i] == 'C')
... | replace | 36 | 38 | 36 | 38 | -11 | |
p03087 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, Q;
string s;
cin >> N >> Q >> s;
vector<int> t(N + 1, 0);
for (int i = 0; i < N; i++)
t.at(i + 1) = t.at(i) + ((s.at(i) == 'A' && s.at(i + 1) == 'C') ? 1 : 0);
int l, r;
for (int i = 0; i < Q; i++) {
cin >> l >> r;
cout << t.at(... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, Q;
string s;
cin >> N >> Q >> s;
vector<int> t(N + 1, 0);
for (int i = 0; i < N - 1; i++)
t.at(i + 1) = t.at(i) + ((s.at(i) == 'A' && s.at(i + 1) == 'C') ? 1 : 0);
int l, r;
for (int i = 0; i < Q; i++) {
cin >> l >> r;
cout << t... | replace | 7 | 8 | 7 | 8 | 0 | |
p03087 | C++ | Runtime Error | #include <bits/stdc++.h>
#define pb push_back
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long l;
typedef long long ll;
typedef vector<int> vi;
typedef vector<l> vl;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
int main() {
ios_ba... | #include <bits/stdc++.h>
#define pb push_back
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long l;
typedef long long ll;
typedef vector<int> vi;
typedef vector<l> vl;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
int main() {
ios_ba... | replace | 37 | 38 | 37 | 42 | 0 | |
p03087 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define mins(a, b) a = min(a, b)
#define maxs(a, b) a = max(a, b)
using namespace std;
int main() {
int n, q;
int x[100010];
for (int r = 0; r < 100010; r++) {
x[r] = 0;
}
cin >> n >> q;
string s;
cin >> s;
pair<int, int> len[q];
for (int i = 0; i < q; i++) {
cin >> l... | #include <bits/stdc++.h>
#define mins(a, b) a = min(a, b)
#define maxs(a, b) a = max(a, b)
using namespace std;
int main() {
int n, q;
int x[100010];
for (int r = 0; r < 100010; r++) {
x[r] = 0;
}
cin >> n >> q;
string s;
cin >> s;
pair<int, int> len[q];
for (int i = 0; i < q; i++) {
cin >> l... | replace | 18 | 19 | 18 | 19 | TLE | |
p03087 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
string s;
int dp[100000];
int cnt(int k) {
if (k < 1)
return d... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
string s;
int dp[100000];
int cnt(int k) {
if (k < 1)
return d... | replace | 26 | 27 | 26 | 27 | TLE | |
p03087 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
bool is_prime(int n) {
if (n == 0 || n == 1)
return (false);
if (n % 2 == 0 && n != 2)
return (false);
for (int i = 3; i * i < n + 1; i += 2) {
if (n % i == 0) {
return (false);
}
}
return (true);
}
int main() {
int n, q;
string s;
ci... | #include <bits/stdc++.h>
using namespace std;
bool is_prime(int n) {
if (n == 0 || n == 1)
return (false);
if (n % 2 == 0 && n != 2)
return (false);
for (int i = 3; i * i < n + 1; i += 2) {
if (n % i == 0) {
return (false);
}
}
return (true);
}
int main() {
int n, q;
string s;
ci... | replace | 21 | 22 | 21 | 22 | -6 | Fatal glibc error: malloc assertion failure in sysmalloc: (old_top == initial_top (av) && old_size == 0) || ((unsigned long) (old_size) >= MINSIZE && prev_inuse (old_top) && ((unsigned long) old_end & (pagesize - 1)) == 0)
|
p03087 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
vector<int> l(Q), r(Q), ans(N + 1);
for (int i = 0; i < Q; i++) {
cin >> l.at(i) >> r.at(i);
}
ans.at(0) = 0;
for (int i = 0; i < N; i++) {
if (S.at(i) == 'A' && S.at(i + 1) == 'C')
a... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
S.push_back('D');
vector<int> l(Q), r(Q), ans(N + 1);
for (int i = 0; i < Q; i++) {
cin >> l.at(i) >> r.at(i);
}
ans.at(0) = 0;
for (int i = 0; i < N; i++) {
if (S.at(i) == 'A' && S.at(i ... | insert | 7 | 7 | 7 | 8 | 0 | |
p03087 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespa... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespa... | replace | 64 | 70 | 64 | 73 | TLE | |
p03087 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <sstream>
#include <string>
#include <vector>
int main(void) {
int64_t N, Q;
std::string s;
std::cin >> N >> Q >> s;
std::vector<std::pair<int64_t, int64_t>> q_list(Q);
for ... | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <sstream>
#include <string>
#include <vector>
int main(void) {
int64_t N, Q;
std::string s;
std::cin >> N >> Q >> s;
std::vector<std::pair<int64_t, int64_t>> q_list(Q);
for ... | replace | 23 | 24 | 23 | 24 | 0 | |
p03087 | C++ | Runtime Error | #include <iostream>
#include <vector>
int main() {
int n, q;
std::cin >> n >> q;
std::string s;
std::cin >> s;
std::vector<int> pos_ac;
for (int i = 0; i < s.length() - 1; i++) {
if (s[i] == 'A' && s[i + 1] == 'C') {
pos_ac.push_back(i);
}
}
for (int i = 0; i < s.length() - 1; i++) {
... | #include <iostream>
#include <vector>
int main() {
int n, q;
std::cin >> n >> q;
std::string s;
std::cin >> s;
std::vector<int> pos_ac;
for (int i = 0; i < s.length() - 1; i++) {
if (s[i] == 'A' && s[i + 1] == 'C') {
pos_ac.push_back(i);
}
}
for (int i = 0; i < s.length() - 1; i++) {
... | replace | 29 | 35 | 29 | 33 | 0 | |
p03087 | C++ | Runtime Error | #include "bits/stdc++.h"
#include "math.h"
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n, q;
cin >> n >> q;
vector<pair<char, int>> s(n);
rep(i, n) cin >> s[i].first;
vector<int> l(q), r(q);
rep(i, n) {
int x, y;
cin >> x >> y;
l[i] = x;
r[i] = y;
}
... | #include "bits/stdc++.h"
#include "math.h"
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n, q;
cin >> n >> q;
vector<pair<char, int>> s(n);
rep(i, n) cin >> s[i].first;
vector<int> l(q), r(q);
for (int i = 0; i < q; i++) {
int x, y;
cin >> x >> y;
l[i] = x;
... | replace | 10 | 11 | 10 | 11 | -6 | malloc(): corrupted top size
|
p03087 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define cans cout << ans << endl
#define cyes cout << "Yes" << endl
#define cno cout << "No" << endl
typedef long long ll;
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
rep(i, q) {
int l, r;
cin >>... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define cans cout << ans << endl
#define cyes cout << "Yes" << endl
#define cno cout << "No" << endl
typedef long long ll;
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<int> sum(n + 1);
vector<int... | replace | 13 | 23 | 13 | 25 | TLE | |
p03087 | C++ | Runtime Error | #include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, Q, ans = 0, l, r;
string S;
cin >> N >> Q >> S;
vector<int> Z(Q);
for (int i = 0; i < N - 1; i++) {
if (S[i] == 'A' && S[i + 1] == 'C')
ans++;
Z[i + 1] = ans;
}
for (int j = 0;... | #include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, Q, ans = 0, l, r;
string S;
cin >> N >> Q >> S;
vector<int> Z(N);
for (int i = 0; i < N - 1; i++) {
if (S[i] == 'A' && S[i + 1] == 'C')
ans++;
Z[i + 1] = ans;
}
for (int j = 0;... | replace | 9 | 10 | 9 | 10 | -6 | malloc(): corrupted top size
|
p03087 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, x, n) for (int i = x; i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
int main() {
int N, Q, l, r, sum;
string S;
cin >> N >> Q >> S;
vector<int> vec(N);
sum = 0;
rep(i, N) {
if (S.at(i) == 'A' && S.at(i + 1) == 'C')
sum += 1;
vec... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, x, n) for (int i = x; i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
int main() {
int N, Q, l, r, sum;
string S;
cin >> N >> Q >> S;
vector<int> vec(N);
sum = 0;
rep(i, N - 1) {
if (S.at(i) == 'A' && S.at(i + 1) == 'C')
sum += 1;
... | replace | 11 | 12 | 11 | 12 | 0 | |
p03087 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
vector<int> AC(N + 1);
AC.at(0) = 0;
for (int i = 1; i < N; i++) {
if (S.at(i) == 'C' && S.at(i - 1) == 'A') {
AC.at(i + 1) = AC.at(i) + 1;
} else {
AC.at(i + 1) = AC.at(i);
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
vector<int> AC(N + 1);
AC.at(0) = 0;
for (int i = 1; i < N; i++) {
if (S.at(i) == 'C' && S.at(i - 1) == 'A') {
AC.at(i + 1) = AC.at(i) + 1;
} else {
AC.at(i + 1) = AC.at(i);
}
... | replace | 23 | 24 | 23 | 24 | 0 | |
p03087 | C++ | Runtime Error | #include <cstring>
#include <iostream>
using namespace std;
int a[11000];
int main() {
int n, q, i, j = 0;
cin >> n >> q;
string s;
cin >> s;
a[0] = 0;
for (i = 1; i < n; i++) {
if (s[i - 1] == 'A' && s[i] == 'C')
j++;
a[i] = j;
}
while (q--) {
int st, e;
cin >> st >> e;
cout <... | #include <cstring>
#include <iostream>
using namespace std;
int a[110000];
int main() {
int n, q, i, j = 0;
cin >> n >> q;
string s;
cin >> s;
a[0] = 0;
for (i = 1; i < n; i++) {
if (s[i - 1] == 'A' && s[i] == 'C')
j++;
a[i] = j;
}
while (q--) {
int st, e;
cin >> st >> e;
cout ... | replace | 3 | 4 | 3 | 4 | 0 | |
p03087 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int count_l[55555] = {};
int N, Q;
cin >> N >> Q;
string s;
cin >> s;
int sum = 0;
for (int i = 0; i < s.size(); i++) {
for (int j = 0; j < 2 && i + j < s.size(); j++) {
if (s[i] == 'A' && s[i + j] == 'C') {
sum++;
}
co... | #include <iostream>
using namespace std;
int main() {
int count_l[555555] = {};
int N, Q;
cin >> N >> Q;
string s;
cin >> s;
int sum = 0;
for (int i = 0; i < s.size(); i++) {
for (int j = 0; j < 2 && i + j < s.size(); j++) {
if (s[i] == 'A' && s[i + j] == 'C') {
sum++;
}
c... | replace | 5 | 6 | 5 | 6 | 0 | |
p03087 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
string s;
int n, q;
vector<int> l(200000);
vector<int> r(200000);
vector<int> a(200000);
vector<int> ans(200000);
int main() {
cin >> n >> q >> s;
int counts = 0;
for (int i = 0; i < n; ++i) {
cin >> l.at(i) >> r.at(i);
}
for (int i = 0; i < n; ++i) {
... | #include <bits/stdc++.h>
using namespace std;
string s;
int n, q;
vector<int> l(200000);
vector<int> r(200000);
vector<int> a(200000);
vector<int> ans(200000);
int main() {
cin >> n >> q >> s;
int counts = 0;
for (int i = 0; i < q; ++i) {
cin >> l.at(i) >> r.at(i);
}
for (int i = 0; i < n; ++i) {
... | replace | 15 | 16 | 15 | 16 | 0 | |
p03087 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, q;
cin >> n >> q;
string s;
int ans = 0;
cin >> s;
vector<int> apper = {};
apper.push_back(0);
// cout <<apper.at(0)<<endl;
for (int i = 0; i <= s.size() - 1; i++) {
if (s.at(i) == 'A' and s.at(i + 1) == 'C') {
ans++;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, q;
cin >> n >> q;
string s;
int ans = 0;
cin >> s;
vector<int> apper = {};
apper.push_back(0);
// cout <<apper.at(0)<<endl;
for (int i = 0; i < s.size() - 1; i++) {
if (s.at(i) == 'A' and s.at(i + 1) == 'C') {
ans++;
}
... | replace | 12 | 13 | 12 | 13 | 0 | |
p03087 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, q;
string s;
cin >> n >> q >> s;
int ac[10500] = {}, lr[10500] = {};
for (size_t i = 1, count = 0; i < n; i++) {
if (s[i - 1] == 'A' && s[i] == 'C')
count++;
ac[i] = count;
}
for (size_t i = 0; i < q; i++) {
int l, r;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, q;
string s;
cin >> n >> q >> s;
int ac[100500] = {}, lr[100500] = {};
for (size_t i = 1, count = 0; i < n; i++) {
if (s[i - 1] == 'A' && s[i] == 'C')
count++;
ac[i] = count;
}
for (size_t i = 0; i < q; i++) {
int l, r;... | replace | 8 | 9 | 8 | 9 | 0 | |
p03087 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <functional>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
typedef long long ll;
#define pb pushback
#define fr(i, n) for (int i = 0; i < n; i++)
#define ifr(i, n) for (int i = n - 1; i >= 0; i--)
int main() {
int n, q, l, r;
cin... | #include <algorithm>
#include <bits/stdc++.h>
#include <functional>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
typedef long long ll;
#define pb pushback
#define fr(i, n) for (int i = 0; i < n; i++)
#define ifr(i, n) for (int i = n - 1; i >= 0; i--)
int main() {
int n, q, l, r;
cin... | insert | 19 | 19 | 19 | 20 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::substr: __pos (which is 1) > this->size() (which is 0)
|
p03087 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
#define MAX_N 100'000
#define MAX_Q 100'000
using namespace std;
int R[MAX_Q];
int main() {
int N, Q;
string S;
cin >> N >> Q >> S;
vector<int> V;
for (int i = 0; i < N - 1; ++i) {
if (S.substr(i, 2) == "AC... | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
#define MAX_N 100'000
#define MAX_Q 100'000
using namespace std;
int R[MAX_Q];
int main() {
int N, Q;
string S;
cin >> N >> Q >> S;
vector<int> V;
for (int i = 0; i < N - 1; ++i) {
if (S.substr(i, 2) == "AC... | replace | 26 | 32 | 26 | 35 | 0 | |
p03087 | C++ | Runtime Error | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define RFOR(i, a, b) for (int i = (a); i >= (b); --i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define RREP(i, n) for (int i = (n); i > 0; --i)
#define CI cin >>
#define CO cout <<
#define EN << endl
#define all(x) (x).begin(), (x).e... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define RFOR(i, a, b) for (int i = (a); i >= (b); --i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define RREP(i, n) for (int i = (n); i > 0; --i)
#define CI cin >>
#define CO cout <<
#define EN << endl
#define all(x) (x).begin(), (x).e... | replace | 23 | 24 | 23 | 24 | 0 | |
p03087 | C++ | Time Limit Exceeded | #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, q;
string s;
cin >> n >> q >> s;
vector<int> a(n, 0);
for (int i = 1; i < n; ++i) {
for (int j = 0; j < i; ++j) {
if (s[j] == 'A' && s[j + 1] == 'C')
a[i]++... | #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, q;
string s;
cin >> n >> q >> s;
vector<int> a(n, 0);
for (int i = 1; i < n; ++i) {
if (s[i - 1] == 'A' && s[i] == 'C')
a[i] = a[i - 1] + 1;
else
a[i] = a... | replace | 10 | 14 | 10 | 14 | TLE | |
p03087 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
int main() {
ll N, Q;
cin >> N >> Q;
string S;
cin >> S;
vector<ll> l(Q), r(Q);
for (int i = 0; i < Q; ++i) {
cin >> l[i] >> r[i];
l[i]--;
r[i]--;
}
vector<ll> list;
... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
int main() {
ll N, Q;
cin >> N >> Q;
string S;
cin >> S;
vector<ll> l(Q), r(Q);
for (int i = 0; i < Q; ++i) {
cin >> l[i] >> r[i];
l[i]--;
r[i]--;
}
vector<ll> list;
... | replace | 26 | 35 | 26 | 29 | TLE | |
p03087 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#in... | #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#in... | insert | 82 | 82 | 82 | 84 | 0 | |
p03087 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<int> t(n + 1, 0);
for (int i = 0; i < n; ++i) {
if (i + 1 < n && s[i] == 'A' && s[i + 1] == 'C') {
t[i + 1] = t[i] + 1;
} else
t[i + 1] = t[i];
for (int j = 0; j < q; ++j) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<int> t(n + 1, 0);
for (int i = 0; i < n; ++i) {
if (i + 1 < n && s[i] == 'A' && s[i + 1] == 'C') {
t[i + 1] = t[i] + 1;
} else
t[i + 1] = t[i];
}
for (int j = 0; j < q; ++j... | replace | 14 | 21 | 14 | 21 | 0 | |
p03087 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, Q;
string S;
cin >> N >> Q >> S;
vector<pair<int, int>> num(Q);
for (int i = 0; i < Q; i++) {
cin >> num[i].first;
cin >> num[i].second;
}
char first, second;
vector<int> start;... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, Q;
string S;
cin >> N >> Q >> S;
vector<pair<int, int>> num(Q);
for (int i = 0; i < Q; i++) {
cin >> num[i].first;
cin >> num[i].second;
}
char first, second;
vector<int> start;... | replace | 27 | 31 | 27 | 33 | TLE | |
p03087 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef unsigned long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int ans[100];
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<int> v(n);
v[0] = 0;
for ... | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef unsigned long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int ans[100010];
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<int> v(n);
v[0] = 0;
f... | replace | 9 | 10 | 9 | 10 | 0 | |
p03087 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long int LL;
using namespace std;
#define INF (1LL << 60)
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, k, n) for (int i = (k); (i) < (n); (i)++)
#define REP(i, n) for (int i = 0; (i) < (n); (i)++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define F first
#define S sec... | #include <bits/stdc++.h>
typedef long long int LL;
using namespace std;
#define INF (1LL << 60)
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, k, n) for (int i = (k); (i) < (n); (i)++)
#define REP(i, n) for (int i = 0; (i) < (n); (i)++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define F first
#define S sec... | replace | 33 | 34 | 33 | 35 | 0 | |
p03087 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
const ll INF = 1000000007;
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
const ll INF = 1000000007;
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<... | replace | 30 | 31 | 30 | 31 | 0 | |
p03087 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <cstring>
#include <functional>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
using namespace std;
typedef long long ll;
int main(void) {
// Your code here
int N, Q;
string S;
cin >> N >> Q >> S;
vector<in... | #include <algorithm>
#include <bits/stdc++.h>
#include <cstring>
#include <functional>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
using namespace std;
typedef long long ll;
int main(void) {
// Your code here
int N, Q;
string S;
cin >> N >> Q >> S;
vector<in... | replace | 22 | 23 | 22 | 23 | 0 | |
p03087 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, Q;
string S;
cin >> N >> Q >> S;
vector<int> vec(N + 1);
vec.at(0) = 0;
int ACcount = 0;
for (int i = 1; i <= N; i++) {
if (S.at(i - 1) == 'A' && S.at(i) == 'C') {
ACcount++;
vec.at(i) = ACcount;
} else {
vec.at(... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, Q;
string S;
cin >> N >> Q >> S;
S += 'B';
vector<int> vec(N + 1);
vec.at(0) = 0;
int ACcount = 0;
for (int i = 1; i <= N; i++) {
if (S.at(i - 1) == 'A' && S.at(i) == 'C') {
ACcount++;
vec.at(i) = ACcount;
} else {
... | replace | 7 | 8 | 7 | 8 | 0 | |
p03087 | C++ | Runtime Error | #include <algorithm>
#include <functional>
#include <iostream>
using namespace std;
int main() {
int n;
int q;
string s;
cin >> n >> q >> s;
int l[q];
int r[q];
int sum[n];
int ans = 0;
for (int i = 0; i < q; i++) {
cin >> l[i] >> r[i];
}
for (int i = 1; i < n; i++) {
if (s[i - 1] == ... | #include <algorithm>
#include <functional>
#include <iostream>
using namespace std;
int main() {
int n;
int q;
string s;
cin >> n >> q >> s;
int l[q];
int r[q];
int sum[n];
int ans = 0;
for (int i = 0; i < q; i++) {
cin >> l[i] >> r[i];
}
for (int i = 1; i < n; i++) {
if (s[i - 1] == ... | replace | 28 | 29 | 28 | 29 | -7 | |
p03087 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
int n, q, m = 0;
int a[10001];
cin >> n >> q >> s;
a[0] = 0;
for (int j = 0; j < s.size(); j++) {
if (s[j] == 'A' && s[j + 1] == 'C')
m++;
a[j + 1] = m;
}
for (int i = 0; i < q; i++) {
int l, r;
... | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
int n, q, m = 0;
int a[100001];
cin >> n >> q >> s;
a[0] = 0;
for (int j = 0; j < s.size(); j++) {
if (s[j] == 'A' && s[j + 1] == 'C')
m++;
a[j + 1] = m;
}
for (int i = 0; i < q; i++) {
int l, r;
... | replace | 7 | 8 | 7 | 8 | 0 | |
p03087 | C++ | Runtime Error | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
string str;
cin >> str;
// 累積和
vector<int> s(N + 1, 0);
for (int i = 0; i < N; ++i) {
if (i + 1 < N && str[i] == 'A' && str[i + 1] == 'C')
s[i + 1] = s[i] + 1;
else
s[i ... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
string str;
cin >> str;
// 累積和
vector<int> s(N + 1, 0);
for (int i = 0; i < N; ++i) {
if (i + 1 < N && str[i] == 'A' && str[i + 1] == 'C')
s[i + 1] = s[i] + 1;
else
s[i ... | replace | 21 | 22 | 21 | 22 | -11 | |
p03088 | C++ | Runtime Error | #pragma GCC optimize("O3")
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
using QWORD = uint64_t;
using SQWORD... | #pragma GCC optimize("O3")
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
using QWORD = uint64_t;
using SQWORD... | replace | 251 | 252 | 251 | 252 | TLE | |
p03088 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <cmath>
const double PI = 3.14159265358979323846;
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
// #define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep(i, n) for (ll i = 0; i < (n); ++i)
// typedef pair<ll, ll> P;
typedef pair<ll, ll> P;
const ll INF = 10e... | #include <bits/stdc++.h>
#include <cmath>
const double PI = 3.14159265358979323846;
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
// #define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep(i, n) for (ll i = 0; i < (n); ++i)
// typedef pair<ll, ll> P;
typedef pair<ll, ll> P;
const ll INF = 10e... | insert | 142 | 142 | 142 | 147 | -11 | |
p03088 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
#define ll long long
const ll mod = 1e9 + 7;
ll substring_count[105][4][4][4];
ll add(ll &a, ll &b) { a = (a + b) % mod; }
bool ng(int a, int b, int c) {
if (a == 1 && b == 2 && c == 3) {
return true;
} else {
return false;
}
}
int main() {
int n;
cin >> n;
... | #include <iostream>
using namespace std;
#define ll long long
const ll mod = 1e9 + 7;
ll substring_count[105][4][4][4];
void add(ll &a, ll &b) { a = (a + b) % mod; }
bool ng(int a, int b, int c) {
if (a == 1 && b == 2 && c == 3) {
return true;
} else {
return false;
}
}
int main() {
int n;
cin >> n... | replace | 6 | 7 | 6 | 7 | TLE | |
p03088 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
bool is_allowed(vector<int> vs) {
assert(vs.size() == 4);
auto check = [&]() {
if (vs[0] == 0 && vs[1] == 1 && vs[2] == 2) {
return false;
}
if (vs[1] == 0 && vs[2] == 1 && vs[3] == 2) {
return false;
}
return true;
};
if (!check())... | #include <bits/stdc++.h>
using namespace std;
bool is_allowed(vector<int> vs) {
assert(vs.size() == 4);
auto check = [&]() {
if (vs[0] == 0 && vs[1] == 1 && vs[2] == 2) {
return false;
}
if (vs[1] == 0 && vs[2] == 1 && vs[3] == 2) {
return false;
}
return true;
};
if (!check())... | replace | 110 | 111 | 110 | 112 | 0 | |
p03088 | C++ | Time Limit Exceeded | // https://atcoder.jp/contests/abc122/tasks/abc122_d
#include <iostream>
#include <string.h>
using namespace std;
const long mod = 1e9 + 7;
long N, memo[110][6][6][6][6];
// A=0,G=1,C=2,T=3
long judge(int now, int b3, int b2, int b1, int b) {
if (b3 == 0 && b2 == 1 && b == 2)
return 0; // AG?Cの場合
if (b3 == 0 &... | // https://atcoder.jp/contests/abc122/tasks/abc122_d
#include <iostream>
#include <string.h>
using namespace std;
const long mod = 1e9 + 7;
long N, memo[110][6][6][6][6];
// A=0,G=1,C=2,T=3
long judge(int now, int b3, int b2, int b1, int b) {
if (memo[now][b3][b2][b1][b] != -1)
return memo[now][b3][b2][b1][b];
... | insert | 9 | 9 | 9 | 11 | TLE | |
p03088 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define fastio() \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define fastio() \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | delete | 41 | 45 | 41 | 41 | -11 | |
p03088 | Python | Runtime Error | def main():
N = int(input())
dp = [
[[[0 for _ in range(4)] for _ in range(4)] for _ in range(4)]
for _ in range(101)
]
dp[0][3][3][3] = 1
mod = 1_000_000_007
for n in range(100):
for i in range(4):
for j in range(4):
for k in range(4):
... | def main():
N = int(input())
dp = [
[[[0 for _ in range(4)] for _ in range(4)] for _ in range(4)]
for _ in range(101)
]
dp[0][3][3][3] = 1
mod = 10**9 + 7
for n in range(100):
for i in range(4):
for j in range(4):
for k in range(4):
... | replace | 7 | 8 | 7 | 8 | 0 | |
p03088 | Python | Runtime Error | # 解説を参考に作成
# import sys
# sys.setrecursionlimit(10 ** 6)
# import bisect
# from collections import deque
from decorator import stop_watch
@stop_watch
def solve(N):
mod = 10**9 + 7
dp = [{} for _ in range(N + 1)]
dp[0].setdefault("TTT", 1)
def check(last4):
for i in range(4):
x = l... | # 解説を参考に作成
# import sys
# sys.setrecursionlimit(10 ** 6)
# import bisect
# from collections import deque
# from decorator import stop_watch
#
#
# @stop_watch
def solve(N):
mod = 10**9 + 7
dp = [{} for _ in range(N + 1)]
dp[0].setdefault("TTT", 1)
def check(last4):
for i in range(4):
... | replace | 5 | 9 | 5 | 9 | ImportError: cannot import name 'stop_watch' from 'decorator' (/home/alex/Documents/bug-detection/.venv/lib/python3.10/site-packages/decorator.py) | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03088/Python/s080786837.py", line 6, in <module>
from decorator import stop_watch
ImportError: cannot import name 'stop_watch' from 'decorator' (/home/alex/Documents/bug-detection/.venv/lib/python3.10/site-pack... |
p03088 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define FastRead \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long ... | #include <bits/stdc++.h>
using namespace std;
#define FastRead \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long ... | delete | 105 | 110 | 105 | 105 | 0 | |
p03088 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace ... | replace | 78 | 79 | 78 | 79 | -6 | *** stack smashing detected ***: terminated
|
p03088 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define MOD 1000000007
vector<unordered_map<string, int>> memo(100);
int N;
bool ok(string s) {
if (s.find("AGC") != string::np... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define MOD 1000000007
vector<unordered_map<string, int>> memo(200);
int N;
bool ok(string s) {
if (s.find("AGC") != string::np... | replace | 14 | 15 | 14 | 15 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.