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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02983 | C++ | Time Limit Exceeded | #define DEBUG 1
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vect... | #define DEBUG 1
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vect... | insert | 163 | 163 | 163 | 164 | TLE | |
p02983 | C++ | Time Limit Exceeded | #define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <... | #define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <... | replace | 39 | 40 | 39 | 41 | TLE | |
p02983 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define LL long long
#define reg register
#define debug(x) cerr << #x << " = " << x << endl;
#define rep(a, b, c) for (reg int a = (b), a##_end_ = (c); a <= a##_end_; ++a)
#define ret(a, b, c) for (reg int a = (b), a##_end_ = (c); a < a##_end_; ++a)
#define drep(a, b, c) ... | #include <bits/stdc++.h>
using namespace std;
#define LL long long
#define reg register
#define debug(x) cerr << #x << " = " << x << endl;
#define rep(a, b, c) for (reg int a = (b), a##_end_ = (c); a <= a##_end_; ++a)
#define ret(a, b, c) for (reg int a = (b), a##_end_ = (c); a < a##_end_; ++a)
#define drep(a, b, c) ... | replace | 39 | 40 | 39 | 40 | 0 | |
p02983 | C++ | Time Limit Exceeded | #include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <casser... | #include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <casser... | insert | 62 | 62 | 62 | 64 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long l, r, i, val, j;
cin >> l >> r;
long long minn = ((l % 2019) * ((l + 1) % 2019)) % 2019;
for (i = l; i < r; i++) {
for (j = i + 1; j <= r; j++) {
val = ((i % 2019) * (j % 2019)) % 2019;
if (val < minn) {
minn = val;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long l, r, i, val, j;
cin >> l >> r;
long long minn = ((l % 2019) * ((l + 1) % 2019)) % 2019;
for (i = l; i < r; i++) {
if (minn == 0) {
break;
}
for (j = i + 1; j <= r; j++) {
val = ((i % 2019) * (j % 2019)) % 2019;
i... | insert | 7 | 7 | 7 | 10 | TLE | |
p02983 | C++ | Time Limit Exceeded |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
long long L, R;
cin >> L >> R;
int N = R - L + 1;
// vector<int> mod_list(N,0);
int min_mod = 1e9;
int max_mo... |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
long long L, R;
cin >> L >> R;
int N = R - L + 1;
// vector<int> mod_list(N,0);
int min_mod = 1e9;
int max_mo... | insert | 29 | 29 | 29 | 31 | TLE | |
p02983 | C++ | Runtime Error | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <string.h>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
const int INF = (1 << 30) - 1;
const ll I... | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <string.h>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
const int INF = (1 << 30) - 1;
const ll I... | replace | 28 | 29 | 28 | 29 | -11 | |
p02983 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using ll = long long;
using ld = long double;
using namespace std;
con... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using ll = long long;
using ld = long double;
using namespace std;
con... | replace | 34 | 41 | 34 | 41 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int L, R;
cin >> L >> R;
int min = 9999;
long long int tmp;
for (long long int i = L; i < R; i++) {
for (long long int j = i + 1; j <= R; j++) {
tmp = i * j;
tmp %= 2019;
if (min > tmp) {
min = tmp;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int L, R;
cin >> L >> R;
if (R - L >= 2019) {
cout << 0 << endl;
return 0;
}
int min = 9999;
long long int tmp;
for (long long int i = L; i < R; i++) {
for (long long int j = i + 1; j <= R; j++) {
tmp = i * j;
... | insert | 6 | 6 | 6 | 11 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define mfill(x, y) memset(x, y, sizeof(x))
#define all(v) v.begin(), v.end()
#define in(x, y, h, w) if (0 <= x && x < h && 0 <= y && y < w)
#define y0 y12345
#define y1 y54321
#ifdef LOCAL
#define debug(...) fprintf(stderr, __... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define mfill(x, y) memset(x, y, sizeof(x))
#define all(v) v.begin(), v.end()
#define in(x, y, h, w) if (0 <= x && x < h && 0 <= y && y < w)
#define y0 y12345
#define y1 y54321
#ifdef LOCAL
#define debug(...) fprintf(stderr, __... | insert | 65 | 65 | 65 | 66 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long l, r;
cin >> l >> r;
if (l - r >= 2019)
cout << 0 << endl;
else {
long long kotae = LLONG_MAX;
for (long long i = l; i < r; i++) {
for (long long j = i + 1; j <= r; j++) {
kotae = min(kotae, (i % 2019 * j) % 2019);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long l, r;
cin >> l >> r;
if (r - l >= 2019)
cout << 0 << endl;
else {
long long kotae = LLONG_MAX;
for (long long i = l; i < r; i++) {
for (long long j = i + 1; j <= r; j++) {
kotae = min(kotae, (i % 2019 * j) % 2019);
... | replace | 6 | 7 | 6 | 7 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define uLL unsigned long long
using namespace std;
#define LL long long
int mark[2333];
int main() {
int L, R;
cin >> L >> R;
for (int i = L, s = 1; i <= R && s <= 2019 * 3; i++)
mark[i % 2019]++;
int ans = 2019;
for (int i = 0; i <= 2019; i++) {
if (!mark[i])
continue;... | #include <bits/stdc++.h>
#define uLL unsigned long long
using namespace std;
#define LL long long
int mark[2333];
int main() {
int L, R;
cin >> L >> R;
for (int i = L, s = 1; i <= R && s <= 2019 * 3; i++, s++)
mark[i % 2019]++;
int ans = 2019;
for (int i = 0; i <= 2019; i++) {
if (!mark[i])
cont... | replace | 8 | 9 | 8 | 9 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int l, r;
cin >> l >> r;
if (l - r > 3000)
cout << 0 << endl;
else {
int ret = 1145141919;
for (int i = l; i <= r; i++) {
for (int j = i + 1; j <= r; j++) {
int a = i % 2019;
int b = j % ... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int l, r;
cin >> l >> r;
if (r - l > 3000)
cout << 0 << endl;
else {
int ret = 1145141919;
for (int i = l; i <= r; i++) {
for (int j = i + 1; j <= r; j++) {
int a = i % 2019;
int b = j % ... | replace | 9 | 10 | 9 | 10 | TLE | |
p02983 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using P = pair<int, int>;
using ll = long long;
const int INF = 1001001001;
int main() {
int l, r;
cin >> l >> r;
int ans = INF;
if (l - r > 2019) {
cout << 0 << endl;
return 0;
}
for (int i = l; i < r; i+... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using P = pair<int, int>;
using ll = long long;
const int INF = 1001001001;
int main() {
int l, r;
cin >> l >> r;
int ans = INF;
if (l - r > 2019) {
cout << 0 << endl;
return 0;
}
for (int i = l; i < r; i+... | insert | 23 | 23 | 23 | 25 | TLE | |
p02984 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
typedef long long ll;
const int INT_INF = 1e9;
const ll INF = 1LL << 30;
const ll MOD = 1e9 + 7;
int main() {
int n;
cin >> n;
V<ll> a(n);
ll sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i]... | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
typedef long long ll;
const int INT_INF = 1e9;
const ll INF = 1LL << 30;
const ll MOD = 1e9 + 7;
int main() {
int n;
cin >> n;
V<ll> a(n);
ll sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i]... | replace | 28 | 30 | 28 | 30 | -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)
|
p02984 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n;
long box = 0;
cin >> n;
vector<int> a(n);
vector<int> mo(n - 1);
vector<int> al(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
al[i] = a[i];
}
while (al.size() != 1) {
box = al[0] + al[2] - al[1];
al.e... | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n;
long box = 0;
cin >> n;
vector<int> a(n);
vector<int> mo(n);
vector<int> al(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
al[i] = a[i];
}
while (al.size() != 1) {
box = al[0] + al[2] - al[1];
al.erase... | replace | 10 | 11 | 10 | 11 | 0 | |
p02984 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#defi... | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#defi... | replace | 150 | 153 | 150 | 153 | TLE | |
p02984 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<ll> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
ll sum = 0;
for (int i = 0; i < n; i++)
sum += a[i];
int r = n / 2;
vector<ll> m(n);
for (int i = 0; i < n; i++) {
m[i]... | #include <iostream>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<ll> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
ll sum = 0;
for (int i = 0; i < n; i++)
sum += a[i];
int r = n / 2;
vector<ll> m(n);
m[0] = sum;
for (int j = 1; j < 2 * ... | replace | 17 | 25 | 17 | 23 | TLE | |
p02984 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
long long A[9999];
long long y[9999];
int main() {
int N;
cin >> N;
for (int... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
long long A[99999];
long long y[99999];
int main() {
int N;
cin >> N;
for (i... | replace | 15 | 17 | 15 | 17 | 0 | |
p02984 | C++ | Runtime Error | // include
// ------------------------------------------------
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
// func
// ------------------------------------------------
int CalcSumOfDigit(int n); // 各桁の和を計算する。
int getDigit(int n); // 数字の桁数を取得する。
string upper(string str); // 英字を大文字に変換する。
strin... | // include
// ------------------------------------------------
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
// func
// ------------------------------------------------
int CalcSumOfDigit(int n); // 各桁の和を計算する。
int getDigit(int n); // 数字の桁数を取得する。
string upper(string str); // 英字を大文字に変換する。
strin... | replace | 66 | 67 | 66 | 67 | -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)
|
p02984 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cctype>
#include <climits>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
// typedef pair<... | #include <algorithm>
#include <cctype>
#include <climits>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
// typedef pair<... | replace | 40 | 47 | 40 | 51 | TLE | |
p02984 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using orde... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using orde... | replace | 48 | 49 | 48 | 50 | 0 | |
p02984 | C++ | Time Limit Exceeded | #include <iostream>
#include <limits>
#include <numeric>
#include <vector>
int main() {
int N;
std::cin >> N;
std::vector<long long> a;
a.reserve(N);
long long x;
for (int i = 0; i < N; ++i) {
std::cin >> x;
a.push_back(x);
}
const auto N_half = N / 2LL;
const auto b_sum = std::accumulate(a... | #include <iostream>
#include <limits>
#include <numeric>
#include <vector>
int main() {
int N;
std::cin >> N;
std::vector<long long> a;
a.reserve(N);
long long x;
for (int i = 0; i < N; ++i) {
std::cin >> x;
a.push_back(x);
}
const auto N_half = N / 2LL;
const auto b_sum = std::accumulate(a... | replace | 23 | 30 | 23 | 31 | TLE | |
p02984 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
using namespace std;
typedef long long ll;
const ll M = 1e4 + 5;
ll a[M], ans[M];
inline ll read() {
ll x = 0, f = 1;
char ch = 0;
while (!isdigit(ch))
f = (ch == '-' ? -1 : 1), ch = getchar();
while (isdigit(ch))
x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar();... | #include <cstdio>
#include <iostream>
using namespace std;
typedef long long ll;
const ll M = 1e5 + 5;
ll a[M], ans[M];
inline ll read() {
ll x = 0, f = 1;
char ch = 0;
while (!isdigit(ch))
f = (ch == '-' ? -1 : 1), ch = getchar();
while (isdigit(ch))
x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar();... | replace | 4 | 5 | 4 | 5 | 0 | |
p02984 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
using namespace std;
long long int a[10000];
long long arr[10000];
int main() {
int n;
// scanf("%d",&n);
cin >> n;
for (int i = 1; i <= n; i++) {
// scanf("%d",&a[i]);
cin >> a[i];
}
long long sum = 0;
for (int i = 1; i <= n; i++) {
if (i % 2 != 0) {
... | #include <cstdio>
#include <iostream>
using namespace std;
long long int a[100000000];
long long arr[100000000];
int main() {
int n;
// scanf("%d",&n);
cin >> n;
for (int i = 1; i <= n; i++) {
// scanf("%d",&a[i]);
cin >> a[i];
}
long long sum = 0;
for (int i = 1; i <= n; i++) {
if (i % 2 !=... | replace | 4 | 6 | 4 | 6 | 0 | |
p02984 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define MAX 5
int main() {
long long N;
cin >> N;
long long ans[MAX];
long long A[MAX];
long long sum = 0;
for (int i = 0; i < N; i++) {
cin >> A[i];
sum += A[i];
}
for (int i = 1; i < N; i += 2) {
sum -= 2 * A[i];
}
ans[0] = sum;
for (in... | #include <bits/stdc++.h>
using namespace std;
#define MAX 100000
int main() {
long long N;
cin >> N;
long long ans[MAX];
long long A[MAX];
long long sum = 0;
for (int i = 0; i < N; i++) {
cin >> A[i];
sum += A[i];
}
for (int i = 1; i < N; i += 2) {
sum -= 2 * A[i];
}
ans[0] = sum;
fo... | replace | 3 | 4 | 3 | 4 | 0 | |
p02984 | 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 main() {
int n;
vector<int> a(n);
rep(i, n) cin >> a[i];
ll x2 = 0;
rep(i, n) {
if (i % 2)
x2 -= a[i];
else
x2 += a[i];
}
vector<int> ans(n);
ans[0] = x2 / 2;
re... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
ll x2 = 0;
rep(i, n) {
if (i % 2)
x2 -= a[i];
else
x2 += a[i];
}
vector<int> ans(n);
ans[0] = ... | insert | 7 | 7 | 7 | 8 | 0 | |
p02984 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define MAX(a, b) (a > b ? a : b)
#define MIN(a, b) (a... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define MAX(a, b) (a > b ? a : b)
#define MIN(a, b) (a... | replace | 34 | 35 | 34 | 35 | 0 | |
p02984 | C++ | Time Limit Exceeded | //
// Created by kuroneko on 2019-07-06.
//
#include <iostream>
typedef long long ll;
using namespace std;
int main() {
int N;
cin >> N;
ll A[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
}
ll x[N];
for (int i = 0; i < N; i++) {
x[i] = A[i];
for (int j = 1; j < N; j++) {
if (j % 2 =... | //
// Created by kuroneko on 2019-07-06.
//
#include <iostream>
typedef long long ll;
using namespace std;
int main() {
int N;
cin >> N;
ll A[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
}
ll x[N];
x[0] = A[0];
for (int j = 1; j < N; j++) {
if (j % 2 == 1)
x[0] -= A[j % N];
else
... | replace | 18 | 26 | 18 | 28 | TLE | |
p02984 | C++ | Time Limit Exceeded | #define ll long long
#define FOR(i, begin, end) for (ll i = (begin); i < (end); i++)
#define REP(i, n) FOR(i, 0, n)
#define SORT(a) sort(a.begin(), a.end())
#define SORTD(a) sort(a.rbegin(), a.rend());
#define UNIQUE(a) unique(a.begin(), a.end())
#define INF 1000000000000000000
#define INT_MAX 2147483647
#include <alg... | #define ll long long
#define FOR(i, begin, end) for (ll i = (begin); i < (end); i++)
#define REP(i, n) FOR(i, 0, n)
#define SORT(a) sort(a.begin(), a.end())
#define SORTD(a) sort(a.rbegin(), a.rend());
#define UNIQUE(a) unique(a.begin(), a.end())
#define INF 1000000000000000000
#define INT_MAX 2147483647
#include <alg... | replace | 39 | 42 | 39 | 44 | TLE | |
p02984 | C++ | Runtime Error | // includes
#include "bits/stdc++.h"
using namespace std;
// macros
#define ll long long
#define MOD 1000000007 // 998244353 //100000000 //
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define sz(x) ((ll)(x).size())
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for (ll i = 0; i < n; ... | // includes
#include "bits/stdc++.h"
using namespace std;
// macros
#define ll long long
#define MOD 1000000007 // 998244353 //100000000 //
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define sz(x) ((ll)(x).size())
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for (ll i = 0; i < n; ... | replace | 163 | 164 | 163 | 165 | 0 | |
p02984 | C++ | Runtime Error | #include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
typedef unsigned int uint;
typedef long long ll;
typedef pair<int, int> P;
const int c_INF = 11111111111;
const int c_mINF = -11111111111;
const int c_YET = -1;
const int c_Dx[4] = {0, 0, 1, -1};
const int... | #include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
typedef unsigned int uint;
typedef long long ll;
typedef pair<int, int> P;
const int c_INF = 11111111111;
const int c_mINF = -11111111111;
const int c_YET = -1;
const int c_Dx[4] = {0, 0, 1, -1};
const int... | replace | 16 | 17 | 16 | 17 | 0 | |
p02984 | C++ | Runtime Error | #include <bits/stdc++.h>
// #include <ext/numeric>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
#define oo 0x3f3f3f3f
#define OO 0x3f3f3f3f3f3f3f3f
#define popcount(n) __builtin_popcount(n)
#define popcountll(n) __builtin_pop... | #include <bits/stdc++.h>
// #include <ext/numeric>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
#define oo 0x3f3f3f3f
#define OO 0x3f3f3f3f3f3f3f3f
#define popcount(n) __builtin_popcount(n)
#define popcountll(n) __builtin_pop... | replace | 26 | 27 | 26 | 27 | 0 | |
p02984 | C++ | Time Limit Exceeded | #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;
typedef vector<int> vi;
const int m = 1000000007;
int main() {
int n;
cin >> n;
vi a(n);
rep(i, n) cin >> a[i];
ll sum = 0;
rep(i, n) sum += a[i];
int m = (n - 1) /... | #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;
typedef vector<int> vi;
const int m = 1000000007;
int main() {
int n;
cin >> n;
vi a(n);
rep(i, n) cin >> a[i];
ll sum = 0;
rep(i, n) sum += a[i];
int m = (n - 1) /... | replace | 17 | 28 | 17 | 25 | TLE | |
p02984 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long n;
vector<long long> a, ans;
void solve();
int main() {
cin >> n;
a.resize(n);
ans.assign(n, 0);
for (int i = 0; i < n; ++i)
cin >> a[i];
solve();
for (int i = 0; i < n; ++i) {
if (i != 0)
cout << " ";
cout << ans[i];
}
cout <<... | #include <bits/stdc++.h>
using namespace std;
long long n;
vector<long long> a, ans;
void solve();
int main() {
cin >> n;
a.resize(n);
ans.assign(n, 0);
for (int i = 0; i < n; ++i)
cin >> a[i];
solve();
for (int i = 0; i < n; ++i) {
if (i != 0)
cout << " ";
cout << ans[i];
}
cout <<... | replace | 33 | 34 | 33 | 34 | -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)
|
p02984 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
const long long mod = 2019;
using namespace std;
using ll = long long;
int main() {
int n;
ll a_sum = 0;
cin >> n;
vector<ll> a(n);
vector<ll> b(n);
rep(i, n) {
cin >> a[i];
a_sum += a[i];
}
rep(i, n) {
if (i == 0) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
const long long mod = 2019;
using namespace std;
using ll = long long;
int main() {
int n;
ll a_sum = 0;
cin >> n;
vector<ll> a(n);
vector<ll> b(n);
rep(i, n) {
cin >> a[i];
a_sum += a[i];
}
rep(i, n) {
if (i == 0) {
... | replace | 23 | 24 | 23 | 26 | 0 | |
p02984 | C++ | Time Limit Exceeded | // #define _GLIBCXX_DEBUG
#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 Graph vector<vector<int>>
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1000000007;
int main() {
int N;
cin >> N;
vector<ll> A(N... | // #define _GLIBCXX_DEBUG
#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 Graph vector<vector<int>>
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1000000007;
int main() {
int N;
cin >> N;
vector<ll> A(N... | replace | 19 | 26 | 19 | 26 | TLE | |
p02984 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define inf 2147483647
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rr read()
#define ll long ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define inf 2147483647
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rr read()
#define ll long ... | replace | 40 | 48 | 40 | 56 | TLE | |
p02984 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int64_t> A(N);
vector<int64_t> x(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
int64_t sum = 0;
for (int i = 0; i < N; i++) {
if (i % 2 == 0) {
sum += A[i];
} else {
sum -= A[i];
}
}
x[... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int64_t> A(N);
vector<int64_t> x(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
int64_t sum = 0;
for (int i = 0; i < N; i++) {
if (i % 2 == 0) {
sum += A[i];
} else {
sum -= A[i];
}
}
x[... | replace | 20 | 21 | 20 | 21 | -11 | |
p02984 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define INF (1LL << 60)
#define REP(i, m, n) for (ll(i) = (m), i##_len = (n); (i) < (i##_len); ++(i))
#define FORR(i, v) for (auto(i) : v)
#define ALL(x) (x).begin(), (x).end()
#define _PR(x) cout << (x) << endl
#define _PS(x) cout << (x) << " "
#de... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define INF (1LL << 60)
#define REP(i, m, n) for (ll(i) = (m), i##_len = (n); (i) < (i##_len); ++(i))
#define FORR(i, v) for (auto(i) : v)
#define ALL(x) (x).begin(), (x).end()
#define _PR(x) cout << (x) << endl
#define _PS(x) cout << (x) << " "
#de... | replace | 26 | 41 | 26 | 34 | TLE | |
p02984 | Python | Runtime Error | import sys
import numpy as np
def input():
return sys.stdin.readline().rstrip()
def main():
n = int(input())
a = [int(e) for e in input().split()]
va = np.array(a)
m = np.identity(n, dtype=int)
for i in range(n):
if i < n - 1:
m[i][i + 1] = 1
else:
m[i... | import sys
import numpy as np
def input():
return sys.stdin.readline().rstrip()
def main():
n = int(input())
a = [int(e) for e in input().split()]
x = [0 for _ in range(n)]
x[0] = sum(a) - (sum(a[1:n:2]) * 2)
for i in range(2, n, 2):
x[i] = x[i - 2] + ((a[i - 1] - a[i - 2]) * 2)
... | replace | 11 | 20 | 11 | 19 | TLE | |
p02984 | Python | Time Limit Exceeded | from sys import stdin, setrecursionlimit
def main():
input = stdin.buffer.readline
n = int(input())
a = list(map(int, input().split()))
x_sum = sum(a) // 2
x = [0] * n
for i in range(n):
tmp = x_sum
idx = (i + 1) % n
for _ in range((n - 1) // 2):
tmp -= a[id... | from sys import stdin, setrecursionlimit
def main():
input = stdin.buffer.readline
n = int(input())
a = list(map(int, input().split()))
x_sum = sum(a) // 2
x = [0] * n
tmp = x_sum
idx = 1
for _ in range((n - 1) // 2):
tmp -= a[idx]
idx += 2
idx %= n
x[0] = 2... | replace | 9 | 17 | 9 | 18 | TLE | |
p02984 | Python | Time Limit Exceeded | n = int(input())
a = list(map(int, input().split()))
b = sum(a) / 2
p = int((n - 1) / 2)
x = []
for i in range(n):
t = b
for j in range(p):
t -= a[(2 * j + i + 1) % n]
x.append(t * 2)
for i in range(n):
print(int(x[i]), end=" ")
| n = int(input())
a = list(map(int, input().split()))
b = sum(a) / 2
p = int((n - 1) / 2)
x = []
t = b
for j in range(p):
t -= a[2 * j + 1]
x.append(t * 2)
for i in range(n - 1):
t = a[i] - x[i] / 2
x.append(t * 2)
for i in range(n):
print(int(x[i]), end=" ")
| replace | 7 | 11 | 7 | 14 | TLE | |
p02984 | Python | Time Limit Exceeded | #!/usr/bin/env python3
n = int(input())
a = [int(x) for x in input().split()]
ans = [sum(a[(i + j) % n] * (-1) ** (j % 2) for j in range(n)) for i in range(n)]
print(" ".join(str(x) for x in ans))
| #!/usr/bin/env python3
n = int(input())
a = [int(x) for x in input().split()]
v = sum(a[i] * (-1) ** (i % 2) for i in range(n))
ans = [0] * n
for i in range(n):
ans[i] = v
v = -v + 2 * a[i]
print(" ".join(str(x) for x in ans))
| replace | 4 | 5 | 4 | 11 | TLE | |
p02984 | Python | Time Limit Exceeded | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
def solve():
N = int(input())
A = list(map(int, input().split()))
ans = []
for i in range(N):
s = 0
for j, a in enumerate(A):
s += a * (1 if (((j - i) % N) % 2 == 0) else -1)
ans.append(str(s))
return ans
def main... | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
def solve():
N = int(input())
A = list(map(int, input().split()))
ans = []
s = 0
for j, a in enumerate(A):
s += a * (1 if ((j % N) % 2 == 0) else -1)
ans.append(str(s))
for i in range(1, N):
s = -s + 2 * A[i - 1]
ans.ap... | replace | 8 | 12 | 8 | 14 | TLE | |
p02984 | Python | Time Limit Exceeded | from collections import deque
n = int(input())
A = list(map(int, input().split()))
sum_even = sum(A[::2])
sum_odd = sum(A[1::2]) + A[0]
ANS = A[:]
A = deque(A)
minus = False
for _ in range(n - 1):
A.rotate(-1)
for i in range(n):
if minus:
ANS[i] -= A[i]
else:
ANS[i] += ... | from collections import deque
n = int(input())
A = list(map(int, input().split()))
B = [0] * n
B[0] = A[0]
B[1] = A[1]
for i in range(2, n):
B[i] = B[i - 2] + A[i]
ANS = [0] * n
for i in range(n):
ans = 0
if i % 2 == 0:
ans += B[-1] - B[-2]
else:
ans += B[-2] - B[-1]
if i - 2 >= ... | replace | 5 | 20 | 5 | 27 | TLE | |
p02984 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// Optimisations
#pragma GCC target("avx2")
#pragma GCC optimization("unroll-loops")
#pragma GCC optimize("O2")
// shortcuts for functions
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define endl "\n"
#define all(v) v.begin(), v.end()
#defin... | #include <bits/stdc++.h>
using namespace std;
// Optimisations
#pragma GCC target("avx2")
#pragma GCC optimization("unroll-loops")
#pragma GCC optimize("O2")
// shortcuts for functions
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define endl "\n"
#define all(v) v.begin(), v.end()
#defin... | replace | 170 | 171 | 170 | 171 | 0 | |
p02984 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORE(i, a, b) for (int i = (a); i <= (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repe(i, n) for (int i = 0; i <= (n); ++i)
#define ALL(v) (v).begin(), (v).end()
#defin... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORE(i, a, b) for (int i = (a); i <= (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repe(i, n) for (int i = 0; i <= (n); ++i)
#define ALL(v) (v).begin(), (v).end()
#defin... | replace | 25 | 26 | 25 | 26 | TLE | |
p02984 | C++ | Runtime Error | // #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace std::chrono;
#define int long long
#define ll long long
auto start_time = system_clock::now();
//@formatter:off
#ifdef _DEBUG
// 区間削除は出来ない
templat... | // #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace std::chrono;
#define int long long
#define ll long long
auto start_time = system_clock::now();
//@formatter:off
#ifdef _DEBUG
// 区間削除は出来ない
templat... | replace | 3,543 | 3,550 | 3,543 | 3,548 | -11 | |
p02984 | C++ | Runtime Error | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
long long int a[10000], s = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (i % 2 == 0)
s += a[i];
else
... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
long long int a[100002], s = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (i % 2 == 0)
s += a[i];
else
... | replace | 11 | 12 | 11 | 12 | 0 | |
p02984 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int N, A[100000];
int i, j;
long S = 0, ans;
long long sum[200000];
for (i = 0; i < 200000; i++)
sum[i] = 0;
cin >> N;
for (i = 0; i < N; i++)
cin >> A[i];
for (i = 0; i < 2 * N; i++) {
sum[i + 1] = sum[i] + A[(2 * i + 1) % N];
}
S = ... | #include <iostream>
using namespace std;
int main() {
int N, A[100000];
long i, j;
long S = 0, ans;
long long sum[200000];
for (i = 0; i < 200000; i++)
sum[i] = 0;
cin >> N;
for (i = 0; i < N; i++)
cin >> A[i];
for (i = 0; i < 2 * N; i++) {
sum[i + 1] = sum[i] + A[(2 * i + 1) % N];
}
S =... | replace | 4 | 5 | 4 | 5 | 0 | |
p02984 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
#define lli long long
#define all(i) i.begin(), i.end()
#define rall(i) i.rbegin(), i.rend()
#define rep0(i, j) for (int i = 0; i < j; i++)
#define rep1(i, j) for (int i = 1; i <= j; i++)
#define rep0d(i, ... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
#define lli long long
#define all(i) i.begin(), i.end()
#define rall(i) i.rbegin(), i.rend()
#define rep0(i, j) for (int i = 0; i < j; i++)
#define rep1(i, j) for (int i = 1; i <= j; i++)
#define rep0d(i, ... | replace | 24 | 36 | 24 | 33 | TLE | |
p02984 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
vector<int> A;
cin >> N;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
A.push_back(a);
}
for (int i = 0; i < N; i++) {
int a = 0;
int p = 1;
for (int j = 0; j < N; j++) {
a +... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
vector<int> A;
cin >> N;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
A.push_back(a);
}
int a = 0;
int p = 1;
for (int j = 0; j < N; j++) {
a += A[j] * p;
p *= -1;
}
cout << a... | replace | 16 | 23 | 16 | 26 | TLE | |
p02984 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main(void) {
int n;
cin >> n;
int dam[n + 1];
for (int i = 1; i <= n; i++) {
int x;
cin >> x;
dam[i] = x;
}
int ans[n + 1];
for (int i = 1; i <= n; i++) {
ans[i] = 0;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main(void) {
int n;
cin >> n;
int dam[n + 1];
for (int i = 1; i <= n; i++) {
int x;
cin >> x;
dam[i] = x;
}
int ans[n + 1];
for (int i = 1; i <= n; i++) {
ans[i] = 0;
... | replace | 18 | 25 | 18 | 19 | TLE | |
p02984 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "../../dump.hpp"
#else
#define dump(...)
#endif
#define int ll
#define rep(i, n) for (int i = 0, i##_cond = (n); i < i##_cond; ++i)
#define FOR(i, a, b) for (int i = (a), i##_cond = (b); i < i##_cond; ++i)
#define ROF(i, a, b) ... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "../../dump.hpp"
#else
#define dump(...)
#endif
#define int ll
#define rep(i, n) for (int i = 0, i##_cond = (n); i < i##_cond; ++i)
#define FOR(i, a, b) for (int i = (a), i##_cond = (b); i < i##_cond; ++i)
#define ROF(i, a, b) ... | replace | 41 | 42 | 41 | 42 | 0 | |
p02984 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
const int maxn = 2e3 + 5;
const ll p = 998244353;
ll a[maxn], b[maxn];
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
ll sum = 0, f = 1;
for (int i = 1; ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
const int maxn = 2e6 + 5;
const ll p = 998244353;
ll a[maxn], b[maxn];
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
ll sum = 0, f = 1;
for (int i = 1; ... | replace | 4 | 5 | 4 | 5 | 0 | |
p02984 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define all(a) a.begin(), a.end()
using namespace std;
const int nax = 1e5;
int d[nax];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> d[i];
}
for (int i = 0; i < n; ++i) {
long long ai = 0;
for (i... | #include <bits/stdc++.h>
#define all(a) a.begin(), a.end()
using namespace std;
const int nax = 1e5;
int d[nax];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> d[i];
}
long long ai = 0;
for (int c = 0; c < n; ++c) {
if (c & ... | replace | 16 | 27 | 16 | 27 | TLE | |
p02984 | C++ | Time Limit Exceeded | // https://atcoder.jp/contests/abc133/tasks/abc133_d
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll,... | // https://atcoder.jp/contests/abc133/tasks/abc133_d
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll,... | replace | 39 | 47 | 39 | 49 | TLE | |
p02984 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<ll> a(n);
for (auto &e : a)
cin >> e;
vector<ll> x(n);
ll l = 0, r = 1e9 / 2 + 1, m;
while (true) {
m = (l + r) / 2;
x[0] = 2 * m;
for (int i = 0; i + 1 < n; i++) {
x[i + 1] = 2... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<ll> a(n);
for (auto &e : a)
cin >> e;
vector<ll> x(n);
ll l = 0, r = 1e9 + 1, m;
while (true) {
m = (l + r) / 2;
x[0] = 2 * m;
for (int i = 0; i + 1 < n; i++) {
x[i + 1] = 2 * (... | replace | 12 | 13 | 12 | 13 | TLE | |
p02984 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
long long int A[100001];
long long int W[100001];
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
W[i] = A[i];
for (int j = 1; j < N; j++) {
if (j % 2 == 0)
W[i] += A[(i + j) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
long long int A[100001];
long long int W[100001];
for (int i = 0; i < N; i++) {
cin >> A[i];
}
W[0] = A[0];
for (int i = 1; i < N; i++) {
if (i % 2 == 0)
W[0] += A[i];
if (i % 2 == 1)
W[0] -= A[i];
}
... | replace | 12 | 20 | 12 | 21 | TLE | |
p02984 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typ... | replace | 47 | 48 | 47 | 48 | -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)
|
p02984 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
#define fi first
#define se second
#define pb push_back
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
templ... | #include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
#define fi first
#define se second
#define pb push_back
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
templ... | replace | 41 | 49 | 41 | 48 | TLE | |
p02984 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define reps(i, n) for (int i = 1; i <= (n); ++i)
#define all(x) (x).begin(), (x).end()
#define Fixed fixed << setprecision(12)
#define int int_fast64_t
using pii = pair<int, int>;
constexpr int INF = 0x3f3f3f3f;
constexpr l... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define reps(i, n) for (int i = 1; i <= (n); ++i)
#define all(x) (x).begin(), (x).end()
#define Fixed fixed << setprecision(12)
#define int int_fast64_t
using pii = pair<int, int>;
constexpr int INF = 0x3f3f3f3f;
constexpr l... | replace | 86 | 87 | 86 | 89 | 0 | |
p02984 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int N;
int A[100000];
int ans[100000];
int sum;
int main() {
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int j = 0; j < N; j++) {
ans[j] = 0;
for (in... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int N;
int A[100000];
int ans[100000];
int sum;
int main() {
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
// 1回目だけ別処理
ans[0] = 0;
for (int i = 0; i < N; i++) {... | replace | 17 | 22 | 17 | 25 | TLE | |
p02984 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i, m, n) for (ll(i) = (m), (i_len) = (n); (i) < (i_len); ++(i))
#define FORR(i, v) for (auto(i) : v)
#defin... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i, m, n) for (ll(i) = (m), (i_len) = (n); (i) < (i_len); ++(i))
#define FORR(i, v) for (auto(i) : v)
#defin... | replace | 29 | 30 | 29 | 30 | 0 | |
p02984 | C++ | Time Limit Exceeded | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
int n;
int t[100002];
int main() {
while (cin >> n) {
for (int i = 0; i < n; i++) {
ci... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
int n;
int t[100002];
int main() {
while (cin >> n) {
for (int i = 0; i < n; i++) {
ci... | replace | 51 | 52 | 51 | 52 | TLE | |
p02984 | C++ | Time Limit Exceeded | #include <iostream>
#include <numeric>
#include <vector>
int main() {
std::size_t n;
std::cin >> n;
std::vector<size_t> a(n, 0);
for (auto &&ai : a)
std::cin >> ai;
const auto sum = std::accumulate(a.begin(), a.end(), size_t(0)) / 2;
std::vector<size_t> x(n, sum);
for (size_t i = 0; i < n; ++i) {
... | #include <iostream>
#include <numeric>
#include <vector>
int main() {
std::size_t n;
std::cin >> n;
std::vector<size_t> a(n, 0);
for (auto &&ai : a)
std::cin >> ai;
const auto sum = std::accumulate(a.begin(), a.end(), size_t(0)) / 2;
std::vector<size_t> x(n, 0);
x[0] = sum;
for (size_t i = 1; i <... | replace | 13 | 26 | 13 | 19 | TLE | |
p02984 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPS(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; ++i)
#define ALL(obj) (obj).begin(), (obj).end()
typedef unsigned int uint;
typedef unsigned long long int ull;
typedef long long int l... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPS(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; ++i)
#define ALL(obj) (obj).begin(), (obj).end()
typedef unsigned int uint;
typedef unsigned long long int ull;
typedef long long int l... | replace | 31 | 37 | 31 | 35 | TLE | |
p02984 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
typedef long long ll;
using namespace std;
vector<ll> A(10000, 0);
int main() {
int N;
cin >> N;
for (int i = 0; i < N; i++)
cin >> A[i];
ll B = 0;
for (int i = 0; i < N; i++) {
if (i % 2 == 0) {
B += A[i];
} else {
B -= A[i]... | #include <algorithm>
#include <iostream>
#include <vector>
typedef long long ll;
using namespace std;
vector<ll> A(100000, 0);
int main() {
int N;
cin >> N;
for (int i = 0; i < N; i++)
cin >> A[i];
ll B = 0;
for (int i = 0; i < N; i++) {
if (i % 2 == 0) {
B += A[i];
} else {
B -= A[i... | replace | 6 | 7 | 6 | 7 | 0 | |
p02984 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n;
cin >> n;
vector<ll> r(n, 0);
vector<ll> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
r[0] += (i & 1 ? -a[i] : a[i]);
}
for (int i = 0; i < n; i++) {
r[i + 1] = 2 * (a[i] - r[i] / 2);
}
for (int i = ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n;
cin >> n;
vector<ll> r(n, 0);
vector<ll> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
r[0] += (i & 1 ? -a[i] : a[i]);
}
for (int i = 0; i < n - 1; i++) {
r[i + 1] = 2 * (a[i] - r[i] / 2);
}
for (int ... | replace | 12 | 13 | 12 | 13 | -11 | |
p02984 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define int long long
typedef long long ll;
using namespace std;
const ll MAXN = 200000;
ll N, flag = 0, tmp = 0, mid = 0;
vector<ll> A(MAXN, 0);
signed main() {
cin >> N;
for (int i = 0; i < N; i++)
cin >> A[i];
ll ng = 0;
ll ok = 1000000000;
while (1) {
// ll ngnum = ng*2... | #include <bits/stdc++.h>
#define int long long
typedef long long ll;
using namespace std;
const ll MAXN = 200000;
ll N, flag = 0, tmp = 0, mid = 0;
vector<ll> A(MAXN, 0);
signed main() {
cin >> N;
for (int i = 0; i < N; i++)
cin >> A[i];
ll ng = -1;
ll ok = 1000000001;
while (1) {
// ll ngnum = ng*... | replace | 14 | 16 | 14 | 16 | TLE | |
p02984 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
long long a[1010], m[1010];
long long su = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
su += a[i];
}
m[0] = 0;
for (int i = 0; i < 2 * N; i += 2) {
m[(i + 2) % N] = 2 ... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
long long a[100010], m[100010];
long long su = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
su += a[i];
}
m[0] = 0;
for (int i = 0; i < 2 * N; i += 2) {
m[(i + 2) % N] ... | replace | 9 | 10 | 9 | 10 | 0 | |
p02984 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
int main() {
ll N;
cin >> N;
vector<ll> A(N);
ll sum = 0;
vector<ll> s(N, 0), ans(N, 0);
for (int i = 0; i < N; i++) {
cin >> A[i];
sum += A[i];
}
for (int i = 0; i < N; i++) {
ll tmp = sum;
f... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
int main() {
ll N;
cin >> N;
vector<ll> A(N);
ll sum = 0;
vector<ll> s(N, 0), ans(N, 0);
for (int i = 0; i < N; i++) {
cin >> A[i];
sum += A[i];
}
ll tmp = sum;
for (int i = 1; i < N; i += 2) {
... | replace | 16 | 27 | 16 | 25 | TLE | |
p02984 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
static const uint64_t MOD = 1000000007LL; /* 10^9 + 7 */
uint64_t dp[100005][13];
/*
* (X1 + X2) / 2 == A1;
* (X2 + X3) / 2 == A2;
* (X3 + X1) / 2 == A3;
* ....
*/
int main() {
int n... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
static const uint64_t MOD = 1000000007LL; /* 10^9 + 7 */
uint64_t dp[100005][13];
/*
* (X1 + X2) / 2 == A1;
* (X2 + X3) / 2 == A2;
* (X3 + X1) / 2 == A3;
* ....
*/
int main() {
int n... | replace | 25 | 37 | 25 | 35 | TLE | |
p02984 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<ll, ll>;
using vi = vector<ll>;
using vvi = vector<vi>;
using vb = vector<bool>;
using vs = vector<string>;
using vp = vector<pii>;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define sz(x) (ll)((x).siz... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<ll, ll>;
using vi = vector<ll>;
using vvi = vector<vi>;
using vb = vector<bool>;
using vs = vector<string>;
using vp = vector<pii>;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define sz(x) (ll)((x).siz... | replace | 59 | 60 | 59 | 60 | 0 | |
p02984 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define For(i, a, b) for (int i = a; i <= b; i++)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) ((int)x.size())
#define int ll
#define MOD (ll)(1e9 + 7)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int32_t main() {
ios::sync_with_s... | #include <bits/stdc++.h>
#define For(i, a, b) for (int i = a; i <= b; i++)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) ((int)x.size())
#define int ll
#define MOD (ll)(1e9 + 7)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int32_t main() {
ios::sync_with_s... | replace | 24 | 30 | 24 | 32 | TLE | |
p02984 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cctype>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef int long long ll... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef int long long ll... | replace | 69 | 70 | 69 | 70 | TLE | |
p02984 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
typedef vector<int> VI;
typedef long long LL;
#define ALL(a) (a).begin(), (a).end()
#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 OUT(v) cout << v << endl
int main() {
int N;
cin >> N;
... | #include <iostream>
#include <vector>
using namespace std;
typedef vector<int> VI;
typedef long long LL;
#define ALL(a) (a).begin(), (a).end()
#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 OUT(v) cout << v << endl
int main() {
int N;
cin >> N;
... | replace | 26 | 33 | 26 | 33 | 0 | |
p02984 | C++ | Runtime Error | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
long long int a[10000], s = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (i % 2 == 0)
s += a[i];
else
... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
long long int a[100000], s = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (i % 2 == 0)
s += a[i];
else
... | replace | 11 | 12 | 11 | 12 | 0 | |
p02984 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
int main() {
int n;
ll sum = 0;
cin >> n;
vector<ll> a(n);
vector<ll> ans(n);
rep(i, n) {
cin >> a[i];
sum += a[i];
}
rep(i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
int main() {
int n;
ll sum = 0;
cin >> n;
vector<ll> a(n);
vector<ll> ans(n);
rep(i, n) {
cin >> a[i];
sum += a[i];
}
rep(i... | replace | 18 | 22 | 18 | 21 | TLE | |
p02986 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
ostream &operator<<(ostream &out, string str) {
for (char c : str)
cout << c;
return out;
}
template <class L, class R> ostream &operator<<(ostream &out, pair<L, R> p) {
return out << "(" << p.first << ", " << p.second << ")";
}
template <class T>
auto operator... | #include <bits/stdc++.h>
using namespace std;
ostream &operator<<(ostream &out, string str) {
for (char c : str)
cout << c;
return out;
}
template <class L, class R> ostream &operator<<(ostream &out, pair<L, R> p) {
return out << "(" << p.first << ", " << p.second << ")";
}
template <class T>
auto operator... | replace | 139 | 140 | 139 | 140 | TLE | |
p02986 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
template <class T> bool chmax(T &a, const T &b) {
... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
template <class T> bool chmax(T &a, const T &b) {
... | replace | 157 | 158 | 157 | 158 | 0 | |
p02986 | C++ | Runtime Error | #pragma region
#include <bits/stdc++.h>
using namespace std;
/*
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
*/
#define int long long
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define RREP(i, n) for (int i = (int)n - 1; i >= 0; i--)
#define FOR(i, s,... | #pragma region
#include <bits/stdc++.h>
using namespace std;
/*
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
*/
#define int long long
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define RREP(i, n) for (int i = (int)n - 1; i >= 0; i--)
#define FOR(i, s,... | replace | 293 | 294 | 293 | 294 | 0 | |
p02986 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using PP = pair<int, int>;
struct Query {
int a;
int b;
int c;
int d;
int m;
};
int N, Q;
vector<PP> G[100000];
int C[100000];
int D[100000];
Query V[100000];
vector<int> qs[100000];
int memo_dist[100000];
unordered_map<int, int> memo_cnt[100000];
unordered_map... | #include <bits/stdc++.h>
using namespace std;
using PP = pair<int, int>;
struct Query {
int a;
int b;
int c;
int d;
int m;
};
int N, Q;
vector<PP> G[100000];
int C[100000];
int D[100000];
Query V[100000];
vector<int> qs[100000];
int memo_dist[100000];
unordered_map<int, int> memo_cnt[100000];
unordered_map... | replace | 48 | 49 | 48 | 49 | 0 | |
p02986 | C++ | Runtime Error | #include <bits/stdc++.h>
#define For(i, a, b) for (int(i) = (a); (i) < (b); ++(i))
#define rFor(i, a, b) for (int(i) = (a)-1; (i) >= (b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef pair<int, int> ... | #include <bits/stdc++.h>
#define For(i, a, b) for (int(i) = (a); (i) < (b); ++(i))
#define rFor(i, a, b) for (int(i) = (a)-1; (i) >= (b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef pair<int, int> ... | replace | 94 | 95 | 94 | 95 | 0 | |
p02986 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
#define ll long long
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define FORD(i, a, b) for (int i = a; i >= b; i--)
#define FORL(i, x) for (int i = head[x]; i; i = nxt[i])
#define clr(x, y) memset(x... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
#define ll long long
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define FORD(i, a, b) for (int i = a; i >= b; i--)
#define FORL(i, x) for (int i = head[x]; i; i = nxt[i])
#define clr(x, y) memset(x... | replace | 42 | 43 | 42 | 43 | -11 | |
p02986 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#includ... | #include <algorithm>
#include <bits/stdc++.h>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#includ... | insert | 1,367 | 1,367 | 1,367 | 1,368 | -11 | |
p02986 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define y1 y11
#define fi first
#define se second
#define pi acos(-1.0)
#define LL long long
// #define mp make_pair
#define pb emplace_back
#define ls rt << 1, l, m
#define rs rt << 1 | 1, m + 1, r
#define ULL unsigned LL
#define pll pair<LL, LL>
#define pli pair<LL, int>
... | #include <bits/stdc++.h>
using namespace std;
#define y1 y11
#define fi first
#define se second
#define pi acos(-1.0)
#define LL long long
// #define mp make_pair
#define pb emplace_back
#define ls rt << 1, l, m
#define rs rt << 1 | 1, m + 1, r
#define ULL unsigned LL
#define pll pair<LL, LL>
#define pli pair<LL, int>
... | replace | 26 | 27 | 26 | 27 | 0 | |
p02986 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define reint register int
#define coint const int
using namespace std;
typedef long long ll;
coint SIZE = 100000 + 5;
struct Edge {
int v, w, head;
};
int ecnt, head[SIZE];
Edge edge[SIZE << 1];
inline void addEdge(coint u, coint v, coint w) {
edge[++ecnt] = (Edge){v, w, head[u]}, h... | #include <bits/stdc++.h>
#define reint register int
#define coint const int
using namespace std;
typedef long long ll;
coint SIZE = 100000 + 5;
struct Edge {
int v, w, head;
};
int ecnt, head[SIZE];
Edge edge[SIZE << 1];
inline void addEdge(coint u, coint v, coint w) {
edge[++ecnt] = (Edge){v, w, head[u]}, h... | replace | 54 | 55 | 54 | 55 | TLE | |
p02986 | C++ | Runtime Error | #pragma optimization_level 3
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#include <bits/stdc++.h>
#define F first
#define S second
#define vec vector
#define ms multiset
#define pb push_back
#define pll pair<ll, ll>
#define pdd pair<ld, ld>
#define pq priority_queue
#define umap unordered_ma... | #pragma optimization_level 3
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#include <bits/stdc++.h>
#define F first
#define S second
#define vec vector
#define ms multiset
#define pb push_back
#define pll pair<ll, ll>
#define pdd pair<ld, ld>
#define pq priority_queue
#define umap unordered_ma... | replace | 118 | 119 | 118 | 119 | -11 | |
p02986 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
const int nax = 1e5 + 5;
pair<int, int> arr[nax];
vector<vector<pair<int, pair<int, ll>>>> v(nax);
int vis[nax] = {0};
int level[nax];
int parent[nax];
int dp[nax][20];
struct s {
int a, b, c, d;
};
vector<vector<s>> pre(nax);
i... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
const int nax = 1e5 + 5;
pair<int, int> arr[nax];
vector<vector<pair<int, pair<int, ll>>>> v(nax);
int vis[nax] = {0};
int level[nax];
int parent[nax];
int dp[nax][20];
struct s {
int a, b, c, d;
};
vector<vector<s>> pre(nax);
i... | replace | 76 | 80 | 76 | 82 | -11 | |
p02986 | C++ | Runtime Error | #include <bits/stdc++.h>
using i64 = long long;
struct Edge {
int to, c, d;
Edge(int to, int c, int d) : to(to), c(c), d(d) {}
};
constexpr int size = 1 << 17;
i64 dat[size * 2 - 1];
auto query(int a, int b, int k, int l, int r) {
if (r <= a || b <= l)
return 0ll;
if (a <= l && r <= b)
return dat[k];... | #include <bits/stdc++.h>
using i64 = long long;
struct Edge {
int to, c, d;
Edge(int to, int c, int d) : to(to), c(c), d(d) {}
};
constexpr int size = 1 << 18;
i64 dat[size * 2 - 1];
auto query(int a, int b, int k, int l, int r) {
if (r <= a || b <= l)
return 0ll;
if (a <= l && r <= b)
return dat[k];... | replace | 8 | 9 | 8 | 9 | 0 | |
p02986 | C++ | Runtime Error | /*
Warn - Don't change next line else you will get WA verdict. Online Judge is
configured to give WA if next line is not present. "An ideal problem has no
test data." Author - Aryan Choudhary (@aryanc403)
*/
#pragma warning(disable : 4996)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")... | /*
Warn - Don't change next line else you will get WA verdict. Online Judge is
configured to give WA if next line is not present. "An ideal problem has no
test data." Author - Aryan Choudhary (@aryanc403)
*/
#pragma warning(disable : 4996)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")... | replace | 123 | 124 | 123 | 124 | 0 | Time Taken : 0.03817
|
p02986 | C++ | Time Limit Exceeded | #pragma optimization_level 3
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#include <bits/stdc++.h>
#define F first
#define S second
#define vec vector
#define ms multiset
#define pb push_back
#define pll pair<ll, ll>
#define pdd pair<ld, ld>
#define pq priority_queue
#define umap unordered_ma... | #pragma optimization_level 3
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#include <bits/stdc++.h>
#define F first
#define S second
#define vec vector
#define ms multiset
#define pb push_back
#define pll pair<ll, ll>
#define pdd pair<ld, ld>
#define pq priority_queue
#define umap unordered_ma... | replace | 217 | 222 | 217 | 222 | TLE | |
p02986 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int, int>
#define mp make_pair
int n, q;
struct edge {
int v, c, w;
edge(int vv, int cc, int ww) {
v = vv;
c = cc;
w = ww;
}
};
vector<edge> G[123456];
int cnt[12345], in[123456], out[123456], tim = 0;
int pa[18][1234... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int, int>
#define mp make_pair
int n, q;
struct edge {
int v, c, w;
edge(int vv, int cc, int ww) {
v = vv;
c = cc;
w = ww;
}
};
vector<edge> G[123456];
int cnt[123456], in[123456], out[123456], tim = 0;
int pa[18][123... | replace | 15 | 16 | 15 | 16 | 0 | |
p02986 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (i... | replace | 172 | 173 | 172 | 173 | 0 | |
p02986 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int maxm = 1e6 + 10;
const int maxn = 133334;
typedef long long ll;
struct node {
int s, e, c, w, next;
} edge[maxn];
int head[maxn], len;
int n, q;
void init() {
memset(head, -1, sizeof(head));
len = 0;
}
void add(int s, int e, int c, int w) {
edge[len].s = s... | #include <bits/stdc++.h>
using namespace std;
const int maxm = 1e6 + 10;
const int maxn = 3e5 + 10;
typedef long long ll;
struct node {
int s, e, c, w, next;
} edge[maxn];
int head[maxn], len;
int n, q;
void init() {
memset(head, -1, sizeof(head));
len = 0;
}
void add(int s, int e, int c, int w) {
edge[len].s =... | replace | 3 | 4 | 3 | 4 | 0 | |
p02986 | C++ | Runtime Error | #include <bits/stdc++.h>
#define all(vec) vec.begin(), vec.end()
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
constexpr ll INF = (1LL << 30) - 1LL;
constexpr ll LINF = (1LL << 60) - 1LL;
constexpr double eps = 1e-9;
constexpr ll MOD = 1000000007LL;
template <typename T> bool chmin(T &a, T b) {
i... | #include <bits/stdc++.h>
#define all(vec) vec.begin(), vec.end()
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
constexpr ll INF = (1LL << 30) - 1LL;
constexpr ll LINF = (1LL << 60) - 1LL;
constexpr double eps = 1e-9;
constexpr ll MOD = 1000000007LL;
template <typename T> bool chmin(T &a, T b) {
i... | replace | 154 | 155 | 154 | 155 | 0 | |
p02986 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int OO = 1e9;
const double EPS = 1e-9;
#define ndl cout << '\n'
#define sz(v) int(v.size())
#define pb push_back
#define mp make_pair
#define fs first
#define sc second
#define present(a, x) (a.find(x) != a.end())
#ifdef LOCAL
#define db(...) ... | #include <bits/stdc++.h>
using namespace std;
const int OO = 1e9;
const double EPS = 1e-9;
#define ndl cout << '\n'
#define sz(v) int(v.size())
#define pb push_back
#define mp make_pair
#define fs first
#define sc second
#define present(a, x) (a.find(x) != a.end())
#ifdef LOCAL
#define db(...) ... | replace | 78 | 79 | 78 | 79 | 0 | |
p02986 | C++ | Runtime Error | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
/////////////////////////////////////////////////////////////////////////
// LCA
/////////////////////////////////////////////////////////////////////////
class LowestCommonAncestor {
public:
LowestCommonAncestor();
LowestCommonAncestor(const v... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
/////////////////////////////////////////////////////////////////////////
// LCA
/////////////////////////////////////////////////////////////////////////
class LowestCommonAncestor {
public:
LowestCommonAncestor();
LowestCommonAncestor(const v... | replace | 71 | 72 | 71 | 72 | -11 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.