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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02713 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
int main() {
int k;
cin >> k;
int ans = 0;
for (int a = 1; a <= k; a++)
for (int b = 1; b <= k; b++)
for (int c = 1; c <= k; c++) {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
int main() {
int k;
cin >> k;
int ans = 0;
for (int a = 1; a <= k; a++)
for (int b = 1; b <= k; b++)
for (int c = 1; c <= k; c++) {
... | replace | 15 | 17 | 15 | 17 | TLE | |
p02713 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define mod 1000000007
#define mp make_pair
#define rep(i, n) for (int i = 0; i < n; i++)
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
using namespace std... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define mod 1000000007
#define mp make_pair
#define rep(i, n) for (int i = 0; i < n; i++)
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
using namespace std... | replace | 21 | 22 | 21 | 22 | TLE | |
p02713 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int K;
cin >> K;
int A = 0;
for (int i = 1; i <= K; i++) {
for (int j = 1; j <= K; j++) {
for (int k = 1; k <= K; k++) {
for (int l = K; l >= 1; l--) {
if (i % l == 0 && j % l == 0 && k % l == 0) {
A += l;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int K;
cin >> K;
int A = 0;
for (int i = 1; i <= K; i++) {
for (int j = 1; j <= K; j++) {
for (int k = 1; k <= K; k++) {
int B = min(i, j);
B = min(B, k);
for (int l = B; l >= 1; l--) {
if (i % l == 0 && j %... | replace | 11 | 12 | 11 | 14 | TLE | |
p02713 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#define mp make_pair
#define pb push_back
#define ll long long
#define kl k << 1
#define kr k << 1 | 1
using namespace std;
inline ll read() {
ll s = 0, w = 1;
char ch = ge... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#define mp make_pair
#define pb push_back
#define ll long long
#define kl k << 1
#define kr k << 1 | 1
using namespace std;
inline ll read() {
ll s = 0, w = 1;
char ch = ge... | replace | 54 | 63 | 54 | 56 | TLE | |
p02713 | Python | Time Limit Exceeded | from math import gcd
from functools import reduce
def gcd_kai(*numbers):
return reduce(gcd, numbers)
K = int(input())
ans = 0
for i in range(K):
for j in range(K):
for k in range(K):
ans += gcd_kai(i + 1, j + 1, k + 1)
print(ans)
| from math import gcd
from functools import reduce
def gcd_kai(*numbers):
return reduce(gcd, numbers)
K = int(input())
ans = 1
if K == 1:
next
else:
ans += (K - 1) * K * 3
ans_sub = 0
for i in range(2, K):
for j in range(i + 1, K + 1):
for k in range(i, K + 1):
... | replace | 9 | 14 | 9 | 22 | TLE | |
p02713 | Python | Time Limit Exceeded | import itertools
import math
def gcd(a: int, b: int, c: int) -> int:
return math.gcd(math.gcd(a, b), c)
def main() -> None:
k = int(input())
s = sum(gcd(a, b, c) for a, b, c in itertools.product(range(1, k + 1), repeat=3))
print(s)
if __name__ == "__main__":
main()
| import itertools
import math
def gcd(a: int, b: int, c: int) -> int:
return math.gcd(math.gcd(a, b), c)
def main() -> None:
k = int(input())
one_to_k = range(1, k + 1)
s1 = sum(one_to_k)
s2 = sum(math.gcd(a, b) for a, b in itertools.combinations(one_to_k, 2))
s3 = sum(gcd(a, b, c) for a, b,... | replace | 11 | 13 | 11 | 16 | TLE | |
p02713 | Python | Runtime Error | import math
k = int(input())
ans = 0
for a in range(k):
for b in range(k):
d = math.gcd(a + 1, b + 1)
for c in range(k):
ans += math(d, c + 1)
print(ans)
| import math
k = int(input())
ans = 0
for a in range(k):
for b in range(k):
d = math.gcd(a + 1, b + 1)
for c in range(k):
ans += math.gcd(d, c + 1)
print(ans)
| replace | 9 | 10 | 9 | 10 | TypeError: 'module' object is not callable | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02713/Python/s321209057.py", line 9, in <module>
ans += math(d, c + 1)
TypeError: 'module' object is not callable
|
p02713 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
typedef long long ll;
#define _GLIBCXX_DEBUG
typedef vector<int> vec;
typedef vector<ll> lvec;
typedef vector<char> cvec;
typedef pair<ll, ll> LP;
typ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
typedef long long ll;
#define _GLIBCXX_DEBUG
typedef vector<int> vec;
typedef vector<ll> lvec;
typedef vector<char> cvec;
typedef pair<ll, ll> LP;
ty... | replace | 2 | 3 | 2 | 3 | -8 | |
p02713 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b, int c) {
for (int i = 200; i >= 1; i--) {
if (a % i == 0 && b % i == 0 && c % i == 0)
return i;
}
}
int main() {
int k;
cin >> k;
long long sum = 0;
for (int i = 1; i <= k; i++)
for (int j = 1; j <= k; j++)
for (int k1 =... | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b, int c) {
if (a < b)
swap(a, b);
int r = 0, ans = 0;
while (1) {
r = a % b;
if (r == 0) {
ans = b;
break;
} else {
a = b;
b = r;
}
}
if (ans > c)
swap(ans, c);
while (1) {
r = ans % c;
... | replace | 3 | 6 | 3 | 26 | TLE | |
p02713 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <math.h>
#define PI 3.14159265358979323846264338327950L
#define ll long long
using namespace std;
int solve(int i, int j) {
int result = 1;
for (int k = 2; k <= min(i, j); k++) {
if (i % k == 0 && j % k == 0) {
result = k;
}
}
return result;
}
int main() {
i... | #include <bits/stdc++.h>
#include <math.h>
#define PI 3.14159265358979323846264338327950L
#define ll long long
using namespace std;
int solve(int i, int j) {
int result = 1;
for (int k = 2; k <= min(i, j); k++) {
if (i % k == 0 && j % k == 0) {
result = k;
}
}
return result;
}
int main() {
i... | replace | 26 | 28 | 26 | 28 | TLE | |
p02713 | C++ | Runtime Error | #include <iostream>
#define ll long long int
using namespace std;
ll gcd2(int a, int b) {
if (a % b == 0)
return b;
if (a < b) {
int tmp = a;
a = b;
b = tmp;
}
return gcd2(b, a % b);
}
ll gcd3(int a, int b, int c) { return gcd2(gcd2(a, b), c); }
int main(void) {
ll K, sum = 0;
cin >> K;
... | #include <iostream>
#define ll long long int
using namespace std;
ll gcd2(int a, int b) {
if (a % b == 0)
return b;
return gcd2(b, a % b);
}
ll gcd3(int a, int b, int c) { return gcd2(gcd2(a, b), c); }
int main(void) {
ll K, sum = 0;
cin >> K;
for (int i = 1; i <= K; i++) {
for (int j = 1; j <= K;... | delete | 8 | 13 | 8 | 8 | -8 | |
p02713 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define INF 1000000009
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef long long ll;
#define REP(i, a, b) for (int i = a; i <= b; i++)
int main(int argc, char const *argv[]) {
map<pair<... | #include "bits/stdc++.h"
using namespace std;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define INF 1000000009
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef long long ll;
#define REP(i, a, b) for (int i = a; i <= b; i++)
int main(int argc, char const *argv[]) {
map<pair<... | replace | 20 | 27 | 20 | 22 | TLE | |
p02713 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iostream>
#include <map>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int euclid(int i, int j) {
if (i % j == 0)
return j;
euclid(j, i % j);
}
int main() {
int K;
cin >> ... | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iostream>
#include <map>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int euclid(int i, int j) {
if (i % j == 0)
return j;
return euclid(j, i % j);
}
int main() {
int K;
... | replace | 15 | 16 | 15 | 16 | 0 | |
p02713 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int gcd(int x, int y) {
if (x % y == 0)
return y;
else
return gcd(y, x % y);
}
int gcd2(int x, int y, int z) { return gcd(x, gcd(y, z)); }
int main() {
int n;
cin >> n;
long long ans = 0;
for (int i; i < n; i++)
for (int j; j < n; j++)
for (i... | #include <bits/stdc++.h>
using namespace std;
int gcd(int x, int y) {
if (x % y == 0)
return y;
else
return gcd(y, x % y);
}
int gcd2(int x, int y, int z) { return gcd(x, gcd(y, z)); }
int main() {
int n;
cin >> n;
long long ans = 0;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
... | replace | 15 | 18 | 15 | 18 | 0 | |
p02713 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for ((i) = 0; (i) < (n); (i)++)
typedef long long ll;
typedef pair<int, int> P;
ll gcd(ll a, ll b, ll c) {
ll i = 0;
ll n = 0;
n = min({a, b, c});
rep(i, n) {
if (a % (n - i) == 0 && b % (n - i) == 0 && c % (n - i) == 0) {
return n - i;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for ((i) = 0; (i) < (n); (i)++)
typedef long long ll;
typedef pair<int, int> P;
ll gcd(ll a, ll b, ll c) {
ll i = 0;
ll n = 0;
n = min({a, b, c});
rep(i, n) {
if (a % (n - i) == 0 && b % (n - i) == 0 && c % (n - i) == 0) {
return n - i;
... | replace | 21 | 22 | 21 | 31 | TLE | |
p02713 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using mii = map<int, int>;
using mll = map<ll, ll>;
using vi = vector<int>;
using vii = vector<vi>;
using vpi = vector<pii>;
using vl = vector<ll>;
using vll = vector<vl>;
using vpl = vector<pll>;
u... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using mii = map<int, int>;
using mll = map<ll, ll>;
using vi = vector<int>;
using vii = vector<vi>;
using vpi = vector<pii>;
using vl = vector<ll>;
using vll = vector<vl>;
using vpl = vector<pll>;
u... | replace | 19 | 20 | 19 | 20 | 0 | |
p02713 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return fa... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return fa... | replace | 46 | 47 | 46 | 47 | TLE | |
p02713 | C++ | Runtime Error | #include "bits/stdc++.h"
#define rep(i, N) for (int i = 0; i < N; i++)
#define int long long
#define INF 1e10
using namespace std;
int gcd(int p, int q) {
if (p % q == 0)
return q;
return gcd(q, p % q);
}
signed main(void) {
int K;
int ans = 0;
cin >> K;
rep(a, K) {
rep(b, K) {
rep(c, K... | #include "bits/stdc++.h"
#define rep(i, N) for (int i = 0; i < N; i++)
#define int long long
#define INF 1e10
using namespace std;
int gcd(int p, int q) {
if (p % q == 0)
return q;
return gcd(q, p % q);
}
signed main(void) {
int K;
int ans = 0;
cin >> K;
rep(a, K) {
rep(b, K) {
rep(c, K... | replace | 23 | 24 | 23 | 24 | -8 | |
p02713 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int gcd(int x, int y) {
for (int i = max(x, y); i > 0; i--) {
if (x % i == 0 && y % i == 0)
return i;
}
}
int main() {
int K;
cin >> K;
int A[K][K];
for (int i = 0; i < K; i++) {
for (int j = 0; j < K; j++) {
A[i][j] = gcd(i + 1, j + 1);
}
... | #include <iostream>
using namespace std;
int gcd(int x, int y) { return (x % y) ? gcd(y, x % y) : y; }
int main() {
int K;
cin >> K;
int A[K][K];
for (int i = 0; i < K; i++) {
for (int j = 0; j < K; j++) {
A[i][j] = gcd(i + 1, j + 1);
}
}
int B[K][K][K];
for (int i = 0; i < K; i++) {
f... | replace | 3 | 9 | 3 | 4 | TLE | |
p02713 | C++ | Time Limit Exceeded | #include <cmath>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int cal_gcd(int a, int b);
int main() {
int k;
ll sum = 0;
cin >> k;
for (int i = 1; i <= k; i++) {
for (int j = 1; j <= k; j++) {
for (int l = 1; l... | #include <cmath>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int cal_gcd(int a, int b);
int main() {
int k;
ll sum = 0;
cin >> k;
for (int i = 1; i <= k; i++) {
for (int j = 1; j <= k; j++) {
for (int l = 1; l... | replace | 35 | 36 | 35 | 36 | TLE | |
p02713 | C++ | Time Limit Exceeded | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cmath>
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <i... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cmath>
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <i... | replace | 26 | 27 | 26 | 27 | TLE | |
p02713 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define PI 3.14159265358979323846264338327950
#define INF 1e18
int gcd(int x, int y) {
if (x % y == 0) {
return y;
}
int k = x % y;
gcd(y, k);
}
in... | #include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define PI 3.14159265358979323846264338327950
#define INF 1e18
int gcd(int x, int y) {
if (x % y == 0) {
return y;
}
int k = x % y;
return gcd(y, k... | replace | 14 | 15 | 14 | 15 | 0 | |
p02713 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (a < b) {
int r = b;
b = a;
a = r;
}
if (a % b == 0)
return b;
else
return gcd(b, a % b);
}
int gcd2(int a, int b, int c) { return gcd(a, gcd(b, c)); }
int main() {
long int k, ans = 0;
cin >> k;
for (int a = 0; a... | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (a < b) {
int r = b;
b = a;
a = r;
}
if (a % b == 0)
return b;
else
return gcd(b, a % b);
}
int gcd2(int a, int b, int c) { return gcd(a, gcd(b, c)); }
int main() {
long int k, ans = 0;
cin >> k;
for (int a = 1; a... | replace | 17 | 20 | 17 | 20 | -8 | |
p02713 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll a, b, c, i, j, k, l, m, n, ans, tmp, hoge, fuga, piyo;
ll x[10010], y[10010];
string s, str;
int gcd(int x, int y) { return (x % y) ? gcd(y, x % y) : y; }
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; i++) {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll a, b, c, i, j, k, l, m, n, ans, tmp, hoge, fuga, piyo;
ll x[10010], y[10010];
string s, str;
int gcd(int x, int y) { return (x % y) ? gcd(y, x % y) : y; }
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
... | replace | 10 | 14 | 10 | 13 | TLE | |
p02713 | C++ | Time Limit Exceeded | /*
Coded and Decoded by : Yash Kapoor
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define pf push_front
#define mp make_pair
#define pll pair<ll, ll>
#define vl vector<ll>
#define sl set<ll>
#define vll vector<pll>
#define ml map<ll, ll>
#define m... | /*
Coded and Decoded by : Yash Kapoor
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define pf push_front
#define mp make_pair
#define pll pair<ll, ll>
#define vl vector<ll>
#define sl set<ll>
#define vll vector<pll>
#define ml map<ll, ll>
#define m... | insert | 58 | 58 | 58 | 59 | TLE | |
p02714 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
int main() {
int n;
cin >> n;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
int main() {
int n;
cin >> n;
... | insert | 46 | 46 | 46 | 50 | 0 | |
p02714 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n, a[4001];
char s[4001];
int s1[4001], s2[4001], s3[4001];
long long ans;
int main() {
scanf("%d", &n);
cin >> s;
for (int i = 0; i < n; ++i) {
if (s[i] == 'R')
a[i + 1] = 1;
else if (s[i] == 'G')
a[i + 1] = 2;
else
a[i + 1] = 3;
}... | #include <bits/stdc++.h>
using namespace std;
int n, a[40001];
char s[40001];
int s1[40001], s2[40010], s3[40001];
long long ans;
int main() {
scanf("%d", &n);
cin >> s;
for (int i = 0; i < n; ++i) {
if (s[i] == 'R')
a[i + 1] = 1;
else if (s[i] == 'G')
a[i + 1] = 2;
else
a[i + 1] = 3... | replace | 2 | 5 | 2 | 5 | 0 | |
p02714 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(ri, n) for (int ri = (int)(n - 1); ri >= 0; ri--)
#define rep2(i, x, n) for (int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri, x, n) for (int ri = (int)(n - 1); ri >= (int)(x); ri--)
#define repit(itr, x) for (auto itr = x.b... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(ri, n) for (int ri = (int)(n - 1); ri >= 0; ri--)
#define rep2(i, x, n) for (int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri, x, n) for (int ri = (int)(n - 1); ri >= (int)(x); ri--)
#define repit(itr, x) for (auto itr = x.b... | replace | 15 | 16 | 15 | 17 | 0 | |
p02714 | C++ | Time Limit Exceeded | #include <iostream>
#include <string>
using namespace std;
int main() {
int N;
string S;
cin >> N;
cin >> S;
int sum = 0;
for (int i = 1; i < N - 1; i++) {
for (int j = i + 1; j < N; j++) {
if (S[i - 1] != S[j - 1]) {
for (int k = j + 1; k <= N; k++) {
if (S[k - 1] != S[i - 1] &... | #include <iostream>
#include <string>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
int count_r = 0;
int count_g = 0;
int count_b = 0;
for (int i = 0; i < N; i++) {
if (S[i] == 'R') {
count_r++;
}
if (S[i] == 'G') {
count_g++;
}
if (S[i] == 'B') {
... | replace | 7 | 20 | 7 | 28 | TLE | |
p02714 | C++ | Runtime Error | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <tuple>
... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <tuple>
... | insert | 68 | 68 | 68 | 70 | 0 | |
p02714 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <iostream>
#include <limits>
#include <numeric>
#include <type_traits>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define srt(i) sort(i.begin(), i.end())
#define rvt(i) sort(i.begin(), i.end(), greater<int>())
int main() {
int n;
string s;
cin >> ... | #include <bits/stdc++.h>
#include <iostream>
#include <limits>
#include <numeric>
#include <type_traits>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define srt(i) sort(i.begin(), i.end())
#define rvt(i) sort(i.begin(), i.end(), greater<int>())
int main() {
int n;
string s;
cin >> ... | replace | 16 | 26 | 16 | 44 | TLE | |
p02714 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
const long long INF = (long long)1e18... | #include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
const long long INF = (long long)1e18... | replace | 45 | 46 | 45 | 46 | TLE | |
p02714 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
#define ull unsigned long long
#define... | #include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
#define ull unsigned long long
#define... | replace | 125 | 129 | 125 | 151 | TLE | |
p02714 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <limits>
#include <numeric>
#include <stdlib.h>
#include <type_traits>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int c = 0;
for (int i = 0; i < n... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <limits>
#include <numeric>
#include <stdlib.h>
#include <type_traits>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
unsigned long long int c = 0;
lo... | replace | 17 | 25 | 17 | 40 | TLE | |
p02714 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define INF 2e9
#define rep(i, n, m) for (int i = n; i < m; i++)
using namespace std;
int main() {
int n;
string s;
vector<int> R, G, ... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define INF 2e9
#define rep(i, n, m) for (int i = n; i < m; i++)
using namespace std;
int main() {
int n;
string s;
vector<int> R, G, ... | replace | 34 | 43 | 34 | 42 | TLE | |
p02714 | Python | Time Limit Exceeded | N = int(input())
S = input()
ans = 0
for i in range(N - 2):
for j in range(i + 1, N - 1):
if S[j] != S[i]:
for k in range(j + 1, N):
if j - i != k - j and S[k] != S[i] and S[k] != S[j]:
ans += 1
print(ans)
| def main():
N = int(input())
S = input()
ans = S.count("R") * S.count("G") * S.count("B")
for i in range(N):
for d in range(N - 1):
j = i + d
k = j + d
if k < N and S[i] != S[j] and S[j] != S[k] and S[k] != S[i]:
ans -= 1
print(ans)
main(... | replace | 0 | 10 | 0 | 14 | TLE | |
p02714 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<pii> vpii;
... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<pii> vpii;
... | replace | 89 | 179 | 89 | 209 | 0 | |
p02714 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int maxx = 4e3 + 7;
int n;
char s[maxx];
int num[maxx];
vector<int> vec[maxx];
LL cnt[maxx];
bool vis[maxx];
LL chk(int a, int b, int c) {
LL res = 0;
for (int i = 0; i < vec[a].size(); i++) {
for (int j = 0; j < vec[b].size(); j++) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int maxx = 4e3 + 7;
int n;
char s[maxx];
int num[maxx];
vector<int> vec[maxx];
LL cnt[maxx];
bool vis[maxx];
LL chk(int a, int b, int c) {
LL res = 0;
for (int i = 0; i < vec[a].size(); i++) {
for (int j = 1; vec[a][i] + 2 * j <= n; j++)... | replace | 14 | 22 | 14 | 17 | 0 | |
p02714 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
long long ans = 0;
cin >> N;
vector<int> r(0), g(0), b(0);
vector<char> c(N);
for (int i = 0; i < N; i++) {
cin >> c.at(i);
if (c.at(i) == 'R') {
r.push_back(i + 1);
} else if (c.at(i) == ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
long long ans = 0;
cin >> N;
vector<int> r(0), g(0), b(0);
vector<char> c(N);
for (int i = 0; i < N; i++) {
cin >> c.at(i);
if (c.at(i) == 'R') {
r.push_back(i + 1);
} else if (c.at(i) == ... | insert | 29 | 29 | 29 | 32 | 0 | |
p02714 | C++ | Time Limit Exceeded | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <functional>
#include <iomanip>... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <functional>
#include <iomanip>... | replace | 50 | 56 | 50 | 58 | TLE | |
p02714 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
using ll = int64_t;
#define rep(i, n) for (int i = 0; i < ((int)(n)); i++) // 0-indexed昇順
int main() {
int N;
string S;
cin >> N >> S;
vector<int> R;
vector<int> G;
vector<int> B;
rep(i, N) {
switch (S.at(i)) {
case 'R':
R.pu... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
using ll = int64_t;
#define rep(i, n) for (int i = 0; i < ((int)(n)); i++) // 0-indexed昇順
int main() {
int N;
string S;
cin >> N >> S;
vector<int> R;
vector<int> G;
vector<int> B;
rep(i, N) {
switch (S.at(i)) {
case 'R':
R.pu... | replace | 30 | 44 | 30 | 44 | TLE | |
p02714 | C++ | Time Limit Exceeded | #include <algorithm> //sort,二分探索,など
#include <bitset> //固定長bit集合
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#include <functional> //sortのgreater
#include <iomanip> //setprecision(浮動小数点の出力の誤差)
#include <iostream> //入出力
#include <map>... | #include <algorithm> //sort,二分探索,など
#include <bitset> //固定長bit集合
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#include <functional> //sortのgreater
#include <iomanip> //setprecision(浮動小数点の出力の誤差)
#include <iostream> //入出力
#include <map>... | replace | 48 | 82 | 48 | 56 | TLE | |
p02714 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
typedef char SINT8;
typedef short SINT16;
typedef int SINT32;
typedef long long SINT64;
typedef double DOUBLE;
#define MAX(a, b) ((a) > (b) ? ... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
typedef char SINT8;
typedef short SINT16;
typedef int SINT32;
typedef long long SINT64;
typedef double DOUBLE;
#define MAX(a, b) ((a) > (b) ? ... | insert | 98 | 98 | 98 | 103 | 0 | |
p02714 | C++ | Time Limit Exceeded | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bits/stdc++.h> // isupper, islower, isdigit, toupper, tolower
#include <bitset> // bitset
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> ... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bits/stdc++.h> // isupper, islower, isdigit, toupper, tolower
#include <bitset> // bitset
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> ... | replace | 51 | 56 | 51 | 57 | TLE | |
p02714 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int INF = 1000000000;
// long long
using ll = long long;
// 出力系
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
// be... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int INF = 1000000000;
// long long
using ll = long long;
// 出力系
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
// be... | replace | 58 | 71 | 58 | 76 | TLE | |
p02714 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using p = pair<int, int>;
#define INF 1000000000
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repX(i, n, x) for (int i = x; i < (int)(n); i++)
#define repM(i, n) for (int i = n; i > 0; i--)
int main() {
int N;
cin >> N;
string S;... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using p = pair<int, int>;
#define INF 1000000000
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repX(i, n, x) for (int i = x; i < (int)(n); i++)
#define repM(i, n) for (int i = n; i > 0; i--)
int main() {
int N;
cin >> N;
string S;... | replace | 26 | 50 | 26 | 36 | 0 | |
p02714 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define endl '\n'
#define lli long long int
#define rep(i, s, e) for (int i = s; i < e; i++)
int main() {
int N;
cin >> N;
string S;
cin >> S;
vector<int> R, G, B;
rep(i, ... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define endl '\n'
#define lli long long int
#define rep(i, s, e) for (int i = s; i < e; i++)
int main() {
int N;
cin >> N;
string S;
cin >> S;
vector<int> R, G, B;
rep(i, ... | replace | 42 | 49 | 42 | 43 | TLE | |
p02714 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
#define pq priority_queue
using namespace std;
const ll INF = (ll)1e9;
const ll MOD = (ll)1e9 + 7;
const ll MAX = 510000;
vector<int> dx = {1, 0, -1, 0}, dy = {0, 1, 0, -1};
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
retu... | #include <bits/stdc++.h>
#define ll long long
#define pq priority_queue
using namespace std;
const ll INF = (ll)1e9;
const ll MOD = (ll)1e9 + 7;
const ll MAX = 510000;
vector<int> dx = {1, 0, -1, 0}, dy = {0, 1, 0, -1};
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
retu... | replace | 44 | 52 | 44 | 60 | TLE | |
p02714 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
#define mm(a, x) memset(a, x, sizeof(a))
#define sync \
std::ios::sync_with_stdio(false); \
st... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
#define mm(a, x) memset(a, x, sizeof(a))
#define sync \
std::ios::sync_with_stdio(false); \
st... | replace | 12 | 13 | 12 | 13 | 0 | |
p02714 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll M = 1e9 + 7;
const int iinf = 1 << 28;
const long long llinf = 1ll << 60;
const double PI = 3.14159265;
inline int getIdx(char c) {
if (c == 'R')
return 0;
if (c == 'G')
return 1;
return 2;
}
struct S {
vector<int> a;
unord... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll M = 1e9 + 7;
const int iinf = 1 << 28;
const long long llinf = 1ll << 60;
const double PI = 3.14159265;
inline int getIdx(char c) {
if (c == 'R')
return 0;
if (c == 'G')
return 1;
return 2;
}
struct S {
vector<int> a;
int m... | replace | 18 | 19 | 18 | 19 | TLE | |
p02714 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
string s;
cin >> n >> s;
vector<int> r, g, b;
for (int i = 0; i < n; i++) {
if (s.at(i) == 'R')
r.emplace_back(i);
else if (s.at(i) == 'G')
g.emplace_bac... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
string s;
cin >> n >> s;
vector<int> r, g, b;
for (int i = 0; i < n; i++) {
if (s.at(i) == 'R')
r.emplace_back(i);
else if (s.at(i) == 'G')
g.emplace_bac... | insert | 21 | 21 | 21 | 26 | 0 | |
p02714 | C++ | Time Limit Exceeded | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <vector>
// #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr long long int INFLL = ... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <vector>
// #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr long long int INFLL = ... | replace | 304 | 317 | 304 | 326 | TLE | |
p02714 | C++ | Time Limit Exceeded | #define _GLIBCXX_DEBUG
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vec... | #pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<P> VP;
typedef vect... | delete | 0 | 1 | 0 | 0 | TLE | |
p02714 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll, ll>
#define FOR(I, A, B) for (ll I = ll(A); I < ll(B); ++I)
#define FORR(I, A, B) for (ll I = ll((B)-1); I >= ll(A); --I)
#define TO(x, t, f) ((x) ? (t) : (f))
#define SORT(x) (sort(x.begin(), x.end())) // 0 2 2 3 4 5 8 9
#define POS... | #pragma GCC target("avx512f,avx512dq,avx512cd,avx512bw,avx512vl")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll, ll>
#define FOR(I, A, B) for (ll I = ll(A); I < ll(B); ++I)
#define FORR(I, A, B) for (ll I = ll((B)-1... | insert | 0 | 0 | 0 | 4 | TLE | |
p02714 | C++ | Time Limit Exceeded | #include <iostream>
#include <algorithm>
#include <cctype>
#include <cstdio>
#include <cstdlib>
#include <fstream>
#include <iomanip>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <typeinfo>
#include <vector>
#define REP(i, n) for (int i =... | #include <iostream>
#include <algorithm>
#include <cctype>
#include <cstdio>
#include <cstdlib>
#include <fstream>
#include <iomanip>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <typeinfo>
#include <vector>
#define REP(i, n) for (int i =... | replace | 233 | 241 | 233 | 239 | TLE | |
p02714 | C++ | Time Limit Exceeded | #pragma GCC optimize("O3")
#include <algorithm>
#include <chrono>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
constex... | #pragma GCC optimize("O3")
#pragma GCC target("avx,avx2,fma")
#include <algorithm>
#include <chrono>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <unordered_map>
#include <unord... | insert | 1 | 1 | 1 | 2 | TLE | |
p02714 | C++ | Time Limit Exceeded | /**
* author : 𝒌𝒚𝒐𝒎𝒖𝒌𝒚𝒐𝒎𝒖𝒑𝒖𝒓𝒊𝒏
* created : 2020-04-13 12:11:29
**/
// #pragma GCC target("avx512f,avx512dq,avx512cd,avx512bw,avx512vl")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <c... | /**
* author : 𝒌𝒚𝒐𝒎𝒖𝒌𝒚𝒐𝒎𝒖𝒑𝒖𝒓𝒊𝒏
* created : 2020-04-13 12:11:29
**/
#pragma GCC target("avx512f,avx512dq,avx512cd,avx512bw,avx512vl")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>... | replace | 5 | 8 | 5 | 8 | TLE | |
p02714 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
#define ll long long
int n;
char s[2005];
int num[2005];
ll a, b, c, ans;
int main() {
scanf("%d", &n);
scanf("%s", s);
for (int i = 1; i <= n; i++) {
if (s[i - 1] == 'R') {
num[i] = 0;
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
#define ll long long
int n;
char s[4005];
int num[4005];
ll a, b, c, ans;
int main() {
scanf("%d", &n);
scanf("%s", s);
for (int i = 1; i <= n; i++) {
if (s[i - 1] == 'R') {
num[i] = 0;
... | replace | 8 | 10 | 8 | 10 | 0 | |
p02714 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, a, b) for (int i = a; i < b; ++i)
using namespace std;
using ll = long long;
int main() {
int N;
string S;
cin >> N >> S;
ll ans = 0;
FOR(i, 0, N - 2) FOR(j, i + 1, N - 1) FOR(k, j + 1, N) {
if (j - i != k - j && S[i] !... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, a, b) for (int i = a; i < b; ++i)
using namespace std;
using ll = long long;
int main() {
int N;
string S;
cin >> N >> S;
vector<ll> cnt(3);
rep(i, N) {
if (S[i] == 'R')
cnt[0] += 1;
if (S[i] == 'G')
cnt... | replace | 10 | 14 | 10 | 26 | TLE | |
p02714 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define vi vector<int>
#define all(x) (x).begin(), (x).end()
#define INF (1 << 30) - 1
using ll = long long;
using namespace std;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <c... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define vi vector<int>
#define all(x) (x).begin(), (x).end()
#define INF (1 << 30) - 1
using ll = long long;
using namespace std;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <c... | replace | 27 | 39 | 27 | 45 | TLE | |
p02714 | C++ | Time Limit Exceeded | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repe(i, n) for (int i = 0; i <= (n); ++i)
#define repe1(i, n) for (int i = 0; i <= (n); ++i)
#define all(x) (x).begin(), (x).end()
#define pb(x) push_back(x)
#define eb(k, v) emplace_back... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repe(i, n) for (int i = 0; i <= (n); ++i)
#define repe1(i, n) for (int i = 0; i <= (n); ++i)
#define all(x) (x).begin(), (x).end()
#define pb(x) push_back(x)
#define eb(k, v) emplace_back... | replace | 39 | 46 | 39 | 53 | TLE | |
p02714 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int mod = 1e+9 + 7;
// マクロ
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)
#define FORD(i, a, b) for (ll i ... | #include <algorithm> //sort,二分探索,など
#include <bitset> //固定長bit集合
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#include <functional> //sortのgreater
#include <iomanip> //setprecision(浮動小数点の出力の誤差)
#include <iostream> //入出力
#include <map>... | replace | 0 | 1 | 0 | 18 | TLE | |
p02714 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int(i) = 0; i < (n); i++)
#define REP(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define INF INT_MAX
#define MOD 1000000007
#define fcout cout << fixed << setprecision(15)
#define ... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int(i) = 0; i < (n); i++)
#define REP(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define INF INT_MAX
#define MOD 1000000007
#define fcout cout << fixed << setprecision(15)
#define ... | replace | 63 | 70 | 63 | 73 | TLE | |
p02714 | C++ | Time Limit Exceeded | // g++ .cpp && ./a.out
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef pair<int, int> p;
typedef long long ll;
const int mod = 1000000007;
const int inf = 1000000007;
int main() {
int n;
string s;
cin >> n >> s;
int cnt = 0;
for (int i = 0; i < n - 2; i... | // g++ .cpp && ./a.out
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef pair<int, int> p;
typedef long long ll;
const int mod = 1000000007;
const int inf = 1000000007;
int main() {
int n;
string s;
cin >> n >> s;
ll cnt = 0;
vector<ll> cntR(n);
vector<... | replace | 15 | 21 | 15 | 61 | TLE | |
p02714 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (in... | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (in... | delete | 89 | 97 | 89 | 89 | TLE | |
p02714 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
#define hhh cerr << "hhh" << endl
#define see(x) cerr << (#x) << '=' << (x) << endl
using namespace std;
typedef long long ll;
typedef pair<int, int> pr;
inline int read() {
int x = 0, f = 1;
char c = getchar();
while (c != '-' && (c < '0' || c > '9'))
c = getchar();
if (c == '-')
... | #include "bits/stdc++.h"
#define hhh cerr << "hhh" << endl
#define see(x) cerr << (#x) << '=' << (x) << endl
using namespace std;
typedef long long ll;
typedef pair<int, int> pr;
inline int read() {
int x = 0, f = 1;
char c = getchar();
while (c != '-' && (c < '0' || c > '9'))
c = getchar();
if (c == '-')
... | replace | 33 | 34 | 33 | 34 | TLE | |
p02714 | C++ | Runtime Error | #pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (int)(b); i++)
#define FORD(i, a, b) for (int i = a; i > (int)(b); i--)
#define PPC(x) __builtin_popcount(x)
#define SZ(x) ((int)(x).size())
#define pb push_back
#define ALL(x) (x).begin(), (x).en... | #pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (int)(b); i++)
#define FORD(i, a, b) for (int i = a; i > (int)(b); i--)
#define PPC(x) __builtin_popcount(x)
#define SZ(x) ((int)(x).size())
#define pb push_back
#define ALL(x) (x).begin(), (x).en... | replace | 22 | 23 | 22 | 23 | 0 | |
p02714 | C++ | Runtime Error | /*
Coded and Decoded by : Yash Kapoor
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define pf push_front
#define mp make_pair
#define pll pair<ll, ll>
#define vl vector<ll>
#define sl set<ll>
#define vll vector<pll>
#define ml map<ll, ll>
#define m... | /*
Coded and Decoded by : Yash Kapoor
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define pf push_front
#define mp make_pair
#define pll pair<ll, ll>
#define vl vector<ll>
#define sl set<ll>
#define vll vector<pll>
#define ml map<ll, ll>
#define m... | insert | 91 | 91 | 91 | 92 | 0 | |
p02714 | C++ | Runtime Error | #include <cstring>
#include <iostream>
using namespace std;
typedef long long ll;
const int N = 4e3 + 7;
char s[N];
int a[N];
int b[N];
int c[N];
int main() {
memset(a, 0, sizeof a);
memset(b, 0, sizeof b);
memset(c, 0, sizeof c);
int n;
ll ans = 0;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> s[i];
... | #include <cstring>
#include <iostream>
using namespace std;
typedef long long ll;
const int N = 1e4 + 7;
char s[N];
int a[N];
int b[N];
int c[N];
int main() {
memset(a, 0, sizeof a);
memset(b, 0, sizeof b);
memset(c, 0, sizeof c);
int n;
ll ans = 0;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> s[i];
... | replace | 4 | 5 | 4 | 5 | 0 | |
p02714 | C++ | Runtime Error | #include <bits/stdc++.h>
#define mem(a, b) memset(a, b, sizeof(a))
#define inf 0x3f3f3f3f
#define ll long long
#define pb push_back
#define PII pair<int, int>
#define X first
#define Y second
#define MP make_pair
#define PI acos(-1.0)
#define eps 1e-8
const int maxn = 5e4 + 10;
const int maxm = 1.5e7 + 10;
const int mo... | #include <bits/stdc++.h>
#define mem(a, b) memset(a, b, sizeof(a))
#define inf 0x3f3f3f3f
#define ll long long
#define pb push_back
#define PII pair<int, int>
#define X first
#define Y second
#define MP make_pair
#define PI acos(-1.0)
#define eps 1e-8
const int maxn = 5e4 + 10;
const int maxm = 1.5e7 + 10;
const int mo... | replace | 41 | 43 | 41 | 44 | TLE | |
p02714 | C++ | Time Limit Exceeded | /* #region Head */
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll, ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vc<vc<T>>;
using vll = vc<ll>;
using vvll = vvc<ll>;
using vld = vc<ld>;
usin... | /* #region Head */
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll, ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vc<vc<T>>;
using vll = vc<ll>;
using vvll = vvc<ll>;
using vld = vc<ld>;
usin... | replace | 169 | 175 | 169 | 189 | TLE | |
p02714 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main(void) {
// Your code here
int N;
string S;
int i;
long long r = 0, g = 0, b = 0;
long long x = 0, y = 0, z = 0;
cin >> N >> S;
for (i = 0; i < N; i++) {
if (S.at(i) == 'R')
r++;
if (S.at(i) == 'G')
g++;
if (S.at(i) == 'B'... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
// Your code here
int N;
string S;
int i;
long long r = 0, g = 0, b = 0;
long long x = 0, y = 0, z = 0;
cin >> N >> S;
for (i = 0; i < N; i++) {
if (S.at(i) == 'R')
r++;
if (S.at(i) == 'G')
g++;
if (S.at(i) == 'B'... | replace | 28 | 30 | 28 | 30 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::at: __n (which is 4) >= this->size() (which is 4)
|
p02714 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <cfenv>
#include <cmath>
#include <deque>
#include <forward_list>
#include <fstream>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <ostream>
#include... | #include <algorithm>
#include <array>
#include <cfenv>
#include <cmath>
#include <deque>
#include <forward_list>
#include <fstream>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <ostream>
#include... | replace | 52 | 54 | 52 | 56 | 0 | |
p02714 | C++ | Runtime Error | /***
***Fresher***
Md Mahfujur Rahman Khan
Dept. of CSE
CSE-28 Batch
JU-48 Batch
Jahangirnagar University
***/
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <... | /***
***Fresher***
Md Mahfujur Rahman Khan
Dept. of CSE
CSE-28 Batch
JU-48 Batch
Jahangirnagar University
***/
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <... | replace | 163 | 164 | 163 | 164 | 0 | |
p02714 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int pan(char a, char b, char c) {
if (a != b && b != c && c != a)
return 1;
return 0;
}
int main() {
int n;
cin >> n;
char a[n];
cin >> a;
long long cnt = 0;
for (int i = 0; i < n - 2; i++) {
for (int j = 1; j + i < n - 1; j++) {
for (int x = 1... | #include <bits/stdc++.h>
using namespace std;
int pan(char a, char b, char c) {
if (a != b && b != c && c != a)
return 1;
return 0;
}
int main() {
int n;
cin >> n;
char a[n];
cin >> a;
long long cnt = 0;
int x = 0, y = 0, z = 0;
for (int i = 0; i < n; i++) {
if (a[i] == 'R')
x++;
if ... | replace | 13 | 19 | 13 | 27 | TLE | |
p02714 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
typedef long long ll;
int main() {
ll n;
cin >> n;
string s;
cin >> s;
if (n <= 3) {
cout << 0 << endl;
return 0;
}
vector<ll> r, g, b;
rep(i, 0, n) {
if (s[i] == 'R')
r.push_back(... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
typedef long long ll;
int main() {
ll n;
cin >> n;
string s;
cin >> s;
if (n <= 3) {
cout << 0 << endl;
return 0;
}
vector<ll> r, g, b;
rep(i, 0, n) {
if (s[i] == 'R')
r.push_back(... | insert | 22 | 22 | 22 | 26 | 0 | |
p02714 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
int n;
string s;
cin >> n >> s;
... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
int n;
string s;
cin >> n >> s;
... | replace | 21 | 30 | 21 | 27 | TLE | |
p02714 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 4e3 + 5;
int main() {
ll i, j, k, n, sum[maxn][3] = {0}, ans = 0;
char s[maxn];
scanf("%d%s", &n, s + 1);
for (i = n; i >= 1; i--) {
sum[i][0] = sum[i + 1][0];
sum[i][1] = sum[i + 1][1];
sum[i][2] = sum[i + 1][2];
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 9;
int main() {
ll i, j, k, n, sum[maxn][3] = {0}, ans = 0;
char s[maxn];
scanf("%d%s", &n, s + 1);
for (i = n; i >= 1; i--) {
sum[i][0] = sum[i + 1][0];
sum[i][1] = sum[i + 1][1];
sum[i][2] = sum[i + 1][2];
... | replace | 3 | 4 | 3 | 4 | 0 | |
p02714 | C++ | Time Limit Exceeded | #include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
string x, y, z;
long long ans = 0;
for (int i = 0; i < n - 2; i++) {
x = s[i];
for (int j = i + 1; j < n - 1; j++) {
y = s[j];
if (y == x)
continue;
for (int k =... | #include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
string x, y, z;
long long r = 0;
long long g = 0;
long long b = 0;
for (int i = 0; i < n; i++) {
if (s[i] == 'R')
r++;
if (s[i] == 'G')
g++;
if (s[i] == 'B')
b++... | replace | 11 | 24 | 11 | 29 | TLE | |
p02714 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int R[1001] = {};
int G[1001] = {};
int B[1001] = {};
int Rcnt = 0;
int Gcnt = 0;
int Bcnt = 0;
string s;
cin >> s;
long long int ans = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'R') {
R[i] = 1;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int R[4001] = {};
int G[4001] = {};
int B[4001] = {};
int Rcnt = 0;
int Gcnt = 0;
int Bcnt = 0;
string s;
cin >> s;
long long int ans = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'R') {
R[i] = 1;
... | replace | 6 | 9 | 6 | 9 | 0 | |
p02714 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define vl vector<ll>
int main() {
int N;
string S;
cin >> N >> S;
ll ans = 0;
for (int i = 0; i < N - 2; i++) {
for (int j = i + 1; j < N - 1; j++) {
for (int k = j + 1; k < N; k++) {
if (S[i] != S[j] && S[j] != S[k] ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define vl vector<ll>
int main() {
int N;
string S;
cin >> N >> S;
ll ans = 0;
ll r = 0;
ll g = 0;
ll b = 0;
for (int i = 0; i < N; ++i) {
if (S[i] == 'R')
r++;
if (S[i] == 'G')
g++;
if (S[i] == 'B')
... | replace | 12 | 18 | 12 | 33 | TLE | |
p02714 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define l_ength size
const int inf = (1 << 30);
const int mod = 1000000007; // 998244353
using ll = long long;
using namespace std;
const int red = 1, green = 2, blue = 4;
ll sum[10][4010];
int main() {
int n;
cin >> n;
string s;
cin >> s;
vector<int> seq;
for (char c : s) {
... | #include <bits/stdc++.h>
#define l_ength size
const int inf = (1 << 30);
const int mod = 1000000007; // 998244353
using ll = long long;
using namespace std;
const int red = 1, green = 2, blue = 4;
ll sum[10][4010];
int main() {
int n;
cin >> n;
string s;
cin >> s;
vector<int> seq;
for (char c : s) {
... | replace | 26 | 27 | 26 | 27 | TLE | |
p02714 | C++ | Runtime Error | #include <bits/stdc++.h>
#ifndef ONLINE_JUDGE
#define LOG(x) (cerr << #x << " = " << (x) << endl)
#else
#define LOG(x) 0
#endif
#define pb push_back
#define mod 1000000007
#define endl '\n'
typedef int integer;
#define int long long
using namespace std;
int powmod(int a, int b) {
int res = 1;
a %= mod;
assert(b... | #include <bits/stdc++.h>
#ifndef ONLINE_JUDGE
#define LOG(x) (cerr << #x << " = " << (x) << endl)
#else
#define LOG(x) 0
#endif
#define pb push_back
#define mod 1000000007
#define endl '\n'
typedef int integer;
#define int long long
using namespace std;
int powmod(int a, int b) {
int res = 1;
a %= mod;
assert(b... | replace | 31 | 32 | 31 | 32 | 0 | |
p02714 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string S;
cin >> S;
int ans = 0;
for (int l = 0; l < N - 2; l++) {
for (int i = l + 1; i < N - 1; i++) {
for (int r = i + 1; r < N; r++) {
if (i - l != r - i) {
if (S[l] != S[i] && S[i] != S[r] && S[r] !=... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string S;
cin >> S;
map<char, long int> count;
for (int i = 0; i < N; i++)
count[S[i]] += 1;
long int ans = count['R'] * count['G'] * count['B'];
for (int i = 1; i < N - 1; i++) {
for (int r = 1; r <= min(i, N - 1 - i); ... | replace | 7 | 16 | 7 | 15 | TLE | |
p02714 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define per(i, a, n) for (ll i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define LONGMAX 1e18
#define INTMAX 1000000000
using namespace ... | #include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define per(i, a, n) for (ll i = n - 1; i >= a; i--)
#define fill0(n) setfill('0') << right << setw(n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define LONGMAX 1e18
#define INTMAX 1000000000
using namespace ... | replace | 19 | 20 | 19 | 20 | 0 | |
p02714 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 5;
typedef long long ll;
int main() {
ll N;
cin >> N;
string s;
cin >> s;
ll r = 0, g = 0, b = 0;
for (int i = 0; i < N; i++) {
if (s[i] == 'R') {
r++;
} else if (s[i] == 'G') {
g++;
} else {
b++;
}
}
... | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 5;
typedef long long ll;
int main() {
ll N;
cin >> N;
string s;
cin >> s;
ll r = 0, g = 0, b = 0;
for (int i = 0; i < N; i++) {
if (s[i] == 'R') {
r++;
} else if (s[i] == 'G') {
g++;
} else {
b++;
}
}
... | replace | 23 | 31 | 23 | 31 | TLE | |
p02714 | C++ | Runtime Error | // Author: Mostafa Mounir Shehab
#include <bits/stdc++.h>
using namespace std;
#define PI 3.14159265 // PI = acos(-1)
#define EPS (1e-10)
#define endl "\n"
#define SZ(v) (int)(v.size())
typedef long long ll;
typedef long double ld;
// template <class Type>
void Fast() {
std::ios_base::sync_with_stdio(0);
c... | // Author: Mostafa Mounir Shehab
#include <bits/stdc++.h>
using namespace std;
#define PI 3.14159265 // PI = acos(-1)
#define EPS (1e-10)
#define endl "\n"
#define SZ(v) (int)(v.size())
typedef long long ll;
typedef long double ld;
// template <class Type>
void Fast() {
std::ios_base::sync_with_stdio(0);
c... | replace | 32 | 33 | 32 | 33 | 0 | |
p02714 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
string s;
cin >> s;
map<char, vector<ll>> ind;
for (ll i = 0; i < n; i++) {
ind[s[i]].push_back(i);
}
ll ans = 0;
for (ll i = 0; i < n; i++) {
for (ll j = i + 1; j < n; j++) {
if (s[i] ==... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
string s;
cin >> s;
map<char, vector<ll>> ind;
for (ll i = 0; i < n; i++) {
ind[s[i]].push_back(i);
}
ll ans = 0;
for (ll i = 0; i < n; i++) {
for (ll j = i + 1; j < n; j++) {
if (s[i] ==... | replace | 27 | 29 | 27 | 29 | 0 | |
p02714 | C++ | Time Limit Exceeded | #include <iostream>
#include <unordered_set>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
long long res = 0;
unordered_set<int> r, g, b;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'R')
r.insert(i);
else if (s[i] == 'G')
g.insert(i);
else
b.insert(i... | #include <iostream>
#include <unordered_set>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
long long res = 0;
unordered_set<int> r, g, b;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'R')
r.insert(i);
else if (s[i] == 'G')
g.insert(i);
else
b.insert(i... | replace | 22 | 28 | 22 | 29 | TLE | |
p02714 | C++ | Runtime Error | /*
* Matheus Oliveira
* 09:20:02 12/04/2020
* d.cpp
*/
#include <bits/stdc++.h>
using namespace std;
#define EPS
#define INF
#define MAXN 4040
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define sc(x) scanf("%d", &x);
#define sc2(x, y) scanf("%d %d", &x, &y... | /*
* Matheus Oliveira
* 09:20:02 12/04/2020
* d.cpp
*/
#include <bits/stdc++.h>
using namespace std;
#define EPS
#define INF
#define MAXN 14040
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define sc(x) scanf("%d", &x);
#define sc2(x, y) scanf("%d %d", &x, &... | replace | 11 | 12 | 11 | 12 | 0 | |
p02714 | C++ | Time Limit Exceeded | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
int main() {
using namespace std;
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, sum;
long long count = 0;
string s;
vector<int> r, g, b;
cin >> n >> s;
for (int i = 0; i <= n; i++) {
switch (s[i]) {
case 'R':
r.push_back(i +... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
int main() {
using namespace std;
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, sum;
long long count = 0;
string s;
vector<int> r, g, b;
cin >> n >> s;
for (int i = 0; i <= n; i++) {
switch (s[i]) {
case 'R':
r.push_back(i +... | replace | 31 | 38 | 31 | 32 | TLE | |
p02714 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int64_t pairs(string s, int n) {
int64_t sum = 0;
int64_t r = 0;
int64_t g = 0;
int64_t b = 0;
for (int i = 0; i < n; i++) {
if (s.at(i) == 'R') {
r++;
} else if (s.at(i) == 'G') {
g++;
} else if (s.at(i) == 'B') {
b++;
}
}
... | #include <bits/stdc++.h>
using namespace std;
int64_t pairs(string s, int n) {
int64_t sum = 0;
int64_t r = 0;
int64_t g = 0;
int64_t b = 0;
for (int i = 0; i < n; i++) {
if (s.at(i) == 'R') {
r++;
} else if (s.at(i) == 'G') {
g++;
} else if (s.at(i) == 'B') {
b++;
}
}
... | replace | 22 | 23 | 22 | 23 | 0 | |
p02714 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i < (n); i++)
typedef long long ll;
int main() {
int n;
cin >> n;
string s;
cin >> s;
vector<int> r(0), g(0), b(0);
rep(i, n) {
if (s[i] == 'R')
r.push_back(i);
if ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i < (n); i++)
typedef long long ll;
int main() {
int n;
cin >> n;
string s;
cin >> s;
vector<int> r(0), g(0), b(0);
rep(i, n) {
if (s[i] == 'R')
r.push_back(i);
if ... | replace | 20 | 31 | 20 | 34 | TLE | |
p02714 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
/*
R=0
G=1
B=2
*/
int main() {
int n;
string ss;
cin >> n >> ss;
long long ans = 0;
int f[402][3] = {0};
for (int i = ss.length() - 1; i >= 0; i--) {
if (ss[i] == 'R') {
f[i][0] = f[i + 1][0] + 1;
f[i][1] = f[i + 1][1];
f[i][2] = f[i + 1][... | #include <bits/stdc++.h>
using namespace std;
/*
R=0
G=1
B=2
*/
int main() {
int n;
string ss;
cin >> n >> ss;
long long ans = 0;
int f[4002][3] = {0};
for (int i = ss.length() - 1; i >= 0; i--) {
if (ss[i] == 'R') {
f[i][0] = f[i + 1][0] + 1;
f[i][1] = f[i + 1][1];
f[i][2] = f[i + 1]... | replace | 13 | 14 | 13 | 14 | 0 | |
p02714 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve(long long N, std::string S) {
ll R = 0, G = 0, B = 0;
for (auto ch : S) {
if (ch == 'R') {
R++;
}
if (ch == 'G') {
G++;
}
if (ch == 'B') {
B++;
}
}
ll Rl = 0, Gl = 0, Bl = 0;
ll ans = 0;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve(long long N, std::string S) {
ll R = 0, G = 0, B = 0;
for (auto ch : S) {
if (ch == 'R') {
R++;
}
if (ch == 'G') {
G++;
}
if (ch == 'B') {
B++;
}
}
ll Rl = 0, Gl = 0, Bl = 0;
ll ans = 0;
... | delete | 51 | 54 | 51 | 51 | 0 | |
p02714 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
string s;
cin >> s;
vector<int> r;
vector<int> g;
vector<int> b;
for (int i = 0; i < N; i++) {
if (s[i] == 'R')
r.push_back(i);
if (s[i] == 'G')
g.push_back(i);
if (s[i] == 'B')
b.push_back(i)... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
string s;
cin >> s;
vector<int> r;
vector<int> g;
vector<int> b;
for (int i = 0; i < N; i++) {
if (s[i] == 'R')
r.push_back(i);
if (s[i] == 'G')
g.push_back(i);
if (s[i] == 'B')
b.push_back(i)... | replace | 26 | 36 | 26 | 34 | TLE | |
p02714 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
bool c[4002];
int main() {
ll n;
cin >> n;
string s;
cin >> s;
ll R = 0, B = 0, G = 0;
vector<ll> a, b;
for (ll i = 0; i < n; i++) {
if (s[i] == 'B') {
c[i] = true;
} else if (s[... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
bool c[20002];
int main() {
ll n;
cin >> n;
string s;
cin >> s;
ll R = 0, B = 0, G = 0;
vector<ll> a, b;
for (ll i = 0; i < n; i++) {
if (s[i] == 'B') {
c[i] = true;
} else if (s... | replace | 5 | 6 | 5 | 6 | 0 | |
p02714 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define pb push_back
#define SPEED \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define pb push_back
#define SPEED \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | replace | 17 | 18 | 17 | 18 | 0 | |
p02714 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = vector<string>;
#define all(v) v.begin(), v.end()
#define rep(i, n) for (ll i = 0; i < n;... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = vector<string>;
#define all(v) v.begin(), v.end()
#define rep(i, n) for (ll i = 0; i < n;... | replace | 47 | 61 | 47 | 56 | TLE | |
p02714 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
#define FOR(i, s, n) for (int i = (s); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i... | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
#define FOR(i, s, n) for (int i = (s); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i... | replace | 33 | 34 | 33 | 34 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.