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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02630 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
const ll mod = 1000000007;
const ll INF = 1e+14;
#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++)
#de... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
const ll mod = 1000000007;
const ll INF = 1e+14;
#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++)
#de... | replace | 18 | 19 | 18 | 19 | 0 | |
p02630 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n, a, sum, num[20], q, b;
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> a, sum += a, num[a]++;
cin >> q;
for (int i = 0; i < q; i++) {
cin >> a >> b;
sum += (b - a) * num[a];
num[b] += num[a];
num[a] = 0;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 10;
ll n, a, sum, num[N], q, b;
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> a, sum += a, num[a]++;
cin >> q;
for (int i = 0; i < q; i++) {
cin >> a >> b;
sum += (b - a) * num[a];
num[b] += num[a... | replace | 3 | 5 | 3 | 5 | 0 | |
p02630 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(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()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
typedef long long ll;
int main(void) {
int n;
cin >> n;... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define RREP(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()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
typedef long long ll;
int main(void) {
int n;
cin >> n;... | replace | 12 | 13 | 12 | 13 | 0 | |
p02630 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int64_t> a(10001, 0);
int64_t sum = 0;
for (int i = 0; i < n;
i++) { // 1~10000の各数を数列がそれぞれいくつ含むかを調べるための配列
int x;
cin >> x;
a.at(x)++;
sum += x; // 数列の和
}
int q;
cin >> q;
vector<int64_t> answer... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int64_t> a(100001, 0);
int64_t sum = 0;
for (int i = 0; i < n;
i++) { // 1~10000の各数を数列がそれぞれいくつ含むかを調べるための配列
int x;
cin >> x;
a.at(x)++;
sum += x; // 数列の和
}
int q;
cin >> q;
vector<int64_t> answe... | replace | 7 | 8 | 7 | 8 | 0 | |
p02630 | C++ | Runtime Error | // SMOKE SHISHA PLAY FIFA //
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define pll ... | // SMOKE SHISHA PLAY FIFA //
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define pll ... | replace | 38 | 39 | 38 | 39 | 0 | |
p02630 | C++ | Runtime Error | #include <iostream>
#include <vector>
typedef long long ll;
using namespace std;
int main(void) {
ll N;
cin >> N;
vector<ll> vc(100000, 0);
ll total = 0;
for (ll i = 0; i < N; i++) {
ll A;
cin >> A;
vc.at(A) += 1;
total += A;
}
int Q;
cin >> Q;
for (int i = 1; i <= Q; i++) {
ll B,... | #include <iostream>
#include <vector>
typedef long long ll;
using namespace std;
int main(void) {
ll N;
cin >> N;
vector<ll> vc(100001, 0);
ll total = 0;
for (ll i = 0; i < N; i++) {
ll A;
cin >> A;
vc.at(A) += 1;
total += A;
}
int Q;
cin >> Q;
for (int i = 1; i <= Q; i++) {
ll B,... | replace | 8 | 9 | 8 | 9 | 0 | |
p02630 | Python | Runtime Error | import sys
from collections import Counter
input = sys.stdin.readline
N = int(input())
alist = list(map(int, input().split()))
Q = int(input())
sumA = sum(alist)
adict = Counter(alist)
for _ in range(Q):
b, c = map(int, input().split())
bnum = adict.pop(b)
if c in adict:
adict[c] += bnum
... | import sys
from collections import Counter
input = sys.stdin.readline
N = int(input())
alist = list(map(int, input().split()))
Q = int(input())
sumA = sum(alist)
adict = Counter(alist)
for _ in range(Q):
b, c = map(int, input().split())
if b not in adict:
print(sumA)
continue
bnum = ... | insert | 17 | 17 | 17 | 21 | 0 | |
p02630 | Python | Runtime Error | N = int(input())
A = list(map(int, input().split()))
ans = 0
n = [0] * 10005
for i in range(N):
n[A[i]] += 1
ans += A[i]
Q = int(input())
for i in range(Q):
b, c = map(int, input().split())
ans += c * n[b] - b * n[b]
print(ans)
n[c] += n[b]
n[b] = 0
| N = int(input())
A = list(map(int, input().split()))
ans = 0
n = [0] * 100005
for i in range(N):
n[A[i]] += 1
ans += A[i]
Q = int(input())
for i in range(Q):
b, c = map(int, input().split())
ans += c * n[b] - b * n[b]
print(ans)
n[c] += n[b]
n[b] = 0
| replace | 4 | 5 | 4 | 5 | 0 | |
p02630 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> A(n);
vector<long long> f(n, 0);
long long sum = 0;
for (int i = 0; i < n; i++) {
cin >> A[i];
sum += A[i];
f[A[i]]++;
}
int Q;
cin >> Q;
while (Q--) {
int b, c;
cin >> b >> c;
int diff =... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> A(n);
vector<long long> f(1e5 + 1, 0);
long long sum = 0;
for (int i = 0; i < n; i++) {
cin >> A[i];
sum += A[i];
f[A[i]]++;
}
int Q;
cin >> Q;
while (Q--) {
int b, c;
cin >> b >> c;
int ... | replace | 7 | 8 | 7 | 8 | 0 | |
p02630 | Python | Runtime Error | from collections import Counter
N = int(input())
A = list(map(int, input().split()))
Q = int(input())
B = []
C = []
for _ in range(Q):
b, c = map(int, input().split())
B.append(b)
C.append(c)
counter = Counter(A)
ans = 0
for num, count in counter.items():
ans += num * count
for i in range(Q):
if ... | from collections import Counter
N = int(input())
A = list(map(int, input().split()))
Q = int(input())
B = []
C = []
for _ in range(Q):
b, c = map(int, input().split())
B.append(b)
C.append(c)
counter = Counter(A)
ans = 0
for num, count in counter.items():
ans += num * count
for i in range(Q):
if ... | replace | 20 | 21 | 20 | 21 | TypeError: unhashable type: 'list' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02630/Python/s734232725.py", line 21, in <module>
counter[C[i]] = counter[C[i]] + counter.pop([B[i]])
TypeError: unhashable type: 'list'
|
p02630 | Python | Runtime Error | n = int(input())
a = list(map(int, input().split()))
mx = max(a)
table = [0] * (mx + 1)
for i in a:
table[i] += 1
q = int(input())
total = sum(a)
for i in range(q):
(
b,
c,
) = map(int, input().split())
total -= table[c] * c + table[b] * b
table[c] += table[b]
table[b] = 0
... | n = int(input())
a = list(map(int, input().split()))
mx = 10**5
table = [0] * (mx + 1)
for i in a:
table[i] += 1
q = int(input())
total = sum(a)
for i in range(q):
(
b,
c,
) = map(int, input().split())
total -= table[c] * c + table[b] * b
table[c] += table[b]
table[b] = 0
t... | replace | 3 | 4 | 3 | 4 | 0 | |
p02630 | Python | Runtime Error | from collections import defaultdict
N = int(input())
_A = [*map(int, input().split())]
Q = int(input())
val = [[*map(int, line.split())] for line in open(0)]
A = defaultdict(int)
for _a in _A:
A[_a] += 1
ans = sum(_A)
for v in val:
if v[0] in A.keys():
num = A[v[0]]
A[v[0]] = 0
A[v[1]... | from collections import defaultdict
N, _A, Q, *val = [[*map(int, line.split())] for line in open(0)]
N = N[0]
Q = Q[0]
A = defaultdict(int)
for _a in _A:
A[_a] += 1
ans = sum(_A)
for v in val:
if v[0] in A.keys():
num = A[v[0]]
A[v[0]] = 0
A[v[1]] += num
ans += (v[1] - v[0]) *... | replace | 2 | 6 | 2 | 5 | 0 | |
p02630 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
#define ll long long
using namespace std;
#define MAX 10005
int main() {
vector<int> l(MAX);
int n;
ll ans = 0;
cin >> n;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
l[a]++;
ans += a;
}
ll ... | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
#define ll long long
using namespace std;
#define MAX 100005
int main() {
vector<int> l(MAX);
int n;
ll ans = 0;
cin >> n;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
l[a]++;
ans += a;
}
ll... | replace | 8 | 9 | 8 | 9 | 0 | |
p02630 | Python | Time Limit Exceeded | N = int(input())
A = list(map(int, input().split()))
Q = int(input())
for i in range(Q):
B, C = map(int, input().split())
for i in range(N):
if A[i] == B:
A[i] = C
print(sum(A))
| from collections import Counter
n = int(input())
a = list(map(int, input().split()))
q = int(input())
cnt = Counter(a)
s = sum(a)
for i in range(q):
b, c = map(int, input().split())
s = s - b * cnt[b]
s = s + c * cnt[b]
cnt[c] += cnt[b]
cnt[b] = 0
print(s)
| replace | 0 | 9 | 0 | 17 | TLE | |
p02630 | Python | Runtime Error | N = int(input())
A = list(map(int, input().split(" ")))
Q = int(input())
BC = [list(map(int, list(input().split(" ")))) for i in range(Q)]
count = [0] * 10**5 + 5
for i in range(N):
count[A[i]] += 1
s = sum(A)
for i in range(Q):
s = s - BC[i][0] * count[BC[i][0]] + BC[i][1] * count[BC[i][0]]
count[BC[i][1... | N = int(input())
A = list(map(int, input().split(" ")))
Q = int(input())
BC = [list(map(int, list(input().split(" ")))) for i in range(Q)]
count = [0] * (10**5 + 5)
for i in range(N):
count[A[i]] += 1
s = sum(A)
for i in range(Q):
s = s - BC[i][0] * count[BC[i][0]] + BC[i][1] * count[BC[i][0]]
count[BC[i]... | replace | 5 | 6 | 5 | 6 | TypeError: can only concatenate list (not "int") to list | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02630/Python/s562064312.py", line 6, in <module>
count = [0] * 10**5 + 5
TypeError: can only concatenate list (not "int") to list
|
p02630 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long a[7001];
int main() {
long long n;
cin >> n;
long long s = 0;
for (int i = 1; i <= n; i++) {
long long o;
cin >> o;
a[o]++;
s += o;
}
int m;
cin >> m;
for (int i = 1; i <= m; i++) {
long long x, y;
cin >> x >> y;
s += (y... | #include <bits/stdc++.h>
using namespace std;
int a[100001];
int main() {
long long n;
cin >> n;
long long s = 0;
for (int i = 1; i <= n; i++) {
long long o;
cin >> o;
a[o]++;
s += o;
}
int m;
cin >> m;
for (int i = 1; i <= m; i++) {
long long x, y;
cin >> x >> y;
s += (y - x... | replace | 2 | 3 | 2 | 3 | 0 | |
p02630 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
using ll = long long;
#define rep(i, a, b) for (ll i = a; i < ll(b); i++)
#define repr(i, a, b) for (ll i = a; i >= ll(b); i--)
#define endl "\n"
#define ALL(x) x.begin(), x.end()
#define ALLR(x) x.rbegin(), x.rend()
using namespace std;
int N, Q, p[100010], b[100010], c[10010];
l... | #include <cstdio>
#include <iostream>
using ll = long long;
#define rep(i, a, b) for (ll i = a; i < ll(b); i++)
#define repr(i, a, b) for (ll i = a; i >= ll(b); i--)
#define endl "\n"
#define ALL(x) x.begin(), x.end()
#define ALLR(x) x.rbegin(), x.rend()
using namespace std;
int N, Q, p[100010], b[100010], c[100010];
... | replace | 10 | 11 | 10 | 11 | 0 | |
p02630 | C++ | Time Limit Exceeded | #include <iostream>
#include <unordered_map>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
long long int sum = 0;
unordered_map<int, int> m;
for (int i = 0; i < n; i++) {
cin >> a[i];
m[a[i]]++;
sum = sum + a[i];
}
int q;
cin >> q;
while (q--) {
int search, val;
... | #include <iostream>
#include <unordered_map>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
long long int sum = 0;
unordered_map<int, int> m;
for (int i = 0; i < n; i++) {
cin >> a[i];
m[a[i]]++;
sum = sum + a[i];
}
int q;
cin >> q;
while (q--) {
int search, val;
... | replace | 21 | 26 | 21 | 25 | TLE | |
p02630 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
const long long INF = 1LL << 60;
typedef pair<ll, ll> Pair;
int main() {
ll N, Q;
ll sum = 0;
ci... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
const long long INF = 1LL << 60;
typedef pair<ll, ll> Pair;
int main() {
ll N, Q;
ll sum = 0;
ci... | replace | 23 | 24 | 23 | 24 | 0 | |
p02630 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <iterator>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
using namespace std;
int main() {
int N;
long long s = 0;
cin >> N;
vector<int> A(N);
vector<int> ap(10 * 10 * 10 * 10 * 10);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
s += A.a... | #include <algorithm>
#include <iostream>
#include <iterator>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
using namespace std;
int main() {
int N;
long long s = 0;
cin >> N;
vector<int> A(N);
vector<int> ap(10 * 10 * 10 * 10 * 10 + 1);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
s +=... | replace | 14 | 15 | 14 | 15 | 0 | |
p02630 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <string>
using namespace std;
typedef unsigned long long int lli;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
lli n;
cin >> n;
vector<lli> v(n + 1);
vector<lli> frequency(n + 1);
lli sum = 0;
for (int i = 1; i <= n; i++) {
cin >> v[i];
fr... | #include <bits/stdc++.h>
#include <string>
using namespace std;
typedef unsigned long long int lli;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
lli n;
cin >> n;
vector<lli> v(n + 1);
vector<lli> frequency(1000001);
lli sum = 0;
for (int i = 1; i <= n; i++) {
cin >> v[i];
... | replace | 14 | 15 | 14 | 15 | 0 | |
p02630 | Python | Runtime Error | N = int(input())
A = [int(_) for _ in input().split()]
Q = int(input())
b_to_c = [[int(_) for _ in input().split()] for i in range(Q)]
sum = 0
memo = [0] * (10**5)
for i in A:
memo[i] += 1
sum += i
for bc in b_to_c:
b = bc[0]
c = bc[1]
sum -= b * memo[b]
sum += c * memo[b]
memo[c] += memo[... | N = int(input())
A = [int(_) for _ in input().split()]
Q = int(input())
b_to_c = [[int(_) for _ in input().split()] for i in range(Q)]
sum = 0
memo = [0] * (10**5 + 1)
for i in A:
memo[i] += 1
sum += i
for bc in b_to_c:
b = bc[0]
c = bc[1]
sum -= b * memo[b]
sum += c * memo[b]
memo[c] += m... | replace | 6 | 7 | 6 | 7 | 0 | |
p02630 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <ctype.h>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define vint vector<int>
... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <ctype.h>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define vint vector<int>
... | replace | 26 | 27 | 26 | 27 | 0 | |
p02630 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
const long long INF = 1LL << 60;
int gcd(in... | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
const long long INF = 1LL << 60;
int gcd(in... | replace | 13 | 14 | 13 | 14 | 0 | |
p02630 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
int64_t s = 0;
vector<vector<int>> v(100000, vector<int>(0));
for (int i = 0; i < n; i++) {
cin >> a.at(i);
s += a.at(i);
v.at(a.at(i)).push_back(i);
}
int q;
cin >> q;
for (int i = 0; i <... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
int64_t s = 0;
vector<vector<int>> v(100001, vector<int>(0));
for (int i = 0; i < n; i++) {
cin >> a.at(i);
s += a.at(i);
v.at(a.at(i)).push_back(i);
}
int q;
cin >> q;
for (int i = 0; i <... | replace | 10 | 11 | 10 | 11 | 0 | |
p02630 | C++ | Runtime Error | #include <bits/stdc++.h>
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;
cin >> n;
long sum = 0;
vector<int> a(100000);
rep(i, n) {
int tmp;
cin >> tmp;
a... | #include <bits/stdc++.h>
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;
cin >> n;
long sum = 0;
vector<int> a(100001);
rep(i, n) {
int tmp;
cin >> tmp;
a... | replace | 11 | 12 | 11 | 12 | 0 | |
p02630 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
int main() {
ll N;
cin >> N;
vector<ll> A(N);
rep(i, N) cin >> A.at(i);
ll Q;
cin >> Q;
vector<ll> B(Q), C(Q);
rep(i, Q) { cin >> B.at(i) >> C.at(i); }
int MAX = 100000;
vector<l... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
int main() {
ll N;
cin >> N;
vector<ll> A(N);
rep(i, N) cin >> A.at(i);
ll Q;
cin >> Q;
vector<ll> B(Q), C(Q);
rep(i, Q) { cin >> B.at(i) >> C.at(i); }
int MAX = 100001;
vector<l... | replace | 14 | 16 | 14 | 16 | 0 | |
p02630 | C++ | Runtime Error | #include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> cnt(n + 1, 0);
long long ans = 0;
rep(i, n) {
cin >> a[i];
ans += a[i];
cnt[a[i]]++;
}
int q;
cin >> q;
vector<int> b(q);... | #include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> cnt(100001, 0);
long long ans = 0;
rep(i, n) {
cin >> a[i];
ans += a[i];
cnt[a[i]]++;
}
int q;
cin >> q;
vector<int> b(q)... | replace | 8 | 9 | 8 | 9 | 0 | |
p02630 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#include <map>
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using Graph = vector<vec... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#include <map>
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using Graph = vector<vec... | replace | 28 | 29 | 28 | 29 | 0 | |
p02630 | 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 ll int64_t
#define _GLIBCXX_DEBUG
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
// 約数列挙(√N)
vector<int64_t> divisor(int64_t n) {
vector<int64_t> ret;
for (... | #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 ll int64_t
#define _GLIBCXX_DEBUG
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
// 約数列挙(√N)
vector<int64_t> divisor(int64_t n) {
vector<int64_t> ret;
for (... | replace | 78 | 79 | 78 | 79 | 0 | |
p02630 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <string>
#include <vector>
using namespace std;
vector<string> split(const string &s, char delim) {
vector<string> elems;
string item;
for (char ch : s) {
if (ch == delim) {
if (!item.empty()) {
elems.push_back(item);
}
item.clear();
} else {
... | #include <bits/stdc++.h>
#include <string>
#include <vector>
using namespace std;
vector<string> split(const string &s, char delim) {
vector<string> elems;
string item;
for (char ch : s) {
if (ch == delim) {
if (!item.empty()) {
elems.push_back(item);
}
item.clear();
} else {
... | replace | 61 | 62 | 61 | 62 | 0 | |
p02630 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
#define PI 3.14159265359
int main() {
ll N;
cin >> N;
ll A;
vector<ll> vec;
vec.reserve(10001);
for (auto i = 0; i ... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
#define PI 3.14159265359
int main() {
ll N;
cin >> N;
ll A;
vector<ll> vec;
ll limit = pow(10, 6);
vec.reserve(limi... | replace | 17 | 19 | 17 | 20 | 0 | |
p02630 | C++ | Runtime Error | /* author : mpily :-()
title : Competing.cpp
time :Sun Jun 14 13:11:23 2020
*/
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_ma... | /* author : mpily :-()
title : Competing.cpp
time :Sun Jun 14 13:11:23 2020
*/
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_ma... | replace | 27 | 28 | 27 | 28 | 0 | |
p02630 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
using namespace std;
// typedef long long LL;
#define For(a, b, c) for (int a = b; a <= c; a++)
#define For_(a, b, c) for (int a = b; a >= c; a... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
using namespace std;
// typedef long long LL;
#define For(a, b, c) for (int a = b; a <= c; a++)
#define For_(a, b, c) for (int a = b; a >= c; a... | replace | 32 | 33 | 32 | 33 | 0 | |
p02630 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
using Graph = vector<vector<int>>;
const int MAX = 10005;
int counter[MAX];
int main() {
int n;
cin >> n;
ll a[n];
ll fsum = 0;
for (int i = 0; i < MAX; ++i) {
counter[i] = 0;
}
for (int i = 0; i < n; ++i) {
cin >> a[i];
cou... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
using Graph = vector<vector<int>>;
const int MAX = 100005;
int counter[MAX];
int main() {
int n;
cin >> n;
ll a[n];
ll fsum = 0;
for (int i = 0; i < MAX; ++i) {
counter[i] = 0;
}
for (int i = 0; i < n; ++i) {
cin >> a[i];
co... | replace | 5 | 6 | 5 | 6 | 0 | |
p02630 | C++ | Runtime Error | #pragma GCC optimize("Ofast")
// #pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define CFOR(i, str) for (int i = 0; (str)[i] != '\0'; (i)++)
#define FOR(i, s, r) for (ll i = (s); i < (r); i++)
#define SUM(a) accumulate(a.begin(),... | #pragma GCC optimize("Ofast")
// #pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define CFOR(i, str) for (int i = 0; (str)[i] != '\0'; (i)++)
#define FOR(i, s, r) for (ll i = (s); i < (r); i++)
#define SUM(a) accumulate(a.begin(),... | replace | 130 | 131 | 130 | 131 | 0 |
Process finished in: 0.00049ms
|
p02630 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n;
cin >> n;
int a[n];
rep(i, n) cin >> a[i];
int q;
cin >> q;
int b[n], c[n];
rep(i, q) cin >> b[i] >> c[i];
map<int, int> count;
rep(i, n)... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n;
cin >> n;
int a[n];
rep(i, n) cin >> a[i];
int q;
cin >> q;
int b[q], c[q];
rep(i, q) cin >> b[i] >> c[i];
map<int, int> count;
rep(i, n)... | replace | 13 | 14 | 13 | 14 | 0 | |
p02630 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<ll> vi(100000, 0);
ll sum = 0;
for (int i = 0; i < N; i++) {
ll a;
cin >> a;
vi.at(a)++;
sum += a;
}
int Q;
cin >> Q;
for (int i = 0; i < Q; i++) {
ll from, to;
cin >> ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<ll> vi(100001, 0);
ll sum = 0;
for (int i = 0; i < N; i++) {
ll a;
cin >> a;
vi.at(a)++;
sum += a;
}
int Q;
cin >> Q;
for (int i = 0; i < Q; i++) {
ll from, to;
cin >> ... | replace | 8 | 9 | 8 | 9 | 0 | |
p02630 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fr first
#define sec second
#define rep(i, n) for (i = 0; i < n; i++)
#define vi vector<int>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define pb push_back
#define M 1000000007
#define ios ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fr first
#define sec second
#define rep(i, n) for (i = 0; i < n; i++)
#define vi vector<int>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define pb push_back
#define M 1000000007
#define ios ... | delete | 42 | 43 | 42 | 42 | TLE | |
p02630 | C++ | Runtime Error | // noobie_corleone
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define ll long long
#define ld long double
#define ss second
#define ff first
#define fr(i, a, b) for (ll i = a; i < b; i++)
#define f(i, n) fr(i, 0, n)
#define rf(i, b, a) for (ll i = b - 1; i >= a; i--)
#def... | // noobie_corleone
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define ll long long
#define ld long double
#define ss second
#define ff first
#define fr(i, a, b) for (ll i = a; i < b; i++)
#define f(i, n) fr(i, 0, n)
#define rf(i, b, a) for (ll i = b - 1; i >= a; i--)
#def... | replace | 50 | 51 | 50 | 51 | 0 | |
p02630 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
unsigned long long int ans = 0;
cin >> N;
vector<int> num(100000, 0);
for (int i = 0; i < N; i++) {
int A;
cin >> A;
ans += A;
num.at(A)++;
}
int Q;
cin >> Q;
for (int i = 0; i < Q; i++) {
int B, C;
cin >> B... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
unsigned long long int ans = 0;
cin >> N;
vector<int> num(100001, 0);
for (int i = 0; i < N; i++) {
int A;
cin >> A;
ans += A;
num.at(A)++;
}
int Q;
cin >> Q;
for (int i = 0; i < Q; i++) {
int B, C;
cin >> B... | replace | 8 | 9 | 8 | 9 | 0 | |
p02630 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const long long MAX = 100005;
int main(void) {
long long N;
cin >> N;
vector<long long> bucket(N);
long long sum = 0;
for (int i = 0; i < N; i++) {
long long tmp;
cin >> tmp;
sum += tmp;
bucket[tmp]++;
}
long... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const long long MAX = 100005;
int main(void) {
long long N;
cin >> N;
vector<long long> bucket(MAX);
long long sum = 0;
for (int i = 0; i < N; i++) {
long long tmp;
cin >> tmp;
sum += tmp;
bucket[tmp]++;
}
lo... | replace | 9 | 10 | 9 | 10 | 0 | |
p02630 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <ctime>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using pii = pair<int, int>;
using ppi = pair<pii, int>;
int f_dir[2][4] = {{-1, 0, 1, 0}, {0, 1, 0, -1}}; //... | #include <algorithm>
#include <cmath>
#include <ctime>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using pii = pair<int, int>;
using ppi = pair<pii, int>;
int f_dir[2][4] = {{-1, 0, 1, 0}, {0, 1, 0, -1}}; //... | replace | 27 | 28 | 27 | 28 | 0 | |
p02630 | Python | Runtime Error | from sys import stdin
readline = stdin.readline
N = int(readline())
A = list(map(int, readline().split()))
Q = int(readline())
t = [0] * (N + 1)
s = sum(A)
for a in A:
t[a] += 1
for _ in range(Q):
B, C = map(int, readline().split())
s -= B * t[B]
s += C * t[B]
t[C] += t[B]
t[B] = 0
print... | from sys import stdin
readline = stdin.readline
N = int(readline())
A = list(map(int, readline().split()))
Q = int(readline())
t = [0] * (10**5 + 1)
s = sum(A)
for a in A:
t[a] += 1
for _ in range(Q):
B, C = map(int, readline().split())
s -= B * t[B]
s += C * t[B]
t[C] += t[B]
t[B] = 0
p... | replace | 8 | 9 | 8 | 9 | 0 | |
p02630 | C++ | Runtime Error | #include <iostream>
#include <map>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
map<int, ll> A;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
auto it = A.find(a);
if (it == A.end()) {
A.emplace(a, 1);
} else {
(it->second)++;
}
}
ll S = 0;
... | #include <iostream>
#include <map>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
map<int, ll> A;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
auto it = A.find(a);
if (it == A.end()) {
A.emplace(a, 1);
} else {
(it->second)++;
}
}
ll S = 0;
... | replace | 30 | 31 | 30 | 35 | 0 | |
p02630 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int q;
cin >> q;
vector<int> b(q);
vector<int> c(q);
for (int i = 0; i < q; i++) {
cin >> b[i] >> c[i];
}
vector<int> d(q);
for (int i = 0; i < q;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int q;
cin >> q;
vector<int> b(q);
vector<int> c(q);
for (int i = 0; i < q; i++) {
cin >> b[i] >> c[i];
}
vector<int> d(q);
for (int i = 0; i < q;... | replace | 23 | 24 | 23 | 24 | 0 | |
p02630 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
vector<ll> a(n);
vector<ll> cnt(n);
ll ans = 0;
ll b[100010], c[100010];
ll q;
rep(i, n) {
cin >> a[i];
ans += a[i];
a[i]--;
cnt[a[i]]++;
... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
vector<ll> a(n);
vector<ll> cnt(100010);
ll ans = 0;
ll b[100010], c[100010];
ll q;
rep(i, n) {
cin >> a[i];
ans += a[i];
a[i]--;
cnt[a[i]]... | replace | 9 | 10 | 9 | 10 | 0 | |
p02630 | C++ | Runtime Error | #include <algorithm>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
#define ll long long
#define read(n) scanf("%d", &n)
#define f(i, a, b) for (int i = a; i <= b; ++i)
#define N 100005
ll num[N];
int main() {
ll n, q, sum = 0;
read(n);
f(i, 1, n) {
ll x;
read(x);
++num[... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
#define ll long long
#define read(n) scanf("%lld", &n)
#define f(i, a, b) for (int i = a; i <= b; ++i)
#define N 100005
ll num[N];
int main() {
ll n, q, sum = 0;
read(n);
f(i, 1, n) {
ll x;
read(x);
++nu... | replace | 6 | 7 | 6 | 7 | -11 | |
p02630 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1];
int b[10005];
long long ans = 0;
memset(b, 0, sizeof(b));
for (int i = 1; i <= n; i++) {
cin >> a[i];
b[a[i]]++;
ans += a[i];
}
int q, be, af;
cin >> q;
for (int i = 1; i <= q; i++) {
cin >> b... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1];
int b[100005];
long long ans = 0;
memset(b, 0, sizeof(b));
for (int i = 1; i <= n; i++) {
cin >> a[i];
b[a[i]]++;
ans += a[i];
}
int q, be, af;
cin >> q;
for (int i = 1; i <= q; i++) {
cin >> ... | replace | 6 | 7 | 6 | 7 | 0 | |
p02630 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)n; i++) // n回繰り返す
#define rrep(i, n) for (int i = n - 1; i ... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)n; i++) // n回繰り返す
#define rrep(i, n) for (int i = n - 1; i ... | replace | 51 | 53 | 51 | 53 | 0 | |
p02630 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long lint;
using namespace std;
lint gcd(lint x, lint y) {
if (x == 0) {
return y;
} else {
return gcd(y % x, x);
}
}
lint lcm(lint x, lint y) { return x / gcd(x, y) * y; }
lint C(lint n, lint k) {
if (n == k) {
return 1;
} else if (n < k) {
return 0;
... | #include <bits/stdc++.h>
typedef long long lint;
using namespace std;
lint gcd(lint x, lint y) {
if (x == 0) {
return y;
} else {
return gcd(y % x, x);
}
}
lint lcm(lint x, lint y) { return x / gcd(x, y) * y; }
lint C(lint n, lint k) {
if (n == k) {
return 1;
} else if (n < k) {
return 0;
... | replace | 49 | 50 | 49 | 50 | 0 | |
p02630 | C++ | Runtime Error | // 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, q;
cin >> n;
vector<int> a(n);
vector<int> cnt(n + 1);
ll sum = 0;... | // 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, q;
cin >> n;
vector<int> a(n);
vector<int> cnt(100005);
ll sum = 0... | replace | 15 | 16 | 15 | 16 | 0 | |
p02630 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define pb push_back
#define pq priority_queue
#define pll pair<long long int, long long int>
#define pii pair<int, int>
#define vvll vector<vector<ll>>
#define vvi vector<vector<int>>
#define vi vector<int>
#define vll vector<ll>
#define vs vect... | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define pb push_back
#define pq priority_queue
#define pll pair<long long int, long long int>
#define pii pair<int, int>
#define vvll vector<vector<ll>>
#define vvi vector<vector<int>>
#define vi vector<int>
#define vll vector<ll>
#define vs vect... | replace | 85 | 90 | 85 | 89 | TLE | |
p02631 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef double db;
typedef long long ll; // 溢出会变成负值
typedef long double ldb;
typedef unsigned long long ull; // 自动取模2^64
const double pi = acos(-1.0);
const int mod = 1e9 + 7; // 998244353;
const int inf = 0x7fffffff; // 2^31-1
const ll INF = 0x7fffffffffffffff;
const in... | #include <bits/stdc++.h>
using namespace std;
typedef double db;
typedef long long ll; // 溢出会变成负值
typedef long double ldb;
typedef unsigned long long ull; // 自动取模2^64
const double pi = acos(-1.0);
const int mod = 1e9 + 7; // 998244353;
const int inf = 0x7fffffff; // 2^31-1
const ll INF = 0x7fffffffffffffff;
const in... | replace | 35 | 36 | 35 | 36 | 0 | |
p02631 | C++ | Runtime Error | #ifndef INCLUDEHEADER_MY_TEMPLATE
#define INCLUDEHEADER_MY_TEMPLATE
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cst... | #ifndef INCLUDEHEADER_MY_TEMPLATE
#define INCLUDEHEADER_MY_TEMPLATE
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cst... | insert | 865 | 865 | 865 | 866 | -11 | |
p02631 | C++ | Runtime Error | // SMOKE SHISHA PLAY FIFA //
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define pll ... | // SMOKE SHISHA PLAY FIFA //
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define pll ... | insert | 37 | 37 | 37 | 38 | -11 | |
p02631 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef vector<pi> vpi;
typedef long double ld;
#define pb emplace_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define ALL(x) x.begin(), x.end()
#define SZ(x) (int)x.size()
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef vector<pi> vpi;
typedef long double ld;
#define pb emplace_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define ALL(x) x.begin(), x.end()
#define SZ(x) (int)x.size()
... | replace | 15 | 16 | 15 | 16 | 0 | |
p02631 | Python | Time Limit Exceeded | n = int(input())
a = [int(i) for i in input().split()]
ans = []
for i in range(n):
temp = 0
for j, aa in enumerate(a):
if j == i:
continue
temp = temp ^ aa
ans.append(temp)
ans = [str(i) for i in ans]
print(" ".join(ans))
| n = int(input())
a = [int(i) for i in input().split()]
ans = []
alld = 0
for aa in a:
alld = alld ^ aa
for aa in a:
ans.append(alld ^ aa)
ans = [str(i) for i in ans]
print(" ".join(ans))
| replace | 5 | 12 | 5 | 12 | TLE | |
p02631 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n - 1; i >= 0; i--)
#define MAX(a, b) a = a > b ? a : b
#define MIN(a, b) a = a < b ? a : b
#define REP(i, x, n) for (int i = x; i < n; i++)
#define REPR(i, x, n) for (int i = n - 1; i >= x; i--)
#define pb push_back
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n - 1; i >= 0; i--)
#define MAX(a, b) a = a > b ? a : b
#define MIN(a, b) a = a < b ? a : b
#define REP(i, x, n) for (int i = x; i < n; i++)
#define REPR(i, x, n) for (int i = n - 1; i >= x; i--)
#define pb push_back
... | replace | 96 | 98 | 96 | 98 | 0 | |
p02631 | C++ | Runtime Error |
// Problem : E - Red Scarf
// Contest : AtCoder - AtCoder Beginner Contest 171
// URL : https://atcoder.jp/contests/abc171/tasks/abc171_e
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
#define DEBUG fprintf(stderr, "Passing [%s... |
// Problem : E - Red Scarf
// Contest : AtCoder - AtCoder Beginner Contest 171
// URL : https://atcoder.jp/contests/abc171/tasks/abc171_e
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
#define DEBUG fprintf(stderr, "Passing [%s... | replace | 48 | 49 | 48 | 49 | 0 | |
p02631 | Python | Time Limit Exceeded | import numpy as np
N = int(input())
a = np.fromstring(input(), sep=" ", dtype=np.int64)
# b = np.bitwise_xor.reduce(a)
# c = np.bitwise_xor(a, b)
# print(*c, sep=" ")
for n in range(N):
print(np.bitwise_xor.reduce(a) ^ a[n])
| import numpy as np
N = int(input())
a = np.fromstring(input(), sep=" ", dtype=np.int64)
b = np.bitwise_xor.reduce(a)
c = np.bitwise_xor(a, b)
print(*c, sep=" ")
| replace | 4 | 9 | 4 | 7 | TLE | |
p02631 | C++ | Runtime Error | // Apparat : drobucs, aleonov, vit_72
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
// #pragma warning(disable : 4996)
// #pragma GCC optimize("O3")
using names... | // Apparat : drobucs, aleonov, vit_72
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
// #pragma warning(disable : 4996)
// #pragma GCC optimize("O3")
using names... | replace | 31 | 32 | 31 | 32 | 0 | |
p02631 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <vector>
#define ll long long
#define N 100005
#define inf 1000000000
using namespace std;
int n;
int a[N], c[N];
int q;
int main() {
scanf("%d", &n);
int sum = 0;
for (int i = 1; i <= n; ++i)
scanf("%d", &a[i]), sum ^= a[i];
for (int i = 1; i <= n; ++i)
p... | #include <algorithm>
#include <cstdio>
#include <vector>
#define ll long long
#define N 200005
#define inf 1000000000
using namespace std;
int n;
int a[N], c[N];
int q;
int main() {
scanf("%d", &n);
int sum = 0;
for (int i = 1; i <= n; ++i)
scanf("%d", &a[i]), sum ^= a[i];
for (int i = 1; i <= n; ++i)
p... | replace | 4 | 5 | 4 | 5 | 0 | |
p02631 | C++ | Runtime Error | #define rep(i, n) for (int i = 0; i < (int)(n); i++)
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
int a[100000];
int s = 0;
cin >> n;
rep(i, n) {
cin >> a[i];
s ^= a[i];
}
rep(i, n) {
cout << (s ^ a[i]);
if (i != n ... | #define rep(i, n) for (int i = 0; i < (int)(n); i++)
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
int a[200000];
int s = 0;
cin >> n;
rep(i, n) {
cin >> a[i];
s ^= a[i];
}
rep(i, n) {
cout << (s ^ a[i]);
if (i != n ... | replace | 10 | 11 | 10 | 11 | 0 | |
p02631 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define int long long int
#define mod 1000000007
int solve(int A[], int n) {
int i;
int B[n];
int x = 0;
for (i = 0; i < n; i++)
x = x ^ A[i];
for (i = 0; i < n; i++) {
B[i] = x ^ A[i];
}
for (i = 0; i < n; i++)
cout << B[i] <<... | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define int long long int
#define mod 1000000007
void solve(int A[], int n) {
int i;
int B[n];
int x = 0;
for (i = 0; i < n; i++)
x = x ^ A[i];
for (i = 0; i < n; i++) {
B[i] = x ^ A[i];
}
for (i = 0; i < n; i++)
cout << B[i] <... | replace | 6 | 7 | 6 | 7 | 0 | |
p02631 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
#define rep1(i, n) for (ll i = 1; i <= (ll)n; i++)
#define PI 3.14159265358979323846
#define vll vector<long long>
#define vvll vector<vector<long long>>
#define pll pair<long long, long long>
using namespace std;
using ll = long long;
using ld =... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
#define rep1(i, n) for (ll i = 1; i <= (ll)n; i++)
#define PI 3.14159265358979323846
#define vll vector<long long>
#define vvll vector<vector<long long>>
#define pll pair<long long, long long>
using namespace std;
using ll = long long;
using ld =... | replace | 27 | 28 | 27 | 34 | 0 | |
p02631 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define FAST \
ios_base::sync_with_stdio(0); \
cin.tie(); \
cout.tie();
#define MAXX 10... | #include <bits/stdc++.h>
using namespace std;
#define FAST \
ios_base::sync_with_stdio(0); \
cin.tie(); \
cout.tie();
#define MAXX 20... | replace | 8 | 9 | 8 | 9 | 0 | |
p02631 | C++ | Runtime Error | #define _CRT_SECURE_NO_WARNINGS
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <func... | #define _CRT_SECURE_NO_WARNINGS
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <func... | replace | 115 | 116 | 115 | 116 | 0 | |
p02631 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll read() {
ll a = 0, b = getchar(), c = 1;
while (!isdigit(b))
c = b == '-' ? -1 : 1, b = getchar();
while (isdigit(b))
a = a * 10 + b - '0', b = getchar();
return a * c;
}
ll n, ans, a[100005];
int main() {
n = read();
for (int i ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll read() {
ll a = 0, b = getchar(), c = 1;
while (!isdigit(b))
c = b == '-' ? -1 : 1, b = getchar();
while (isdigit(b))
a = a * 10 + b - '0', b = getchar();
return a * c;
}
ll n, ans, a[200005];
int main() {
n = read();
for (int i ... | replace | 11 | 12 | 11 | 12 | 0 | |
p02631 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define endl "\n"
#define all(v) v.begin(), v.end()
#define mp make_pair
#define mm(a) memset(a, 0, sizeof(a))
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define repn(i, a, b) for (ll i = a; i >= b; i--)
#define pb push_back
#define ff first
#defi... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define endl "\n"
#define all(v) v.begin(), v.end()
#define mp make_pair
#define mm(a) memset(a, 0, sizeof(a))
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define repn(i, a, b) for (ll i = a; i >= b; i--)
#define pb push_back
#define ff first
#defi... | replace | 39 | 49 | 39 | 42 | TLE | |
p02631 | C++ | Time Limit Exceeded | //============================================================================
// Name : template.cpp
// Author :
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
#include <... | //============================================================================
// Name : template.cpp
// Author :
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
#include <... | replace | 54 | 64 | 54 | 56 | TLE | |
p02631 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int i, j;
cin >> N;
vector<int> a(N);
for (i = 0; i < N; i++)
cin >> a[i];
for (i = 0; i < N; i++) {
bitset<32> ans;
for (j = 0; j < N; j++)
if (i != j)
ans ^= a[j];
cout << ans.to_ullong() << " ";
}
cout <<... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int i, j;
cin >> N;
vector<int> a(N);
for (i = 0; i < N; i++)
cin >> a[i];
bitset<32> ans;
for (i = 1; i < N; i++)
ans ^= a[i];
cout << ans.to_ullong() << " ";
for (i = 1; i < N; i++) {
ans ^= a[i];
ans ^= a[i - 1];
... | replace | 10 | 15 | 10 | 17 | TLE | |
p02631 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag,
tree_order_statistics_node_update>
oset;
#define sim template <class c
#defi... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag,
tree_order_statistics_node_update>
oset;
#define sim template <class c
#defi... | replace | 64 | 66 | 64 | 66 | 0 | |
p02631 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int LL
#define PII pair<int, int>
#define VI vector<int>
#define VPII vector<PII>
#define LL long long
#define LD long double
#define f first
#define s second
#define MP make_pair
#define PB push_back
#define endl '\n'
#define ALL(c) (c).begin(), (c).end()
#define S... | #include <bits/stdc++.h>
using namespace std;
#define int LL
#define PII pair<int, int>
#define VI vector<int>
#define VPII vector<PII>
#define LL long long
#define LD long double
#define f first
#define s second
#define MP make_pair
#define PB push_back
#define endl '\n'
#define ALL(c) (c).begin(), (c).end()
#define S... | replace | 57 | 58 | 57 | 58 | 0 | |
p02631 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
ll n, a[100005], q, sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum = sum ^ a[i];
}
for (int i = 0; i < n; i++) {
cout << (a[i] ^ sum);
cout << " ";
}
cout << "\n";
return 0;
}
| #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
ll n, a[200005], q, sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum = sum ^ a[i];
}
for (int i = 0; i < n; i++) {
cout << (a[i] ^ sum);
cout << " ";
}
cout << "\n";
return 0;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02631 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define MOD 998244353
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;
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define MOD 998244353
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;
}
... | replace | 49 | 56 | 49 | 57 | TLE | |
p02631 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <ctype.h>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define vint vector<int>
... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <ctype.h>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define vint vector<int>
... | replace | 24 | 25 | 24 | 25 | 0 | |
p02631 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#define LL long long
#define li i << 1
#define ri i << 1 | 1
using namespace std;
inline LL read() {
char c = getchar();
LL x = 0,... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#define LL long long
#define li i << 1
#define ri i << 1 | 1
using namespace std;
inline LL read() {
char c = getchar();
LL x = 0,... | replace | 34 | 47 | 34 | 38 | TLE | |
p02631 | C++ | Runtime Error | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define ll long long
#define pb push_back
#define mp make_pair
#define pii pair<ll, ll>
#define vi vector<ll>
#define vii vector<pii>
#define mi map<ll, ll... | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define ll long long
#define pb push_back
#define mp make_pair
#define pii pair<ll, ll>
#define vi vector<ll>
#define vii vector<pii>
#define mi map<ll, ll... | replace | 32 | 33 | 32 | 33 | 0 | |
p02631 | C++ | Runtime Error | #include <bits/stdc++.h>
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define all(x) (x).begin(), (x).end()... | #include <bits/stdc++.h>
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define all(x) (x).begin(), (x).end()... | replace | 51 | 52 | 51 | 52 | 0 | |
p02631 | C++ | Runtime Error | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <iostream> // cout, endl, cin
#include <math.h> // sqrt
#include <string> // string, to_string, stoi
#include <vector> // vector
using namespace std;
long long ruijo(int n) {
long long ans = 1;
for (int i = 0; i < n;... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <iostream> // cout, endl, cin
#include <math.h> // sqrt
#include <string> // string, to_string, stoi
#include <vector> // vector
using namespace std;
long long ruijo(int n) {
long long ans = 1;
for (int i = 0; i < n;... | replace | 40 | 41 | 40 | 41 | 0 | |
p02631 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll i, j, k, l, m, n, o, p, q, r, t, a[100001] = {0};
cin >> n;
m = 0;
for (i = 0; i < n; i++) {
cin >> a[i];
m ^= a[i];
}
for (i = 0; i < n; i++) {
cout << (m ^ a[i]) << " ";
}
cout << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll i, j, k, l, m, n, o, p, q, r, t, a[300001] = {0};
cin >> n;
m = 0;
for (i = 0; i < n; i++) {
cin >> a[i];
m ^= a[i];
}
for (i = 0; i < n; i++) {
cout << (m ^ a[i]) << " ";
}
cout << endl;
return 0;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02631 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x) \
sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<( \
c i) {
sim > ... | #include <bits/stdc++.h>
using namespace std;
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x) \
sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<( \
c i) {
sim > ... | replace | 39 | 46 | 39 | 40 | TLE | |
p02631 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MX = 1e5 + 5;
int vt[MX];
int main() {
int i, j, k;
int n;
cin >> n;
for (i = 0; i < n; ++i)
cin >> vt[i];
int sm = 0;
for (i = 0; i < n; ++i)
sm ^= vt[i];
for (i = 0; i < n; ++i) {
cout << (sm ^ vt[i]) << " ";
}... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MX = 2e5 + 5;
int vt[MX];
int main() {
int i, j, k;
int n;
cin >> n;
for (i = 0; i < n; ++i)
cin >> vt[i];
int sm = 0;
for (i = 0; i < n; ++i)
sm ^= vt[i];
for (i = 0; i < n; ++i) {
cout << (sm ^ vt[i]) << " ";
}... | replace | 3 | 4 | 3 | 4 | 0 | |
p02631 | C++ | Runtime Error | // #pragma GCC optimize (2)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(v) v.begin(), v.end()
ll quick_pow(ll base, ll n) {
ll ans = 1;
while (n) {
if (n & 1)
ans *= base;
base *= base;
n >>= 1;
}
return ans;
}
void solve();
int main() {
int T = 1;
// ci... | // #pragma GCC optimize (2)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(v) v.begin(), v.end()
ll quick_pow(ll base, ll n) {
ll ans = 1;
while (n) {
if (n & 1)
ans *= base;
base *= base;
n >>= 1;
}
return ans;
}
void solve();
int main() {
int T = 1;
// ci... | replace | 25 | 26 | 25 | 26 | 0 | |
p02631 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
LL bin(LL a, LL b, LL p) {
LL res = 1;
for (; b; b >>= 1, a = a * a % p)
if (b & 1)
res = res * a % p;
return res;
}
const int N = 1e5 + 50;
int a[N];
int n;
int main(int argc, char const *argv[]) {
scanf("%d", &n);
int s = 0;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
LL bin(LL a, LL b, LL p) {
LL res = 1;
for (; b; b >>= 1, a = a * a % p)
if (b & 1)
res = res * a % p;
return res;
}
const int N = 3e5 + 50;
int a[N];
int n;
int main(int argc, char const *argv[]) {
scanf("%d", &n);
int s = 0;
... | replace | 12 | 13 | 12 | 13 | 0 | |
p02631 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
int main() {
// int t;cin>>t;while(t--)
{
ll a, b, c, d, i, j, k, l, m, n, cnt = 0, sum = 0;
ll arr[1000];
cin >> n;
for (i = 0; i < n; i++) {
cin >> arr[i];
}
k = arr[0];
for (i = 1; i < n; i++... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
int main() {
// int t;cin>>t;while(t--)
{
ll a, b, c, d, i, j, k, l, m, n, cnt = 0, sum = 0;
ll arr[300000];
cin >> n;
for (i = 0; i < n; i++) {
cin >> arr[i];
}
k = arr[0];
for (i = 1; i < n; i... | replace | 8 | 9 | 8 | 9 | 0 | |
p02631 | C++ | Runtime Error | #include <algorithm>
#include <functional>
#include <iostream>
#include <string>
using namespace std;
#include <climits>
#include <iomanip>
#include <math.h>
#include <queue>
#include <vector>
using Graph = vector<vector<int>>;
const double PI = 3.14159265358979323846;
long long modpow(long long a, long long n, long ... | #include <algorithm>
#include <functional>
#include <iostream>
#include <string>
using namespace std;
#include <climits>
#include <iomanip>
#include <math.h>
#include <queue>
#include <vector>
using Graph = vector<vector<int>>;
const double PI = 3.14159265358979323846;
long long modpow(long long a, long long n, long ... | replace | 43 | 44 | 43 | 44 | 0 | |
p02631 | C++ | Runtime Error | /* _
_oo0oo_
o8888888o
88" . "88
(| -_- |)
0\ = /0
____/`---'\____
/ \\| |// \
/ \\||| /:\ |||// \
/ _||||| ... | /* _
_oo0oo_
o8888888o
88" . "88
(| -_- |)
0\ = /0
____/`---'\____
/ \\| |// \
/ \\||| /:\ |||// \
/ _||||| ... | replace | 96 | 97 | 96 | 97 | 0 | |
p02631 | C++ | Runtime Error | // In the name of god
#include <bits/stdc++.h>
#pragma GCC optimze("02")
using namespace std;
using ll = long long;
const ll maxn = 1e5 + 5, inf = 1e18 + 18;
ll n, ans, a[maxn];
int main() {
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
ans = an... | // In the name of god
#include <bits/stdc++.h>
#pragma GCC optimze("02")
using namespace std;
using ll = long long;
const ll maxn = 2e5 + 5, inf = 1e18 + 18;
ll n, ans, a[maxn];
int main() {
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
ans = an... | replace | 5 | 6 | 5 | 6 | 0 | |
p02631 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
#define INF ((1 << 30) - 1)
#define LINF (1LL << 60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
#define INF ((1 << 30) - 1)
#define LINF (1LL << 60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
... | replace | 12 | 13 | 12 | 13 | 0 | |
p02631 | C++ | Time Limit Exceeded | #include <bits/stdc++.h> //toINFandByd
#define forn(i, n) for (int i = 0; i < int(n); i++)
#define endl "\n"
using namespace std;
typedef long long ll;
void solve() {
int n;
cin >> n;
vector<ll> a(n);
forn(i, n) cin >> a[i];
vector<ll> ans(n);
int i, j;
for (i = 0; i < n; i++) {
ans[i] = 0;
for (... | #include <bits/stdc++.h> //toINFandByd
#define forn(i, n) for (int i = 0; i < int(n); i++)
#define endl "\n"
using namespace std;
typedef long long ll;
void solve() {
int n;
cin >> n;
vector<ll> a(n);
forn(i, n) cin >> a[i];
vector<ll> ans(n);
int i, j;
ans[0] = 0;
for (i = 1; i < n; i++) {
ans[0] ... | replace | 13 | 20 | 13 | 22 | TLE | |
p02631 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii... | replace | 50 | 51 | 50 | 51 | 0 | |
p02631 | C++ | Runtime Error | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("unroll-loops")
// #pragma warning(disable : 4996)
#ifdef _MSC_VER
#include <intrin.h>
#define __builtin_popcount __popcnt
#define __builtin_popcountll __popcnt64
#endif
#include <limits.h>
#include <m... | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("unroll-loops")
// #pragma warning(disable : 4996)
#ifdef _MSC_VER
#include <intrin.h>
#define __builtin_popcount __popcnt
#define __builtin_popcountll __popcnt64
#endif
#include <limits.h>
#include <m... | replace | 83 | 84 | 83 | 84 | 0 | |
p02631 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <vector>
typedef unsigned long long ULONG;
typedef long long LONG;
using namespace std;
#define PI 3.14159265358... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <vector>
typedef unsigned long long ULONG;
typedef long long LONG;
using namespace std;
#define PI 3.14159265358... | replace | 28 | 35 | 28 | 37 | TLE | |
p02631 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <iomanip>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#in... | #include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <iomanip>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#in... | replace | 50 | 59 | 50 | 53 | TLE | |
p02631 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int INF = 0x3f3f3f3f;
const int N = 100005;
#define ll long long
int cmp(int a, int b) { return a > b; }
int gcd(int x, int y) {
while (y ^= x ^= y ^= x %= y)
;
return x;
}
int a[100005];
int n, num = 0;
int main() {
cin >> n;
for... | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int INF = 0x3f3f3f3f;
const int N = 100005;
#define ll long long
int cmp(int a, int b) { return a > b; }
int gcd(int x, int y) {
while (y ^= x ^= y ^= x %= y)
;
return x;
}
int a[200004];
int n, num = 0;
int main() {
cin >> n;
for... | replace | 12 | 13 | 12 | 13 | 0 | |
p02631 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define sz(a) ((int)a.size())
#define mp make_pair
#define fi first
#define se second
const int maxn = 1e5 + 5;
const int maxv = 1e9;
int T, tc;
int n;
int a[maxn];
int main() {
// freopen("inp.txt", "r", stdin);
cin >> n;
int x = 0;
for... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define sz(a) ((int)a.size())
#define mp make_pair
#define fi first
#define se second
const int maxn = 2e5 + 5;
const int maxv = 1e9;
int T, tc;
int n;
int a[maxn];
int main() {
// freopen("inp.txt", "r", stdin);
cin >> n;
int x = 0;
for... | replace | 10 | 11 | 10 | 11 | 0 | |
p02631 | C++ | Runtime Error | /*
Powered by C++11.
Author : Alex_Wei.
*/
#include <bits/stdc++.h>
using namespace std;
// #pragma GCC optimize(3)
// #define int long long
#define ll long long
#define pii pair<int, int>
#define fi first
#define se second
#define pb emplace_back
#define all(x) x.begin(), x.end()
#define sor(x) sort... | /*
Powered by C++11.
Author : Alex_Wei.
*/
#include <bits/stdc++.h>
using namespace std;
// #pragma GCC optimize(3)
// #define int long long
#define ll long long
#define pii pair<int, int>
#define fi first
#define se second
#define pb emplace_back
#define all(x) x.begin(), x.end()
#define sor(x) sort... | replace | 84 | 85 | 84 | 85 | 0 | |
p02631 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const long long maxn = 1e5 + 5;
const long long inf = 0x3f3f3f3f;
long long a[maxn], num;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
// freopen(".in","r",stdin);
// freopen(".out","w",stdout);
long long n;
cin >> n;
for (long long i =... | #include <bits/stdc++.h>
using namespace std;
const long long maxn = 1e6 + 5;
const long long inf = 0x3f3f3f3f;
long long a[maxn], num;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
// freopen(".in","r",stdin);
// freopen(".out","w",stdout);
long long n;
cin >> n;
for (long long i =... | replace | 2 | 3 | 2 | 3 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.