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) {
if (K[l] == 'A' || K[l] == 'T' || K[l] == 'G' || K[l] == 'C') {
C = 1;
E = j;
if (E > D)
D = E;
} else
C = 0;
}
}
}
}
cout << D << endl;
}
| #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++;
if (C > D)
D = C;
} else
C = 0;
}
}
cout << D << endl;
} | 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] = count[i - 1] + 1;
}
answer = max(answer, count[i]);
} else {
count[i] = 0;
}
}
cout << answer << endl;
} | #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] = count[i - 1] + 1;
}
answer = max(answer, count[i]);
} else {
count[i] = 0;
}
}
cout << answer << endl;
} | 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++;
}
}
sort(max.begin(), max.end(), greater<int>());
cout << max[0] << endl;
return 0;
} | #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++;
}
}
max.push_back(num);
sort(max.begin(), max.end(), greater<int>());
cout << max[0] << endl;
return 0;
} | 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 = 0;
else {
cou++;
ans = max(cou, ans);
}
}
cout << ans << endl;
} | #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 = 0;
else {
cou++;
ans = max(cou, ans);
}
}
cout << ans << endl;
} | 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' ||
s.at(i + j) == 'T')
j++;
x = max(x, j);
i += j;
}
}
cout << x << endl;
} | #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' ||
s.at(i + j) == 'G' || s.at(i + j) == 'T'))
j++;
x = max(x, j);
i += j;
}
}
cout << x << endl;
} | 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;
//---------------------------------------------------------------------------------------------------
using vi = vector<int>; // intの1次元の型に vi という別名をつける
using vll = vector<ll>; // intの1次元の型に vi という別名をつける
using vvll = vector<vll>; // intの2次元の型に vvi という別名をつける
using vs = vector<string>; // stringの1次元の型に vs という別名をつける
using pll =
pair<ll, ll>; // これ以降 pii という型名はpair<ll, ll> と同じ意味で使える
//---------------------------------------------------------------------------------------------------
int main() {
string s;
cin >> s;
int ans = 0;
vi acgt;
// cout<<s.size();
rep(i, s.size()) {
if (s.at(i) == 'A' || s.at(i) == 'T' || s.at(i) == 'G' || s.at(i) == 'C') {
} else {
acgt.push_back(i);
}
}
ans = acgt.at(0);
// rep(i,acgt.size())cout<<acgt.at(i);
rep(i, acgt.size() - 1) { ans = max(ans, acgt.at(i + 1) - acgt.at(i) - 1); }
// cout<<acgt.back()<<endl;
int k = s.size() - acgt.back() - 1;
ans = max(ans, k);
cout << ans << endl;
}
| #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;
//---------------------------------------------------------------------------------------------------
using vi = vector<int>; // intの1次元の型に vi という別名をつける
using vll = vector<ll>; // intの1次元の型に vi という別名をつける
using vvll = vector<vll>; // intの2次元の型に vvi という別名をつける
using vs = vector<string>; // stringの1次元の型に vs という別名をつける
using pll =
pair<ll, ll>; // これ以降 pii という型名はpair<ll, ll> と同じ意味で使える
//---------------------------------------------------------------------------------------------------
int main() {
string s;
cin >> s;
int ans = 0;
vi acgt;
// cout<<s.size();
rep(i, s.size()) {
if (s.at(i) == 'A' || s.at(i) == 'T' || s.at(i) == 'G' || s.at(i) == 'C') {
} else {
acgt.push_back(i);
}
}
if (acgt.size() == 0)
cout << s.size();
else {
ans = acgt.at(0);
// rep(i,acgt.size())cout<<acgt.at(i);
rep(i, acgt.size() - 1) { ans = max(ans, acgt.at(i + 1) - acgt.at(i) - 1); }
// cout<<acgt.back()<<endl;
int k = s.size() - acgt.back() - 1;
ans = max(ans, k);
cout << ans << endl;
}
}
| 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.push_back(cnt);
cnt = 0;
}
}
cout << *max_element(len.begin(), len.end()) << endl;
}
| #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() - 1)
len.push_back(cnt);
} else {
len.push_back(cnt);
cnt = 0;
}
}
cout << *max_element(len.begin(), len.end()) << endl;
}
| 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] = 0;
for (int i = 1; i <= N; ++i) {
count[i] = count[i - 1];
if (str.substr(i, 2) == "AC") {
++i;
count[i] = count[i - 1] + 1;
}
}
for (int i = 0; i < Q; ++i) {
int a, b;
cin >> a >> b;
cout << count[b] - count[a] << endl;
}
need_enter();
return 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] = 0;
for (int i = 1; i <= N; ++i) {
count[i] = count[i - 1];
if (str.substr(i, 2) == "AC") {
++i;
count[i] = count[i - 1] + 1;
}
}
for (int i = 0; i < Q; ++i) {
int a, b;
cin >> a >> b;
cout << count[b] - count[a] << endl;
}
return 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 : 0);
}
int head, tail;
head = 0;
tail = 0;
for (i = 0; i < Q; i++) {
cin >> head >> tail;
head = head - 1;
tail = tail - 1;
cout << counter[tail] - counter[head] << endl;
}
return 0;
} | #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 : 0);
}
int head, tail;
head = 0;
tail = 0;
for (i = 0; i < Q; i++) {
cin >> head >> tail;
head = head - 1;
tail = tail - 1;
cout << counter[tail] - counter[head] << endl;
}
return 0;
} | 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 namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned short int us;
typedef short int ss;
typedef long double ld;
void pre(int *ar, int n, string st) {
int i, cnt = 0;
ar[0] = cnt;
For(i, 0, n - 1) {
string demo = string(st.begin() + i, st.begin() + i + 2);
if (demo == "AC")
cnt++;
// cout<<demo el;
ar[i + 1] = cnt;
}
return;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int n, q, i;
string st;
cin >> n >> q >> st;
int ar[n];
pre(ar, n, st);
// for(int t: ar) cout<<t sp;
// cout el;
For(i, 0, q) {
int l, r;
cin >> l >> r;
r -= 1;
l -= 1;
// cout<<l sp<< r <<": ";
cout << ar[r] - ar[l] el;
}
return 0;
}
| #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 namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned short int us;
typedef short int ss;
typedef long double ld;
void pre(int *ar, int n, string st) {
int i, cnt = 0;
ar[0] = cnt;
For(i, 0, n - 1) {
string demo = string(st.begin() + i, st.begin() + i + 2);
if (demo == "AC")
cnt++;
// cout<<demo el;
ar[i + 1] = cnt;
}
return;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
/*#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif*/
int n, q, i;
string st;
cin >> n >> q >> st;
int ar[n];
pre(ar, n, st);
// for(int t: ar) cout<<t sp;
// cout el;
For(i, 0, q) {
int l, r;
cin >> l >> r;
r -= 1;
l -= 1;
// cout<<l sp<< r <<": ";
cout << ar[r] - ar[l] el;
}
return 0;
}
| 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;
if (s.at(i + 1) != 'C')
continue;
c++;
}
for (int i = 0; i < q; ++i) {
int a = l[i][0] - 1, b = l[i][1] - 1;
cout << cnt.at(b) - cnt.at(a) << endl;
}
} | #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;
if (i + 1 >= n)
break;
if (s.at(i + 1) != 'C')
continue;
c++;
}
for (int i = 0; i < q; ++i) {
int a = l[i][0] - 1, b = l[i][1] - 1;
cout << cnt.at(b) - cnt.at(a) << endl;
}
} | 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]++;
}
}
int l, r;
for (int i = 0; i < Q; ++i) {
cin >> l >> r;
cout << sum[r] - sum[l] << endl;
}
}
| #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, r;
for (int i = 0; i < Q; ++i) {
cin >> l >> r;
cout << sum[r] - sum[l] << endl;
}
}
| 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 << l[i] << " " << r[i] << endl;
}
for (int i = 1; i < N + 1; i++) {
count[i] = count[i - 1];
if (s[i - 1] == 'A' && s[i] == 'C')
count[i] += 1;
// cout << count[i];
}
// cout << count[N];
// cout << endl;
for (int i = 0; i < Q; i++) {
if (true) {
cout << count[r[i] - 1] - count[l[i] - 1] << endl;
}
}
return 0;
}
| #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 << l[i] << " " << r[i] << endl;
}
for (int i = 1; i < N + 1; i++) {
count[i] = count[i - 1];
if (s[i - 1] == 'A' && s[i] == 'C')
count[i] += 1;
// cout << count[i];
}
// cout << count[N];
// cout << endl;
for (int i = 0; i < Q; i++) {
if (true) {
cout << count[r[i] - 1] - count[l[i] - 1] << endl;
}
}
return 0;
}
| 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 >> n >> q;
scanf("%s", s);
int len = n;
int cnt = 0;
for (int i = 0; i < len; ++i) {
if (i > 0 && s[i] == 'C' && s[i - 1] == 'A')
++cnt;
ans[i] = cnt;
}
// for(int i=0;i<len;++i)
// cout<<i<<" "<<ans[i]<<endl;
while (q--) {
int a, b;
cin >> a >> b;
--a;
--b;
cout << ans[b] - ans[a] << endl;
}
return 0;
}
| #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 >> n >> q;
scanf("%s", s);
int len = n;
int cnt = 0;
for (int i = 0; i < len; ++i) {
if (i > 0 && s[i] == 'C' && s[i - 1] == 'A')
++cnt;
ans[i] = cnt;
}
// for(int i=0;i<len;++i)
// cout<<i<<" "<<ans[i]<<endl;
while (q--) {
int a, b;
cin >> a >> b;
--a;
--b;
cout << ans[b] - ans[a] << endl;
}
return 0;
}
| 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] - arr[l - 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] - arr[l - 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(int, input().split())
print(hoge[r - 1] - hoge[l - 1])
| 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]
cnt = 0
for i in range(1, n):
if s[i - 1] + s[i] == "AC":
cnt += 1
hoge.append(cnt)
for _ in range(q):
l, r = map(int, input().split())
print(hoge[r - 1] - hoge[l - 1])
| 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):
if S[i] == "A" and S[i + 1] == "C":
tsum[i + 2] += 1
ac_check[i] = 1
ac_check[i + 1] = 2
for i in range(N):
tsum[i + 1] += tsum[i]
ans = []
for i in range(Q):
l, r = map(int, readline().split())
count = tsum[r] - tsum[l - 1]
if ac_check[l - 1] == 2:
count -= 1
ans.append(count)
print("\n".join(map(str, ans)))
if __name__ == "__main__":
main()
| 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 - 1):
if S[i] == "A" and S[i + 1] == "C":
tsum[i + 2] += 1
ac_check[i] = 1
ac_check[i + 1] = 2
for i in range(N):
tsum[i + 1] += tsum[i]
ans = []
for i in range(Q):
l, r = map(int, readline().split())
count = tsum[r] - tsum[l - 1]
if ac_check[l - 1] == 2:
count -= 1
ans.append(count)
print("\n".join(map(str, ans)))
if __name__ == "__main__":
main()
| 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())
ValueError: not enough values to unpack (expected 2, got 0)
|
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;
int count = 0;
for (int i = 0; i < s.size(); i++) {
if (i > 0 && s[i] == 'C' && s[i - 1] == 'A') {
count++;
}
memo[i] = count;
}
for (int i = 0; i < Q; i++) {
cin >> l >> r;
int x = memo[r - 1] - memo[l - 1];
ans[i] = x;
}
for (int i = 0; i < Q; i++) {
std::cout << ans[i] << endl;
}
return 0;
}
| #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;
int count = 0;
for (int i = 0; i < s.size(); i++) {
if (i > 0 && s[i] == 'C' && s[i - 1] == 'A') {
count++;
}
memo[i] = count;
}
for (int i = 0; i < Q; i++) {
cin >> l >> r;
int x = memo[r - 1] - memo[l - 1];
ans[i] = x;
}
for (int i = 0; i < Q; i++) {
std::cout << ans[i] << endl;
}
return 0;
}
| 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*5&&O){p-=b;O--;}}return 0U;if(p==b*5&&O){p-=b;O--;}}return
// 0U;:b"",
// "e&a6if(p==b*5&&O){p-=b;O--;}}return 0U;if(p==b*5&&O){p-=b;O--;}}return
// 0U;:"e#d",
// ">bad/bad/"};static ll S(){return(o[p][q]);}static/**/ll /**/Z=0
// ;void/**/z(ll //
// l){if(/**/Z-l){Z=l;q++;if(p<b*5&&!S()){p+=b;q=0;}}}ll main(ll I,
// /**/char**l){//
// d=YUKKUU(f*);if(1<(O=_)){b=((YUKKUU(o)/YUKKUU(char*))-1)/4;q=22; p=
// 0;while(p<b*5){
// /*<*/if(Z-1){d=S()>96;i=S()-(d?96:32) ;q++;if(p<b*5&&!S()){p+=b; q=
// 0;}Z=1;}/*[[*/ while(i){_=o[0][S()-97];I=_-10?b:1; for( ;I--;)putchar(_
// );if (! --i||d)z(~i );}
// if(p==b*5&&O){p-=b;O--;}}return 0U; }if(! (P=( f*)calloc /*]*/ (Q
// ,I)))return 1;
// {;}for(_=p=1;p<I;p++){e(q=1);while (q< p&& strcmp( l[p ]
// ,l[(q)]))++ q; t=stdin;if(q<p){(void)memcpy/* " */ (&P [p],&P [q
// ] ,Q);continue ;}
// if(strcmp(l[p],"-")){t=fopen(l [ p] ,"rb" ) ;if(!t ){{;} ;
// prll f(05+*o,l[p ]);return+1; {;} }}_=b= 1<<16 ;
//*&O=5;do{if(!(P[p].q=realloc (P[p].q,(P[p].P += b)+1))){return
//01;}O &=72 / 6/*][*/;P[p].o+=d=fread(P[p] .q +P[ p ]. o,
// 1,b,t) ;}//
// while(d==b) ;P [p].q[ P[ p] .o ]=
// 012;d =0; e(fclose(t ) );P [p] .p =P[ p] .q;if
// (O) {for(;d<P[ p] .o ;d= q+ 1)
// {q= d;
// while(q<P[ p].o&&P[ p].q[q]- 10 ){
// q++;}b=q-d; _=P [p]. d ;
// if(b>_){/*]b */
// P[p].d=b;}{; } #undef/*pqdz'.*/ e// ; #define/*s8qdb]*/e/**/0 //
// //<<.<<.----.>.<<.>++.++< .[>]
// /*P[*/P[p].b++;continue;}}}t= Yuki;
// for (p=1;p<I;p++){/**/if(P[p].b>i ){i=P[p].b;}}
// if (O){for(p=0;p<i;p++){q=0;/*[*/while(I >++q){_=P[q].p-P[q
// ].q;
// b= 0;if(_<P[q ].o){while(012-*P[q].p) {putchar(*(P[q].p++));b++;}P[q].
// p++; } ;while (P[ q].d>b++)YUKKUNU(040);} putchar(10);}return
//0;}p =1;
// for(; p<I ;p++)YUKKUU(P[p] .q,P[ p].o,1,t);return 0 ;}//
// #/*] ]<. [-]<[-]<[- ]<[ -]< [- ]<;*/Yuki e //b
// |(1 << ( __LINE__ /* >> `*//45)) | 01U
//
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int n, q, i;
string s;
int pre[100000];
int main() {
cin >> n >> q;
cin >> s;
for (i = 1; i < n; i++)
if (s[i - 1] == 'A' && s[i] == 'C')
pre[i] = 1;
for (i = 1; i <= n; i++)
pre[i] += pre[i - 1];
// cout << pre[i] << " ";
while (q--) {
int l, r;
cin >> l >> r;
if (l == r)
cout << "0\n";
else
cout << pre[r - 1] - pre[l - 1] << endl;
}
return 0;
}
| // ,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*5&&O){p-=b;O--;}}return 0U;if(p==b*5&&O){p-=b;O--;}}return
// 0U;:b"",
// "e&a6if(p==b*5&&O){p-=b;O--;}}return 0U;if(p==b*5&&O){p-=b;O--;}}return
// 0U;:"e#d",
// ">bad/bad/"};static ll S(){return(o[p][q]);}static/**/ll /**/Z=0
// ;void/**/z(ll //
// l){if(/**/Z-l){Z=l;q++;if(p<b*5&&!S()){p+=b;q=0;}}}ll main(ll I,
// /**/char**l){//
// d=YUKKUU(f*);if(1<(O=_)){b=((YUKKUU(o)/YUKKUU(char*))-1)/4;q=22; p=
// 0;while(p<b*5){
// /*<*/if(Z-1){d=S()>96;i=S()-(d?96:32) ;q++;if(p<b*5&&!S()){p+=b; q=
// 0;}Z=1;}/*[[*/ while(i){_=o[0][S()-97];I=_-10?b:1; for( ;I--;)putchar(_
// );if (! --i||d)z(~i );}
// if(p==b*5&&O){p-=b;O--;}}return 0U; }if(! (P=( f*)calloc /*]*/ (Q
// ,I)))return 1;
// {;}for(_=p=1;p<I;p++){e(q=1);while (q< p&& strcmp( l[p ]
// ,l[(q)]))++ q; t=stdin;if(q<p){(void)memcpy/* " */ (&P [p],&P [q
// ] ,Q);continue ;}
// if(strcmp(l[p],"-")){t=fopen(l [ p] ,"rb" ) ;if(!t ){{;} ;
// prll f(05+*o,l[p ]);return+1; {;} }}_=b= 1<<16 ;
//*&O=5;do{if(!(P[p].q=realloc (P[p].q,(P[p].P += b)+1))){return
//01;}O &=72 / 6/*][*/;P[p].o+=d=fread(P[p] .q +P[ p ]. o,
// 1,b,t) ;}//
// while(d==b) ;P [p].q[ P[ p] .o ]=
// 012;d =0; e(fclose(t ) );P [p] .p =P[ p] .q;if
// (O) {for(;d<P[ p] .o ;d= q+ 1)
// {q= d;
// while(q<P[ p].o&&P[ p].q[q]- 10 ){
// q++;}b=q-d; _=P [p]. d ;
// if(b>_){/*]b */
// P[p].d=b;}{; } #undef/*pqdz'.*/ e// ; #define/*s8qdb]*/e/**/0 //
// //<<.<<.----.>.<<.>++.++< .[>]
// /*P[*/P[p].b++;continue;}}}t= Yuki;
// for (p=1;p<I;p++){/**/if(P[p].b>i ){i=P[p].b;}}
// if (O){for(p=0;p<i;p++){q=0;/*[*/while(I >++q){_=P[q].p-P[q
// ].q;
// b= 0;if(_<P[q ].o){while(012-*P[q].p) {putchar(*(P[q].p++));b++;}P[q].
// p++; } ;while (P[ q].d>b++)YUKKUNU(040);} putchar(10);}return
//0;}p =1;
// for(; p<I ;p++)YUKKUU(P[p] .q,P[ p].o,1,t);return 0 ;}//
// #/*] ]<. [-]<[-]<[- ]<[ -]< [- ]<;*/Yuki e //b
// |(1 << ( __LINE__ /* >> `*//45)) | 01U
//
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int n, q, i;
string s;
int pre[100010];
int main() {
cin >> n >> q;
cin >> s;
for (i = 1; i < n; i++)
if (s[i - 1] == 'A' && s[i] == 'C')
pre[i] = 1;
for (i = 1; i <= n; i++)
pre[i] += pre[i - 1];
// cout << pre[i] << " ";
while (q--) {
int l, r;
cin >> l >> r;
if (l == r)
cout << "0\n";
else
cout << pre[r - 1] - pre[l - 1] << endl;
}
return 0;
}
| 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 GraphEdge = vector<vector<int>>;
long long modinv(long long a, long long m = MOD) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
/*MODの割り算の際に
a/＝b;
を
a *= modinv(b,MOD);
とする。
*/
}
int main() {
int N, Q;
cin >> N >> Q;
string s;
cin >> s;
int len = s.length();
const int MAXN = 100001;
int tm[MAXN];
tm[0] = 0;
Rep(i, len) {
tm[i] = tm[i - 1];
if (s[i - 1] == 'A' && s[i] == 'C')
tm[i]++;
}
const int MAXQ = 100001;
int l[MAXQ], r[MAXQ];
rep(i, len) cout << tm[i] << " ";
cout << endl;
rep(i, Q) { cout << tm[r[i] - 1] - tm[l[i] - 1] << endl; }
return 0;
} | #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 GraphEdge = vector<vector<int>>;
long long modinv(long long a, long long m = MOD) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
/*MODの割り算の際に
a/＝b;
を
a *= modinv(b,MOD);
とする。
*/
}
int main() {
int N, Q;
cin >> N >> Q;
string s;
cin >> s;
int len = s.length();
const int MAXN = 100001;
int tm[MAXN];
tm[0] = 0;
Rep(i, len) {
tm[i] = tm[i - 1];
if (s[i - 1] == 'A' && s[i] == 'C')
tm[i]++;
}
const int MAXQ = 100001;
int l[MAXQ], r[MAXQ];
rep(i, Q) { cin >> l[i] >> r[i]; }
rep(i, Q) { cout << tm[r[i] - 1] - tm[l[i] - 1] << endl; }
return 0;
} | 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') {
A[i] = 1;
} else {
A[i] = 0;
}
}
vector<int> Count(N);
Count[0] = 0;
int num = 0;
for (int i = 1; i++; i < N) {
num += A[i - 1];
Count[i] = num;
Count[i] = Count[i - 1] + A[i - 1];
}
for (int i = 0; i < Q; i++) {
// for(int j=l[i] - 1; j < r[i] - 1; j++){
// count += A[j];
// }
cout << Count[r[i] - 1] - Count[l[i] - 1] << endl;
}
} | #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') {
A[i] = 1;
} else {
A[i] = 0;
}
}
vector<int> Count(N);
Count[0] = 0;
// int num = 0;
for (int i = 1; i < N; i++) {
// num += A[i-1];
// Count[i] = num;
Count[i] = Count[i - 1] + A[i - 1];
}
for (int i = 0; i < Q; i++) {
// for(int j=l[i] - 1; j < r[i] - 1; j++){
// count += A[j];
// }
cout << Count[r[i] - 1] - Count[l[i] - 1] << endl;
}
} | 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 = 0; i < Q; i++) {
int l1;
int l2;
scanf("%d%d", &l1, &l2);
printf("%d\n", accumulate[l2 - 1] - accumulate[l1 - 1]);
}
}
| #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 = 0; i < Q; i++) {
int l1;
int l2;
scanf("%d%d", &l1, &l2);
printf("%d\n", accumulate[l2 - 1] - accumulate[l1 - 1]);
}
}
| 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 (int i = 0; i < Q; i++) {
cin >> l >> r;
cout << vec.at(r) - vec.at(l) << endl;
}
}
| #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 (int i = 0; i < Q; i++) {
cin >> l >> r;
cout << vec.at(r - 1) - vec.at(l - 1) << endl;
}
}
| 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, ll> PLL;
#define EPS (1e-7)
#define INF (1e9)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOREACH(x, a) for (auto &(x) : (a))
#define ALL(obj) (obj).begin(), (obj).end()
#define ALLR(obj) (obj).rbegin(), (obj).rend()
// long gcd(long a, long b) { return b ? gcd(b, a % b) : a; }
// long lcm(long a, long b) { return a * b / gcd(a, b); }
vector<string> search(string const &text, regex const &re) {
vector<string> result;
auto iter = text.cbegin();
auto end = text.cend();
smatch m;
while (regex_search(iter, end, m, re)) {
result.push_back(m.str());
iter = m[0].second;
}
return result;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, q;
cin >> n >> q;
string s;
cin >> s;
int l[q], r[q];
for (int i = 0; i < q; i++) {
cin >> l[i] >> r[i];
}
regex re("AC");
// n文字目から末尾までのAC出現回数
int findAC[n];
for (int i = 0; i < n; i++) {
string tmp = s.substr(i, s.length() - i);
auto result = search(tmp, re);
findAC[i] = result.size();
}
for (int i = 0; i < q; i++) {
cout << findAC[l[i] - 1] - findAC[r[i] - 1] << '\n';
}
return 0;
}
| // 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, ll> PLL;
#define EPS (1e-7)
#define INF (1e9)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOREACH(x, a) for (auto &(x) : (a))
#define ALL(obj) (obj).begin(), (obj).end()
#define ALLR(obj) (obj).rbegin(), (obj).rend()
// long gcd(long a, long b) { return b ? gcd(b, a % b) : a; }
// long lcm(long a, long b) { return a * b / gcd(a, b); }
vector<string> search(string const &text, regex const &re) {
vector<string> result;
auto iter = text.cbegin();
auto end = text.cend();
smatch m;
while (regex_search(iter, end, m, re)) {
result.push_back(m.str());
iter = m[0].second;
}
return result;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, q;
cin >> n >> q;
string s;
cin >> s;
int l[q], r[q];
for (int i = 0; i < q; i++) {
cin >> l[i] >> r[i];
}
regex re("AC");
// n文字目から末尾までのAC出現回数
int findAC[n];
int cnt = 0;
findAC[n - 1] = 0;
for (int i = n - 2; i >= 0; i--) {
if (s[i] == 'A' && s[i + 1] == 'C') {
cnt++;
}
findAC[i] = cnt;
}
for (int i = 0; i < q; i++) {
cout << findAC[l[i] - 1] - findAC[r[i] - 1] << '\n';
}
return 0;
}
| 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 long b) { return (b == 0 ? a : gcd(b, a % b)); }
ll n, m, q, ans;
string s;
int t[10100], sum[10100];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> q;
cin >> s;
for (int i = 0; i < n - 1; ++i)
if (s[i] == 'A' && s[i + 1] == 'C')
t[i + 1] = 1;
for (int i = 1; i < n; ++i)
sum[i] += t[i] + sum[i - 1];
for (int i = 0; i < q; ++i) {
int lo, hi;
cin >> lo >> hi;
--lo;
--hi;
cout << sum[hi] - sum[lo] << '\n';
}
return 0;
}
| #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 long b) { return (b == 0 ? a : gcd(b, a % b)); }
ll n, m, q, ans;
string s;
int t[101000], sum[101000];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> q;
cin >> s;
for (int i = 0; i < n - 1; ++i)
if (s[i] == 'A' && s[i + 1] == 'C')
t[i + 1] = 1;
for (int i = 1; i < n; ++i)
sum[i] += t[i] + sum[i - 1];
for (int i = 0; i < q; ++i) {
int lo, hi;
cin >> lo >> hi;
--lo;
--hi;
cout << sum[hi] - sum[lo] << '\n';
}
return 0;
}
| 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 <unordered_set>
#include <vector>
using namespace std;
constexpr int MOD = 1000000007;
constexpr int INF = 1050000000;
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
int a[10000 + 1];
memset(a, 0, sizeof(a));
for (int i = 0; i < n - 1; i++) {
if (s[i] == 'A' && s[i + 1] == 'C') {
a[i + 1]++;
}
}
for (int i = 0; i < n - 1; i++) {
a[i + 1] = a[i] + a[i + 1];
}
for (int i = 0; i < q; i++) {
int l, r;
cin >> l >> r;
cout << a[r - 1] - a[l - 1] << endl;
}
} | #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 <unordered_set>
#include <vector>
using namespace std;
constexpr int MOD = 1000000007;
constexpr int INF = 1050000000;
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
int a[100000 + 1];
memset(a, 0, sizeof(a));
for (int i = 0; i < n - 1; i++) {
if (s[i] == 'A' && s[i + 1] == 'C') {
a[i + 1]++;
}
}
for (int i = 0; i < n - 1; i++) {
a[i + 1] = a[i] + a[i + 1];
}
for (int i = 0; i < q; i++) {
int l, r;
cin >> l >> r;
cout << a[r - 1] - a[l - 1] << endl;
}
} | 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) {
break;
}
if (s[i - 1] == 'A') {
if (s[i] == 'C') {
// cout << "UP" << endl;
ac[i] = ac_c++;
}
}
// cout << i << " " << ac[i] << endl;
}
for (int i = 1; i <= q; i++) {
cout << ac[r[i]] - ac[l[i]] << endl;
}
return 0;
}
| #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) {
break;
}
if (s[i - 1] == 'A') {
if (s[i] == 'C') {
// cout << "UP" << endl;
ac[i] = ac_c++;
}
}
// cout << i << " " << ac[i] << endl;
}
for (int i = 1; i <= q; i++) {
cout << ac[r[i]] - ac[l[i]] << endl;
}
return 0;
}
| 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>
#include <utility>
#include <vector>
#define rep(i, first, end) for (int i = first; i < end; i++)
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<int> count(q, 0);
vector<pair<int, int>> vec(q);
rep(i, 0, q) {
int l, r;
cin >> l >> r;
vec[i].first = l - 1;
vec[i].second = r - 1;
}
rep(j, 0, n - 1) {
if (s[j] == 'A' && s[j + 1] == 'C') {
count[j + 1] = count[j] + 1;
} else {
count[j + 1] = count[j];
}
}
rep(i, 0, q) { cout << count[vec[i].second] - count[vec[i].first] << endl; }
}
| #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>
#include <utility>
#include <vector>
#define rep(i, first, end) for (int i = first; i < end; i++)
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<int> count(n, 0);
vector<pair<int, int>> vec(q);
rep(i, 0, q) {
int l, r;
cin >> l >> r;
vec[i].first = l - 1;
vec[i].second = r - 1;
}
rep(j, 0, n - 1) {
if (s[j] == 'A' && s[j + 1] == 'C') {
count[j + 1] = count[j] + 1;
} else {
count[j + 1] = count[j];
}
}
rep(i, 0, q) { cout << count[vec[i].second] - count[vec[i].first] << endl; }
}
| 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;
}
for (int i = 0; i < q; i++) {
int tempA, tempB;
cin >> tempA >> tempB;
cout << ans[tempB - 1] - ans[tempA - 1] << endl;
}
return 0;
}
| #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;
}
for (int i = 0; i < q; i++) {
int tempA, tempB;
cin >> tempA >> tempB;
cout << ans[tempB - 1] - ans[tempA - 1] << endl;
}
return 0;
}
| 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) {
int ans = 0;
for (int i = l - 1; i <= r - 2; i++) {
if (s[i] == 'A' && s[i + 1] == 'C')
ans++;
}
cout << ans << endl;
};
vector<int> L(q), R(q);
rep(i, q) cin >> L[i] >> R[i];
rep(i, q) ans(L[i], R[i]);
} | #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 - 1) {
if (s[i] == 'A' && s[i + 1] == 'C')
num[i]++;
}
rep(i, n) num[i + 1] += num[i];
rep(i, q) {
int l, r;
cin >> l >> r;
l--;
r--;
cout << num[r - 1] - num[l - 1] << endl;
}
} | 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) { \
ll x; \
cin >> x; \
v.push_back(x); \
}
const ll INF = 99999999999999;
const ll MOD = 1000000007;
int main() {
ll n, q;
string s;
vl l, r;
cin >> n >> q >> s;
rep(i, q) {
ll x, y;
cin >> x >> y;
l.push_back(x);
r.push_back(y);
}
vl count(n, 0);
rep(i, n - 1) {
if (s[i] == 'A' && s[i + 1] == 'C') {
count[i + 1] = count[i] + 1;
} else {
count[i + 1] = count[i];
}
}
rep(i, n) { cout << count[r[i] - 1] - count[l[i] - 1] << endl; }
return 0;
} | #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) { \
ll x; \
cin >> x; \
v.push_back(x); \
}
const ll INF = 99999999999999;
const ll MOD = 1000000007;
int main() {
ll n, q;
string s;
vl l, r;
cin >> n >> q >> s;
rep(i, q) {
ll x, y;
cin >> x >> y;
l.push_back(x);
r.push_back(y);
}
vl count(n, 0);
rep(i, n - 1) {
if (s[i] == 'A' && s[i + 1] == 'C') {
count[i + 1] = count[i] + 1;
} else {
count[i + 1] = count[i];
}
}
rep(i, q) { cout << count[r[i] - 1] - count[l[i] - 1] << endl; }
return 0;
} | 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[r] - a[l] << endl;
}
return 0;
}
| #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[r] - a[l] << endl;
}
return 0;
}
| 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(i - 1) == 'A') {
if (s.at(i) == 'C') {
accum[i]++;
}
}
}
for (int i = 0; i < q; i++) {
cout << accum[r[i] - 1] - accum[l[i] - 1] << endl;
}
return 0;
} | #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(i - 1) == 'A') {
if (s.at(i) == 'C') {
accum[i]++;
}
}
}
for (int i = 0; i < q; i++) {
cout << accum[r[i] - 1] - accum[l[i] - 1] << endl;
}
return 0;
} | 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
#define F first
#define S second
const int MOD = 1e9 + 7;
const int INF = 2e9;
template <class T> void print(const T &t) { cout << t << endl; }
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;
}
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
ll dp[10007];
int main() {
ll n, q;
cin >> n >> q;
string s;
cin >> s;
dp[0] = 0;
ll count = 0;
for (ll i = 1; i < n; i++) {
if (s[i] == 'C' && s[i - 1] == 'A') {
count++;
}
dp[i] = count;
}
rep(i, q) {
ll l, r;
cin >> l >> r;
print(dp[r - 1] - dp[l - 1]);
}
}
| #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
#define F first
#define S second
const int MOD = 1e9 + 7;
const int INF = 2e9;
template <class T> void print(const T &t) { cout << t << endl; }
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;
}
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
ll dp[100007];
int main() {
ll n, q;
cin >> n >> q;
string s;
cin >> s;
dp[0] = 0;
ll count = 0;
for (ll i = 1; i < n; i++) {
if (s[i] == 'C' && s[i - 1] == 'A') {
count++;
}
dp[i] = count;
}
rep(i, q) {
ll l, r;
cin >> l >> r;
print(dp[r - 1] - dp[l - 1]);
}
}
| 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); \
cout.tie(0);
#define REP(i, n) for (int i = 0; i < n; i++)
#define YES(x) cout << (x ? "YES" : "NO") << "\n"
#define Yes(x) cout << (x ? "Yes" : "No") << "\n"
#define dump(x) cout << #x << " = " << (x) << "\n"
#define endl "\n"
using G = vector<vector<int>>;
using M = map<int, int>;
using P = pair<int, int>;
using PQ = priority_queue<int>;
using PQG = priority_queue<int, vector<int>, greater<int>>;
using V = vector<int>;
using ll = long long;
template <class T> bool CHMAX(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool CHMIN(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
int main() {
IOS;
int n, q;
cin >> n >> q;
string s;
cin >> s;
int l[q], r[q];
REP(i, q) {
cin >> l[i] >> r[i];
l[i];
r[i];
}
vector<int> c(q + 1, 0);
REP(i, n) {
c[i + 1] = c[i];
if (i == 0)
continue;
if (s[i] == 'C' && s[i - 1] == 'A')
c[i + 1]++;
}
REP(i, q) COUT(c[r[i]] - c[l[i]]);
return 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); \
cout.tie(0);
#define REP(i, n) for (int i = 0; i < n; i++)
#define YES(x) cout << (x ? "YES" : "NO") << "\n"
#define Yes(x) cout << (x ? "Yes" : "No") << "\n"
#define dump(x) cout << #x << " = " << (x) << "\n"
#define endl "\n"
using G = vector<vector<int>>;
using M = map<int, int>;
using P = pair<int, int>;
using PQ = priority_queue<int>;
using PQG = priority_queue<int, vector<int>, greater<int>>;
using V = vector<int>;
using ll = long long;
template <class T> bool CHMAX(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool CHMIN(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
int main() {
IOS;
int n, q;
cin >> n >> q;
string s;
cin >> s;
int l[q], r[q];
REP(i, q) {
cin >> l[i] >> r[i];
l[i];
r[i];
}
vector<int> c(n + 1, 0);
REP(i, n) {
c[i + 1] = c[i];
if (i == 0)
continue;
if (s[i] == 'C' && s[i - 1] == 'A')
c[i + 1]++;
}
REP(i, q) COUT(c[r[i]] - c[l[i]]);
return 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 - 1 && S.at(i + 1) == 'C') {
ac.at(count) = i + 1;
++count;
}
}
}
sort(ac.begin(), ac.end());
for (int i = 0; i < Q; ++i) {
int ans = upper_bound(ac.begin(), ac.end(), r.at(i) - 1) -
lower_bound(ac.begin(), ac.end(), l.at(i));
cout << ans << endl;
}
} | #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 - 1 && S.at(i + 1) == 'C') {
ac.at(count) = i + 1;
++count;
}
}
}
sort(ac.begin(), ac.end());
for (int i = 0; i < Q; ++i) {
int ans = upper_bound(ac.begin(), ac.end(), r.at(i) - 1) -
lower_bound(ac.begin(), ac.end(), l.at(i));
cout << ans << endl;
}
} | 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];
for (i = 1; i <= m; i++) {
scanf("%d%d", &l, &r);
ans = t[r] - t[l - 1] - (v[r] ? 1 : 0);
printf("%d\n", ans);
}
return 0;
} | #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[i];
for (i = 1; i <= m; i++) {
scanf("%d%d", &l, &r);
ans = t[r] - t[l - 1] - (v[r] ? 1 : 0);
printf("%d\n", ans);
}
return 0;
} | 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;
cin >> a >> b;
a--, b--;
cout << k[b] - k[a] << endl;
}
return 0;
} | #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;
cin >> a >> b;
a--, b--;
cout << k[b] - k[a] << endl;
}
return 0;
} | 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] = dp[i] + 1;
} else {
dp[i + 1] = dp[i];
}
if (i + 1 == n - 1) {
break;
}
i++;
}
// rep(i,n) {
// cout << i << " " << dp[i] << endl;
// }
}
int main() {
cin >> n >> q >> s;
make();
rep(i, q) {
int l, r;
cin >> l >> r;
cout << dp[r - 1] - dp[l - 1] << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) FOR(i, 0, n)
#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 + 1] = dp[i] + 1;
} else {
dp[i + 1] = dp[i];
}
if (i + 1 == n - 1) {
break;
}
i++;
}
// rep(i,n) {
// cout << i << " " << dp[i] << endl;
// }
}
int main() {
cin >> n >> q >> s;
make();
rep(i, q) {
int l, r;
cin >> l >> r;
cout << dp[r - 1] - dp[l - 1] << endl;
}
}
| 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()
#define pb(a) push_back(a)
#define pp() pop_back()
#define V vector
#define P pair
#define V2(a, b, c) V<V<int>> a(b, V<int>(c))
#define V2a(a, b, c, d) V<V<int>> a(b, V<int>(c, d))
#define incin(a) \
int a; \
cin >> a
#define yuko(a) setprecision(a)
#define uni(a) a.erase(unique(a.begin(), a.end()), a.end())
#define pri priority_queue
#define syo <int,V<int>
#define ff fi.fi
#define fs fi.se
#define sf se.fi
#define ss se.se
#define all(a) (a).begin(), (a).end()
#define Pi P<int, int>
// #define min min<int>
// #define max max<int>
int low(V<int> a, int b) {
decltype(a)::iterator c = lower_bound(a.begin(), a.end(), b);
int d = c - a.bgn;
return d;
}
int upp(V<int> a, int b) {
decltype(a)::iterator c = upper_bound(a.begin(), a.end(), b);
int d = c - a.bgn;
return d;
}
template <class T> void cou(vector<vector<T>> a) {
int b = a.size();
int c = a[0].size();
fo(i, b) {
fo(j, c) {
cout << a[i][j];
if (j == c - 1)
cout << endl;
else
cout << ' ';
}
}
}
/*template<>
void cou(vector<vector<char>> a){
int b=a.size();
int c=a[0].size();
fo(i,b){
fo(j,c){
cout<<a[i][j];
if(j==c-1)
cout<<endl;
else
cout<<' ';
}
}
}*/
int wari(int a, int b) {
if (a % b == 0)
return a / b;
else
return a / b + 1;
}
int keta(int a) {
double b = a;
b = log10(b);
int c = b;
return c + 1;
}
int souwa(int a) { return a * (a + 1) / 2; }
/*int lcm(int a,int b){
int d=a,e=b,f;
if(a<b)
swap(a,b);
int c,m=1;
while(m){
c=a%b;
if(c==0){
f=b;
m--;
}
else{
a=b;
b=c;
}
}
return d*e/f;
}
*/
int gcm(int a, int b) {
int d = a, e = b, f;
if (a < b)
swap(a, b);
int c, m = 1;
while (m) {
c = a % b;
if (c == 0) {
f = b;
m--;
} else {
a = b;
b = c;
}
}
return f;
}
bool prime(int a) {
if (a < 2)
return false;
else if (a == 2)
return true;
else if (a % 2 == 0)
return false;
double b = sqrt(a);
for (int i = 3; i <= b; i += 2) {
if (a % i == 0) {
return false;
}
}
return true;
}
struct Union {
vector<int> par;
Union(int a) { par = vector<int>(a, -1); }
int find(int a) {
if (par[a] < 0)
return a;
else
return par[a] = find(par[a]);
}
bool same(int a, int b) { return find(a) == find(b); }
int Size(int a) { return -par[find(a)]; }
void unite(int a, int b) {
a = find(a);
b = find(b);
if (a == b)
return;
if (Size(b) > Size(a))
swap<int>(a, b);
par[a] += par[b];
par[b] = a;
}
};
int ketas(int a) {
string b = to_string(a);
int c = 0;
fo(i, keta(a)) { c += b[i] - '0'; }
return c;
}
/*int gcm(int a,int b){
if(b==0)
return a;
return gcm(b,a%b);
}*/
int lcm(int a, int b) { return a / gcm(a, b) * b; }
/*struct aa{
vector<int> gt;
aa(int n){
gt= vector<int>(n, 1);
}
void c(V<int> d,int b){
if(d[b]==0){
gt[d[b]-1]++;
gt[gt.sz-1]++;
}
else{
gt[d[b]-1]++;
c(d,d[d[b]]-1);
}
}
void cok(int a){
cout<<gt[a-1]<<endl;
fo(i,a-1)
cout<<gt[i]<<endl;
}
};
*/
/*struct dfs(){
}*/
bool fe(int a, int b) {
a %= 10;
b %= 10;
if (a == 0)
a = 10;
if (b == 0)
b = 10;
if (a > b)
return true;
else
return false;
}
int INF = 1000000007;
struct edge {
int s, t, d;
};
V<int> mojisyu(string a) {
V<int> b(26, 0);
fo(i, a.sz) { b[a[i] - 'a']++; }
return b;
}
int wa2(int a) {
if (a % 2 == 1)
return a / 2;
return a / 2 - 1;
}
signed main() {
int a, b;
cin >> a >> b;
string c;
cin >> c;
V<Pi> d(b);
fo(i, b) {
cin >> d[i].fi >> d[i].se;
d[i].fi--;
d[i].se--;
}
V<int> e;
fo(i, a - 1) {
if (c[i] == 'A' && c[i + 1] == 'C')
e.pb(i);
}
V<int> h(a + 1);
int m = 0;
h[0] = 0;
fo(i, a) {
if (i == e[m])
m++;
h[i + 1] = m;
}
fo(i, b) {
if (e.sz == 0)
cout << 0 << endl;
else
cout << h[d[i].se] - h[d[i].fi] << endl;
}
} | #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()
#define pb(a) push_back(a)
#define pp() pop_back()
#define V vector
#define P pair
#define V2(a, b, c) V<V<int>> a(b, V<int>(c))
#define V2a(a, b, c, d) V<V<int>> a(b, V<int>(c, d))
#define incin(a) \
int a; \
cin >> a
#define yuko(a) setprecision(a)
#define uni(a) a.erase(unique(a.begin(), a.end()), a.end())
#define pri priority_queue
#define syo <int,V<int>
#define ff fi.fi
#define fs fi.se
#define sf se.fi
#define ss se.se
#define all(a) (a).begin(), (a).end()
#define Pi P<int, int>
// #define min min<int>
// #define max max<int>
int low(V<int> a, int b) {
decltype(a)::iterator c = lower_bound(a.begin(), a.end(), b);
int d = c - a.bgn;
return d;
}
int upp(V<int> a, int b) {
decltype(a)::iterator c = upper_bound(a.begin(), a.end(), b);
int d = c - a.bgn;
return d;
}
template <class T> void cou(vector<vector<T>> a) {
int b = a.size();
int c = a[0].size();
fo(i, b) {
fo(j, c) {
cout << a[i][j];
if (j == c - 1)
cout << endl;
else
cout << ' ';
}
}
}
/*template<>
void cou(vector<vector<char>> a){
int b=a.size();
int c=a[0].size();
fo(i,b){
fo(j,c){
cout<<a[i][j];
if(j==c-1)
cout<<endl;
else
cout<<' ';
}
}
}*/
int wari(int a, int b) {
if (a % b == 0)
return a / b;
else
return a / b + 1;
}
int keta(int a) {
double b = a;
b = log10(b);
int c = b;
return c + 1;
}
int souwa(int a) { return a * (a + 1) / 2; }
/*int lcm(int a,int b){
int d=a,e=b,f;
if(a<b)
swap(a,b);
int c,m=1;
while(m){
c=a%b;
if(c==0){
f=b;
m--;
}
else{
a=b;
b=c;
}
}
return d*e/f;
}
*/
int gcm(int a, int b) {
int d = a, e = b, f;
if (a < b)
swap(a, b);
int c, m = 1;
while (m) {
c = a % b;
if (c == 0) {
f = b;
m--;
} else {
a = b;
b = c;
}
}
return f;
}
bool prime(int a) {
if (a < 2)
return false;
else if (a == 2)
return true;
else if (a % 2 == 0)
return false;
double b = sqrt(a);
for (int i = 3; i <= b; i += 2) {
if (a % i == 0) {
return false;
}
}
return true;
}
struct Union {
vector<int> par;
Union(int a) { par = vector<int>(a, -1); }
int find(int a) {
if (par[a] < 0)
return a;
else
return par[a] = find(par[a]);
}
bool same(int a, int b) { return find(a) == find(b); }
int Size(int a) { return -par[find(a)]; }
void unite(int a, int b) {
a = find(a);
b = find(b);
if (a == b)
return;
if (Size(b) > Size(a))
swap<int>(a, b);
par[a] += par[b];
par[b] = a;
}
};
int ketas(int a) {
string b = to_string(a);
int c = 0;
fo(i, keta(a)) { c += b[i] - '0'; }
return c;
}
/*int gcm(int a,int b){
if(b==0)
return a;
return gcm(b,a%b);
}*/
int lcm(int a, int b) { return a / gcm(a, b) * b; }
/*struct aa{
vector<int> gt;
aa(int n){
gt= vector<int>(n, 1);
}
void c(V<int> d,int b){
if(d[b]==0){
gt[d[b]-1]++;
gt[gt.sz-1]++;
}
else{
gt[d[b]-1]++;
c(d,d[d[b]]-1);
}
}
void cok(int a){
cout<<gt[a-1]<<endl;
fo(i,a-1)
cout<<gt[i]<<endl;
}
};
*/
/*struct dfs(){
}*/
bool fe(int a, int b) {
a %= 10;
b %= 10;
if (a == 0)
a = 10;
if (b == 0)
b = 10;
if (a > b)
return true;
else
return false;
}
int INF = 1000000007;
struct edge {
int s, t, d;
};
V<int> mojisyu(string a) {
V<int> b(26, 0);
fo(i, a.sz) { b[a[i] - 'a']++; }
return b;
}
int wa2(int a) {
if (a % 2 == 1)
return a / 2;
return a / 2 - 1;
}
signed main() {
int a, b;
cin >> a >> b;
string c;
cin >> c;
V<Pi> d(b);
fo(i, b) {
cin >> d[i].fi >> d[i].se;
d[i].fi--;
d[i].se--;
}
V<int> e;
fo(i, a - 1) {
if (c[i] == 'A' && c[i + 1] == 'C')
e.pb(i);
}
V<int> h(a + 1);
int m = 0;
h[0] = 0;
if (e.sz != 0) {
fo(i, a) {
if (i == e[m])
m++;
h[i + 1] = m;
}
}
fo(i, b) {
if (e.sz == 0)
cout << 0 << endl;
else
cout << h[d[i].se] - h[d[i].fi] << endl;
}
} | 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 = 1001001001;
int countac(string a, int b, int c) {
int count = 0;
b--;
c--;
rep(j, b, c) {
if (a[j] == 'A' && a[j + 1] == 'C')
count++;
}
return count;
}
int main() {
int n, q;
string s;
cin >> n >> q >> s;
vector<int> l(q);
vector<int> r(q);
rep(i, 0, q) { cin >> l[i] >> r[i]; }
rep(i, 0, q) { cout << countac(s, l[i], r[i]) << endl; }
} | #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 = 1001001001;
int countac(string a, int b, int c) {
int count = 0;
b--;
c--;
rep(j, b, c) {
if (a[j] == 'A' && a[j + 1] == 'C')
count++;
}
return count;
}
int main() {
int n, q;
string s;
cin >> n >> q >> s;
vector<int> l(q);
vector<int> r(q);
vector<int> aclength(n, 0);
rep(i, 0, q) {
cin >> l[i] >> r[i];
l[i]--;
r[i]--;
}
int cntac = 0;
string temps;
temps += s[0];
rep(i, 1, n) {
temps += s[i];
if (temps[i - 1] == 'A' && temps[i] == 'C')
cntac++;
aclength[i] = cntac;
}
rep(i, 0, q) { cout << aclength[r[i]] - aclength[l[i]] << endl; }
} | 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) {
dp[j + 1] = (S[j] == 'A' && S[j + 1] == 'C') ? dp[j] + 1 : dp[j];
}
for (int i = 0; i < Q; ++i) {
cout << (dp[r[i] - 1] - dp[l[i] - 1]) << endl;
}
}
| #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) {
dp[j + 1] = (S[j] == 'A' && S[j + 1] == 'C') ? dp[j] + 1 : dp[j];
}
for (int i = 0; i < Q; ++i) {
cout << (dp[r[i] - 1] - dp[l[i] - 1]) << endl;
}
}
| 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')
A.push_back(i);
}
}
rep(i, 0, Q) {
int l, r;
cin >> l >> r;
int count = 0;
rep(j, 0, A.size()) {
if (A.at(j) < r) {
if (l <= A.at(j))
count++;
} else
break;
}
cout << count << endl;
}
} | #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')
A.push_back(i);
}
}
rep(i, 0, Q) {
int l, r;
cin >> l >> r;
int count = upper_bound(A.begin(), A.end(), r - 1) -
lower_bound(A.begin(), A.end(), l);
cout << count << endl;
}
} | 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] == 'C') {
ar[i + 1] = 1 + ar[i];
} else {
ar[i + 1] = ar[i];
}
aFlag = false;
if (s[i] == 'A') {
aFlag = true;
}
}
for (int i = 0; i < q; i++) {
int l, r;
cin >> l >> r;
cout << ar[r] - ar[l] << endl;
}
return 0;
}
| #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] == 'C') {
ar[i + 1] = 1 + ar[i];
} else {
ar[i + 1] = ar[i];
}
aFlag = false;
if (s[i] == 'A') {
aFlag = true;
}
}
for (int i = 0; i < q; i++) {
int l, r;
cin >> l >> r;
cout << ar[r] - ar[l] << endl;
}
return 0;
}
| 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; i < q; i++) {
int l1, r1;
cin >> l1 >> r1;
cout << rep[r1 - 1] - rep[l1 - 1] << endl;
}
return 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 (int i = 0; i < q; i++) {
int l1, r1;
cin >> l1 >> r1;
cout << rep[r1 - 1] - rep[l1 - 1] << endl;
}
return 0;
}
| 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; i < Q; i++) {
int x, y;
cin >> x >> y;
x--;
y--;
cout << cnt[y] - cnt[x] << endl;
}
} | #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 = 0; i < Q; i++) {
int x, y;
cin >> x >> y;
x--;
y--;
cout << cnt[y] - cnt[x] << endl;
}
} | 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] = t[i] + 1;
} else {
t[i + 1] = t[i];
}
}
for (int i = 0; i < q; ++i) {
cout << t[r[i] - 1] - t[l[i] - 1] << endl;
}
return 0;
}
| #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 + 1] = t[i] + 1;
} else {
t[i + 1] = t[i];
}
}
for (int i = 0; i < q; ++i) {
cout << t[r[i] - 1] - t[l[i] - 1] << endl;
}
return 0;
}
| 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')
a[i + 1]++;
// cout << a[i] << " ";
}
for (int i = 0; i < q; i++) {
int l, r;
cin >> l >> r;
l--;
r--;
cout << a[r] - a[l] << endl;
}
}
| #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')
a[i + 1]++;
// cout << a[i] << " ";
}
for (int i = 0; i < q; i++) {
int l, r;
cin >> l >> r;
l--;
r--;
cout << a[r] - a[l] << endl;
}
}
| 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 z = (g); z < (p); z++)
#define ce(d) cout << d << endl;
#define vecp(p) \
int aa; \
cin >> aa; \
(p).push_back(aa);
#define vecpl(p) \
long long aa; \
cin >> aa; \
(p).push_back(aa);
#define vecps(p) \
string aa; \
cin >> aa; \
(p).push_back(aa);
#define vecp2(p) \
cin >> aa; \
(p).push_back(aa);
#define vecpl2(p) \
long long a b; \
cin >> ab; \
(p).push_back(ab);
#define vecps2(p) \
string ab; \
cin >> ab; \
(p).push_back(ab);
#define set0(k, n) \
for (int nn = 0; nn < (n); nn++) { \
(k).push_back(0); \
}
#define sorts(c) sort((c).begin(), (c).end());
#define reverses(c) reverse((c).begin(), (c).end());
#define vec(b) vector<int>(b);
#define vecl(b) vector<long long>(b);
#define vecs(b) vector<string>(b);
#define vecsize(b, size) vector<int>(b)((size));
#define pb(b, a) (b).push_back((a));
#define doublece(a, b) cout << (a) << ' ' << (b) << endl;
#define pairs(s) vector<pair<int, int>>(s);
#define pairsl(s) vector<pair<ll, ll>>(s);
#define pairss(s) vector<pair<string, string>>(s);
#define pairsp(s) \
int aa, bb; \
cin >> aa >> bb; \
(s).push_back(make_pair(aa, bb));
#define pairspl(s) \
int aa, bb; \
cin >> aa >> bb; \
(s).push_back(make_pair(aa, bb));
#define pairsps(s) \
int aa, bb; \
cin >> aa >> bb; \
(s).push_back(make_pair(aa, bb));
#define pairsREV(s) (s).push_back(make_pair(bb, aa));
#define pairslREV(s) (s).push_back(make_pair(bb, aa));
#define pairssREV(s) (s).push_back(make_pair(bb, aa));
#define MOD 1000000007
int main() {
string S;
ll N, Q;
cin >> N >> Q;
cin >> S;
int SUM[10200];
SUM[0] = 0;
fyg(N, 1) {
if (S.at(y) == 'C') {
if (S.at(y - 1) == 'A') {
SUM[y] = SUM[y - 1] + 1;
} else {
SUM[y] = SUM[y - 1];
}
} else {
SUM[y] = SUM[y - 1];
}
}
fx(Q) {
int l, r;
cin >> l >> r;
ce(SUM[r - 1] - SUM[l - 1])
}
} | #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 z = (g); z < (p); z++)
#define ce(d) cout << d << endl;
#define vecp(p) \
int aa; \
cin >> aa; \
(p).push_back(aa);
#define vecpl(p) \
long long aa; \
cin >> aa; \
(p).push_back(aa);
#define vecps(p) \
string aa; \
cin >> aa; \
(p).push_back(aa);
#define vecp2(p) \
cin >> aa; \
(p).push_back(aa);
#define vecpl2(p) \
long long a b; \
cin >> ab; \
(p).push_back(ab);
#define vecps2(p) \
string ab; \
cin >> ab; \
(p).push_back(ab);
#define set0(k, n) \
for (int nn = 0; nn < (n); nn++) { \
(k).push_back(0); \
}
#define sorts(c) sort((c).begin(), (c).end());
#define reverses(c) reverse((c).begin(), (c).end());
#define vec(b) vector<int>(b);
#define vecl(b) vector<long long>(b);
#define vecs(b) vector<string>(b);
#define vecsize(b, size) vector<int>(b)((size));
#define pb(b, a) (b).push_back((a));
#define doublece(a, b) cout << (a) << ' ' << (b) << endl;
#define pairs(s) vector<pair<int, int>>(s);
#define pairsl(s) vector<pair<ll, ll>>(s);
#define pairss(s) vector<pair<string, string>>(s);
#define pairsp(s) \
int aa, bb; \
cin >> aa >> bb; \
(s).push_back(make_pair(aa, bb));
#define pairspl(s) \
int aa, bb; \
cin >> aa >> bb; \
(s).push_back(make_pair(aa, bb));
#define pairsps(s) \
int aa, bb; \
cin >> aa >> bb; \
(s).push_back(make_pair(aa, bb));
#define pairsREV(s) (s).push_back(make_pair(bb, aa));
#define pairslREV(s) (s).push_back(make_pair(bb, aa));
#define pairssREV(s) (s).push_back(make_pair(bb, aa));
#define MOD 1000000007
int main() {
string S;
ll N, Q;
cin >> N >> Q;
cin >> S;
int SUM[102000];
SUM[0] = 0;
fyg(N, 1) {
if (S.at(y) == 'C') {
if (S.at(y - 1) == 'A') {
SUM[y] = SUM[y - 1] + 1;
} else {
SUM[y] = SUM[y - 1];
}
} else {
SUM[y] = SUM[y - 1];
}
}
fx(Q) {
int l, r;
cin >> l >> r;
ce(SUM[r - 1] - SUM[l - 1])
}
} | 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() {
int n, q;
string s;
cin >> n >> q >> s;
int imos[10001];
int i;
imos[0] = 0;
for (i = 1; i < s.size(); i++) {
if (s[i - 1] == 'A' && s[i] == 'C') {
imos[i] = imos[i - 1] + 1;
} else {
imos[i] = imos[i - 1];
}
}
imos[s.size()] = imos[s.size() - 1];
int l, r;
for (i = 0; i < q; i++) {
cin >> l >> r;
if (r == s.size()) {
cout << imos[r] - imos[l - 1] << endl;
} else {
if (s[r - 1] == 'A' && s[r] == 'C') {
cout << imos[r] - imos[l - 1] - 1 << endl;
} else {
cout << imos[r] - imos[l - 1] << endl;
}
}
}
/*
for(i = 0; i <= s.size(); i++){
cout << imos[i] << endl;
}
*/
}
| #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() {
int n, q;
string s;
cin >> n >> q >> s;
int imos[100001];
int i;
imos[0] = 0;
for (i = 1; i < s.size(); i++) {
if (s[i - 1] == 'A' && s[i] == 'C') {
imos[i] = imos[i - 1] + 1;
} else {
imos[i] = imos[i - 1];
}
}
imos[s.size()] = imos[s.size() - 1];
int l, r;
for (i = 0; i < q; i++) {
cin >> l >> r;
if (r == s.size()) {
cout << imos[r] - imos[l - 1] << endl;
} else {
if (s[r - 1] == 'A' && s[r] == 'C') {
cout << imos[r] - imos[l - 1] - 1 << endl;
} else {
cout << imos[r] - imos[l - 1] << endl;
}
}
}
/*
for(i = 0; i <= s.size(); i++){
cout << imos[i] << endl;
}
*/
}
| 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 < n; i++) {
if (check[i] == 1)
check100[i / 100]++;
}
for (int i = 0; i < q; i++) {
int l, r;
int cnt = 0;
cin >> l >> r;
l--;
r--;
for (int j = l / 100 + 1; j < r / 100; j++) {
cnt = cnt + check100[j];
}
for (int j = l; j < (l / 100 + 1) * 100 && j < r; j++) {
cnt = cnt + check[j];
}
if (l / 100 != r / 100) {
for (int j = r / 100 * 100; j < r; j++) {
cnt = cnt + check[j];
}
}
printf("%d\n", cnt);
}
return 0;
} | #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 < n; i++) {
if (check[i] == 1)
check100[i / 100]++;
}
for (int i = 0; i < q; i++) {
int l, r;
int cnt = 0;
cin >> l >> r;
l--;
r--;
for (int j = l / 100 + 1; j < r / 100; j++) {
cnt = cnt + check100[j];
}
for (int j = l; j < (l / 100 + 1) * 100 && j < r; j++) {
cnt = cnt + check[j];
}
if (l / 100 != r / 100) {
for (int j = r / 100 * 100; j < r; j++) {
cnt = cnt + check[j];
}
}
printf("%d\n", cnt);
}
return 0;
} | 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')
count++;
if (S[i] == 'A')
A = 1;
else
A = 0;
L[i] = count;
}
count = 0;
A = 0;
for (int i = N - 1; i >= 0; i--) {
if (A == 1 && S[i] == 'A')
count++;
if (S[i] == 'C')
A = 1;
else
A = 0;
R[i] = count;
}
for (int i = 0; i < N; i++) {
cout << R[l[i] - 1] + L[r[i] - 1] - L[N - 1] << endl;
}
}
| #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')
count++;
if (S[i] == 'A')
A = 1;
else
A = 0;
L[i] = count;
}
count = 0;
A = 0;
for (int i = N - 1; i >= 0; i--) {
if (A == 1 && S[i] == 'A')
count++;
if (S[i] == 'C')
A = 1;
else
A = 0;
R[i] = count;
}
for (int i = 0; i < Q; i++) {
cout << L[r[i] - 1] - L[l[i] - 1] << endl;
}
}
| 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(r - 1) - t.at(l - 1) << endl;
}
} | #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.at(r - 1) - t.at(l - 1) << endl;
}
} | 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_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
std::cout.unsetf(
std::ios::floatfield); // this and next line for floating precision upto 6
std::cout.precision(10);
ll a, b, c, d, x, i, j, n, t, m, k, y;
double p, q, r, w, u;
string str = "", str1 = "";
ll a1, a2, b1, b2;
char ch;
cin >> n >> t;
cin >> str;
vll v;
for (i = 0; i < n; i = i + 1) {
if (str[i] == 'A' && str[i + 1] == 'C') {
v.pb(i + 1);
i++;
}
}
while (t--) {
cin >> a >> b;
vll::iterator it = lower_bound(all(v), a);
vll::iterator itr = lower_bound(all(v), b);
if (*it >= b) {
cout << "0\n";
continue;
}
if (*itr == b) {
cout << itr - it << "\n";
} else {
itr--;
cout << itr - it + 1 << "\n";
}
}
} | #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_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
std::cout.unsetf(
std::ios::floatfield); // this and next line for floating precision upto 6
std::cout.precision(10);
ll a, b, c, d, x, i, j, n, t, m, k, y;
double p, q, r, w, u;
string str = "", str1 = "";
ll a1, a2, b1, b2;
char ch;
cin >> n >> t;
cin >> str;
vll v;
for (i = 0; i < n; i = i + 1) {
if (str[i] == 'A' && str[i + 1] == 'C') {
v.pb(i + 1);
i++;
}
}
while (t--) {
cin >> a >> b;
vll::iterator it = lower_bound(all(v), a);
vll::iterator itr = lower_bound(all(v), b);
if (it == v.end()) {
cout << "0\n";
continue;
}
if (*it >= b || it >= itr) {
cout << "0\n";
continue;
}
if (*itr == b) {
cout << itr - it << "\n";
} else {
itr--;
cout << itr - it + 1 << "\n";
}
}
} | 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 >> len[i].first >> len[i].second;
}
for (int i = 1; i <= 100010; i++) {
if (s[i - 1] == 'A' and s[i] == 'C')
x[i] = 1 + x[i - 1];
else
x[i] += x[i - 1];
}
for (int i = 0; i < q; i++) {
cout << x[len[i].second - 1] - x[len[i].first - 1] << endl;
}
}
| #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 >> len[i].first >> len[i].second;
}
for (int i = 1; i <= s.size(); i++) {
if (s[i - 1] == 'A' and s[i] == 'C')
x[i] = 1 + x[i - 1];
else
x[i] += x[i - 1];
}
for (int i = 0; i < q; i++) {
cout << x[len[i].second - 1] - x[len[i].first - 1] << endl;
}
}
| 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 dp[k] = 0;
if (dp[k] != -1)
return dp[k];
if (s[k] == 'C' && s[k - 1] == 'A')
return dp[k] = cnt(k - 1) + 1;
else
return cnt(k - 1);
}
int main() {
int n, q, l, r;
cin >> n >> q >> s;
for (int i = 0; i < n; i++) {
dp[i] = -1;
}
for (int i = 0; i < q; i++) {
cin >> l >> r;
cout << cnt(r - 1) - cnt(l - 1) << endl;
}
} | #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 dp[k] = 0;
if (dp[k] != -1)
return dp[k];
if (s[k] == 'C' && s[k - 1] == 'A')
return dp[k] = cnt(k - 1) + 1;
else
return dp[k] = cnt(k - 1);
}
int main() {
int n, q, l, r;
cin >> n >> q >> s;
for (int i = 0; i < n; i++) {
dp[i] = -1;
}
for (int i = 0; i < q; i++) {
cin >> l >> r;
cout << cnt(r - 1) - cnt(l - 1) << endl;
}
} | 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;
cin >> n >> q >> s;
vector<int> cum(n + 1, 0);
for (int i = 0; i < n + 1; i++) {
if (s.substr(i, 2) == "AC" && i < n - 1) {
cum[i + 2] = cum[i + 1] + 1;
} else {
cum[i + 2] = cum[i + 1];
}
}
for (int i = 0; i < q; i++) {
int l, r;
cin >> l >> r;
cout << cum[r] - cum[l] << '\n';
}
return 0;
}
| #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;
cin >> n >> q >> s;
vector<int> cum(n + 1, 0);
for (int i = 0; i < n - 1; i++) {
if (s.substr(i, 2) == "AC" && i < n - 1) {
cum[i + 2] = cum[i + 1] + 1;
} else {
cum[i + 2] = cum[i + 1];
}
}
for (int i = 0; i < q; i++) {
int l, r;
cin >> l >> r;
cout << cum[r] - cum[l] << '\n';
}
return 0;
}
| 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')
ans.at(i + 1) = ans.at(i) + 1;
else
ans.at(i + 1) = ans.at(i);
}
for (int i = 0; i < Q; i++) {
cout << ans.at(r.at(i) - 1) - ans.at(l.at(i) - 1) << endl;
}
} | #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 + 1) == 'C')
ans.at(i + 1) = ans.at(i) + 1;
else
ans.at(i + 1) = ans.at(i);
}
for (int i = 0; i < Q; i++) {
cout << ans.at(r.at(i) - 1) - ans.at(l.at(i) - 1) << endl;
}
} | 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 namespace std;
using ull = unsigned long long;
using ll = long long;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
#define EPS (1e-7)
#define ALL(x) begin(x), end(x)
int countAC(const string &s) {
const std::string find_word("AC");
std::string::size_type pos = s.find(find_word);
int count = 0;
while (pos != std::string::npos) {
count++;
pos = s.find(find_word, pos + find_word.length());
}
return count;
}
int main() {
ll N, Q;
cin >> N >> Q;
string S;
cin >> S;
vector<pair<ll, ll>> LRs(Q);
for (size_t i = 0; i < Q; i++) {
cin >> LRs[i].first >> LRs[i].second;
}
// 最初に全部見つけておく。
vector<ll> ACpos(N, 0);
for (size_t i = 0; i < N - 1; i++) {
if (S[i] == 'A' && S[i + 1] == 'C') {
ACpos[i] = 1;
}
}
for_each(ALL(LRs), [S, ACpos](auto lr) {
int ans = 0;
for (size_t i = lr.first - 1; i < lr.second - 1; i++) {
if (ACpos[i] == 1)
ans++;
}
cout << ans << endl;
});
return 0;
}
| #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 namespace std;
using ull = unsigned long long;
using ll = long long;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
#define EPS (1e-7)
#define ALL(x) begin(x), end(x)
int countAC(const string &s) {
const std::string find_word("AC");
std::string::size_type pos = s.find(find_word);
int count = 0;
while (pos != std::string::npos) {
count++;
pos = s.find(find_word, pos + find_word.length());
}
return count;
}
int main() {
ll N, Q;
cin >> N >> Q;
string S;
cin >> S;
vector<pair<ll, ll>> LRs(Q);
for (size_t i = 0; i < Q; i++) {
cin >> LRs[i].first >> LRs[i].second;
}
// 最初に全部見つけておく。
vector<ll> ACpos(N, 0);
for (size_t i = 0; i < N - 1; i++) {
if (S[i] == 'A' && S[i + 1] == 'C') {
ACpos[i] = 1;
}
}
// そして累積和を作る
vector<ll> Sums(N + 1);
for (size_t i = 0; i < N; i++) {
Sums[i + 1] = Sums[i] + ACpos[i];
}
// 累積和を使って回答する
for_each(ALL(LRs), [S, Sums](auto lr) {
const ll ans = Sums[lr.second - 1] - Sums[lr.first - 1];
cout << ans << endl;
});
return 0;
}
| 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 (int64_t i = 0; i < Q; ++i) {
int64_t a, b;
std::cin >> a >> b;
q_list.at(i) = std::make_pair(a, b);
}
std::vector<int64_t> thousand_list(10 ^ 6 / 1000);
for (int64_t i = 0; i < s.size() - 1; ++i) {
if (s.at(i) == 'A' && s.at(i + 1) == 'C')
thousand_list.at(i / 1000)++;
}
auto Count = [&](int64_t l, int64_t r) {
int64_t count = 0;
for (int64_t i = l; i < r; ++i) {
if (s.at(i) == 'A' && s.at(i + 1) == 'C')
count++;
}
return count;
};
for (auto &q : q_list) {
int64_t count = 0;
int64_t start = q.first - 1;
int64_t end = q.second - 1;
int64_t start_index = start / 1000;
int64_t end_index = end / 1000;
if (end_index - start_index >= 2) {
for (int64_t i = start_index + 1; i < end_index; ++i) {
count += thousand_list.at(i);
}
count += Count(start, start + 1000 - (start % 1000));
count += Count(end - (end % 1000), end);
} else {
count = Count(start, end);
}
std::cout << count << std::endl;
}
return 0;
} | #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 (int64_t i = 0; i < Q; ++i) {
int64_t a, b;
std::cin >> a >> b;
q_list.at(i) = std::make_pair(a, b);
}
std::vector<int64_t> thousand_list(1000000 / 1000);
for (int64_t i = 0; i < s.size() - 1; ++i) {
if (s.at(i) == 'A' && s.at(i + 1) == 'C')
thousand_list.at(i / 1000)++;
}
auto Count = [&](int64_t l, int64_t r) {
int64_t count = 0;
for (int64_t i = l; i < r; ++i) {
if (s.at(i) == 'A' && s.at(i + 1) == 'C')
count++;
}
return count;
};
for (auto &q : q_list) {
int64_t count = 0;
int64_t start = q.first - 1;
int64_t end = q.second - 1;
int64_t start_index = start / 1000;
int64_t end_index = end / 1000;
if (end_index - start_index >= 2) {
for (int64_t i = start_index + 1; i < end_index; ++i) {
count += thousand_list.at(i);
}
count += Count(start, start + 1000 - (start % 1000));
count += Count(end - (end % 1000), end);
} else {
count = Count(start, end);
}
std::cout << count << std::endl;
}
return 0;
}
| 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++) {
if (s[i] == 'A' && s[i + 1] == 'C') {
pos_ac.push_back(i + n);
}
}
for (int i = 0; i < q; i++) {
int l, r;
std::cin >> l >> r;
l--;
r--;
int count = 0;
auto pos = *lower_bound(pos_ac.begin(), pos_ac.end(), l) + 1;
for (auto pos = *lower_bound(pos_ac.begin(), pos_ac.end(), l) + 1; pos <= r;
pos = *lower_bound(pos_ac.begin(), pos_ac.end(), pos) + 1) {
count++;
}
std::cout << count << std::endl;
}
}
| #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++) {
if (s[i] == 'A' && s[i + 1] == 'C') {
pos_ac.push_back(i + n);
}
}
for (int i = 0; i < q; i++) {
int l, r;
std::cin >> l >> r;
l--;
r--;
auto l_itr = lower_bound(pos_ac.begin(), pos_ac.end(), l);
auto r_itr = lower_bound(pos_ac.begin(), pos_ac.end(), r);
int count = r_itr - l_itr;
std::cout << count << std::endl;
}
}
| 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;
}
for (int i = 0; i < n - 1; i++) {
if (s[i].first == 'A') {
if (s[i + 1].first == 'C') {
s[i + 1].second = s[i].second + 1;
} else
s[i + 1].second = s[i].second;
} else
s[i + 1].second = s[i].second;
}
for (int i = 0; i < q; i++) {
int x = s[r[i] - 1].second - s[l[i] - 1].second;
cout << x << endl;
}
}
| #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;
r[i] = y;
}
for (int i = 0; i < n - 1; i++) {
if (s[i].first == 'A') {
if (s[i + 1].first == 'C') {
s[i + 1].second = s[i].second + 1;
} else
s[i + 1].second = s[i].second;
} else
s[i + 1].second = s[i].second;
}
for (int i = 0; i < q; i++) {
int x = s[r[i] - 1].second - s[l[i] - 1].second;
cout << x << endl;
}
}
| 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 >> l >> r;
l--;
r--;
int ans = 0;
for (int i = l; i < r; i++) {
if (s[i] == 'A' && s[i + 1] == 'C')
ans++;
}
cout << ans << endl;
}
return 0;
} | #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> l(q), r(q);
rep(i, q) cin >> l[i] >> r[i];
sum[0] = 0;
for (int i = 1; i < s.size(); i++) {
if (s[i - 1] == 'A' && s[i] == 'C')
sum[i + 1] = sum[i] + 1;
else
sum[i + 1] = sum[i];
}
for (int i = 0; i < q; i++) {
int ans = sum[r[i]] - sum[l[i]];
cout << ans << endl;
}
return 0;
} | 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; j < Q; j++) {
scanf("%d%d", &l, &r);
cout << Z[r - 1] - Z[l - 1] << endl;
}
} | #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; j < Q; j++) {
scanf("%d%d", &l, &r);
cout << Z[r - 1] - Z[l - 1] << endl;
}
} | 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.at(i) = sum;
}
rep(i, Q) {
cin >> l >> r;
if (l == 1) {
if (r == 1)
cout << 0 << endl;
else
cout << vec.at(r - 2) << endl;
} else
cout << vec.at(r - 2) - vec.at(l - 2) << endl;
}
} | #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;
vec.at(i) = sum;
}
rep(i, Q) {
cin >> l >> r;
if (l == 1) {
if (r == 1)
cout << 0 << endl;
else
cout << vec.at(r - 2) << endl;
} else
cout << vec.at(r - 2) - vec.at(l - 2) << endl;
}
} | 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);
}
}
int ans;
for (int i = 0; i < Q; i++) {
int l, r;
cin >> l >> r;
if (S.at(l - 1) == 'C' && S.at(l - 2) == 'A') {
ans = AC.at(r) - AC.at(l - 1) - 1;
} else {
ans = AC.at(r) - AC.at(l - 1);
}
cout << ans << endl;
}
}
| #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);
}
}
int ans;
for (int i = 0; i < Q; i++) {
int l, r;
cin >> l >> r;
if (l > 1 && S.at(l - 1) == 'C' && S.at(l - 2) == 'A') {
ans = AC.at(r) - AC.at(l - 1) - 1;
} else {
ans = AC.at(r) - AC.at(l - 1);
}
cout << ans << endl;
}
}
| 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 << a[e - 1] - a[st - 1] << endl;
}
return 0;
}
| #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 << a[e - 1] - a[st - 1] << endl;
}
return 0;
} | 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++;
}
count_l[i + j] = sum;
}
}
for (int q = 0; q < Q; q++) {
int l, r;
cin >> l >> r;
cout << count_l[r - 1] - count_l[l - 1] << endl;
}
}
| #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++;
}
count_l[i + j] = sum;
}
}
for (int q = 0; q < Q; q++) {
int l, r;
cin >> l >> r;
cout << count_l[r - 1] - count_l[l - 1] << endl;
}
}
| 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) {
if (i == n - 1) {
a.at(i) = counts;
break;
}
if (s.at(i) == 'A' && s.at(i + 1) == 'C') {
a.at(i) = counts;
counts++;
a.at(i + 1) = counts;
} else {
a.at(i) = counts;
}
}
for (int i = 0; i < q; ++i) {
ans.at(i) = a.at(r.at(i) - 1) - a.at(l.at(i) - 1);
}
for (int i = 0; i < q; ++i)
cout << ans.at(i) << endl;
} | #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) {
if (i == n - 1) {
a.at(i) = counts;
break;
}
if (s.at(i) == 'A' && s.at(i + 1) == 'C') {
a.at(i) = counts;
counts++;
a.at(i + 1) = counts;
} else {
a.at(i) = counts;
}
}
for (int i = 0; i < q; ++i) {
ans.at(i) = a.at(r.at(i) - 1) - a.at(l.at(i) - 1);
}
for (int i = 0; i < q; ++i)
cout << ans.at(i) << endl;
} | 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++;
}
apper.push_back(ans);
// cout << apper.at(i+1)<<endl;
}
int st, fin;
for (int i = 0; i < q; i++) {
cin >> st >> fin;
cout << apper.at(fin - 1) - apper.at(st - 1) << endl;
}
}
| #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++;
}
apper.push_back(ans);
// cout << apper.at(i+1)<<endl;
}
int st, fin;
for (int i = 0; i < q; i++) {
cin >> st >> fin;
cout << apper.at(fin - 1) - apper.at(st - 1) << endl;
}
}
| 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;
cin >> l >> r;
lr[i] = ac[r - 1] - ac[l - 1];
}
for (size_t i = 0; i < q; i++) {
cout << lr[i] << endl;
}
} | #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;
cin >> l >> r;
lr[i] = ac[r - 1] - ac[l - 1];
}
for (size_t i = 0; i < q; i++) {
cout << lr[i] << endl;
}
} | 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 >> n >> q;
string s;
int a[n];
int c = 0;
a[0] = 0;
fr(i, n - 1) {
if (s.substr(i, 2) == "AC") {
c++;
}
a[i + 1] = c;
}
fr(i, q) {
cin >> l >> r;
cout << a[r - 1] - a[l - 1] << endl;
}
}
| #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 >> n >> q;
string s;
int a[n];
int c = 0;
a[0] = 0;
cin >> s;
fr(i, n - 1) {
if (s.substr(i, 2) == "AC") {
c++;
}
a[i + 1] = c;
}
fr(i, q) {
cin >> l >> r;
cout << a[r - 1] - a[l - 1] << endl;
}
}
| 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") {
V.push_back(i);
}
}
for (int i = 0; i < Q; ++i) {
int l, r;
cin >> l >> r;
--l;
--r;
auto low = lower_bound(V.begin(), V.end(), l);
auto up = lower_bound(V.begin(), V.end(), r);
R[i] = (int)(up - (*up != r) - V.begin()) -
(int)(low + (*low != l) - V.begin()) + 1;
}
for (int i = 0; i < Q; ++i) {
printf("%d\n", R[i]);
}
} | #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") {
V.push_back(i);
}
}
for (int i = 0; i < Q; ++i) {
int l, r;
cin >> l >> r;
if (V.size() > 0) {
--l;
--r;
auto low = lower_bound(V.begin(), V.end(), l);
auto up = upper_bound(V.begin(), V.end(), r - 1) - 1;
R[i] = (int)(up - V.begin()) - (int)(low - V.begin()) + 1;
} else {
R[i] = 0;
}
}
for (int i = 0; i < Q; ++i) {
printf("%d\n", R[i]);
}
} | 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).end()
#define asn ans
using namespace std;
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
using ll = long long;
int main() {
int n, q;
CI n >> q;
string s;
CI s;
int ans[20000] = {};
for (int i = 0; i < n; i++) {
if (s[i] == 'A' and s[i + 1] == 'C') {
ans[i + 1] = ans[i] + 1;
} else {
ans[i + 1] = ans[i];
}
}
vector<pair<int, int>> a(q);
REP(i, q) { CI a[i].first >> a[i].second; }
REP(i, q) { CO ans[a[i].second - 1] - ans[a[i].first - 1] EN; }
} | #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).end()
#define asn ans
using namespace std;
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
using ll = long long;
int main() {
int n, q;
CI n >> q;
string s;
CI s;
int ans[200000] = {};
for (int i = 0; i < n; i++) {
if (s[i] == 'A' and s[i + 1] == 'C') {
ans[i + 1] = ans[i] + 1;
} else {
ans[i + 1] = ans[i];
}
}
vector<pair<int, int>> a(q);
REP(i, q) { CI a[i].first >> a[i].second; }
REP(i, q) { CO ans[a[i].second - 1] - ans[a[i].first - 1] EN; }
} | 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]++;
}
}
vector<int> l(q), r(q);
rep(i, q) cin >> l[i] >> r[i];
rep(i, q) {
l[i]--;
r[i]--;
cout << a[r[i]] - a[l[i]] << endl;
}
} | #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[i - 1];
}
vector<int> l(q), r(q);
rep(i, q) cin >> l[i] >> r[i];
rep(i, q) {
l[i]--;
r[i]--;
cout << a[r[i]] - a[l[i]] << endl;
}
} | 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;
for (int i = 0; i < N; ++i)
if (S[i] == 'A' && S[i + 1] == 'C')
list.push_back(i);
list.push_back(10e8);
int i, j, k;
for (i = 0; i < Q; ++i) {
for (j = 0; j < list.size() + 1; ++j) {
if (l[i] <= list[j])
break;
}
for (k = j; k < list.size() + 1; ++k)
if (r[i] <= list[k])
break;
cout << k - j << endl;
}
} | #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;
for (int i = 0; i < N; ++i)
if (S[i] == 'A' && S[i + 1] == 'C')
list.push_back(i);
list.push_back(10e8);
int i, j, k;
for (i = 0; i < Q; ++i) {
cout << lower_bound(list.begin(), list.end(), r[i]) -
lower_bound(list.begin(), list.end(), l[i])
<< endl;
}
} | 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>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 1000000007;
typedef long double ld;
const ll INF = 1e+14;
typedef pair<int, int> P;
#define stop \
char nyaa; \
cin >> nyaa;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define per1(i, n) for (int i = n; i >= 1; i--)
#define Rep1(i, sta, n) for (int i = sta; i <= n; i++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(), c.end()
#define pb push_back
void Yes() {
cout << "Yes" << endl;
exit(0);
}
void No() {
cout << "No" << endl;
exit(0);
}
int main() {
ll N;
cin >> N;
ll Q;
cin >> Q;
string S;
cin >> S;
ll L[Q];
ll R[Q];
rep(i, Q) {
ll a, b;
cin >> a >> b;
L[i] = a;
R[i] = b;
}
vector<ll> A;
rep(i, N - 1) {
if (S[i] == 'A' && S[i + 1] == 'C')
A.push_back(i);
else
continue;
}
ll count = 0;
ll count1 = 0;
ll B[N];
rep(i, N) { B[i] = 0; }
rep(i, N) {
B[i] = count;
if (A[count1] == i) {
count++;
count1++;
}
}
rep(i, Q) {
ll a = L[i] - 1;
ll b = R[i] - 1;
ll ans = B[b] - B[a];
cout << ans << endl;
}
}
| #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>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 1000000007;
typedef long double ld;
const ll INF = 1e+14;
typedef pair<int, int> P;
#define stop \
char nyaa; \
cin >> nyaa;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define per1(i, n) for (int i = n; i >= 1; i--)
#define Rep1(i, sta, n) for (int i = sta; i <= n; i++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(), c.end()
#define pb push_back
void Yes() {
cout << "Yes" << endl;
exit(0);
}
void No() {
cout << "No" << endl;
exit(0);
}
int main() {
ll N;
cin >> N;
ll Q;
cin >> Q;
string S;
cin >> S;
ll L[Q];
ll R[Q];
rep(i, Q) {
ll a, b;
cin >> a >> b;
L[i] = a;
R[i] = b;
}
vector<ll> A;
rep(i, N - 1) {
if (S[i] == 'A' && S[i + 1] == 'C')
A.push_back(i);
else
continue;
}
ll count = 0;
ll count1 = 0;
ll B[N];
rep(i, N) { B[i] = 0; }
rep(i, N) {
if (A.empty())
break;
B[i] = count;
if (A[count1] == i) {
count++;
count1++;
}
}
rep(i, Q) {
ll a = L[i] - 1;
ll b = R[i] - 1;
ll ans = B[b] - B[a];
cout << ans << endl;
}
}
| 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) {
int l, r;
cin >> l >> r;
l--;
r--;
cout << t[r] - t[l] << endl;
}
}
return 0;
} | #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) {
int l, r;
cin >> l >> r;
l--;
r--;
cout << t[r] - t[l] << endl;
}
return 0;
} | 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;
for (int i = 0; i < N - 1; i++) {
first = S[i];
second = S[i + 1];
if (S[i] == 'A' && S[i + 1] == 'C') {
start.push_back(i);
}
}
for (int i = 0; i < Q; i++) {
int count = 0;
for (int j = 0; j < start.size(); j++) {
if (start[j] + 1 >= num[i].first && start[j] + 1 < num[i].second)
count++;
}
cout << count << endl;
}
return 0;
} | #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;
for (int i = 0; i < N - 1; i++) {
first = S[i];
second = S[i + 1];
if (S[i] == 'A' && S[i + 1] == 'C') {
start.push_back(i);
}
}
for (int i = 0; i < Q; i++) {
int count = 0;
vector<int>::iterator first_itr =
lower_bound(start.begin(), start.end(), num[i].first - 1);
vector<int>::iterator last_itr =
lower_bound(start.begin(), start.end(), num[i].second - 1);
count = distance(first_itr, last_itr);
cout << count << endl;
}
return 0;
} | 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 (int i = 1; i < n; i++) {
if (s[i] == 'C' && s[i - 1] == 'A')
v[i] = v[i - 1] + 1;
else
v[i] = v[i - 1];
}
int id = 0;
for (int j = 0; j < q; j++) {
int l, r;
cin >> l >> r;
ans[id] = v[r - 1] - v[l - 1];
id++;
}
// for (int h=0;h <= n;h++) cout << v[h];
// cout << endl;
for (int i = 0; i < q; i++) {
cout << ans[i] << endl;
}
return 0;
}
| #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;
for (int i = 1; i < n; i++) {
if (s[i] == 'C' && s[i - 1] == 'A')
v[i] = v[i - 1] + 1;
else
v[i] = v[i - 1];
}
int id = 0;
for (int j = 0; j < q; j++) {
int l, r;
cin >> l >> r;
ans[id] = v[r - 1] - v[l - 1];
id++;
}
// for (int h=0;h <= n;h++) cout << v[h];
// cout << endl;
for (int i = 0; i < q; i++) {
cout << ans[i] << endl;
}
return 0;
}
| 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 second
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<int> l(q);
vector<int> r(q);
REP(i, q) {
cin >> l[i] >> r[i];
l[i]--;
r[i]--;
}
vector<int> ac;
REP(i, n - 1) {
if (s[i] == 'A' && s[i + 1] == 'C') {
ac.push_back(i);
i++;
}
}
if (ac.size() == 0) {
REP(i, q) { cout << endl; }
}
REP(i, q) {
int ans = 0;
auto itr1 = lower_bound(ALL(ac), l[i]);
auto itr2 = lower_bound(ALL(ac), r[i]);
if (*(itr2 - 1) < r[i]) {
ans = distance(itr1, itr2 - 1) + 1;
} else {
ans = distance(itr1, itr2 - 2) + 1;
}
cout << ans << endl;
}
return 0;
}
| #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 second
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<int> l(q);
vector<int> r(q);
REP(i, q) {
cin >> l[i] >> r[i];
l[i]--;
r[i]--;
}
vector<int> ac;
REP(i, n - 1) {
if (s[i] == 'A' && s[i + 1] == 'C') {
ac.push_back(i);
i++;
}
}
if (ac.size() == 0) {
REP(i, q) { cout << 0 << endl; }
return 0;
}
REP(i, q) {
int ans = 0;
auto itr1 = lower_bound(ALL(ac), l[i]);
auto itr2 = lower_bound(ALL(ac), r[i]);
if (*(itr2 - 1) < r[i]) {
ans = distance(itr1, itr2 - 1) + 1;
} else {
ans = distance(itr1, itr2 - 2) + 1;
}
cout << ans << endl;
}
return 0;
}
| 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<int> l(q), r(q);
rep(i, q) cin >> l[i] >> r[i];
vector<int> a(n + 1);
a[0] = 0;
a[1] = 0;
for (int i = 1; i < n; i++) {
if (s[i - 1] == 'A' && s[i] == 'C')
a[i + 1] = a[i] + 1;
else
a[i + 1] = a[i];
}
rep(i, q) {
int ansi = a[r[i]] - a[l[i] - 1];
if (l[i] > 1 && s[l[i] - 1] == 'C' && s[l[i - 2]] == 'A')
ansi--;
cout << ansi << endl;
}
} | #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<int> l(q), r(q);
rep(i, q) cin >> l[i] >> r[i];
vector<int> a(n + 1);
a[0] = 0;
a[1] = 0;
for (int i = 1; i < n; i++) {
if (s[i - 1] == 'A' && s[i] == 'C')
a[i + 1] = a[i] + 1;
else
a[i + 1] = a[i];
}
rep(i, q) {
int ansi = a[r[i]] - a[l[i] - 1];
if (l[i] > 1 && s[l[i] - 1] == 'C' && s[l[i] - 2] == 'A')
ansi--;
cout << ansi << endl;
}
}
| 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<int> dp(N);
dp.at(0) = 0;
int cnt = 0;
for (int i = 0; i < N; i++) {
dp.at(i) = cnt;
if (S.at(i) == 'A' && S.at(i + 1) == 'C') {
cnt++;
}
}
for (int i = 0; i < Q; i++) {
int x, y;
cin >> x >> y;
x--;
y--;
cout << dp.at(y) - dp.at(x) << endl;
}
} | #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<int> dp(N);
dp.at(0) = 0;
int cnt = 0;
for (int i = 0; i < N; i++) {
dp.at(i) = cnt;
if (S.at(i) == 'A' && i + 1 < N && S.at(i + 1) == 'C') {
cnt++;
}
}
for (int i = 0; i < Q; i++) {
int x, y;
cin >> x >> y;
x--;
y--;
cout << dp.at(y) - dp.at(x) << endl;
}
}
| 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(i) = ACcount;
}
}
for (int i = 0; i < Q; i++) {
int l, r;
int count = 0;
cin >> l >> r;
count = vec.at(r - 1) - vec.at(l - 1);
cout << count << endl;
}
} | #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 {
vec.at(i) = ACcount;
}
}
for (int i = 0; i < Q; i++) {
int l, r;
int count = 0;
cin >> l >> r;
count = vec.at(r - 1) - vec.at(l - 1);
cout << count << endl;
}
}
| 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] == 'A' and s[i] == 'C') {
sum[i + 1] = sum[i] + 1;
} else {
sum[i + 1] = sum[i];
}
}
for (int i = 0; i < n; i++) {
cout << sum[r[i]] - sum[l[i]] << endl;
}
return 0;
} | #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] == 'A' and s[i] == 'C') {
sum[i + 1] = sum[i] + 1;
} else {
sum[i + 1] = sum[i];
}
}
for (int i = 0; i < q; i++) {
cout << sum[r[i]] - sum[l[i]] << endl;
}
return 0;
} | 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;
cin >> l >> r;
cout << a[r - 1] - a[l - 1] << endl;
}
return 0;
} | #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;
cin >> l >> r;
cout << a[r - 1] - a[l - 1] << endl;
}
return 0;
} | 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 + 1] = s[i];
}
// クエリ
for (int q = 0; q < Q; ++Q) {
int l, r;
cin >> l >> r;
--l, --r; // 0-indexed にする
cout << s[r] - s[l] << endl;
}
}
| #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 + 1] = s[i];
}
// クエリ
for (int q = 0; q < Q; ++q) {
int l, r;
cin >> l >> r;
--l, --r; // 0-indexed にする
cout << s[r] - s[l] << endl;
}
}
| 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 = int64_t;
using DWORD = uint32_t;
using SDWORD = int32_t;
using WORD = uint16_t;
using SWORD = int16_t;
using BYTE = uint8_t;
using SBYTE = int8_t;
using DOUBLE = double;
using FLOAT = float;
#define MIN_SDWORD (-2147483648)
#define MAX_SDWORD (2147483647)
#define MIN_SBYTE (-128)
#define MAX_SBYTE (127)
#define MIN_SQWORD (0x8000000000000000)
#define MAX_SQWORD (0x7FFFFFFFFFFFFFFF)
#define MAX_QWORD (0xFFFFFFFFFFFFFFFF)
#define MAX_DWORD (0xFFFFFFFF)
#define MAX_WORD (0xFFFF)
#define MAX_BYTE (0xFF)
#define ArrayLength(a) (sizeof(a) / sizeof(a[0]))
static inline QWORD MAX(QWORD a, QWORD b) { return a > b ? a : b; }
static inline DWORD MAX(DWORD a, DWORD b) { return a > b ? a : b; }
static inline SDWORD MAX(SDWORD a, SDWORD b) { return a > b ? a : b; }
static inline QWORD MIN(QWORD a, QWORD b) { return a < b ? a : b; }
static inline DWORD MIN(DWORD a, DWORD b) { return a < b ? a : b; }
static inline SDWORD MIN(SDWORD a, SDWORD b) { return a < b ? a : b; }
#define BYTE_BITS (8)
#define WORD_BITS (16)
#define DWORD_BITS (32)
#define QWORD_BITS (64)
using M_BOOL = bool;
#define M_TRUE (true)
#define M_FALSE (false)
#define DIVISOR (1000000007)
static inline void inputString(char *pcStr) {
char *pcCur = pcStr;
for (;;) {
char c = getchar();
if (('\n' == c) || (EOF == c)) {
break;
}
*pcCur = c;
pcCur++;
}
*pcCur = '\0';
}
static inline SQWORD inputSQWORD(void) {
SQWORD sqNumber = 0;
SQWORD sqMultiplier = 1;
M_BOOL bRead = M_FALSE;
for (;;) {
char c = getchar();
if (!bRead) {
if ('-' == c) {
sqMultiplier = -1;
}
}
if (('0' <= c) && (c <= '9')) {
sqNumber *= 10LL;
sqNumber += (SQWORD)(c - '0');
bRead = M_TRUE;
} else {
if (bRead) {
return sqNumber * sqMultiplier;
}
}
}
}
static inline SDWORD inputSDWORD(void) {
SDWORD lNumber = 0;
SDWORD lMultiplier = 1;
M_BOOL bRead = M_FALSE;
for (;;) {
char c = getchar();
if (!bRead) {
if ('-' == c) {
lMultiplier = -1;
}
}
if (('0' <= c) && (c <= '9')) {
lNumber *= 10;
lNumber += (c - '0');
bRead = M_TRUE;
} else {
if (bRead) {
return lNumber * lMultiplier;
}
}
}
}
static inline DOUBLE inputFP(void) {
DOUBLE dInt = 0.0;
DOUBLE dFrac = 0.0;
DOUBLE dMultiplier = 1.0;
DWORD dwFpCnt = 0;
DOUBLE *pdCur = &dInt;
M_BOOL bRead = M_FALSE;
for (;;) {
char c = getchar();
if (!bRead) {
if ('-' == c) {
dMultiplier = -1;
}
}
if ('.' == c) {
pdCur = &dFrac;
} else if (('0' <= c) && (c <= '9')) {
(*pdCur) *= 10;
(*pdCur) += (DOUBLE)(c - '0');
bRead = M_TRUE;
if (pdCur == &dFrac) {
dwFpCnt++;
}
} else {
if (bRead) {
return dMultiplier *
(dInt + dFrac / (pow((DOUBLE)10.0, (DOUBLE)dwFpCnt)));
}
}
}
}
static SQWORD calcZeroToNumXor(SQWORD sqNum) {
SQWORD sqRet = 0;
for (DWORD dwBit = 1; dwBit < 64; dwBit++) {
SQWORD sqMask = 0x1LL << dwBit;
if (sqMask & sqNum) {
if (0 == (sqNum & 0x1)) {
sqRet |= sqMask;
}
}
}
/* lowest bit */
if ((sqNum % 4 == 1) || (sqNum % 4 == 2)) {
sqRet |= 1;
}
return sqRet;
}
static BYTE getCharFromKey(BYTE byKey) {
BYTE byChar = '0';
switch (byKey) {
case 1:
byChar = 'A';
break;
case 2:
byChar = 'G';
break;
case 3:
byChar = 'C';
break;
case 4:
byChar = 'T';
break;
default:
break;
}
return byChar;
}
static BYTE getKeyFromChar(BYTE byChar) {
BYTE byKey = 0;
switch (byChar) {
case 'A':
byKey = 1;
break;
case 'G':
byKey = 2;
break;
case 'C':
byKey = 3;
break;
case 'T':
byKey = 4;
break;
default:
break;
}
return byKey;
}
/**
* LAST3 [0x00, b[-3], b[-2], b[-1]]
*/
static bool isSequenceOK(DWORD dwLast3, BYTE byNext) {
BYTE byKey_3 = (dwLast3 & 0x00000F00) >> 8;
BYTE byKey_2 = (dwLast3 & 0x000000F0) >> 4;
BYTE byKey_1 = (dwLast3 & 0x0000000F);
BYTE byC_3 = getCharFromKey(byKey_3);
BYTE byC_2 = getCharFromKey(byKey_2);
BYTE byC_1 = getCharFromKey(byKey_1);
/* ?AGC */
if (('A' == byC_2) && ('G' == byC_1) && ('C' == byNext)) {
return false;
}
/* ?ACG */
if (('A' == byC_2) && ('C' == byC_1) && ('G' == byNext)) {
return false;
}
/* ?GAC */
if (('G' == byC_2) && ('A' == byC_1) && ('C' == byNext)) {
return false;
}
/* A?GC */
if (('A' == byC_3) && ('G' == byC_1) && ('C' == byNext)) {
return false;
}
/* AG?C */
if (('A' == byC_3) && ('G' == byC_2) && ('C' == byNext)) {
return false;
}
return true;
}
static SQWORD s_aasqDpTbl[101][0xFFF];
#define ANS_MOD (1000000007)
/**
* @brief 次のカウントを得る。
*/
static DWORD getNextDp(DWORD dwNextLast3, SQWORD *psqPrevDpTbl,
SQWORD *psqNextDpTbl) {
DWORD dwPrevLast3;
BYTE byNext = getCharFromKey(dwNextLast3 & 0x0000000F);
SQWORD sqNextDp = 0;
for (DWORD dwKey = 0; dwKey <= 4; dwKey++) {
dwPrevLast3 = (((dwNextLast3 & 0x00000FF0) >> 4) | (dwKey << 8));
if (isSequenceOK(dwPrevLast3, byNext)) {
sqNextDp = (sqNextDp + *(psqPrevDpTbl + dwPrevLast3)) % ANS_MOD;
}
}
*(psqNextDpTbl + dwNextLast3) = sqNextDp;
}
int main() {
SQWORD sqInput_N = inputSQWORD();
/**
* dp[i][last3]
* 最後の3文字が last3 で、AGCが現れない文字列の数
* dp[0][*] = 0
* dp[1][*] = 4
* dp[2][*] = 16
* dp[3][*] = 61
*
* dp[j+1][*] = dp[j][]
*/
memset(s_aasqDpTbl, 0, sizeof(s_aasqDpTbl));
/* dp[1] を手動で初期化する */
for (DWORD dwKey_1 = 1; dwKey_1 <= 4; dwKey_1++) {
DWORD dwKey = dwKey_1;
s_aasqDpTbl[1][dwKey] = 1;
}
for (DWORD dwIdx = 1; dwIdx <= sqInput_N; dwIdx++) {
for (DWORD dwKey_3 = 0; dwKey_3 <= 4; dwKey_3++) {
for (DWORD dwKey_2 = 0; dwKey_2 <= 4; dwKey_2++) {
/* 追加する文字は空文字が存在しない */
for (DWORD dwKey_1 = 1; dwKey_1 <= 4; dwKey_1++) {
DWORD dwNextKey = (dwKey_3 << 8) | (dwKey_2 << 4) | (dwKey_1);
getNextDp(dwNextKey, s_aasqDpTbl[dwIdx], s_aasqDpTbl[dwIdx + 1]);
}
}
}
}
SQWORD sqAns = 0;
for (DWORD dwKey_3 = 1; dwKey_3 <= 4; dwKey_3++) {
for (DWORD dwKey_2 = 1; dwKey_2 <= 4; dwKey_2++) {
for (DWORD dwKey_1 = 1; dwKey_1 <= 4; dwKey_1++) {
DWORD dwAllKey = (dwKey_3 << 8) | (dwKey_2 << 4) | (dwKey_1);
sqAns = (sqAns + s_aasqDpTbl[sqInput_N][dwAllKey]) % ANS_MOD;
}
}
}
printf("%lld\n", sqAns);
return 0;
} | #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 = int64_t;
using DWORD = uint32_t;
using SDWORD = int32_t;
using WORD = uint16_t;
using SWORD = int16_t;
using BYTE = uint8_t;
using SBYTE = int8_t;
using DOUBLE = double;
using FLOAT = float;
#define MIN_SDWORD (-2147483648)
#define MAX_SDWORD (2147483647)
#define MIN_SBYTE (-128)
#define MAX_SBYTE (127)
#define MIN_SQWORD (0x8000000000000000)
#define MAX_SQWORD (0x7FFFFFFFFFFFFFFF)
#define MAX_QWORD (0xFFFFFFFFFFFFFFFF)
#define MAX_DWORD (0xFFFFFFFF)
#define MAX_WORD (0xFFFF)
#define MAX_BYTE (0xFF)
#define ArrayLength(a) (sizeof(a) / sizeof(a[0]))
static inline QWORD MAX(QWORD a, QWORD b) { return a > b ? a : b; }
static inline DWORD MAX(DWORD a, DWORD b) { return a > b ? a : b; }
static inline SDWORD MAX(SDWORD a, SDWORD b) { return a > b ? a : b; }
static inline QWORD MIN(QWORD a, QWORD b) { return a < b ? a : b; }
static inline DWORD MIN(DWORD a, DWORD b) { return a < b ? a : b; }
static inline SDWORD MIN(SDWORD a, SDWORD b) { return a < b ? a : b; }
#define BYTE_BITS (8)
#define WORD_BITS (16)
#define DWORD_BITS (32)
#define QWORD_BITS (64)
using M_BOOL = bool;
#define M_TRUE (true)
#define M_FALSE (false)
#define DIVISOR (1000000007)
static inline void inputString(char *pcStr) {
char *pcCur = pcStr;
for (;;) {
char c = getchar();
if (('\n' == c) || (EOF == c)) {
break;
}
*pcCur = c;
pcCur++;
}
*pcCur = '\0';
}
static inline SQWORD inputSQWORD(void) {
SQWORD sqNumber = 0;
SQWORD sqMultiplier = 1;
M_BOOL bRead = M_FALSE;
for (;;) {
char c = getchar();
if (!bRead) {
if ('-' == c) {
sqMultiplier = -1;
}
}
if (('0' <= c) && (c <= '9')) {
sqNumber *= 10LL;
sqNumber += (SQWORD)(c - '0');
bRead = M_TRUE;
} else {
if (bRead) {
return sqNumber * sqMultiplier;
}
}
}
}
static inline SDWORD inputSDWORD(void) {
SDWORD lNumber = 0;
SDWORD lMultiplier = 1;
M_BOOL bRead = M_FALSE;
for (;;) {
char c = getchar();
if (!bRead) {
if ('-' == c) {
lMultiplier = -1;
}
}
if (('0' <= c) && (c <= '9')) {
lNumber *= 10;
lNumber += (c - '0');
bRead = M_TRUE;
} else {
if (bRead) {
return lNumber * lMultiplier;
}
}
}
}
static inline DOUBLE inputFP(void) {
DOUBLE dInt = 0.0;
DOUBLE dFrac = 0.0;
DOUBLE dMultiplier = 1.0;
DWORD dwFpCnt = 0;
DOUBLE *pdCur = &dInt;
M_BOOL bRead = M_FALSE;
for (;;) {
char c = getchar();
if (!bRead) {
if ('-' == c) {
dMultiplier = -1;
}
}
if ('.' == c) {
pdCur = &dFrac;
} else if (('0' <= c) && (c <= '9')) {
(*pdCur) *= 10;
(*pdCur) += (DOUBLE)(c - '0');
bRead = M_TRUE;
if (pdCur == &dFrac) {
dwFpCnt++;
}
} else {
if (bRead) {
return dMultiplier *
(dInt + dFrac / (pow((DOUBLE)10.0, (DOUBLE)dwFpCnt)));
}
}
}
}
static SQWORD calcZeroToNumXor(SQWORD sqNum) {
SQWORD sqRet = 0;
for (DWORD dwBit = 1; dwBit < 64; dwBit++) {
SQWORD sqMask = 0x1LL << dwBit;
if (sqMask & sqNum) {
if (0 == (sqNum & 0x1)) {
sqRet |= sqMask;
}
}
}
/* lowest bit */
if ((sqNum % 4 == 1) || (sqNum % 4 == 2)) {
sqRet |= 1;
}
return sqRet;
}
static BYTE getCharFromKey(BYTE byKey) {
BYTE byChar = '0';
switch (byKey) {
case 1:
byChar = 'A';
break;
case 2:
byChar = 'G';
break;
case 3:
byChar = 'C';
break;
case 4:
byChar = 'T';
break;
default:
break;
}
return byChar;
}
static BYTE getKeyFromChar(BYTE byChar) {
BYTE byKey = 0;
switch (byChar) {
case 'A':
byKey = 1;
break;
case 'G':
byKey = 2;
break;
case 'C':
byKey = 3;
break;
case 'T':
byKey = 4;
break;
default:
break;
}
return byKey;
}
/**
* LAST3 [0x00, b[-3], b[-2], b[-1]]
*/
static bool isSequenceOK(DWORD dwLast3, BYTE byNext) {
BYTE byKey_3 = (dwLast3 & 0x00000F00) >> 8;
BYTE byKey_2 = (dwLast3 & 0x000000F0) >> 4;
BYTE byKey_1 = (dwLast3 & 0x0000000F);
BYTE byC_3 = getCharFromKey(byKey_3);
BYTE byC_2 = getCharFromKey(byKey_2);
BYTE byC_1 = getCharFromKey(byKey_1);
/* ?AGC */
if (('A' == byC_2) && ('G' == byC_1) && ('C' == byNext)) {
return false;
}
/* ?ACG */
if (('A' == byC_2) && ('C' == byC_1) && ('G' == byNext)) {
return false;
}
/* ?GAC */
if (('G' == byC_2) && ('A' == byC_1) && ('C' == byNext)) {
return false;
}
/* A?GC */
if (('A' == byC_3) && ('G' == byC_1) && ('C' == byNext)) {
return false;
}
/* AG?C */
if (('A' == byC_3) && ('G' == byC_2) && ('C' == byNext)) {
return false;
}
return true;
}
static SQWORD s_aasqDpTbl[102][0xFFF];
#define ANS_MOD (1000000007)
/**
* @brief 次のカウントを得る。
*/
static DWORD getNextDp(DWORD dwNextLast3, SQWORD *psqPrevDpTbl,
SQWORD *psqNextDpTbl) {
DWORD dwPrevLast3;
BYTE byNext = getCharFromKey(dwNextLast3 & 0x0000000F);
SQWORD sqNextDp = 0;
for (DWORD dwKey = 0; dwKey <= 4; dwKey++) {
dwPrevLast3 = (((dwNextLast3 & 0x00000FF0) >> 4) | (dwKey << 8));
if (isSequenceOK(dwPrevLast3, byNext)) {
sqNextDp = (sqNextDp + *(psqPrevDpTbl + dwPrevLast3)) % ANS_MOD;
}
}
*(psqNextDpTbl + dwNextLast3) = sqNextDp;
}
int main() {
SQWORD sqInput_N = inputSQWORD();
/**
* dp[i][last3]
* 最後の3文字が last3 で、AGCが現れない文字列の数
* dp[0][*] = 0
* dp[1][*] = 4
* dp[2][*] = 16
* dp[3][*] = 61
*
* dp[j+1][*] = dp[j][]
*/
memset(s_aasqDpTbl, 0, sizeof(s_aasqDpTbl));
/* dp[1] を手動で初期化する */
for (DWORD dwKey_1 = 1; dwKey_1 <= 4; dwKey_1++) {
DWORD dwKey = dwKey_1;
s_aasqDpTbl[1][dwKey] = 1;
}
for (DWORD dwIdx = 1; dwIdx <= sqInput_N; dwIdx++) {
for (DWORD dwKey_3 = 0; dwKey_3 <= 4; dwKey_3++) {
for (DWORD dwKey_2 = 0; dwKey_2 <= 4; dwKey_2++) {
/* 追加する文字は空文字が存在しない */
for (DWORD dwKey_1 = 1; dwKey_1 <= 4; dwKey_1++) {
DWORD dwNextKey = (dwKey_3 << 8) | (dwKey_2 << 4) | (dwKey_1);
getNextDp(dwNextKey, s_aasqDpTbl[dwIdx], s_aasqDpTbl[dwIdx + 1]);
}
}
}
}
SQWORD sqAns = 0;
for (DWORD dwKey_3 = 1; dwKey_3 <= 4; dwKey_3++) {
for (DWORD dwKey_2 = 1; dwKey_2 <= 4; dwKey_2++) {
for (DWORD dwKey_1 = 1; dwKey_1 <= 4; dwKey_1++) {
DWORD dwAllKey = (dwKey_3 << 8) | (dwKey_2 << 4) | (dwKey_1);
sqAns = (sqAns + s_aasqDpTbl[sqInput_N][dwAllKey]) % ANS_MOD;
}
}
}
printf("%lld\n", sqAns);
return 0;
} | 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 = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
std::istream &operator>>(std::istream &in, set<int> &o) {
ll a;
in >> a;
o.insert(a);
return in;
}
std::istream &operator>>(std::istream &in, queue<int> &o) {
ll a;
in >> a;
o.push(a);
return in;
}
bool contain(set<int> &s, int a) { return s.find(a) != s.end(); }
// ofstream outfile("log.txt");
// outfile << setw(6) << setfill('0') << prefecture << setw(6) << setfill('0')
// << rank << endl;
// std::cout << std::bitset<8>(9);
// const ll mod = 1e10;
typedef priority_queue<ll, vector<ll>, greater<ll>> PQ_ASK;
#include <iostream>
#include <vector>
using namespace std;
const int mod = 1000000007;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
friend std::istream &operator>>(std::istream &in, mint &o) {
ll a;
in >> a;
o = a;
return in;
}
friend std::ostream &operator<<(std::ostream &out, const mint &o) {
out << o.x;
return out;
}
};
bool check(string &s) {
{
string u = s.substr(0, 3);
string v = s.substr(1, 3);
if (u == "AGC")
return false;
if (v == "AGC")
return false;
}
for (int i = 0; i < s.size() - 1; i++) {
string t = s;
swap(t[i], t[i + 1]);
string u = t.substr(0, 3);
string v = t.substr(1, 3);
if (u == "AGC")
return false;
if (v == "AGC")
return false;
}
return true;
}
int main() {
int n;
cin >> n;
n -= 4;
vector<map<string, mint>> dp(n + 1);
vector<char> agct = {'A', 'G', 'C', 'T'};
for (char c : agct) {
for (char d : agct) {
for (char e : agct) {
for (char f : agct) {
string k = "";
k += c;
k += d;
k += e;
k += f;
if (!check(k))
continue;
dp[0][k] = 1;
}
}
}
}
for (int i = 0; i < n; i++) {
for (auto &e : dp[i]) {
string s = e.first;
mint k = e.second;
string t = s.substr(1);
for (char c : agct) {
string f = t + c;
if (!check(f))
continue;
dp[i + 1][f] += k;
}
}
}
mint ans = 0;
for (auto &e : dp.back()) {
ans += e.second;
}
cout << ans << endl;
}
| #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 = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
std::istream &operator>>(std::istream &in, set<int> &o) {
ll a;
in >> a;
o.insert(a);
return in;
}
std::istream &operator>>(std::istream &in, queue<int> &o) {
ll a;
in >> a;
o.push(a);
return in;
}
bool contain(set<int> &s, int a) { return s.find(a) != s.end(); }
// ofstream outfile("log.txt");
// outfile << setw(6) << setfill('0') << prefecture << setw(6) << setfill('0')
// << rank << endl;
// std::cout << std::bitset<8>(9);
// const ll mod = 1e10;
typedef priority_queue<ll, vector<ll>, greater<ll>> PQ_ASK;
#include <iostream>
#include <vector>
using namespace std;
const int mod = 1000000007;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
friend std::istream &operator>>(std::istream &in, mint &o) {
ll a;
in >> a;
o = a;
return in;
}
friend std::ostream &operator<<(std::ostream &out, const mint &o) {
out << o.x;
return out;
}
};
bool check(string &s) {
{
string u = s.substr(0, 3);
string v = s.substr(1, 3);
if (u == "AGC")
return false;
if (v == "AGC")
return false;
}
for (int i = 0; i < s.size() - 1; i++) {
string t = s;
swap(t[i], t[i + 1]);
string u = t.substr(0, 3);
string v = t.substr(1, 3);
if (u == "AGC")
return false;
if (v == "AGC")
return false;
}
return true;
}
int main() {
int n;
cin >> n;
if (n == 3) {
cout << 61 << endl;
ret();
}
n -= 4;
vector<map<string, mint>> dp(n + 1);
vector<char> agct = {'A', 'G', 'C', 'T'};
for (char c : agct) {
for (char d : agct) {
for (char e : agct) {
for (char f : agct) {
string k = "";
k += c;
k += d;
k += e;
k += f;
if (!check(k))
continue;
dp[0][k] = 1;
}
}
}
}
for (int i = 0; i < n; i++) {
for (auto &e : dp[i]) {
string s = e.first;
mint k = e.second;
string t = s.substr(1);
for (char c : agct) {
string f = t + c;
if (!check(f))
continue;
dp[i + 1][f] += k;
}
}
}
mint ans = 0;
for (auto &e : dp.back()) {
ans += e.second;
}
cout << ans << endl;
}
| 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;
substring_count[0][0][0][0] = 1;
for (int i = 0; i < n; ++i) {
for (int a = 0; a < 4; ++a) {
for (int b = 0; b < 4; ++b) {
for (int c = 0; c < 4; ++c) {
for (int d = 0; d < 4; ++d) {
if (ng(b, c, d) || ng(c, b, d) || ng(b, d, c))
continue;
if (ng(a, c, d) || ng(a, b, d))
continue;
add(substring_count[i + 1][b][c][d], substring_count[i][a][b][c]);
}
}
}
}
}
ll ans = 0;
for (int a = 0; a < 4; ++a) {
for (int b = 0; b < 4; ++b) {
for (int c = 0; c < 4; ++c) {
add(ans, substring_count[n][a][b][c]);
}
}
}
cout << ans << endl;
}
| #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;
substring_count[0][0][0][0] = 1;
for (int i = 0; i < n; ++i) {
for (int a = 0; a < 4; ++a) {
for (int b = 0; b < 4; ++b) {
for (int c = 0; c < 4; ++c) {
for (int d = 0; d < 4; ++d) {
if (ng(b, c, d) || ng(c, b, d) || ng(b, d, c))
continue;
if (ng(a, c, d) || ng(a, b, d))
continue;
add(substring_count[i + 1][b][c][d], substring_count[i][a][b][c]);
}
}
}
}
}
ll ans = 0;
for (int a = 0; a < 4; ++a) {
for (int b = 0; b < 4; ++b) {
for (int c = 0; c < 4; ++c) {
add(ans, substring_count[n][a][b][c]);
}
}
}
cout << ans << endl;
}
| 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()) {
return false;
}
for (int i = 0; i < 3; ++i) {
swap(vs[i], vs[i + 1]);
if (!check()) {
return false;
}
swap(vs[i], vs[i + 1]);
}
return true;
}
vector<vector<int>> all_allowed() {
vector<vector<int>> all;
for (int a = 0; a < 4; ++a) {
for (int b = 0; b < 4; ++b) {
for (int c = 0; c < 4; ++c) {
for (int d = 0; d < 4; ++d) {
vector<int> xs = {a, b, c, d};
if (is_allowed(xs)) {
all.push_back(xs);
}
}
}
}
}
return all;
}
long long prime = 1000000007;
vector<vector<long long>> mul(vector<vector<long long>> a,
vector<vector<long long>> b) {
// auto t0 = clock();
// assert (a[0].size() == b.size());
int m = (int)a.size(), n = (int)b.size(), p = (int)b[0].size();
// (m x n) * (n x p)
vector<vector<long long>> c(m, vector<long long>(p, 0LL));
for (int i = 0; i < m; ++i) {
for (int j = 0; j < p; ++j) {
long long s = 0;
for (int k = 0; k < n; ++k) {
s += (a[i][k] * b[k][j]) % prime;
}
c[i][j] = s % prime;
}
}
// cerr << "simple mul time: " << (clock() - t0) << " -- " << m << ", " << n
// << ", " << p << endl;
return c;
}
vector<vector<long long>> pow(vector<vector<long long>> a, int r) {
if (r == 1) {
return a;
}
if (r % 2 == 1) {
auto b = pow(a, r - 1);
return mul(a, b);
}
auto b = pow(a, r / 2);
return mul(b, b);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<long long> answers = {
0, 0, 0, 61, 230, 865,
3247, 12185, 45719, 171531, 643550, 2414454,
9058467, 33985227, 127504505, 478366600, 794717734, 733354121,
261943303, 776803305, 580025381, 51688048, 44657419, 737209731,
604119499, 159693437, 858533109, 639056669, 549054109, 996291083,
531294469, 23314687, 783022045, 855462856, 649970414, 68697295,
409213624, 604356692, 88638656, 978442997, 534833116, 763737161,
785892908, 123883652, 639213333, 181836645, 998121103, 124885216,
501575626, 39816123, 113468411, 799008836, 775465589, 256852905,
664630886, 971550783, 751629411, 51018086, 702530485, 725438992,
696683714, 792638194, 221791721, 149602322, 414054379, 986519078,
981760191, 305799096, 515140586, 406959393, 975058685, 245601370,
324759692, 673385295, 191483611, 570246669, 427196161, 781042769,
569725155, 842176273, 25328739, 847501730, 206282374, 353770801,
323137024, 371653459, 940737264, 123820509, 915711339, 847205021,
252858375, 718889563, 866398347, 738390145, 133009077, 333099663,
170591295, 329869205, 616680192, 597534442, 388130742};
if (n == 3) {
cout << 61 << endl;
return 0;
}
map<vector<int>, int> mapping;
for (auto &xs : all_allowed()) {
mapping[xs] = (int)mapping.size();
assert(mapping[xs] < 230);
}
if (n <= 98) {
cout << answers[n] << endl;
return 0;
}
vector<vector<long long>> mat(mapping.size(),
vector<long long>(mapping.size(), 0));
for (auto &ys : all_allowed()) {
for (int a = 0; a < 4; ++a) {
vector<int> xs(ys.begin() + 1, ys.end());
xs.push_back(a);
if (is_allowed(xs)) {
++mat[mapping[ys]][mapping[xs]];
}
}
}
vector<vector<long long>> u(mapping.size(), vector<long long>(1, 1LL));
// auto t0 = clock();
vector<vector<long long>> v = u;
// vector<long long> answers = {0, 0, 0, 61, 230};
// for (int i = 5; i <= 100; ++i) {
// v = mul(mat, v);
// long long tmp = 0;
// for (auto& p : v) {
// tmp += p[0];
// }
// answers.push_back(tmp % prime);
// }
// cerr << "{";
// for (auto answer : answers) {
// cout << answer << ", ";
// }
// cerr << "}" << endl;
if (n > 4) {
auto x = pow(mat, n - 4);
v = mul(x, u);
}
// cerr << "pow time = " << (clock() - t0) << endl;
// assert (v[0].size() == 1);
long long result = 0;
for (auto &p : v) {
result += p[0];
}
cout << (result % prime) << endl;
return 0;
}
| #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()) {
return false;
}
for (int i = 0; i < 3; ++i) {
swap(vs[i], vs[i + 1]);
if (!check()) {
return false;
}
swap(vs[i], vs[i + 1]);
}
return true;
}
vector<vector<int>> all_allowed() {
vector<vector<int>> all;
for (int a = 0; a < 4; ++a) {
for (int b = 0; b < 4; ++b) {
for (int c = 0; c < 4; ++c) {
for (int d = 0; d < 4; ++d) {
vector<int> xs = {a, b, c, d};
if (is_allowed(xs)) {
all.push_back(xs);
}
}
}
}
}
return all;
}
long long prime = 1000000007;
vector<vector<long long>> mul(vector<vector<long long>> a,
vector<vector<long long>> b) {
// auto t0 = clock();
// assert (a[0].size() == b.size());
int m = (int)a.size(), n = (int)b.size(), p = (int)b[0].size();
// (m x n) * (n x p)
vector<vector<long long>> c(m, vector<long long>(p, 0LL));
for (int i = 0; i < m; ++i) {
for (int j = 0; j < p; ++j) {
long long s = 0;
for (int k = 0; k < n; ++k) {
s += (a[i][k] * b[k][j]) % prime;
}
c[i][j] = s % prime;
}
}
// cerr << "simple mul time: " << (clock() - t0) << " -- " << m << ", " << n
// << ", " << p << endl;
return c;
}
vector<vector<long long>> pow(vector<vector<long long>> a, int r) {
if (r == 1) {
return a;
}
if (r % 2 == 1) {
auto b = pow(a, r - 1);
return mul(a, b);
}
auto b = pow(a, r / 2);
return mul(b, b);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<long long> answers = {
0, 0, 0, 61, 230, 865,
3247, 12185, 45719, 171531, 643550, 2414454,
9058467, 33985227, 127504505, 478366600, 794717734, 733354121,
261943303, 776803305, 580025381, 51688048, 44657419, 737209731,
604119499, 159693437, 858533109, 639056669, 549054109, 996291083,
531294469, 23314687, 783022045, 855462856, 649970414, 68697295,
409213624, 604356692, 88638656, 978442997, 534833116, 763737161,
785892908, 123883652, 639213333, 181836645, 998121103, 124885216,
501575626, 39816123, 113468411, 799008836, 775465589, 256852905,
664630886, 971550783, 751629411, 51018086, 702530485, 725438992,
696683714, 792638194, 221791721, 149602322, 414054379, 986519078,
981760191, 305799096, 515140586, 406959393, 975058685, 245601370,
324759692, 673385295, 191483611, 570246669, 427196161, 781042769,
569725155, 842176273, 25328739, 847501730, 206282374, 353770801,
323137024, 371653459, 940737264, 123820509, 915711339, 847205021,
252858375, 718889563, 866398347, 738390145, 133009077, 333099663,
170591295, 329869205, 616680192, 597534442, 388130742};
if (n == 3) {
cout << 61 << endl;
return 0;
}
map<vector<int>, int> mapping;
for (auto &xs : all_allowed()) {
int t = (int)mapping.size();
mapping[xs] = t;
assert(mapping[xs] < 230);
}
if (n <= 98) {
cout << answers[n] << endl;
return 0;
}
vector<vector<long long>> mat(mapping.size(),
vector<long long>(mapping.size(), 0));
for (auto &ys : all_allowed()) {
for (int a = 0; a < 4; ++a) {
vector<int> xs(ys.begin() + 1, ys.end());
xs.push_back(a);
if (is_allowed(xs)) {
++mat[mapping[ys]][mapping[xs]];
}
}
}
vector<vector<long long>> u(mapping.size(), vector<long long>(1, 1LL));
// auto t0 = clock();
vector<vector<long long>> v = u;
// vector<long long> answers = {0, 0, 0, 61, 230};
// for (int i = 5; i <= 100; ++i) {
// v = mul(mat, v);
// long long tmp = 0;
// for (auto& p : v) {
// tmp += p[0];
// }
// answers.push_back(tmp % prime);
// }
// cerr << "{";
// for (auto answer : answers) {
// cout << answer << ", ";
// }
// cerr << "}" << endl;
if (n > 4) {
auto x = pow(mat, n - 4);
v = mul(x, u);
}
// cerr << "pow time = " << (clock() - t0) << endl;
// assert (v[0].size() == 1);
long long result = 0;
for (auto &p : v) {
result += p[0];
}
cout << (result % prime) << endl;
return 0;
}
| 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 && b1 == 1 && b == 2)
return 0; // A?CGの場合
if (b2 == 0 && b1 == 1 && b == 2)
return 0; // ?AGCの場合
if (b2 == 0 && b1 == 2 && b == 1)
return 0; // ?ACGの場合
if (b2 == 1 && b1 == 0 && b == 2)
return 0; // ?GACの場合
if (now == N)
return 1;
// 答えを再帰で求める
long ans = 0;
for (int i = 0; i < 4; i++) {
ans += judge(now + 1, b2, b1, b, i);
}
return memo[now][b3][b2][b1][b] = ans % mod;
}
int main() {
cin >> N;
memset(memo, -1, sizeof(memo));
cout << judge(0, 3, 3, 3, 3) << endl;
}
| // 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];
if (b3 == 0 && b2 == 1 && b == 2)
return 0; // AG?Cの場合
if (b3 == 0 && b1 == 1 && b == 2)
return 0; // A?CGの場合
if (b2 == 0 && b1 == 1 && b == 2)
return 0; // ?AGCの場合
if (b2 == 0 && b1 == 2 && b == 1)
return 0; // ?ACGの場合
if (b2 == 1 && b1 == 0 && b == 2)
return 0; // ?GACの場合
if (now == N)
return 1;
// 答えを再帰で求める
long ans = 0;
for (int i = 0; i < 4; i++) {
ans += judge(now + 1, b2, b1, b, i);
}
return memo[now][b3][b2][b1][b] = ans % mod;
}
int main() {
cin >> N;
memset(memo, -1, sizeof(memo));
cout << judge(0, 3, 3, 3, 3) << endl;
}
| 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); \
cout.tie(0)
#define loop(i, a, b) for (int i = a; i < b; i++)
#define test() \
int t; \
cin >> t; \
while (t--)
#define pb push_back
#define mkp make_pair
#define nl cout << "\n"
#define sp cout << " "
#define vi vector<int>
#define pii pair<int, int>
#define vii vector<pii>
#define prsp(v) \
loop(i, 0, v.size()) cout << v[i], sp; \
nl;
#define prpsp(v) \
loop(i, 0, v.size()) cout << v[i].F << " " << v[i].S, sp; \
nl;
#define prnl(v) \
loop(i, 0, v.size()) cout << v[i], nl; \
nl;
#define prpnl(v) \
loop(i, 0, v.size()) cout << v[i].F << " " << v[i].S, nl; \
nl;
#define MOD 1000000007
#define mod(n) (((n % MOD) + MOD) % MOD)
#define all(x) x.begin(), x.end()
const int N = 1e5 + 5;
int dp[105][5][5][5];
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
fastio();
int n;
cin >> n;
dp[0][0][0][0] = 1;
loop(i, 0, n) loop(j, 0, 5) loop(k, 0, 5) loop(l, 0, 5) {
loop(m, 0, 4) {
if (k == 1 && l == 2 && m == 3)
continue;
if (k == 1 && l == 3 && m == 2)
continue;
if (k == 3 && l == 1 && m == 2)
continue;
if (j == 1 && l == 3 && m == 2)
continue;
if (j == 1 && k == 3 && m == 2)
continue;
dp[i + 1][k][l][m] += dp[i][j][k][l];
dp[i + 1][k][l][m] = mod(dp[i + 1][k][l][m]);
}
}
ll ans = 0;
loop(j, 0, 5) loop(k, 0, 5) loop(l, 0, 5) {
ans += dp[n][j][k][l];
ans = mod(ans);
}
cout << ans, nl;
return 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); \
cout.tie(0)
#define loop(i, a, b) for (int i = a; i < b; i++)
#define test() \
int t; \
cin >> t; \
while (t--)
#define pb push_back
#define mkp make_pair
#define nl cout << "\n"
#define sp cout << " "
#define vi vector<int>
#define pii pair<int, int>
#define vii vector<pii>
#define prsp(v) \
loop(i, 0, v.size()) cout << v[i], sp; \
nl;
#define prpsp(v) \
loop(i, 0, v.size()) cout << v[i].F << " " << v[i].S, sp; \
nl;
#define prnl(v) \
loop(i, 0, v.size()) cout << v[i], nl; \
nl;
#define prpnl(v) \
loop(i, 0, v.size()) cout << v[i].F << " " << v[i].S, nl; \
nl;
#define MOD 1000000007
#define mod(n) (((n % MOD) + MOD) % MOD)
#define all(x) x.begin(), x.end()
const int N = 1e5 + 5;
int dp[105][5][5][5];
int main() {
fastio();
int n;
cin >> n;
dp[0][0][0][0] = 1;
loop(i, 0, n) loop(j, 0, 5) loop(k, 0, 5) loop(l, 0, 5) {
loop(m, 0, 4) {
if (k == 1 && l == 2 && m == 3)
continue;
if (k == 1 && l == 3 && m == 2)
continue;
if (k == 3 && l == 1 && m == 2)
continue;
if (j == 1 && l == 3 && m == 2)
continue;
if (j == 1 && k == 3 && m == 2)
continue;
dp[i + 1][k][l][m] += dp[i][j][k][l];
dp[i + 1][k][l][m] = mod(dp[i + 1][k][l][m]);
}
}
ll ans = 0;
loop(j, 0, 5) loop(k, 0, 5) loop(l, 0, 5) {
ans += dp[n][j][k][l];
ans = mod(ans);
}
cout << ans, nl;
return 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):
if dp[n][i][j][k] == 0:
continue
for a in range(4):
if (
(j == 0 and i == 1 and a == 2)
or (j == 0 and i == 2 and a == 1)
or (j == 1 and i == 0 and a == 2)
or (k == 0 and j == 1 and a == 2)
or (k == 0 and i == 1 and a == 2)
):
continue
dp[n + 1][a][i][j] += dp[n][i][j][k]
dp[n + 1][a][i][j] %= mod
ans = 0
for i in range(4):
for j in range(4):
for k in range(4):
ans += dp[N][i][j][k]
ans %= mod
print(ans)
main()
| 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):
if dp[n][i][j][k] == 0:
continue
for a in range(4):
if (
(j == 0 and i == 1 and a == 2)
or (j == 0 and i == 2 and a == 1)
or (j == 1 and i == 0 and a == 2)
or (k == 0 and j == 1 and a == 2)
or (k == 0 and i == 1 and a == 2)
):
continue
dp[n + 1][a][i][j] += dp[n][i][j][k]
dp[n + 1][a][i][j] %= mod
ans = 0
for i in range(4):
for j in range(4):
for k in range(4):
ans += dp[N][i][j][k]
ans %= mod
print(ans)
main()
| 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 = list(last4)
if i > 0:
x[i], x[i - 1] = x[i - 1], x[i]
if "".join(x).count("AGC") >= 1:
return False
return True
for i in range(1, N + 1):
for last3, count in dp[i - 1].items():
for c in "AGCT":
if check(last3 + c):
new_last3 = last3[1:] + c
dp[i].setdefault(last3[1:] + c, 0)
dp[i][new_last3] = (dp[i][new_last3] + count) % mod
print(sum(dp[-1].values()) % mod)
if __name__ == "__main__":
N = int(input())
solve(N)
# # test
# from random import randint
# from func import random_str
# solve()
| # 解説を参考に作成
# 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 = list(last4)
if i > 0:
x[i], x[i - 1] = x[i - 1], x[i]
if "".join(x).count("AGC") >= 1:
return False
return True
for i in range(1, N + 1):
for last3, count in dp[i - 1].items():
for c in "AGCT":
if check(last3 + c):
new_last3 = last3[1:] + c
dp[i].setdefault(last3[1:] + c, 0)
dp[i][new_last3] = (dp[i][new_last3] + count) % mod
print(sum(dp[-1].values()) % mod)
if __name__ == "__main__":
N = int(input())
solve(N)
# # test
# from random import randint
# from func import random_str
# solve()
| 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-packages/decorator.py)
|
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 long int
#define ld long double
#define FOR(i, a, n) for (int i = (a); i <= (n); ++i)
#define RFOR(i, a, n) for (int i = (n); i >= (a); --i)
#define FI(i, n) for (int i = 0; i < (n); ++i)
#define ZERO(a) memset((a), 0, sizeof((a)))
#define f first
// #define s second
#define pb push_back
#define mk make_pair
#define all(g) g.begin(), g.end()
int fastMax(int x, int y) { return (((y - x) >> (32 - 1)) & (x ^ y)) ^ y; }
int fastMin(int x, int y) { return (((y - x) >> (32 - 1)) & (x ^ y)) ^ x; }
// #include <ext/pb_ds/assoc_container.hpp> // Common file
// #include <ext/pb_ds/tree_policy.hpp> // Including
// tree_order_statistics_node_updat using namespace __gnu_pbds; typedef tree<ll,
// null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update>
// ordered_set;
// I am questioning life and universe and
// everything else after looking at this
const ll MAXN = 101;
ll dp[MAXN][5][5][5][5][5][2];
const ll MOD = 1e9 + 7;
map<char, ll> m;
ll n;
ll rec(ll idx, ll prev0, ll prev1, ll prev2, ll prev3, ll prev4, ll check) {
if (idx == n + 1) {
if (prev1 == m['A'] && prev2 == m['G'] && prev3 == m['C'])
return 0;
else if (prev1 == m['A'] && prev2 == m['C'] && prev3 == m['G'])
return 0;
else if (prev1 == m['G'] && prev2 == m['A'] && prev3 == m['C'])
return 0;
else if (prev0 == m['A'] && prev2 == m['G'] && prev3 == m['C'])
return 0;
else if (prev1 == m['A'] && prev2 == m['G'] && prev4 == m['C'])
return 0;
else if (prev2 == m['A'] && prev3 == m['G'] && prev4 == m['C'])
return 0;
else if (prev2 == m['A'] && prev3 == m['C'] && prev4 == m['G'])
return 0;
else if (prev2 == m['G'] && prev3 == m['A'] && prev4 == m['C'])
return 0;
else if (prev1 == m['A'] && prev3 == m['G'] && prev4 == m['C'])
return 0;
else if (check)
return 0;
else
return 1;
}
if (prev1 == m['A'] && prev2 == m['G'] && prev3 == m['C'])
check = true;
else if (prev1 == m['A'] && prev2 == m['C'] && prev3 == m['G'])
check = true;
else if (prev1 == m['G'] && prev2 == m['A'] && prev3 == m['C'])
check = true;
else if (prev0 == m['A'] && prev2 == m['G'] && prev3 == m['C'])
check = true;
else if (prev1 == m['A'] && prev2 == m['G'] && prev4 == m['C'])
check = true;
else if (prev2 == m['A'] && prev3 == m['G'] && prev4 == m['C'])
check = true;
else if (prev2 == m['A'] && prev3 == m['C'] && prev4 == m['G'])
check = true;
else if (prev2 == m['G'] && prev3 == m['A'] && prev4 == m['C'])
check = true;
else if (prev1 == m['A'] && prev3 == m['G'] && prev4 == m['C'])
check = true;
ll &ans = dp[idx][prev0][prev1][prev2][prev3][prev4][check];
if (ans != -1)
return ans;
ans = 0;
ans = (ans + rec(idx + 1, prev1, prev2, prev3, prev4, m['A'], check)) % MOD;
ans = (ans + rec(idx + 1, prev1, prev2, prev3, prev4, m['G'], check)) % MOD;
ans = (ans + rec(idx + 1, prev1, prev2, prev3, prev4, m['C'], check)) % MOD;
ans = (ans + rec(idx + 1, prev1, prev2, prev3, prev4, m['T'], check)) % MOD;
return ans;
}
void solve() {
m['A'] = 0, m['G'] = 1, m['C'] = 2, m['T'] = 3;
cin >> n;
memset(dp, -1, sizeof(dp));
ll ans = rec(1, 4, 4, 4, 4, 4, 0);
cout << ans << endl;
}
signed main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
FastRead;
ll t;
t = 1;
// cin>>t;
FOR(tt, 1, t) { solve(); }
} | #include <bits/stdc++.h>
using namespace std;
#define FastRead \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long long int
#define ld long double
#define FOR(i, a, n) for (int i = (a); i <= (n); ++i)
#define RFOR(i, a, n) for (int i = (n); i >= (a); --i)
#define FI(i, n) for (int i = 0; i < (n); ++i)
#define ZERO(a) memset((a), 0, sizeof((a)))
#define f first
// #define s second
#define pb push_back
#define mk make_pair
#define all(g) g.begin(), g.end()
int fastMax(int x, int y) { return (((y - x) >> (32 - 1)) & (x ^ y)) ^ y; }
int fastMin(int x, int y) { return (((y - x) >> (32 - 1)) & (x ^ y)) ^ x; }
// #include <ext/pb_ds/assoc_container.hpp> // Common file
// #include <ext/pb_ds/tree_policy.hpp> // Including
// tree_order_statistics_node_updat using namespace __gnu_pbds; typedef tree<ll,
// null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update>
// ordered_set;
// I am questioning life and universe and
// everything else after looking at this
const ll MAXN = 101;
ll dp[MAXN][5][5][5][5][5][2];
const ll MOD = 1e9 + 7;
map<char, ll> m;
ll n;
ll rec(ll idx, ll prev0, ll prev1, ll prev2, ll prev3, ll prev4, ll check) {
if (idx == n + 1) {
if (prev1 == m['A'] && prev2 == m['G'] && prev3 == m['C'])
return 0;
else if (prev1 == m['A'] && prev2 == m['C'] && prev3 == m['G'])
return 0;
else if (prev1 == m['G'] && prev2 == m['A'] && prev3 == m['C'])
return 0;
else if (prev0 == m['A'] && prev2 == m['G'] && prev3 == m['C'])
return 0;
else if (prev1 == m['A'] && prev2 == m['G'] && prev4 == m['C'])
return 0;
else if (prev2 == m['A'] && prev3 == m['G'] && prev4 == m['C'])
return 0;
else if (prev2 == m['A'] && prev3 == m['C'] && prev4 == m['G'])
return 0;
else if (prev2 == m['G'] && prev3 == m['A'] && prev4 == m['C'])
return 0;
else if (prev1 == m['A'] && prev3 == m['G'] && prev4 == m['C'])
return 0;
else if (check)
return 0;
else
return 1;
}
if (prev1 == m['A'] && prev2 == m['G'] && prev3 == m['C'])
check = true;
else if (prev1 == m['A'] && prev2 == m['C'] && prev3 == m['G'])
check = true;
else if (prev1 == m['G'] && prev2 == m['A'] && prev3 == m['C'])
check = true;
else if (prev0 == m['A'] && prev2 == m['G'] && prev3 == m['C'])
check = true;
else if (prev1 == m['A'] && prev2 == m['G'] && prev4 == m['C'])
check = true;
else if (prev2 == m['A'] && prev3 == m['G'] && prev4 == m['C'])
check = true;
else if (prev2 == m['A'] && prev3 == m['C'] && prev4 == m['G'])
check = true;
else if (prev2 == m['G'] && prev3 == m['A'] && prev4 == m['C'])
check = true;
else if (prev1 == m['A'] && prev3 == m['G'] && prev4 == m['C'])
check = true;
ll &ans = dp[idx][prev0][prev1][prev2][prev3][prev4][check];
if (ans != -1)
return ans;
ans = 0;
ans = (ans + rec(idx + 1, prev1, prev2, prev3, prev4, m['A'], check)) % MOD;
ans = (ans + rec(idx + 1, prev1, prev2, prev3, prev4, m['G'], check)) % MOD;
ans = (ans + rec(idx + 1, prev1, prev2, prev3, prev4, m['C'], check)) % MOD;
ans = (ans + rec(idx + 1, prev1, prev2, prev3, prev4, m['T'], check)) % MOD;
return ans;
}
void solve() {
m['A'] = 0, m['G'] = 1, m['C'] = 2, m['T'] = 3;
cin >> n;
memset(dp, -1, sizeof(dp));
ll ans = rec(1, 4, 4, 4, 4, 4, 0);
cout << ans << endl;
}
signed main() {
FastRead;
ll t;
t = 1;
// cin>>t;
FOR(tt, 1, t) { solve(); }
} | 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 std;
#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)
#define REP(i, n) FOR(i, 0, n - 1)
#define NREP(i, n) FOR(i, 1, n)
using ll = long long;
using pii = pair<int, int>;
using piii = pair<pii, pii>;
const int dx[4] = {0, -1, 1, 0};
const int dy[4] = {-1, 0, 0, 1};
const int INF = 1e9 + 7;
int gcd(int x, int y) {
if (x < y)
swap(x, y);
if (y == 0)
return x;
return gcd(y, x % y);
}
template <class T1, class T2> void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <class T1, class T2> void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
template <class T> void Add(T &a, const T &b, const T &mod = 1000000007) {
int val = ((a % mod) + (b % mod)) % mod;
if (val < 0) {
val += mod;
}
a = val;
}
////////////////////////////////////////
int main() {
int N;
cin >> N;
ll dp[110][4][4][4];
// dp[N][i][j][k]でN文字目まで確定していてN-2文字目がi,N-1文字目がj,N文字目がk
// Aなら0,Cなら1,Gなら2,Tなら3
for (int i = 0; i < 110; ++i) {
for (int j = 0; j < 4; ++j) {
for (int k = 0; k < 4; ++k) {
for (int l = 0; l < 4; ++l) {
dp[i][j][k][l] = 0;
}
}
}
}
for (int i = 0; i < 4; ++i) {
for (int j = 0; j < 4; ++j) {
for (int k = 0; k < 4; ++k) {
if ((i == 0 && j == 2 && k == 1) || (i == 0 && j == 1 && k == 2) ||
(i == 2 && j == 0 && k == 1)) {
continue;
}
dp[3][i][j][k] = 1;
}
}
}
for (int i = 3; i < 110; ++i) {
for (int j = 0; j < 4; ++j) {
for (int k = 0; k < 4; ++k) {
for (int l = 0; l < 4; ++l) {
for (int m = 0; m < 4; ++m) {
if (j == 0 && k == 2 && l == 1)
continue;
if (j == 2 && k == 0 && l == 1)
continue;
if (j == 0 && k == 1 && l == 2)
continue;
if (m == 0 && k == 2 && l == 1)
continue;
if (m == 0 && j == 2 && l == 1)
continue;
dp[i + 1][j][k][l] += dp[i][m][j][k];
dp[i + 1][j][k][l] %= INF;
}
}
}
}
}
ll ans = 0;
for (int i = 0; i < 4; ++i) {
for (int j = 0; j < 4; ++j) {
for (int k = 0; k < 4; ++k) {
ans += dp[N][i][j][k];
}
}
}
cout << ans % INF << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)
#define REP(i, n) FOR(i, 0, n - 1)
#define NREP(i, n) FOR(i, 1, n)
using ll = long long;
using pii = pair<int, int>;
using piii = pair<pii, pii>;
const int dx[4] = {0, -1, 1, 0};
const int dy[4] = {-1, 0, 0, 1};
const int INF = 1e9 + 7;
int gcd(int x, int y) {
if (x < y)
swap(x, y);
if (y == 0)
return x;
return gcd(y, x % y);
}
template <class T1, class T2> void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <class T1, class T2> void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
template <class T> void Add(T &a, const T &b, const T &mod = 1000000007) {
int val = ((a % mod) + (b % mod)) % mod;
if (val < 0) {
val += mod;
}
a = val;
}
////////////////////////////////////////
int main() {
int N;
cin >> N;
ll dp[110][4][4][4];
// dp[N][i][j][k]でN文字目まで確定していてN-2文字目がi,N-1文字目がj,N文字目がk
// Aなら0,Cなら1,Gなら2,Tなら3
for (int i = 0; i < 110; ++i) {
for (int j = 0; j < 4; ++j) {
for (int k = 0; k < 4; ++k) {
for (int l = 0; l < 4; ++l) {
dp[i][j][k][l] = 0;
}
}
}
}
for (int i = 0; i < 4; ++i) {
for (int j = 0; j < 4; ++j) {
for (int k = 0; k < 4; ++k) {
if ((i == 0 && j == 2 && k == 1) || (i == 0 && j == 1 && k == 2) ||
(i == 2 && j == 0 && k == 1)) {
continue;
}
dp[3][i][j][k] = 1;
}
}
}
for (int i = 3; i < 105; ++i) {
for (int j = 0; j < 4; ++j) {
for (int k = 0; k < 4; ++k) {
for (int l = 0; l < 4; ++l) {
for (int m = 0; m < 4; ++m) {
if (j == 0 && k == 2 && l == 1)
continue;
if (j == 2 && k == 0 && l == 1)
continue;
if (j == 0 && k == 1 && l == 2)
continue;
if (m == 0 && k == 2 && l == 1)
continue;
if (m == 0 && j == 2 && l == 1)
continue;
dp[i + 1][j][k][l] += dp[i][m][j][k];
dp[i + 1][j][k][l] %= INF;
}
}
}
}
}
ll ans = 0;
for (int i = 0; i < 4; ++i) {
for (int j = 0; j < 4; ++j) {
for (int k = 0; k < 4; ++k) {
ans += dp[N][i][j][k];
}
}
}
cout << ans % INF << endl;
return 0;
}
| 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::npos) {
return false;
}
for (int i = 0; i < 3; i++) {
string copied = s;
char tmp = copied[i];
copied[i] = copied[i + 1];
copied[i + 1] = tmp;
if (copied.find("AGC") != string::npos) {
return false;
}
}
return true;
}
int dfs(int cur, string last) {
auto it = memo[cur].find(last);
if (it != memo[cur].end()) {
return memo[cur][last];
}
if (cur == N)
return 1;
int cnt = 0;
for (auto c : "AGCT") {
if (c == 0)
continue;
string newstr = last + c;
if (ok(newstr)) {
cnt = (cnt + dfs(cur + 1, newstr.substr(1))) % MOD;
}
}
memo[cur][last] = cnt;
return cnt;
}
int main() {
cin >> N;
cout << dfs(0, "XXX") << endl;
return 0;
}
| #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::npos) {
return false;
}
for (int i = 0; i < 3; i++) {
string copied = s;
char tmp = copied[i];
copied[i] = copied[i + 1];
copied[i + 1] = tmp;
if (copied.find("AGC") != string::npos) {
return false;
}
}
return true;
}
int dfs(int cur, string last) {
auto it = memo[cur].find(last);
if (it != memo[cur].end()) {
return memo[cur][last];
}
if (cur == N)
return 1;
int cnt = 0;
for (auto c : "AGCT") {
if (c == 0)
continue;
string newstr = last + c;
if (ok(newstr)) {
cnt = (cnt + dfs(cur + 1, newstr.substr(1))) % MOD;
}
}
memo[cur][last] = cnt;
return cnt;
}
int main() {
cin >> N;
cout << dfs(0, "XXX") << endl;
return 0;
}
| 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.