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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02971 | C++ | Runtime Error | #include <iostream>
using namespace std;
const int INFTY = 1 << 21;
int L[50000], R[50000];
void merge(int A[], int left, int mid, int right) {
int n1 = mid - left;
int n2 = right - mid;
for (int i = 0; i < n1; i++)
L[i] = A[left + i];
for (int i = 0; i < n2; i++)
R[i] = A[mid + i];
L[n1] = R[n2] = I... | #include <iostream>
using namespace std;
const int INFTY = 1 << 21;
int L[200005], R[200005];
void merge(int A[], int left, int mid, int right) {
int n1 = mid - left;
int n2 = right - mid;
for (int i = 0; i < n1; i++)
L[i] = A[left + i];
for (int i = 0; i < n2; i++)
R[i] = A[mid + i];
L[n1] = R[n2] =... | replace | 3 | 4 | 3 | 4 | 0 | |
p02971 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const int MAX = 1e5 + 10;
const int INF = 1e9;
const ll MOD = 1e9 + 7;
int N, A[MAX];
int main() {
cin >> N;
for (int i = 0; i < N; i++)
cin >> A[i];
int maxi[2];
maxi[0] = maxi[1] = 0;
for (int i = 0; i < N;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const int MAX = 1e6 + 10;
const int INF = 1e9;
const ll MOD = 1e9 + 7;
int N, A[MAX];
int main() {
cin >> N;
for (int i = 0; i < N; i++)
cin >> A[i];
int maxi[2];
maxi[0] = maxi[1] = 0;
for (int i = 0; i < N;... | replace | 6 | 7 | 6 | 7 | 0 | |
p02971 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define leading \
zero str.erase(0, min(str.find_first_not_of('0'), str.size() - 1));
using namespace __gnu_pbds;
using namespace std;
typedef long long... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define leading \
zero str.erase(0, min(str.find_first_not_of('0'), str.size() - 1));
using namespace __gnu_pbds;
using namespace std;
typedef long long... | replace | 48 | 49 | 48 | 49 | TLE | |
p02971 | C++ | Runtime Error | // stringray
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
/*#ifndef __LOCAL__
#pragma comment(linker,"/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#endif*/
using namespace std;
... | // stringray
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
/*#ifndef __LOCAL__
#pragma comment(linker,"/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#endif*/
using namespace std;
... | replace | 85 | 88 | 85 | 88 | 0 | |
p02971 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pii pair<int, int>
#define _FastIO \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pii pair<int, int>
#define _FastIO \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | replace | 9 | 10 | 9 | 10 | 0 | |
p02971 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A;
cin >> N;
vector<int> As(N);
for (int i = 0; i < N; i++) {
cin >> As.at(i);
}
for (int i = 0; i < N; i++) {
vector<int> tempAs = As;
tempAs.at(i) = 0;
sort(tempAs.begin(), tempAs.end());
cout << tempAs.at(N - 1) << e... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A;
cin >> N;
vector<int> As(N);
for (int i = 0; i < N; i++) {
cin >> As.at(i);
}
vector<int> tempAs = As;
sort(tempAs.begin(), tempAs.end());
if (tempAs.at(N - 1) == tempAs.at(N - 2)) {
for (int i = 0; i < N; i++) {
cout... | replace | 12 | 17 | 12 | 34 | TLE | |
p02971 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
vector<int> B(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
B = A;
B[i] = 0;
sort(B.begin(), B.end());
cout << B[N - 1] << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
vector<int> B(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
B = A;
sort(B.begin(), B.end());
int max = B[N - 1];
if (B[N - 2] == B[N - 1]) {
for (int i = 0; i < N; i++) {
cout << B[N -... | replace | 13 | 18 | 13 | 31 | TLE | |
p02971 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[100010], b[100010];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
b[i] = a[i];
}
sort(b, b + n);
for (int i = 0; i < n; i++) {
if (a[i] == b[n - 1])
cout << b[n - 2] << endl;
else
cout << b[n - 1] << endl;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[200010], b[200010];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
b[i] = a[i];
}
sort(b, b + n);
for (int i = 0; i < n; i++) {
if (a[i] == b[n - 1])
cout << b[n - 2] << endl;
else
cout << b[n - 1] << endl;... | replace | 3 | 4 | 3 | 4 | 0 | |
p02971 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#includ... | replace | 40 | 50 | 40 | 52 | TLE | |
p02971 | C++ | Runtime Error | #pragma GCC optimize(2)
#pragma warning(disable : 4996)
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define itn int
#define F(i, a, b) for (int i = a; i <= (b); ++i)
#define F2(i, a, b) ... | #pragma GCC optimize(2)
#pragma warning(disable : 4996)
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define itn int
#define F(i, a, b) for (int i = a; i <= (b); ++i)
#define F2(i, a, b) ... | replace | 16 | 17 | 16 | 17 | 0 | |
p02971 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define reg register
#define rep(i, a, b) for (int i = a, i##end = b; i <= i##end; ++i)
#define drep(i, a, b) for (int i = a, i##end = b; i >= i##end; --i)
char IO;
int rd() {
int s = 0, f = 0;
while (!isdigit(IO = getchar()))
if (IO == '-')
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define reg register
#define rep(i, a, b) for (int i = a, i##end = b; i <= i##end; ++i)
#define drep(i, a, b) for (int i = a, i##end = b; i >= i##end; --i)
char IO;
int rd() {
int s = 0, f = 0;
while (!isdigit(IO = getchar()))
if (IO == '-')
... | replace | 20 | 21 | 20 | 21 | 0 | |
p02971 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const int N = 1e5 + 5;
int n, a[N];
multiset<int> m;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
m.insert(a[i]);
}
for ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const int N = 2e5 + 5;
int n, a[N];
multiset<int> m;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
m.insert(a[i]);
}
for ... | replace | 5 | 6 | 5 | 6 | 0 | |
p02971 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define pb push_back
#define ps push
#define pf push_front
#define mp make_pair
#define And &&
#define Or ||
#define ppb pop_back
#define ppf pop_front
#define inf INT_MAX
#define sz(name) name.size()
#define len(name) nam... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define pb push_back
#define ps push
#define pf push_front
#define mp make_pair
#define And &&
#define Or ||
#define ppb pop_back
#define ppf pop_front
#define inf INT_MAX
#define sz(name) name.size()
#define len(name) nam... | replace | 26 | 27 | 26 | 27 | 0 | |
p02971 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i, s, e) for (i64(i) = (s); (i) < (e); (i)++)
#define rev(i, s, e) for (i64(i) = (s); (i)-- > (e);)
#define all(x) x.begin(), x.end()
int main() {
i64 N;
cin >> N;
vector<i64> A(N);
rep(i, 0, N) cin >> A[i];
multiset<i64> st;
... | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i, s, e) for (i64(i) = (s); (i) < (e); (i)++)
#define rev(i, s, e) for (i64(i) = (s); (i)-- > (e);)
#define all(x) x.begin(), x.end()
int main() {
i64 N;
cin >> N;
vector<i64> A(N);
rep(i, 0, N) cin >> A[i];
multiset<i64> st;
... | replace | 15 | 16 | 15 | 16 | 0 | |
p02971 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define ii pair<int, int>
#define S second
#define F first
#define PI 3.1415926535897932384626
#define SPEED std::ios_base::sync_with_stdio(false);
const int N = 100100;
ll n, q, a[N], seg[N << 2];
ll mrg(ll x1, ll x2) { retur... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define ii pair<int, int>
#define S second
#define F first
#define PI 3.1415926535897932384626
#define SPEED std::ios_base::sync_with_stdio(false);
const int N = 200100;
ll n, q, a[N], seg[N << 2];
ll mrg(ll x1, ll x2) { retur... | replace | 11 | 12 | 11 | 12 | 0 | |
p02971 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> v, v2;
int counter, tmp, max, second, result;
cin >> counter;
for (int i = 0; i < counter; i++) {
cin >> tmp;
v.emplace_back(tmp);
}
max = *max_element(v.begin(), v.end());
v2 = v;
sort(v2.begin(), v2.end(), greater<int>()... | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> v, v2;
int counter, tmp, max, second, result;
cin >> counter;
for (int i = 0; i < counter; i++) {
cin >> tmp;
v.emplace_back(tmp);
}
max = *max_element(v.begin(), v.end());
v2 = v;
sort(v2.begin(), v2.end(), greater<int>()... | replace | 22 | 23 | 22 | 23 | TLE | |
p02971 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int maxM = 2e5 + 7;
const int maxV = 90010;
const int MOD = 1e9 + 7;
int T;
const int maxN = 1e2 + 8;
const ll INF = 1000000000000000010LL;
const int K = 15;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int maxM = 2e5 + 7;
const int maxV = 90010;
const int MOD = 1e9 + 7;
int T;
const int maxN = 2e5 + 8;
const ll INF = 1000000000000000010LL;
const int K = 15;... | replace | 13 | 14 | 13 | 14 | 0 | |
p02971 | Python | Time Limit Exceeded | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
from copy import copy
def main():
N = int(input())
A = [int(input()) for _ in range(N)]
for i in range(N):
tmp = copy(A)
tmp[i] = 0
print(max(tmp))
if __name__ == "__main__":
main()
| #!/usr/bin/env python3
# -*- coding: utf-8 -*-
from copy import copy
def main():
N = int(input())
A = [int(input()) for _ in range(N)]
A_max = copy(A)
A_max.sort(reverse=True)
for a in A:
if a == A_max[0]:
print(A_max[1])
else:
print(A_max[0])
if __name__... | replace | 8 | 12 | 8 | 16 | TLE | |
p02971 | Python | Runtime Error | n = int(input())
a = [int(input()) for _ in range(n)]
m1, m2 = sorted(set(a))[n - 2 :]
if a.count(m1) > 1:
for _ in range(n):
print(m1)
else:
for x in a:
print(m1) if x == m2 else print(m2)
| n = int(input())
a = [int(input()) for _ in range(n)]
b = sorted(a)
for x in a:
print(b[(x < b[-1]) - 2])
| replace | 2 | 9 | 2 | 5 | 0 | |
p02971 | Python | Time Limit Exceeded | n = int(input())
a = []
for _ in range(n):
a.append(int(input()))
for i in range(n):
_a = a.copy()
_a.pop(i)
print(max(_a))
| n = int(input())
a = []
for _ in range(n):
a.append(int(input()))
m = max(a)
idxs = [i for i, v in enumerate(a) if v == m]
if len(idxs) > 1:
for i in range(n):
print(m)
if len(idxs) == 1:
idx = idxs[0]
for i in range(n):
if idx == i:
_a = a.copy()
_a.pop(i)
... | replace | 5 | 9 | 5 | 21 | TLE | |
p02971 | Python | Runtime Error | import itertools
n = int(input())
a = [int(input()) for i in range(n)]
max_list = [0] + list(itertools.accumulate(a, func=max))
max_list_r = [0, *itertools.accumulate(reversed(a), func=max)][::-1]
# print(max_list)
# print(max_list_r)
for i in range(n):
print(max(max_list[i], max_list_r[i + 1]))
| import itertools
n = int(input())
a = [int(input()) for i in range(n)]
max_list = [0] + list(itertools.accumulate(a, func=max))
max_list_r = ([0] + list(itertools.accumulate(reversed(a), func=max)))[::-1]
for i in range(n):
print(max(max_list[i], max_list_r[i + 1]))
| replace | 6 | 9 | 6 | 7 | 0 | |
p02971 | C++ | Runtime Error |
#include <bits/stdc++.h>
class kin {
public:
inline void open(FILE *, int);
inline void close(void);
inline void scan(void);
inline kin &operator>(char &);
inline kin &operator>(int &);
inline kin &operator>(long long &);
inline kin &operator>(double &);
inline kin &operator>(long double &);
inline ... |
#include <bits/stdc++.h>
class kin {
public:
inline void open(FILE *, int);
inline void close(void);
inline void scan(void);
inline kin &operator>(char &);
inline kin &operator>(int &);
inline kin &operator>(long long &);
inline kin &operator>(double &);
inline kin &operator>(long double &);
inline ... | replace | 50 | 51 | 50 | 51 | 0 | |
p02971 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include... | delete | 42 | 43 | 42 | 42 | TLE | |
p02971 | C++ | Runtime Error | /*
lakshaygpt28
Lakshay Gupta
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
using ll = long long;
using db = double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vll = vector<ll>;
template <typ... | /*
lakshaygpt28
Lakshay Gupta
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
using ll = long long;
using db = double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vll = vector<ll>;
template <typ... | replace | 51 | 52 | 51 | 52 | 0 | |
p02971 | C++ | Time Limit Exceeded |
#include <algorithm>
#include <climits>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int i, ans = 0, n, j, x, max;
int kari = 0;
vector<int> a;
cin >> n;
for (i = 0; i < n; i++) {
cin >> x... |
#include <algorithm>
#include <climits>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int i, ans = 0, n, j, x, max;
int kari = 0;
vector<int> a;
cin >> n;
for (i = 0; i < n; i++) {
cin >> x... | insert | 27 | 27 | 27 | 29 | TLE | |
p02971 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef pair<P, ll> P3;
typedef pair<P, P> PP;
constexpr ll MOD = ll(1e9) + 7;
constexpr int IINF = INT_MAX;
constexpr ll LLINF = LLONG_MAX;
constexpr int MAX_N = int(1e5) + 5;
constexpr double EP... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef pair<P, ll> P3;
typedef pair<P, P> PP;
constexpr ll MOD = ll(1e9) + 7;
constexpr int IINF = INT_MAX;
constexpr ll LLINF = LLONG_MAX;
constexpr int MAX_N = int(2e5) + 5;
constexpr double EP... | replace | 10 | 11 | 10 | 11 | 0 | |
p02971 | C++ | Runtime Error | #include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define pb push_back
#define endl '\n'
using namespace std;
typedef long long LL;
typedef pair<int, int> P;
typedef pair<LL, LL> LP;
typedef pair<int, P> iP;
typedef pair<P, P> PP;
static const int INF = INT_MAX;
static const LL LINF = LL... | #include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define pb push_back
#define endl '\n'
using namespace std;
typedef long long LL;
typedef pair<int, int> P;
typedef pair<LL, LL> LP;
typedef pair<int, P> iP;
typedef pair<P, P> PP;
static const int INF = INT_MAX;
static const LL LINF = LL... | replace | 20 | 21 | 20 | 21 | 0 | |
p02971 | Python | Time Limit Exceeded | # -*- coding: utf-8 -*-
n = int(input())
a = list()
for i in range(n):
a.append(int(input()))
a_sorted = sorted(a, reverse=True)
for i in range(n):
index = a_sorted.index(a[i])
if a[i] == a_sorted[0]:
print(a_sorted[1])
continue
print(a_sorted[0])
| # -*- coding: utf-8 -*-
n = int(input())
a = list()
for i in range(n):
a.append(int(input()))
a_sorted = sorted(a, reverse=True)
for i in range(n):
if a[i] == a_sorted[0]:
print(a_sorted[1])
continue
print(a_sorted[0])
| delete | 11 | 12 | 11 | 11 | TLE | |
p02971 | Python | Time Limit Exceeded | n = int(input())
a = []
for i in range(n):
a.append(int(input()))
k = max(a)
for i in range(n):
if a[i] < k:
print(k)
else:
tmp = a[i]
a[i] = 0
print(max(a))
a[i] = tmp
| n = int(input())
a = []
for i in range(n):
a.append(int(input()))
bl = [0 for i in range(n)]
bl[0] = a[0]
br = [0 for i in range(n)]
br[0] = a[n - 1]
for i in range(1, n):
bl[i] = max(bl[i - 1], a[i])
a.reverse()
for i in range(1, n):
br[i] = max(br[i - 1], a[i])
br.reverse()
print(br[1])
for i in range(1, ... | replace | 4 | 13 | 4 | 18 | TLE | |
p02971 | Python | Time Limit Exceeded | n = int(input())
a = []
for _ in range(n):
a.append(int(input()))
sa = sorted(a)
for i in range(n):
val = a[i]
idx = sa.index(val)
sa.pop(idx)
print(sa[-1])
sa.insert(idx, val)
| n = int(input())
a = []
for _ in range(n):
a.append(int(input()))
sa = sorted(a)
mx = sa[-1]
for val in a:
if val != mx:
print(sa[-1])
else:
print(sa[-2])
| replace | 6 | 12 | 6 | 12 | TLE | |
p02971 | Python | Time Limit Exceeded | N = int(input())
A = [int(input()) for i in range(N)]
for j in range(N):
p = A.pop(j)
print(max(A))
A.insert(j, p)
| N = int(input())
A = [int(input()) for i in range(N)]
max1 = [A.index(max(A)), max(A)]
p = A.pop(A.index(max(A)))
max2 = max(A)
ans = [max2 if j == max1[0] else max1[1] for j in range(N)]
for k in range(N):
print(ans[k])
| replace | 3 | 7 | 3 | 9 | TLE | |
p02971 | Python | Time Limit Exceeded | N = int(input())
A = [int(input()) for i in range(N)]
# maxA = max(A)
for x in range(len(A)):
a_tmp = A[x]
A[x] = 0
print(max(A))
A[x] = a_tmp
| N = int(input())
A = [int(input()) for i in range(N)]
maxA = max(A)
copy_A = A[:]
copy_A.remove(maxA)
secondA = max(copy_A)
for x in A:
if x == maxA:
print(secondA)
else:
print(maxA)
| replace | 2 | 8 | 2 | 11 | TLE | |
p02971 | Python | Time Limit Exceeded | import copy
N = int(input())
A = []
for i in range(N):
A.append(int(input()))
chinpo = max(A)
B = copy.copy(A)
B.remove(max(A))
chinchin = max(B)
for i in range(N):
if i == A.index(max(A)):
print(chinchin)
else:
print(chinpo)
| import copy
N = int(input())
A = []
for i in range(N):
A.append(int(input()))
chinpo = max(A)
B = copy.copy(A)
B.remove(max(A))
chinchin = max(B)
for i in range(A.index(max(A))):
print(chinpo)
print(chinchin)
for i in range(A.index(max(A)) + 1, N):
print(chinpo)
| replace | 12 | 17 | 12 | 17 | TLE | |
p02971 | Python | Time Limit Exceeded | n = int(input())
a = []
for _ in range(n):
a.append(int(input()))
for _ in range(n):
val = a.pop(0)
print(max(a))
a.append(val)
| n = int(input())
a = []
for _ in range(n):
a.append(int(input()))
desc = sorted(list(set(a)), reverse=True)
max = desc[0]
large_2 = desc[1] if len(desc) > 1 else 0
if a.count(max) == 1:
for val in a:
if val == max:
print(large_2)
else:
print(max)
else:
for _ in rang... | replace | 5 | 9 | 5 | 18 | TLE | |
p02971 | Python | Runtime Error | from heapq import heappush, heappop
N = int(input())
A = [int(input()) for i in range(N)]
hq = []
for i in range(N):
heappush(hq, -A[i])
max1 = -heappop(hq)
while True:
max2 = -heappop(hq)
if max2 != max1:
break
ans = [0] * N
for i in range(N):
if A[i] == max1:
ans[i] = max2
else:
... | from heapq import heappush, heappop
N = int(input())
A = [int(input()) for i in range(N)]
hq = []
for i in range(N):
heappush(hq, -A[i])
max1 = -heappop(hq)
max2 = -heappop(hq)
ans = [0] * N
for i in range(N):
if A[i] == max1:
ans[i] = max2
else:
ans[i] = max1
print(*ans, sep="\n")
| replace | 8 | 12 | 8 | 9 | 0 | |
p02971 | Python | Time Limit Exceeded | #!/usr/bin/env python3
def main():
N = int(input())
As = [int(input()) for _ in range(N)]
for i in range(N):
tmp = As[:]
tmp.pop(i)
print(max(tmp))
if __name__ == "__main__":
main()
| #!/usr/bin/env python3
def main():
N = int(input())
As = [int(input()) for _ in range(N)]
max1 = max(As)
max_idx = As.index(max1)
As.remove(max1)
max2 = max(As)
max_list = [max1] * N
max_list[max_idx] = max2
for m in max_list:
print(m)
if __name__ == "__main__":
main(... | replace | 6 | 10 | 6 | 14 | TLE | |
p02971 | Python | Time Limit Exceeded | N = int(input())
a = []
for _ in range(N):
a.append(int(input()))
tmp = 0
idx = 0
while idx < N:
tmp, a[idx] = a[idx], tmp
print(max(a))
tmp, a[idx] = a[idx], tmp
idx += 1
| N = int(input())
a = []
for _ in range(N):
a.append(int(input()))
a_sorted = sorted(a)
max_a = a_sorted.pop()
second_a = a_sorted.pop()
if max_a == second_a:
for _ in range(N):
print(max_a)
else:
idx = 0
while idx < N:
if a[idx] == max_a:
print(second_a)
else:
... | replace | 4 | 11 | 4 | 18 | TLE | |
p02971 | Python | Time Limit Exceeded | N = int(input())
A = [int(input()) for _ in range(N)]
for i in range(N):
temp = A[:i] + A[i + 1 :]
print(max(temp))
| N = int(input())
A = [int(input()) for _ in range(N)]
sorted_A = sorted(A)
[print(sorted_A[-2] if sorted_A[-1] == A[i] else sorted_A[-1]) for i in range(N)]
| replace | 2 | 6 | 2 | 4 | TLE | |
p02971 | Python | Runtime Error | def main():
N = int(input())
A = [int(input()) for _ in range(N)]
max_value = max(A)
max_index = A.index(max_value)
for i in range(N):
if i != max_index:
print(max_value)
else:
if i == 0:
print(max(A[1:]))
elif i == N:
... | def main():
N = int(input())
A = [int(input()) for _ in range(N)]
max_value = max(A)
max_index = A.index(max_value)
for i in range(N):
if i != max_index:
print(max_value)
else:
if i == 0:
print(max(A[1:]))
elif i == N - 1:
... | replace | 13 | 15 | 13 | 15 | 0 | |
p02972 | C++ | Memory Limit Exceeded | #include <iostream>
using namespace std;
long long head[200001];
long long save[200001][1000];
int main() {
long long N;
long long a[200001];
long long b[200001];
long long size = 0;
cin >> N;
for (int i = 1; i <= N; i++)
cin >> a[i];
for (int i = 1; i <= N; i++) {
for (int j = 2; i * j <= N; j+... | #include <iostream>
using namespace std;
int head[200001];
int save[200001][200];
int main() {
long long N;
long long a[200001];
long long b[200001];
long long size = 0;
cin >> N;
for (int i = 1; i <= N; i++)
cin >> a[i];
for (int i = 1; i <= N; i++) {
for (int j = 2; i * j <= N; j++) {
sa... | replace | 3 | 5 | 3 | 5 | MLE | |
p02972 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#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 INF 10000000000
#define MOD 1000000007
using ll = long long;
using Graph = vector<set<ll>>;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
rep1(i, ... | #include <bits/stdc++.h>
using namespace std;
#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 INF 10000000000
#define MOD 1000000007
using ll = long long;
using Graph = vector<set<ll>>;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
rep1(i, ... | replace | 19 | 21 | 19 | 21 | 0 | |
p02972 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
#define ll long long
int main() {
ll N, M = 0;
ll i, j;
ll tmp;
cin >> N;
ll a[N + 1], b[N + 1];
for (i = 1; i <= N; i++) {
cin >> a[i];
b[i] = 0;
}
for (i = N; i > 0; i--) {
tmp = 0;
j = i;
while (tmp <= N) {
tmp = (tmp + b[j]) % 2;
... | #include <iostream>
using namespace std;
#define ll long long
int main() {
ll N, M = 0;
ll i, j;
ll tmp;
cin >> N;
ll a[N + 1], b[N + 1];
for (i = 1; i <= N; i++) {
cin >> a[i];
b[i] = 0;
}
for (i = N; i > 0; i--) {
tmp = 0;
j = i;
while (j <= N) {
tmp = (tmp + b[j]) % 2;
... | replace | 16 | 17 | 16 | 17 | TLE | |
p02972 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// DAME:
int main() {
ll n;
cin >> n;
vector<int> a(n + 1);
for (ll i = 1; i <= n; i++) {
cin >> a[i];
}
vector<int> ans(n + 1);
for (ll i = n; i >= 1; i--) {
ll tmp = i;
int sum = 0;
while (tmp <= n) {
tmp += i;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// DAME:
int main() {
ll n;
cin >> n;
vector<int> a(n + 1);
for (ll i = 1; i <= n; i++) {
cin >> a[i];
}
vector<int> ans(n + 1);
for (ll i = n; i >= 1; i--) {
ll tmp = i;
int sum = 0;
while (tmp + i <= n) {
tmp += ... | replace | 17 | 18 | 17 | 18 | 0 | |
p02972 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, m, n) for (int i = m; i < n; ++i)
#define rem(i, m, n) for (int i = m; i > n; --i)
int main() {
int N;
cin >> N;
vector<int> a(N + 1);
rep(i, 1, N + 1) cin >> a[i];
vector<int> ans(N + 1);
rem(i, N, 0) if (a[i]) {
ans[i] = 1;
rep(j, 1, i)... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, m, n) for (int i = m; i < n; ++i)
#define rem(i, m, n) for (int i = m; i > n; --i)
int main() {
int N;
cin >> N;
vector<int> a(N + 1);
rep(i, 1, N + 1) cin >> a[i];
vector<int> ans(N + 1);
rem(i, N, 0) {
ans[i] = a[i];
for (int j = 2 * i;... | replace | 11 | 14 | 11 | 16 | TLE | |
p02972 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
ret... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
ret... | replace | 24 | 25 | 24 | 25 | 0 | |
p02972 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define exrep(i, a, b) for (ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define chmax(x, y) x =... | #include <bits/stdc++.h>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define exrep(i, a, b) for (ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define chmax(x, y) x =... | replace | 125 | 127 | 125 | 129 | TLE | |
p02972 | C++ | Runtime Error | #define _USE_MAT_DEFINES
#include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
... | #define _USE_MAT_DEFINES
#include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
... | replace | 44 | 45 | 44 | 45 | 0 | |
p02972 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
rep(i, n) cin >> a[i + 1];
vector<int> b(n + 1);
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = i + i; j <= n; j += i) {
sum ^= b[j... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
rep(i, n) cin >> a[i + 1];
vector<int> b(n + 1);
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = i + i; j <= n; j += i) {
sum ^= b[j... | replace | 24 | 27 | 24 | 25 | 0 | |
p02972 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int a[N + 1];
int b[N + 1];
int ans[N + 1];
for (int i = 1; i <= N; i++) {
cin >> a[i];
}
for (int i = N; i >= 1; i--) {
int cnt = 0;
for (int j = i + 1; j <= N; j++) {
if (j % i == 0) {
if (b[j] == 1)
... | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int a[N + 1];
int b[N + 1];
int ans[N + 1];
for (int i = 1; i <= N; i++) {
cin >> a[i];
}
for (int i = N; i >= 1; i--) {
int cnt = 0;
for (int j = i + i; j <= N; j += i) {
if (j % i == 0) {
if (b[j] == 1)
... | replace | 15 | 16 | 15 | 16 | TLE | |
p02972 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#d... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#d... | replace | 58 | 59 | 58 | 59 | -6 | free(): invalid pointer
|
p02972 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Pi = pair<int, int>;
using Pl = pair<ll, ll>;
using vint = vector<int>;
using vvint = vector<vint>;
using vvvint = vector<vvint>;
using vdouble = vector<double>;
using vvdouble = vector<vdouble>;
using vvvdouble = vector<vvdouble>;
using vll = v... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Pi = pair<int, int>;
using Pl = pair<ll, ll>;
using vint = vector<int>;
using vvint = vector<vint>;
using vvvint = vector<vvint>;
using vdouble = vector<double>;
using vvdouble = vector<vdouble>;
using vvvdouble = vector<vvdouble>;
using vll = v... | insert | 52 | 52 | 52 | 54 | 0 | |
p02972 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
scanf("%d", &n);
vector<int> a(n);
for (int i = 1; i <= n; ++i)
scanf("%d", &a[i]);
vector<int> out;
for (int i = n; i > 0; --i) {
for (int j = 2 * i; j <= n; j += i)
a[i] ^... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
scanf("%d", &n);
vector<int> a(n + 1);
for (int i = 1; i <= n; ++i)
scanf("%d", &a[i]);
vector<int> out;
for (int i = n; i > 0; --i) {
for (int j = 2 * i; j <= n; j += i)
a[... | replace | 10 | 11 | 10 | 11 | 0 | |
p02972 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
typedef pair<int, int> P;
template <class T> inline bool chmax(T &a, T b) {
if (a < b)... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
typedef pair<int, int> P;
template <class T> inline bool chmax(T &a, T b) {
if (a < b)... | replace | 33 | 35 | 33 | 35 | 0 | |
p02972 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int arr[N], n, val[N];
vector<int> v;
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> arr[i];
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = i; j <= n; j += i)
sum += val[j];
if (sum % 2 != arr[i]) {
... | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
int arr[N], n, val[N];
vector<int> v;
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> arr[i];
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j = i; j <= n; j += i)
sum += val[j];
if (sum % 2 != arr[i]) {
... | replace | 2 | 3 | 2 | 3 | 0 | |
p02972 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, a, n) for (int i = a; ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, a, n) for (int i = a; ... | replace | 29 | 31 | 29 | 34 | TLE | |
p02972 | C++ | Time Limit Exceeded | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <deque> // deque
#include <iomanip> // setprecision
#include <iostream> // cout, endl, cin
#include <map> // map
#include <math.h> // sqrt
#include <queue> // queue, priority_queue... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <deque> // deque
#include <iomanip> // setprecision
#include <iostream> // cout, endl, cin
#include <map> // map
#include <math.h> // sqrt
#include <queue> // queue, priority_queue... | replace | 36 | 40 | 36 | 39 | TLE | |
p02972 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define f(i, x, n) for (int i = x; i < n; i++)
#define all(c) c.begin(), c.end()
#define print(x) cerr << (#x) << "is " << x << "\n"
using ll = long long;
using pii = pair<int, int>;
const int MOD = ... | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define f(i, x, n) for (int i = x; i < n; i++)
#define all(c) c.begin(), c.end()
#define print(x) cerr << (#x) << "is " << x << "\n"
using ll = long long;
using pii = pair<int, int>;
const int MOD = ... | replace | 24 | 25 | 24 | 25 | TLE | |
p02972 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n;
int a[1000000];
int b[1000000];
int c[1000000];
int main() {
ll cnt = 0;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= n; i++)
b[i] = 0;
// cerr << " end in" << endl;
for (ll i = n; i > 0; i--) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n;
int a[1000000];
int b[1000000];
int c[1000000];
int main() {
ll cnt = 0;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= n; i++)
b[i] = 0;
// cerr << " end in" << endl;
for (ll i = n; i > 0; i--) {
... | replace | 18 | 22 | 18 | 21 | TLE | |
p02972 | 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 count = 0;
for (int i = n - 1; i >= 0; i--) {
for (int j = i * 2 + 1; j < n; j += i + 1) {
a[i] ^= a[j];
}
count += a[i];
}
cout << coun... | #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 count = 0;
for (int i = n - 1; i >= 0; i--) {
for (int j = i * 2 + 1; j < n; j += i + 1) {
a[i] ^= a[j];
}
count += a[i];
}
cout << coun... | replace | 20 | 21 | 20 | 21 | 0 | |
p02972 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <string>
#include <time.h>
#include <tuple>
#include <vector>
// #in... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <string>
#include <time.h>
#include <tuple>
#include <vector>
// #in... | replace | 134 | 135 | 134 | 135 | -6 | Fatal glibc error: malloc assertion failure in sysmalloc: (old_top == initial_top (av) && old_size == 0) || ((unsigned long) (old_size) >= MINSIZE && prev_inuse (old_top) && ((unsigned long) old_end & (pagesize - 1)) == 0)
|
p02972 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define per(i, a, b) for (int i = a; i >= b; i--)
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define sz(x) ((int)x.size())
#define rd(type, ...) ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define per(i, a, b) for (int i = a; i >= b; i--)
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define sz(x) ((int)x.size())
#define rd(type, ...) ... | replace | 62 | 63 | 62 | 63 | 0 | |
p02972 | C++ | Runtime Error | #include <iostream>
#include <stdio.h>
using namespace std;
const int M = 2e5 + 5;
int a[M];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
int cnt = 0;
for (int i = n; i >= 1; i--) {
for (int j = 2; j <= n; j++)
a[i] = (a[i] + a[i * j]) % 2;
if (a[i]... | #include <iostream>
#include <stdio.h>
using namespace std;
const int M = 2e5 + 5;
int a[M];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
int cnt = 0;
for (int i = n; i >= 1; i--) {
for (int j = 2; i * j <= n; j++)
a[i] = (a[i] + a[i * j]) % 2;
if (... | replace | 14 | 15 | 14 | 15 | 0 | |
p02972 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// #define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop ... | #include <bits/stdc++.h>
using namespace std;
// #define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop ... | replace | 111 | 112 | 111 | 112 | 0 | |
p02972 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int N;
bool A[2010], C[2010];
vector<int> B;
cin >> N;
for (int i = 1; i <= N; ++i) {
bool a;
cin >> a;
A[i] = (a > 0 ? true : false);
}
int sum = 0;
for (int i = N; i >= 1; --i) {
int j = i;
... | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int N;
bool A[200010], C[200010];
vector<int> B;
cin >> N;
for (int i = 1; i <= N; ++i) {
bool a;
cin >> a;
A[i] = (a > 0 ? true : false);
}
int sum = 0;
for (int i = N; i >= 1; --i) {
int j =... | replace | 8 | 9 | 8 | 9 | 0 | |
p02972 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
int a[2100];
int b[2100];
vector<int> x;
int c = 0;
for (int i = 1; i <= N; i++) {
cin >> a[i];
}
for (int i = N; i > 0; i--) {
int z = 2;
int sum = 0;
while (z *... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
int a[210000];
int b[210000];
vector<int> x;
int c = 0;
for (int i = 1; i <= N; i++) {
cin >> a[i];
}
for (int i = N; i > 0; i--) {
int z = 2;
int sum = 0;
while ... | replace | 10 | 12 | 10 | 12 | 0 | |
p02972 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
const ll INF = mod * mod;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(x) (x).begin(), (x).end()
ll min(ll a, ll b) {
if (a > b) {
return b;
} else {
return a;
}
}
ll max(ll a, ll b) {
if (a > ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
const ll INF = mod * mod;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(x) (x).begin(), (x).end()
ll min(ll a, ll b) {
if (a > b) {
return b;
} else {
return a;
}
}
ll max(ll a, ll b) {
if (a > ... | replace | 63 | 68 | 63 | 68 | TLE | |
p02972 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int a[100005], b[100005];
int main() {
int n, num = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = n; i >= 1; i--) {
int j = i * 2;
b[i] = a[i];
while (j <= n) {
b[i] ^= b[j];
j += i;
}... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int a[200005], b[200005];
int main() {
int n, num = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = n; i >= 1; i--) {
int j = i * 2;
b[i] = a[i];
while (j <= n) {
b[i] ^= b[j];
j += i;
}... | replace | 3 | 4 | 3 | 4 | 0 | |
p02972 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
long long n, sum = 0, mod = 2019;
cin >> n;
vector<bool> vec(n + 1, 0);
vector<int> ans;
int a[n + 1];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = n; i >= 1; i--) {
int... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
long long n, sum = 0, mod = 2019;
cin >> n;
vector<bool> vec(n + 1, 0);
vector<int> ans;
int a[n + 1];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = n; i >= 1; i--) {
int... | replace | 28 | 29 | 28 | 29 | 0 | |
p02972 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
REP(i, n) { cin >> a[i]; }
vector<int> ans(n + 1, 0);
for (int i = n; i >= 1; --i) {
int ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
REP(i, n) { cin >> a[i]; }
vector<int> ans(n + 1, 0);
for (int i = n; i >= 1; --i) {
int ... | replace | 15 | 19 | 15 | 17 | TLE | |
p02972 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> a(N);
REP(i, N) { cin >> a[i]; }
vector<int> ans(N + 1);
ans.assign(N + 1, 0);
for (int i = N; i >= ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> a(N + 1);
REP(i, N) { cin >> a[i]; }
vector<int> ans(N + 1);
ans.assign(N + 1, 0);
for (int i = N; i... | replace | 9 | 10 | 9 | 10 | 0 | |
p02972 | C++ | Runtime Error | #include <iostream>
using namespace std;
unsigned int a[100001];
bool ans[100001];
int main(void) {
int N;
cin >> N;
for (int i = 0; i <= N; i++)
ans[i] = false;
for (int i = 1; i <= N; i++)
cin >> a[i];
int ans_cnt = 0;
for (int i = N; i > 0; i--) {
unsigned int sum = 0;
for (int j = i; ... | #include <iostream>
using namespace std;
unsigned int a[200001];
bool ans[200001];
int main(void) {
int N;
cin >> N;
for (int i = 0; i <= N; i++)
ans[i] = false;
for (int i = 1; i <= N; i++)
cin >> a[i];
int ans_cnt = 0;
for (int i = N; i > 0; i--) {
unsigned int sum = 0;
for (int j = i; ... | replace | 3 | 5 | 3 | 5 | 0 | |
p02972 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long n;
cin >> n;
vector<long> a(n);
for (long i = 0; i < n; ++i) {
cin >> a[i];
}
vector<long> ans;
for (long i = n - 1; i >= n / 2 + 1; --i) {
ans.push_back(a[i]);
}
for (long i = n / 2; i >= 0; --i) {
long sum = 0;
for (lo... | #include <bits/stdc++.h>
using namespace std;
int main() {
long n;
cin >> n;
vector<long> a(n);
for (long i = 0; i < n; ++i) {
cin >> a[i];
}
vector<long> ans;
for (long i = n - 1; i >= n / 2 + 1; --i) {
ans.push_back(a[i]);
}
for (long i = n / 2; i >= 0; --i) {
long sum = 0;
for (lo... | replace | 18 | 19 | 18 | 19 | 0 | |
p02972 | C++ | Runtime Error | /*
Original problem: https://atcoder.jp/contests/abc134/tasks/abc134_d
Author: sammochen
*/
#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
using namespace std;
#define REP(x, l, u) for (ll x = l; x < u; x++)
#define RREP(x, l, u) for (ll x = l; x >= u; x--)
#define PII pair<int, int>
#define PLL pair<ll, ... | /*
Original problem: https://atcoder.jp/contests/abc134/tasks/abc134_d
Author: sammochen
*/
#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
using namespace std;
#define REP(x, l, u) for (ll x = l; x < u; x++)
#define RREP(x, l, u) for (ll x = l; x >= u; x--)
#define PII pair<int, int>
#define PLL pair<ll, ... | replace | 34 | 35 | 34 | 35 | 0 | |
p02972 | C++ | Time Limit Exceeded | #include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int n, a[200005], b[200005];
vector<int> ans;
inline void dd() {
for (int i = 1; i <= n; ++i)
printf("%d ", b[i]);
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d", &a[i]);
for (int i = n; i >= 1; --i) {
... | #include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int n, a[200005], b[200005];
vector<int> ans;
inline void dd() {
for (int i = 1; i <= n; ++i)
printf("%d ", b[i]);
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d", &a[i]);
for (int i = n; i >= 1; --i) {
... | replace | 16 | 17 | 16 | 17 | TLE | |
p02972 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <set>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main(void) {
long long int n;
cin >> n;
vector<long long int> a(n);
for (long long int i = 0; i... | #include <algorithm>
#include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <set>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main(void) {
long long int n;
cin >> n;
vector<long long int> a(n);
for (long long int i = 0; i... | replace | 24 | 27 | 24 | 25 | TLE | |
p02972 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int N = 1e5 + 5;
int a[N], b[N];
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#ifdef ONLINE_JUDGE
// freopen("", "r", stdin);
// freopen("", "w", stdout);
#endif
int n;
cin >> n;
for ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int N = 2e5 + 5;
int a[N], b[N];
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#ifdef ONLINE_JUDGE
// freopen("", "r", stdin);
// freopen("", "w", stdout);
#endif
int n;
cin >> n;
for ... | replace | 7 | 8 | 7 | 8 | 0 | |
p02972 | C++ | Runtime Error | // D.
#include <algorithm>
#include <bitset>
#include <iostream>
#include <sstream>
#include <vector>
using namespace std;
typedef long long LL;
typedef bitset<100002> BS;
int main(int argc, char *argv[]) {
int n;
cin >> n;
BS a, r;
for (int i = 1; i <= n; ++i) {
int x;
cin >> x;
if (x) {
... | // D.
#include <algorithm>
#include <bitset>
#include <iostream>
#include <sstream>
#include <vector>
using namespace std;
typedef long long LL;
typedef bitset<200002> BS;
int main(int argc, char *argv[]) {
int n;
cin >> n;
BS a, r;
for (int i = 1; i <= n; ++i) {
int x;
cin >> x;
if (x) {
... | replace | 11 | 12 | 11 | 12 | 0 | |
p02972 | C++ | Runtime Error | #include <algorithm>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
vector<ll> a(n), b(n, 0);
for (int i = 1; i <= n; i++) {
... | #include <algorithm>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
vector<ll> a(2 * n), b(2 * n, 0);
for (int i = 1; i <= n;... | replace | 18 | 19 | 18 | 19 | -6 | Fatal glibc error: malloc assertion failure in sysmalloc: (old_top == initial_top (av) && old_size == 0) || ((unsigned long) (old_size) >= MINSIZE && prev_inuse (old_top) && ((unsigned long) old_end & (pagesize - 1)) == 0)
|
p02972 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define Int int64_t
#define dump(x) cout << (x) << endl
#define fi first
#define se second
Int mod = 1e9 + 7;
Int INF = 1e18;
double EPS = 0.00000001;
// Int mod = 998244353;
int main() {
Int n;
cin >> n;
vector<bool> a(n + 1);
for (Int i = 1; i <= n; i++) {
In... | #include <bits/stdc++.h>
using namespace std;
#define Int int64_t
#define dump(x) cout << (x) << endl
#define fi first
#define se second
Int mod = 1e9 + 7;
Int INF = 1e18;
double EPS = 0.00000001;
// Int mod = 998244353;
int main() {
Int n;
cin >> n;
vector<bool> a(n + 1);
for (Int i = 1; i <= n; i++) {
In... | replace | 20 | 22 | 20 | 22 | 0 | |
p02972 | C++ | Runtime Error | #include <algorithm> //sort()
#include <iostream>
#include <numeric>
#include <stdlib.h>
#include <tuple>
#include <vector> //vector
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define debug(a) cout << "debug (" #a "):" << endl << (a) << endl;
typedef uint64_t ulint;
typ... | #include <algorithm> //sort()
#include <iostream>
#include <numeric>
#include <stdlib.h>
#include <tuple>
#include <vector> //vector
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define debug(a) cout << "debug (" #a "):" << endl << (a) << endl;
typedef uint64_t ulint;
typ... | replace | 44 | 45 | 44 | 45 | 0 | |
p02972 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
int main() {
ll n;
cin >> n;
vector<ll> a(n + 1);
a[0] = -1;
for (ll i = 1; i <= n; i++)
cin >> a[i];
vector<ll> b(n + 1);
b[0] = -1;
for (ll i = n... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
int main() {
ll n;
cin >> n;
vector<ll> a(n + 1);
a[0] = -1;
for (ll i = 1; i <= n; i++)
cin >> a[i];
vector<ll> b(n + 1);
b[0] = -1;
for (ll i = n... | replace | 22 | 26 | 22 | 27 | 0 | |
p02972 | 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; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
int main... | #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 INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
int main... | replace | 20 | 21 | 20 | 21 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 3) >= this->size() (which is 3)
|
p02972 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const int INF = (1 << 30);
const ll INFLL = (1ll << 60);
const ll MOD = (ll)(1e9 + 7);
#define l_ength size
void mul_mod(ll &a, ll b) {
a *= b;
a %= MOD;
}
void add_mod(ll &a, ll b) {
a = (a < MOD) ? a : (a - MOD);
b = (b < MOD) ? b : (b - M... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const int INF = (1 << 30);
const ll INFLL = (1ll << 60);
const ll MOD = (ll)(1e9 + 7);
#define l_ength size
void mul_mod(ll &a, ll b) {
a *= b;
a %= MOD;
}
void add_mod(ll &a, ll b) {
a = (a < MOD) ? a : (a - MOD);
b = (b < MOD) ? b : (b - M... | replace | 21 | 22 | 21 | 22 | 0 | |
p02972 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class ... | replace | 51 | 52 | 51 | 52 | 0 | |
p02972 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int a[200001] = {};
int b[200001] = {};
int main() {
long N;
cin >> N;
for (long i = 1; i <= N; i++) {
cin >> a[i];
}
long M = 0;
if (a[N] == 1) {
M++;
b[N] = 1;
}
for (long i = N - 1; i >= 1; i--) {
long c = 0;
for (long j = i; j <= N;... | #include <bits/stdc++.h>
using namespace std;
int a[200001] = {};
int b[200001] = {};
int main() {
long N;
cin >> N;
for (long i = 1; i <= N; i++) {
cin >> a[i];
}
long M = 0;
if (a[N] == 1) {
M++;
b[N] = 1;
}
for (long i = N - 1; i >= 1; i--) {
long c = 0;
for (long j = i; j <= N;... | replace | 19 | 21 | 19 | 21 | TLE | |
p02972 | C++ | Runtime Error | #include <iostream>
#include <stdio.h>
// #include <bits/stdc++.h>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cmath>
#include <cstring>
#include <float.h>
#include <iomanip>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#... | #include <iostream>
#include <stdio.h>
// #include <bits/stdc++.h>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cmath>
#include <cstring>
#include <float.h>
#include <iomanip>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#... | replace | 36 | 43 | 36 | 38 | 0 | |
p02972 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> res(n + 1), a(n);
int cnt = 0;
for (int i = 0; i < n; i++) {
cin >> a.at(i);
if (i >= n / 2) {
res.at(i + 1) = a.at(i);
if (res.at(i + 1) == 1)
cnt++;
}
}
for (int i = n / 2; i > 0; i--... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> res(n + 1), a(n);
int cnt = 0;
for (int i = 0; i < n; i++) {
cin >> a.at(i);
if (i >= n / 2) {
res.at(i + 1) = a.at(i);
if (res.at(i + 1) == 1)
cnt++;
}
}
for (int i = n / 2; i > 0; i--... | replace | 31 | 32 | 31 | 32 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 4) >= this->size() (which is 4)
|
p02972 | C++ | Runtime Error | // C++ includes
#include <bits/stdc++.h>
// 俳句
using namespace std;
// alias templates
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
// alias declaration
using ll = long long;
using str = string;
using vll = V<ll>;
using vvll = V<vll>;
using vs = V<str>;
// loops
#define FOR(i, a, b... | // C++ includes
#include <bits/stdc++.h>
// 俳句
using namespace std;
// alias templates
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
// alias declaration
using ll = long long;
using str = string;
using vll = V<ll>;
using vvll = V<vll>;
using vs = V<str>;
// loops
#define FOR(i, a, b... | replace | 36 | 42 | 36 | 51 | 0 | |
p02972 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a.at(i);
}
vector<int> A(N, 0);
// reverse(a.begin(),a.end());
int tmp = 0;
for (int i = 0; i < N; i++) {
int j = N - i - 1;
tmp = 0;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a.at(i);
}
vector<int> A(N, 0);
// reverse(a.begin(),a.end());
int tmp = 0;
for (int i = 0; i < N; i++) {
int j = N - i - 1;
tmp = 0;
... | replace | 17 | 18 | 17 | 18 | 0 | |
p02972 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = ll(a); i < ll(b); i++)
#define irep(i, a, b) for (ll i = ll(a); i > ll(b); i--)
using ll = long long;
using namespace std;
ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
// sort(a, a + N, greater<ll>()) // descend
// sort(a, a+N) // ... | #include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = ll(a); i < ll(b); i++)
#define irep(i, a, b) for (ll i = ll(a); i > ll(b); i--)
using ll = long long;
using namespace std;
ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
// sort(a, a + N, greater<ll>()) // descend
// sort(a, a+N) // ... | replace | 37 | 41 | 37 | 39 | TLE | |
p02972 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#ifndef bhartiya
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
// #pragma GCC target
// ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native"... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#ifndef bhartiya
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
// #pragma GCC target
// ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native"... | replace | 79 | 80 | 79 | 80 | 0 | |
p02972 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
ll N;
cin >> N;
vector<int> a(N + 1);
for (int i = 1; i <= N; i++) {
cin >> a[i];
}
vector<int> box(N);
ll ans = 0;
vector<ll> ans_arr;
for (ll i = N / 2 + 1; i <= N; i++) {
box[i] = a[i];
if (box[i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
ll N;
cin >> N;
vector<int> a(N + 1);
for (int i = 1; i <= N; i++) {
cin >> a[i];
}
vector<int> box(N + 1);
ll ans = 0;
vector<ll> ans_arr;
for (ll i = N / 2 + 1; i <= N; i++) {
box[i] = a[i];
if (b... | replace | 14 | 15 | 14 | 15 | 0 | |
p02972 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// type alias
typedef long long LL;
typedef pair<int, int> II;
typedef tuple<int, int, int> III;
typedef vector<int> VI;
typedef vector<string> VS;
typedef unordered_map<int, int> MAPII;
typedef unordered_set<int> SETI;
template <class T> using VV = vector<vector<T>>;
// mi... | #include <bits/stdc++.h>
using namespace std;
// type alias
typedef long long LL;
typedef pair<int, int> II;
typedef tuple<int, int, int> III;
typedef vector<int> VI;
typedef vector<string> VS;
typedef unordered_map<int, int> MAPII;
typedef unordered_set<int> SETI;
template <class T> using VV = vector<vector<T>>;
// mi... | replace | 107 | 108 | 107 | 108 | 0 | |
p02972 | 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;
int m = 0;
int main() {
int N;
cin >> N;
vector<int> a(N);
vector<int> b(N);
for (int i = 1; i <= N; i++) {
cin >> a[i];
b[i] = a[i];
}
for (int i = N; i >= 1; i--) {
for (int... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int m = 0;
int main() {
int N;
cin >> N;
vector<int> a(N + 1);
vector<int> b(N + 1);
for (int i = 1; i <= N; i++) {
cin >> a[i];
b[i] = a[i];
}
for (int i = N; i >= 1; i--) {
... | replace | 9 | 11 | 9 | 11 | 0 | |
p02972 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef pair<int, int> Pii;
typedef pair<int, double> Pid;
typedef pair<do... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef pair<int, int> Pii;
typedef pair<int, double> Pid;
typedef pair<do... | replace | 27 | 29 | 27 | 29 | 0 | |
p02972 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int out_print(vector<int> b, int N, int num) {
cout << num << endl;
if (num == 0)
return 0;
for (int i = 0; i < N; i++) {
if (b[i] == 1) {
cout << (i + 1) << " ";
}
}
return 0;
}
int is_odd(vector<int> b, int ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int out_print(vector<int> b, int N, int num) {
cout << num << endl;
if (num == 0)
return 0;
for (int i = 0; i < N; i++) {
if (b[i] == 1) {
cout << (i + 1) << " ";
}
}
return 0;
}
int is_odd(vector<int> b, int ... | replace | 47 | 49 | 47 | 57 | TLE | |
p02972 | 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;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
typedef long long ll;
typedef pair<ll, int> P;
typedef set<int> S;
int main() {
int m;
ci... | #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;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
typedef long long ll;
typedef pair<ll, int> P;
typedef set<int> S;
int main() {
int m;
ci... | replace | 24 | 29 | 24 | 29 | TLE | |
p02972 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
const int INF = 100100100;
using namespace std;
int main() {
int N;
int a[100001];
int c[100001];
int res = 0;
cin >> N;
rep(i, N) cin >> a[i + 1];
rep(i, N + 1) c[i] = 0;
for (int i = N; i > 0; i--) {
int j = 2;
int sum =... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
const int INF = 100100100;
using namespace std;
int main() {
int N;
int a[200001];
int c[200001];
int res = 0;
cin >> N;
rep(i, N) cin >> a[i + 1];
rep(i, N + 1) c[i] = 0;
for (int i = N; i > 0; i--) {
int j = 2;
int sum =... | replace | 7 | 9 | 7 | 9 | 0 | |
p02972 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <set>
#include <stdio.h>
#include <vector>
int main() {
// read problem
long long int N, tmp, factor;
std::vector<long long int> a, count, box;
scanf("%lld", &N);
for (long long int i = 0; i < N; i++) {
... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <set>
#include <stdio.h>
#include <vector>
int main() {
// read problem
long long int N, tmp, factor;
std::vector<long long int> a, count, box;
scanf("%lld", &N);
for (long long int i = 0; i < N; i++) {
... | replace | 33 | 34 | 33 | 34 | 0 | Answer:
|
p02972 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
/*
#include <boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
using cint = cpp_int;
*/
// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
const ll dx[4] = {1, 0, -1, 0};
const ll dy[4] = {0, 1, 0, -1};
const ll ... | #include <bits/stdc++.h>
using namespace std;
/*
#include <boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
using cint = cpp_int;
*/
// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
const ll dx[4] = {1, 0, -1, 0};
const ll dy[4] = {0, 1, 0, -1};
const ll ... | replace | 209 | 210 | 209 | 210 | TLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.