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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02864 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
const int BUF = 305;
const long long INF = 1LL << 62;
int nCol, nCut;
int col2height[BUF];
void read() {
cin >> nCol >> nCut;
for (int i = 0; i < nCol; ++i) {
cin >> col2height[i];
}
}
long lon... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
const int BUF = 305;
const long long INF = 1LL << 62;
int nCol, nCut;
int col2height[BUF];
void read() {
cin >> nCol >> nCut;
for (int i = 0; i < nCol; ++i) {
cin >> col2height[i];
}
}
long lon... | replace | 20 | 21 | 20 | 21 | TLE | |
p02865 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int N, M = 0;
cin >> N;
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= N; j++) {
if (i + j == N) {
M = M + 1;
}
}
}
cout << M / 2 << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
cout << (n - 1) / 2 << endl;
return 0;
} | replace | 5 | 15 | 5 | 8 | TLE | |
p02865 | C++ | Time Limit Exceeded | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cmath>
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
#include <limits>
#include <map> // map
#incl... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cmath>
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
#include <limits>
#include <map> // map
#incl... | replace | 46 | 54 | 46 | 47 | TLE | |
p02865 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int ans = 0, i = 1, num;
while (i) {
if (N - num <= num) {
break;
}
ans++;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int ans = N / 2 - 1 * ((N + 1) % 2);
cout << ans << endl;
return 0;
} | replace | 6 | 13 | 6 | 7 | TLE | |
p02865 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <cctype>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
std::string line;
int main() {
int n;
cin >> n;
int cnt = 0;
for (int i = 1; i < n / 2; ++i) {
for (in... | #include <bits/stdc++.h>
#include <cctype>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
std::string line;
int main() {
int n;
cin >> n;
int cnt = 0;
cnt = (n - 1) / 2;
cout << cnt << endl;
... | replace | 17 | 25 | 17 | 19 | TLE | |
p02865 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll long long
int main() {
ll k;
cin >> k;
ll i, j, c = 0;
for (i = 1; i < k; i++) {
for (j = i; j < k; j++) {
if (i + j == k && i != j) {
c++;
}
}
}
cout << c << endl;
} | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll long long
int main() {
int n, m, x, k, count, i;
cin >> n;
cout << (n - 1) / 2;
return 0;
} | replace | 5 | 16 | 5 | 9 | TLE | |
p02865 | C++ | Time Limit Exceeded | // #include<bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
/*
#include <boost/multiprecision/cpp_dec_float.hpp>
#include<boost/multiprecision/cpp_int.hpp>
#include <boost/rational.hpp>
namespace mp = boost::multiprecision;
using... | // #include<bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
/*
#include <boost/multiprecision/cpp_dec_float.hpp>
#include<boost/multiprecision/cpp_int.hpp>
#include <boost/rational.hpp>
namespace mp = boost::multiprecision;
using... | replace | 33 | 37 | 33 | 36 | TLE | |
p02865 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
typedef long long ll;
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
// 素因数分解
vector<pair<ll, int>> factorize(ll n) {
vector<pair<ll, int>> res;
for (ll i = 2; i * i <= n; i++) {
if (n % i)
continue;
res.emplace_back(i... | #include <bits/stdc++.h>
typedef long long ll;
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
// 素因数分解
vector<pair<ll, int>> factorize(ll n) {
vector<pair<ll, int>> res;
for (ll i = 2; i * i <= n; i++) {
if (n % i)
continue;
res.emplace_back(i... | replace | 27 | 32 | 27 | 34 | TLE | |
p02865 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
using vll = vector<long long>;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
retur... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
using vll = vector<long long>;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
retur... | replace | 53 | 58 | 53 | 57 | TLE | |
p02865 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n... | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n... | delete | 43 | 47 | 43 | 43 | 0 | |
p02865 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
const long double PI = (acos(-1));
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n;
cin >> n;
int ans = 0;
for (int i = 1; i < n; i++) {
for (int j = i + 1; j < n; j++) {
if (i + j == n) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
const long double PI = (acos(-1));
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n;
cin >> n;
int ans = 0;
for (int i = 1; i < n; i++) {
if (n - i > i && n - i > 1 && n) {
ans++;
}
}
... | replace | 11 | 15 | 11 | 13 | TLE | |
p02865 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, sum, i, j;
cin >> n;
sum = 0;
for (i = 1; i < n; ++i) {
for (j = i + 1; i + j < n; ++j) {
sum = sum + 1;
}
}
cout << sum << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, sum, i, j;
cin >> n;
sum = 0;
if (n % 2 == 0) {
sum = n / 2 - 1;
} else {
sum = n / 2;
}
cout << sum << endl;
return 0;
}
| replace | 7 | 11 | 7 | 11 | TLE | |
p02865 | C++ | Runtime Error | #include <bits/stdc++.h>
#define endl "\n"
#define pb push_back
#define ll long long
#define ld long double
#define d1(x) cerr << #x << "--> " << x << endl
#define d2(x, y) cerr << #x << "--> " << x << " | " << #y << "--> " << y << endl
#define d3(x, y, z) \
... | #include <bits/stdc++.h>
#define endl "\n"
#define pb push_back
#define ll long long
#define ld long double
#define d1(x) cerr << #x << "--> " << x << endl
#define d2(x, y) cerr << #x << "--> " << x << " | " << #y << "--> " << y << endl
#define d3(x, y, z) \
... | replace | 21 | 22 | 21 | 22 | 0 | |
p02865 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <math.h>
using namespace std;
#define N 1000
int main() {
long int n, i, j, k, cnt = 0;
cin >> n;
k = n;
for (i = 1; i < n / 2; i++) {
for (j = i + 1; j < k; j++) {
if (n == i + j) {
cnt++;
k--;
break;
}
}
}
co... | #include <algorithm>
#include <iostream>
#include <math.h>
using namespace std;
#define N 1000
int main() {
long int n, i, j, k, cnt = 0;
cin >> n;
k = n;
for (i = 1; i <= n / 2; i++) {
for (j = k - 1; j > n / 2; j--) {
if (n == i + j) {
cnt++;
k--;
break;
}
}
}
... | replace | 12 | 14 | 12 | 14 | TLE | |
p02866 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long ul;
typedef unsigned long long ull;
typedef long long ll;
typedef vector<ll> vint;
typedef vector<vector<ll>> vvint;
typedef vector<vector<vector<ll>>> vvvint;
typedef vector<string> vstring;
typedef vector<vector<string>> vvstring;
typedef vector<cha... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long ul;
typedef unsigned long long ull;
typedef long long ll;
typedef vector<ll> vint;
typedef vector<vector<ll>> vvint;
typedef vector<vector<vector<ll>>> vvvint;
typedef vector<string> vstring;
typedef vector<vector<string>> vvstring;
typedef vector<cha... | replace | 312 | 313 | 312 | 314 | TLE | |
p02866 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const long long int mod = 998244353;
int main() {
long long int N, x = 0;
cin >> N;
vector<long long int> D(N);
cin >> D.at(0);
if (D.at(0) == 0) {
if (N == 1)
x = 1;
else {
for (long long int i = 1; i < N; i++)
cin >> D.at(i);
so... | #include <bits/stdc++.h>
using namespace std;
const long long int mod = 998244353;
int main() {
long long int N, x = 0;
cin >> N;
vector<long long int> D(N);
cin >> D.at(0);
if (D.at(0) == 0) {
if (N == 1)
x = 1;
else {
for (long long int i = 1; i < N; i++)
cin >> D.at(i);
so... | replace | 19 | 20 | 19 | 21 | TLE | |
p02866 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#inc... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#inc... | replace | 104 | 105 | 104 | 106 | TLE | |
p02866 | C++ | Time Limit Exceeded | //{{{
#include <algorithm>
#include <cmath>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <sys/time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll... | //{{{
#include <algorithm>
#include <cmath>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <sys/time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll... | insert | 59 | 59 | 59 | 63 | TLE | |
p02866 | C++ | Runtime Error | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin()... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin()... | delete | 91 | 93 | 91 | 91 | 0 | |
p02866 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using llong = long long;
using ldbl = long double;
using lpair = pair<llong, llong>;
#define ALL(x) x.begin(), x.end()
const llong inf = 1'000'000'000'000'007ll;
const llong mod = 998244353;
llong mpow(llong n, llong m) {
if (m == 1)
return n;
llong ret = mpow(... | #include <bits/stdc++.h>
using namespace std;
using llong = long long;
using ldbl = long double;
using lpair = pair<llong, llong>;
#define ALL(x) x.begin(), x.end()
const llong inf = 1'000'000'000'000'007ll;
const llong mod = 998244353;
llong mpow(llong n, llong m) {
if (m == 0)
return 0;
if (m == 1)
re... | insert | 13 | 13 | 13 | 15 | 0 | |
p02866 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 998244353;
const ll LINF = 1LL << 60;
con... | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 998244353;
const ll LINF = 1LL << 60;
con... | insert | 56 | 56 | 56 | 57 | TLE | |
p02866 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
const double PI = acos(-1);
using namespace std;
typedef long long ll;
typedef long double ld;
const ... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
const double PI = acos(-1);
using namespace std;
typedef long long ll;
typedef long double ld;
const ... | replace | 340 | 342 | 340 | 342 | TLE | |
p02866 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
using ll = long long;
string char_to_string(char val) { return string(1, val); }
int char_to_int(char val) { return val - '0'; }
template <class T> inline bool chmin(T ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
using ll = long long;
string char_to_string(char val) { return string(1, val); }
int char_to_int(char val) { return val - '0'; }
template <class T> inline bool chmin(T ... | replace | 80 | 82 | 80 | 82 | 0 | |
p02866 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
using vll = vector<long long>;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
retur... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
using vll = vector<long long>;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
retur... | insert | 103 | 103 | 103 | 104 | TLE | |
p02866 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long double ld;
typedef long long ll;
using namespace std;
const ll p = 998244353;
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(nullptr);
freopen("input.txt", "r", stdin);
cout << setprecision(20);
int n;
cin >> n;
vector<int> a(n, 0);
int det;
... | #include <bits/stdc++.h>
typedef long double ld;
typedef long long ll;
using namespace std;
const ll p = 998244353;
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(nullptr);
// freopen("input.txt", "r", stdin);
cout << setprecision(20);
int n;
cin >> n;
vector<int> a(n, 0);
int det;... | replace | 12 | 13 | 12 | 13 | -6 | terminate called after throwing an instance of 'std::length_error'
what(): cannot create std::vector larger than max_size()
|
p02866 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
//--------... | #include <bits/stdc++.h>
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
//--------... | insert | 132 | 132 | 132 | 136 | 0 | |
p02866 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int D[100050];
for (int i = 1; i <= N; i++)
cin >> D[i];
int bucket_max = 0;
int bucket[100050];
for (int i = 1; i <= N; i++) {
bucket_max = (D[i] > bucket_max) ? D[i] : bucket_max;
bucket[D[i]]++;
}
if (!(bucket[0]... | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int D[100050];
for (int i = 1; i <= N; i++)
cin >> D[i];
int bucket_max = 0;
int bucket[100050] = {};
for (int i = 1; i <= N; i++) {
bucket_max = (D[i] > bucket_max) ? D[i] : bucket_max;
bucket[D[i]]++;
}
if (!(buck... | replace | 12 | 13 | 12 | 13 | TLE | |
p02866 | C++ | Time Limit Exceeded | #include <cstdio>
#include <iostream>
#define ll long long
#define mod 998244353
using namespace std;
int n, x;
int cnt[1000010];
ll ans = 1;
ll ksm(ll x, ll i) {
ll res = 1;
for (; i; i >>= 1, x = x * x % mod)
if (i & 1)
res = res * x % mod;
return res;
}
int main() {
scanf("%d", &n);
for (register... | #include <cstdio>
#include <iostream>
#define ll long long
#define mod 998244353
using namespace std;
int n, x;
int cnt[1000010];
ll ans = 1;
ll ksm(ll x, ll i) {
ll res = 1;
for (; i; i >>= 1, x = x * x % mod)
if (i & 1)
res = res * x % mod;
return res;
}
int main() {
scanf("%d", &n);
for (register... | insert | 37 | 37 | 37 | 38 | TLE | |
p02866 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define Int int64_t
using namespace std;
int64_t modpow(int64_t a, int64_t b, int64_t MOD) {
int64_t ret = 1;
while (b > 0) {
if (b & 1) {
(ret *= a) %= MOD;
}
(a *= a) %= MOD;
b >>= 1;
}
return ret % MOD;
}
int main() {
const Int MOD = 998244353;
int N;
c... | #include <bits/stdc++.h>
#define Int int64_t
using namespace std;
int64_t modpow(int64_t a, int64_t b, int64_t MOD) {
int64_t ret = 1;
while (b > 0) {
if (b & 1) {
(ret *= a) %= MOD;
}
(a *= a) %= MOD;
b >>= 1;
}
return ret % MOD;
}
int main() {
const Int MOD = 998244353;
int N;
c... | replace | 32 | 33 | 32 | 41 | TLE | |
p02866 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <vector>
#define mp make_pair
#define pb push_back
#define p push
#define FOR(a, c) for (int a = 0; a < c; a++)
#define FORR(el, vecc) for (auto &el : vecc)
... | #include <bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <vector>
#define mp make_pair
#define pb push_back
#define p push
#define FOR(a, c) for (int a = 0; a < c; a++)
#define FORR(el, vecc) for (auto &el : vecc)
... | replace | 61 | 65 | 61 | 64 | TLE | |
p02866 | C++ | Runtime Error | #include <bits/stdc++.h>
#define long long long int
using namespace std;
// @author: pashka
int main() {
ios::sync_with_stdio(false);
int n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<int> d(n);
for (int i = 0; i < n; i++)
d[a[i]]++;
if (a[0] != 0 || d[0] != 1) {
cout... | #include <bits/stdc++.h>
#define long long long int
using namespace std;
// @author: pashka
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<int> d(n);
for (int i = 0; i < n; i++)
d[a[i]]++;
if (a[0] != 0 || d[0] != 1... | insert | 10 | 10 | 10 | 11 | 0 | |
p02866 | C++ | Runtime Error | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;
#define N_MAX 100001
#define MOD 998244353
long long int intpow(int base, int p) {
if (1 == p) {
return base;
}
if (0 == p % 2) {
long long int val = intpow... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;
#define N_MAX 100001
#define MOD 998244353
long long int intpow(int base, int p) {
if (0 == p) {
return 1;
}
if (1 == p) {
return base;
}
if (0 == p % 2... | insert | 14 | 14 | 14 | 17 | 0 | |
p02866 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
#define all(x) (x).begin(), (x).end()
#define fsp(x) fixed << setprecision(x)
const ll inf = LLONG_MAX;
const long double pi = acos(-1);
void Yes() { cout << "Yes" << endl; }
void No() { cout << "No" << endl; }
void YES() { cout... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
#define all(x) (x).begin(), (x).end()
#define fsp(x) fixed << setprecision(x)
const ll inf = LLONG_MAX;
const long double pi = acos(-1);
void Yes() { cout << "Yes" << endl; }
void No() { cout << "No" << endl; }
void YES() { cout... | replace | 52 | 54 | 52 | 54 | TLE | |
p02866 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#incl... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#incl... | replace | 275 | 276 | 275 | 276 | 0 | |
p02866 | C++ | Time Limit Exceeded | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
const ll mod = 998244353;
int main(void) {
ll n, i, j, d, ans, dmax = -1;
ll dcnt[100010];
for (i = ... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
const ll mod = 998244353;
int main(void) {
ll n, i, j, d, ans, dmax = -1;
ll dcnt[100010] = {};
cin ... | replace | 17 | 22 | 17 | 18 | TLE | |
p02866 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define co(a) cout << a << endl
#define sz size()
#define bgn... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define co(a) cout << a << endl
#define sz size()
#define bgn... | replace | 255 | 257 | 255 | 257 | TLE | |
p02866 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define mod 1000000007 // 10^9+7
#define div 998244353
#define rep(i, n) for (int i = 0; i < n; i++)
int n, cnt = 1, ans = 1, maxl = 0;
int d[200000];
map<int, int> mp;
int my_pow(int a, int b) {
if (b == 1)
return a;
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define mod 1000000007 // 10^9+7
#define div 998244353
#define rep(i, n) for (int i = 0; i < n; i++)
int n, cnt = 1, ans = 1, maxl = 0;
int d[200000];
map<int, int> mp;
int my_pow(int a, int b) {
if (b == 1)
return a;
... | insert | 29 | 29 | 29 | 33 | 0 | |
p02866 | Python | Runtime Error | from collections import Counter
N = int(input())
Dlist = list(map(int, input().split()))
DCounter = Counter(Dlist)
if DCounter[0] == 1 and Dlist[0] == 0:
num = 1
mae = 1
for key, value in sorted(DCounter.items()[1:]):
num *= mae**value
mae = value
num %= 998244353
print(num % 99... | from collections import Counter
N = int(input())
Dlist = list(map(int, input().split()))
DCounter = Counter(Dlist)
if DCounter[0] == 1 and Dlist[0] == 0:
num = 1
for i in range(1, max(Dlist) + 1):
num *= DCounter[i - 1] ** DCounter[i]
print(num % 998244353)
else:
print(0)
| replace | 7 | 12 | 7 | 10 | TypeError: 'dict_items' object is not subscriptable | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02866/Python/s839580086.py", line 8, in <module>
for key, value in sorted(DCounter.items()[1:]):
TypeError: 'dict_items' object is not subscriptable
|
p02866 | Python | Runtime Error | LARGE = 998244353
def solve(n, d_list):
cnt = [0] * (max(d_list) + 1)
for i in range(n):
cnt[d_list[i]] += 1
if cnt[0] != 1 or d_list[0] != 0:
return 0
res = 1
for i in range(max(d_list)):
res *= pow(cnt[i], cnt[i + 1], LARGE)
res %= LARGE
return res
def main(... | LARGE = 998244353
def solve(n, d_list):
cnt = [0] * (max(d_list) + 1)
for i in range(n):
cnt[d_list[i]] += 1
if cnt[0] != 1 or d_list[0] != 0:
return 0
res = 1
for i in range(max(d_list)):
res *= pow(cnt[i], cnt[i + 1], LARGE)
res %= LARGE
return res
def main(... | replace | 18 | 19 | 18 | 19 | ValueError: invalid literal for int() with base 10: '0 1 1 2' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02866/Python/s784122479.py", line 32, in <module>
main()
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02866/Python/s784122479.py", line 19, in main
d_list = list(map(int(input())))... |
p02866 | Python | Runtime Error | import collections
def mod_pow(a, n, mod):
result = 1
a_n = a
while n > 0:
if n & 1:
result = result * a_n % mod
a_n = a_n * a_n % mod
n >>= 1
return result
def main(n, d):
MOD = 998244353
counter = collections.Counter(d)
if counter[0] != 1:
re... | import collections
def mod_pow(a, n, mod):
result = 1
a_n = a
while n > 0:
if n & 1:
result = result * a_n % mod
a_n = a_n * a_n % mod
n >>= 1
return result
def main(n, d):
MOD = 998244353
counter = collections.Counter(d)
if counter[0] != 1 or d[0] != ... | replace | 17 | 20 | 17 | 18 | TypeError: argument of type 'builtin_function_or_method' is not iterable | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02866/Python/s386049563.py", line 34, in <module>
print(main(n=N, d=D))
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02866/Python/s386049563.py", line 20, in main
if 0 in counter.v... |
p02866 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define all_map(itr, mp) for (auto itr = mp.begin(); itr != m... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define all_map(itr, mp) for (auto itr = mp.begin(); itr != m... | replace | 33 | 35 | 33 | 40 | -11 | |
p02867 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define For(i, j, k) for (int i = (int)(j); i <= (int)(k); i++)
#define Rep(i, j, k) for (int i = (int)(j); i >= (int)(k); i--)
inline ll read() {
ll x = 0;
char ch = getchar();
bool f = 0;
for (; !isdigit(ch); ch = getchar... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define For(i, j, k) for (int i = (int)(j); i <= (int)(k); i++)
#define Rep(i, j, k) for (int i = (int)(j); i >= (int)(k); i--)
inline ll read() {
ll x = 0;
char ch = getchar();
bool f = 0;
for (; !isdigit(ch); ch = getchar... | replace | 73 | 74 | 73 | 74 | TLE | |
p02867 | C++ | Runtime Error | // https://atcoder.jp/contests/nikkei2019-2-qual/tasks/nikkei2019_2_qual_c
#define CIN_ONLY
#define DECIMAL_DIGITS 10
#define STATIC_MOD 1e9 + 7
#ifdef BTK
/*<head>*/
#include "Template.hpp"
/*</head>*/
#else
/*<body>*/
/* #region auto includes */
/* #region stl */
/*<stl>*/
#include <bits/stdc++.h>
#include <sys/type... | // https://atcoder.jp/contests/nikkei2019-2-qual/tasks/nikkei2019_2_qual_c
#define CIN_ONLY
#define DECIMAL_DIGITS 10
#define STATIC_MOD 1e9 + 7
#ifdef BTK
/*<head>*/
#include "Template.hpp"
/*</head>*/
#else
/*<body>*/
/* #region auto includes */
/* #region stl */
/*<stl>*/
#include <bits/stdc++.h>
#include <sys/type... | delete | 549 | 550 | 549 | 549 | 0 | |
p02867 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
bool hasCycle = false;
void search(int curr, int &n, vector<vector<int>> &v, vector<int> &visited,
int count) {
if (hasCycle)
return;
visited[curr] = count;
for (auto &to : v[curr]) {
if (visited[to] != -1) {
if (count - visited[to] + 1 != ... | #include <bits/stdc++.h>
using namespace std;
bool hasCycle = false;
void search(int curr, int &n, vector<vector<int>> &v, vector<int> &visited,
int count) {
if (hasCycle)
return;
visited[curr] = count;
for (auto &to : v[curr]) {
if (visited[to] != -1) {
if (count - visited[to] + 1 != ... | delete | 47 | 48 | 47 | 47 | -6 | 5d0cdb3d-ee50-4ea1-9d86-4a6c4695f647.out: /home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02867/C++/s112190854.cpp:42: int main(): Assertion `false' failed.
|
p02867 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, int> P;
int main() {
int N;
cin >> N;
vector<P> A(N), B(N);
for (int i = 0; i < N; ++i) {
cin >> A[i].first;
A[i].second = i;
}
for (int i = 0; i < N; ++i) {
cin >> B[i].fir... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, int> P;
int main() {
int N;
cin >> N;
vector<P> A(N), B(N);
for (int i = 0; i < N; ++i) {
cin >> A[i].first;
A[i].second = i;
}
for (int i = 0; i < N; ++i) {
cin >> B[i].fir... | replace | 20 | 21 | 20 | 21 | 0 | |
p02867 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
namespace TYC {
typedef long long ll;
typedef pair<int, int> pii;
const int N = 1e5 + 5;
int n, A[N], B[N], P[N];
map<int, int> idA, idB;
inline int read() {
int x = 0, f = 0, ch = getchar();
while (!isdigit(ch))
f |= (ch == '-'), ch = getchar();
while (isdigit... | #include <bits/stdc++.h>
using namespace std;
namespace TYC {
typedef long long ll;
typedef pair<int, int> pii;
const int N = 1e5 + 5;
int n, A[N], B[N], P[N];
map<int, int> idA, idB;
inline int read() {
int x = 0, f = 0, ch = getchar();
while (!isdigit(ch))
f |= (ch == '-'), ch = getchar();
while (isdigit... | replace | 39 | 41 | 39 | 41 | TLE | |
p02867 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define rrep(i, a, b) for (int i = (a); i >= (b); --i)
#define PB push_back
#define ar2 array<int, 2>
typedef long long LL;
const int P = 1e9 + 7;
const int N = 2005;
const double pi = acos(-1);
mt19937 rng(chrono::stead... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define rrep(i, a, b) for (int i = (a); i >= (b); --i)
#define PB push_back
#define ar2 array<int, 2>
typedef long long LL;
const int P = 1e9 + 7;
const int N = 1e5 + 5;
const double pi = acos(-1);
mt19937 rng(chrono::st... | replace | 8 | 9 | 8 | 9 | 0 | |
p02867 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cstdio>
#include <tuple>
#include <vector>
using namespace std;
int main() {
int N;
scanf("%d", &N);
vector<pair<int, int>> A, B;
for (int n = 0; n < N; ++n) {
int a;
scanf("%d", &a);
A.emplace_back(a, n);
}
for (int n = 0; n < N; ++n) {
in... | #include <algorithm>
#include <cassert>
#include <cstdio>
#include <tuple>
#include <vector>
using namespace std;
int main() {
int N;
scanf("%d", &N);
vector<pair<int, int>> A, B;
for (int n = 0; n < N; ++n) {
int a;
scanf("%d", &a);
A.emplace_back(a, n);
}
for (int n = 0; n < N; ++n) {
in... | replace | 47 | 52 | 47 | 49 | 0 | |
p02867 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
... | replace | 145 | 146 | 145 | 149 | 0 | |
p02867 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <queue>
#include <set>
#include <utility>
#include <vector>
using namespace std;
int g[100000];
int dfs(int x) {
if (g[x] == x) {
return x;
} else {
return x = dfs(g[x]);
}
}
int main() {
int n, x, y;
vector<pair<int... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <queue>
#include <set>
#include <utility>
#include <vector>
using namespace std;
int g[100000];
int dfs(int x) {
if (g[x] == x) {
return x;
} else {
return x = dfs(g[x]);
}
}
int main() {
int n, x, y;
vector<pair<int... | replace | 43 | 44 | 43 | 44 | 0 | |
p02867 | C++ | Runtime Error | #include <bits/stdc++.h>
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define vpii vector<pair<int, int>>
#define gph map<int, vector<int>>
#define mp make_pair
#define FOR(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR1(i, n) for (int i = 1; i <= (int)(n); i++)
#define FORD0(i, n) for (... | #include <bits/stdc++.h>
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define vpii vector<pair<int, int>>
#define gph map<int, vector<int>>
#define mp make_pair
#define FOR(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR1(i, n) for (int i = 1; i <= (int)(n); i++)
#define FORD0(i, n) for (... | replace | 29 | 30 | 29 | 30 | -11 | |
p02868 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using ll = long long;
struct edge {
int to;
ll cost;
};
typedef pair<int, int> P;
const ll INF = 1e18;
const int MAX_V = 1e5;
vector<edge> G[MAX_V];
vector<ll> d(MAX_V, INF);
void dijkstra(int s) {
priority_queue<P... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using ll = long long;
struct edge {
int to;
ll cost;
};
typedef pair<ll, int> P;
const ll INF = 1e18;
const int MAX_V = 1e5;
vector<edge> G[MAX_V];
vector<ll> d(MAX_V, INF);
void dijkstra(int s) {
priority_queue<P,... | replace | 9 | 10 | 9 | 10 | TLE | |
p02868 | C++ | Time Limit Exceeded | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typede... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typede... | replace | 66 | 69 | 66 | 69 | TLE | |
p02868 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) x.begin(), x.e... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) x.begin(), x.e... | replace | 24 | 25 | 24 | 25 | 0 | |
p02868 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define FORN(i, m, n) for (int(i) = (m); (i) <= (n); (i)++)
#define FORR(i, m, n) for (int(i) = (m); (i) >= (n); (i)--)
#define rep(i, n) FOR(i, 0, n)
#define repn(i, n) FORN(i, 1, n)
#define repr(i, n) FORR(i, n, 0... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define FORN(i, m, n) for (int(i) = (m); (i) <= (n); (i)++)
#define FORR(i, m, n) for (int(i) = (m); (i) >= (n); (i)--)
#define rep(i, n) FOR(i, 0, n)
#define repn(i, n) FORN(i, 1, n)
#define repr(i, n) FORR(i, n, 0... | replace | 55 | 56 | 55 | 56 | TLE | |
p02868 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
constexpr int N = 100010;
// https://smijake3.hatenablog.com/entry/2019/04/28/021457#%E5%8C%BA%E9%96%93chmin%E3%82%AF%E3%82%A8%E3%83%AARMQRSQ%E3%82%92%E5%87%A6%E7%90%86%E3%81%99%E3%82%8B%E5%AE%9F%E8%A3%85
class SegmentTree {
const ll inf = 1e18;
... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
constexpr int N = 100010;
// https://smijake3.hatenablog.com/entry/2019/04/28/021457#%E5%8C%BA%E9%96%93chmin%E3%82%AF%E3%82%A8%E3%83%AARMQRSQ%E3%82%92%E5%87%A6%E7%90%86%E3%81%99%E3%82%8B%E5%AE%9F%E8%A3%85
class SegmentTree {
const ll inf = 1e18;
... | replace | 134 | 135 | 134 | 135 | 0 | |
p02868 | C++ | Runtime Error | #include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using pli = pair<int64_t, int>;
using mii = map<int, int>;
struct node {
mii edge;
bool done = false;
int64_t cost = -1;
bool operator<(const node &rhs) const {
if (rhs.cost == -1 && this->cost == -1... | #include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using pli = pair<int64_t, int>;
using mii = map<int, int>;
struct node {
mii edge;
bool done = false;
int64_t cost = -1;
bool operator<(const node &rhs) const {
if (rhs.cost == -1 && this->cost == -1... | replace | 73 | 74 | 73 | 77 | 0 | |
p02868 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define debug(x) \
do { ... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define debug(x) \
do { ... | replace | 71 | 75 | 71 | 73 | 0 | |
p02868 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long LL;
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define REP(I, N) for (int I = 0; I < (N); ++I)
#define REPP(I, A, B) for (int I = (A); I < (B); ++I)
#define RI(X) scanf("%d", &(X))
#define RII(X, Y) scanf("%d%d", &(X), &(Y))
#define RIII(X, Y, Z) sca... | #include <bits/stdc++.h>
typedef long long LL;
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define REP(I, N) for (int I = 0; I < (N); ++I)
#define REPP(I, A, B) for (int I = (A); I < (B); ++I)
#define RI(X) scanf("%d", &(X))
#define RII(X, Y) scanf("%d%d", &(X), &(Y))
#define RIII(X, Y, Z) sca... | insert | 64 | 64 | 64 | 66 | 0 | |
p02868 | C++ | Runtime Error | #include <bits/stdc++.h>
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define popcnt(x) __builtin_popcount(x)
#define inf 0x3f3f3f3f
#define watch(x) cout << (#x) << " is " << (x) << endl
#define rand() (rand() << 15 | rand())
using namespace std;
typedef long long ll;
#define EPS 1e-9
#define PI acos(-1.... | #include <bits/stdc++.h>
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define popcnt(x) __builtin_popcount(x)
#define inf 0x3f3f3f3f
#define watch(x) cout << (#x) << " is " << (x) << endl
#define rand() (rand() << 15 | rand())
using namespace std;
typedef long long ll;
#define EPS 1e-9
#define PI acos(-1.... | replace | 28 | 29 | 28 | 29 | 0 | |
p02868 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <utility>
#include <vector>
using ll_t = long long;
using pii = std::pair<int, int>;
const int MAXN = (int)1e5 + 1;
const ll_t INF = (ll_t)1e15;
struct SegmentTree {
struct Node {
int l, r;
ll_t tag; // 这个区间内，<=tag的值不变，>tag的值改为tag.
};
Node node[MAXN];
i... | #include <algorithm>
#include <cstdio>
#include <utility>
#include <vector>
using ll_t = long long;
using pii = std::pair<int, int>;
const int MAXN = (int)1e5 + 1;
const ll_t INF = (ll_t)1e15;
struct SegmentTree {
struct Node {
int l, r;
ll_t tag; // 这个区间内，<=tag的值不变，>tag的值改为tag.
};
Node node[MAXN * 4];
... | replace | 15 | 16 | 15 | 16 | 0 | |
p02868 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const ll N = 1e5 + 5, mod = 1e15;
ll dist[N];
vector<pii> adj[N];
ll n, m;
void dij() {
for (int i = 0; i < n; i++)
dist[i] = mod;
set<pii> s;
dist[0] = 0;
s.insert({0, 0});
while (!s.empty()) {
int v =... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
const ll N = 1e5 + 5, mod = 1e15;
ll dist[N];
vector<pii> adj[N];
ll n, m;
void dij() {
for (int i = 0; i < n; i++)
dist[i] = mod;
set<pii> s;
dist[0] = 0;
s.insert({0, 0});
while (!s.empty()) {
int v = (... | replace | 4 | 5 | 4 | 5 | TLE | |
p02868 | C++ | Runtime Error | #include <cstdio>
#include <cstdlib>
#include <vector>
using namespace std;
const long long TINF = 100000000000000000ll;
template <class T> class segmintree {
private:
T ragin(int i, int j, int k, int a, int b) {
return a <= j && k <= b ? seg[i]
: k <= a || b <= j ? TINF
... | #include <cstdio>
#include <cstdlib>
#include <vector>
using namespace std;
const long long TINF = 100000000000000000ll;
template <class T> class segmintree {
private:
T ragin(int i, int j, int k, int a, int b) {
return a <= j && k <= b ? seg[i]
: k <= a || b <= j ? TINF
... | replace | 26 | 27 | 26 | 27 | -6 | malloc(): corrupted top size
|
p02868 | C++ | Time Limit Exceeded | #pragma target("avx")
#pragma optimize("O3")
#pragma optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define INF_LL 100000000000000000LL
#define INF 200000000
#define MOD 998244353
#define ll long long
#define all(x) x.begin(), x.end()
#define REP(i, a, b) for (int i = a; i < b; i++)
#define rep(... | #pragma target("avx")
#pragma optimize("O3")
#pragma optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define INF_LL 100000000000000000LL
#define INF 200000000
#define MOD 998244353
#define ll long long
#define all(x) x.begin(), x.end()
#define REP(i, a, b) for (int i = a; i < b; i++)
#define rep(... | replace | 14 | 15 | 14 | 15 | TLE | |
p02868 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MX = 100005;
const ll INF = 1000000000LL * 1000000000LL;
int n;
vector<pair<int, int>> neigh[4 * MX];
struct {
int L, R;
int pl, pr;
} T[2 * MX];
int nxt;
int buildTree1(int L, int R) {
if (L == R)
return L;
int cur = nxt++;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MX = 100005;
const ll INF = 1000000000LL * 1000000000LL;
int n;
vector<pair<int, int>> neigh[4 * MX];
struct {
int L, R;
int pl, pr;
} T[4 * MX];
int nxt;
int buildTree1(int L, int R) {
if (L == R)
return L;
int cur = nxt++;
... | replace | 14 | 15 | 14 | 15 | 0 | |
p02868 | C++ | Runtime Error | #include <bits/stdc++.h> //Written by ThiDaiLoc
using namespace std; // Team Three Wolves
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<ll, pll> trp;
typedef vector<ll> vi;
typedef vector<pll> vp;
#define fu(i, a, b) for (ll i = a; i <= b; i++)... | #include <bits/stdc++.h> //Written by ThiDaiLoc
using namespace std; // Team Three Wolves
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<ll, pll> trp;
typedef vector<ll> vi;
typedef vector<pll> vp;
#define fu(i, a, b) for (ll i = a; i <= b; i++)... | insert | 97 | 97 | 97 | 99 | 0 | |
p02868 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define pp pair<int, int>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define ll long long
#define ld long double
#define all(a) (a).begin(), (a).end()
#define mk make_pair
ll mod = 1000000007;
ll MOD = 998244353;
int inf = 1000001000;
ll INF = 100000000000000000;
... | #include <bits/stdc++.h>
using namespace std;
#define pp pair<int, int>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define ll long long
#define ld long double
#define all(a) (a).begin(), (a).end()
#define mk make_pair
ll mod = 1000000007;
ll MOD = 998244353;
int inf = 1000001000;
ll INF = 100000000000000000;
... | replace | 93 | 94 | 93 | 95 | 0 | |
p02868 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cassert>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string.h>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long l... | #include <algorithm>
#include <cassert>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string.h>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long l... | replace | 41 | 42 | 41 | 42 | TLE | |
p02868 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define RREP(i, m, n) for (int i = (int)(m); i >= (int)(n); i--)
#define rrep(i, n) RREP(i, n - 1, 0)
#define REPL(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define RREP(i, m, n) for (int i = (int)(m); i >= (int)(n); i--)
#define rrep(i, n) RREP(i, n - 1, 0)
#define REPL(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i... | replace | 18 | 19 | 18 | 19 | TLE | |
p02868 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define RREP(i, m, n) for (int i = (int)(m); i >= (int)(n); i--)
#define rrep(i, n) RREP(i, n - 1, 0)
#define all(v) v.begin(), v.end()
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define RREP(i, m, n) for (int i = (int)(m); i >= (int)(n); i--)
#define rrep(i, n) RREP(i, n - 1, 0)
#define all(v) v.begin(), v.end()
... | replace | 54 | 55 | 54 | 55 | TLE | |
p02868 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define debug(x) cerr << #x << " = " << x << endl
using namespace std;
typedef long long... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define debug(x) cerr << #x << " = " << x << endl
using namespace std;
typedef long long... | replace | 32 | 33 | 32 | 33 | TLE | |
p02868 | C++ | Runtime Error | /// awoooooo
#include <bits/stdc++.h>
#define sz(x) (int)((x).size())
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
const int N = (int)2e5 + 5;
const int inf = (int)1e9 + 7;
const ll INF = (ll)1e18;
int n, m;
int l[N], r[N], c[N];
ll de[N];
vector<int> event[N];
in... | /// awoooooo
#include <bits/stdc++.h>
#define sz(x) (int)((x).size())
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
const int N = (int)2e5 + 5;
const int inf = (int)1e9 + 7;
const ll INF = (ll)1e18;
int n, m;
int l[N], r[N], c[N];
ll de[N];
vector<int> event[N];
in... | replace | 27 | 28 | 27 | 28 | 0 | |
p02868 | C++ | Time Limit Exceeded | #define DEBUG 0
#include <algorithm>
#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 <vector>
using namespac... | #define DEBUG 0
#include <algorithm>
#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 <vector>
using namespac... | replace | 175 | 176 | 175 | 176 | TLE | |
p02868 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const long long int INF = 1e18;
// computational complexity : O(E*logV)
struct edge {
int to;
long long int cost;
};
int V, E; // number of (vertices, edges)
vector<vector<edge>> graph;
vector<long long int> d; // shortest distances
void Dijkstra(int s) { // s = sta... | #include <bits/stdc++.h>
using namespace std;
const long long int INF = 1e18;
// computational complexity : O(E*logV)
struct edge {
int to;
long long int cost;
};
int V, E; // number of (vertices, edges)
vector<vector<edge>> graph;
vector<long long int> d; // shortest distances
void Dijkstra(int s) { ... | replace | 15 | 21 | 15 | 22 | TLE | |
p02868 | C++ | Runtime Error | #include <cstring>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
const int N = 100000 + 10;
typedef long long LL;
int n, m;
int nod[2][N], C, s, t;
vector<pair<int, int>> g[1300000 + 10];
void build(int id, int l, int r, int rt) {
nod[id][rt] = ++C;
// printf("id = %d, l = %d, r = %d,... | #include <cstring>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
const int N = 100000 + 10;
typedef long long LL;
int n, m;
int nod[2][N << 2], C, s, t;
vector<pair<int, int>> g[1300000 + 10];
void build(int id, int l, int r, int rt) {
nod[id][rt] = ++C;
// printf("id = %d, l = %d, r ... | replace | 9 | 10 | 9 | 10 | 0 | |
p02868 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = (ll)(a); i < (ll)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ll long long
#define lld long double
#define ALL(x) x.begin(), x.end()
#ifdef ... | #include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = (ll)(a); i < (ll)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ll long long
#define lld long double
#define ALL(x) x.begin(), x.end()
#ifdef ... | replace | 79 | 93 | 79 | 80 | TLE | |
p02868 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
const int N = 110000;
typedef long long LL;
const LL mod = 1e9 + 7;
int l[N], r[N];
int a[N], b[N], c[N];
int n, m;
vector<int> g;
vector<pair<int, LL>> f[N * 8];
priority_queue<pair<LL, int>, ... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
const int N = 110000;
typedef long long LL;
const LL mod = 1e9 + 7;
int l[N], r[N];
int a[N], b[N], c[N];
int n, m;
vector<int> g;
vector<pair<int, LL>> f[N * 8];
priority_queue<pair<LL, int>, ... | replace | 20 | 22 | 20 | 22 | 0 | |
p02868 | C++ | Runtime Error | //----------------------------templates
#pragma GCC optimize("Ofast")
#pragma GCC target("tune=native")
#pragma GCC target("avx")
//----------------------------
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define int ll
#define FOR(i, j, n) for (int i = (int)(j)... | //----------------------------templates
#pragma GCC optimize("Ofast")
#pragma GCC target("tune=native")
#pragma GCC target("avx")
//----------------------------
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define int ll
#define FOR(i, j, n) for (int i = (int)(j)... | replace | 332 | 335 | 332 | 334 | 0 | |
p02868 | 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;
const ll INF = 1e18;
int n, m;
vector<P> edge[100010];
vector<ll> dijkstra(int x) {
vector<ll> dist(n + 1, INF);
priority_queue<P, vector<P>, greater<P>> q;
dist[x] = 0;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 1e18;
int n, m;
vector<P> edge[100010];
vector<ll> dijkstra(int x) {
vector<ll> dist(n + 1, INF);
priority_queue<P, vector<P>, greater<P>> q;
dist[x] = 0;
... | replace | 4 | 5 | 4 | 5 | TLE | |
p02868 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using na... | #include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using na... | replace | 284 | 285 | 284 | 285 | TLE | |
p02868 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
const long long INF = 1e18;
struct Edge {
int from, to;
long long cost;
Edge(int _to, long long _cost) : from(-1), to(_to), cost(_cost) {}
Edge(int _from, int _to, long long _cost)
: from(_from), to(_to), cost(_co... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
const long long INF = 1e18;
struct Edge {
int from, to;
long long cost;
Edge(int _to, long long _cost) : from(-1), to(_to), cost(_cost) {}
Edge(int _from, int _to, long long _cost)
: from(_from), to(_to), cost(_co... | insert | 44 | 44 | 44 | 46 | 0 | |
p02868 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
t... | #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 FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
t... | replace | 49 | 50 | 49 | 50 | TLE | |
p02868 | C++ | Runtime Error | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
// repetition
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
// container util
#define all(x) (x).begin(), (x).end()
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
// repetition
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
// container util
#define all(x) (x).begin(), (x).end()
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define... | replace | 109 | 110 | 109 | 110 | 0 | |
p02868 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
int n, m;
vector<P> to[100005];
vector<ll> dist(100005, LLONG_MAX);
ll solve() {
priority_queue<P, vector<P>,... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
int n, m;
vector<P> to[100005];
vector<ll> dist(100005, LLONG_MAX);
ll solve() {
priority_queue<P, vector<P>,... | replace | 44 | 47 | 44 | 47 | TLE | |
p02868 | C++ | Runtime Error | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define bit(x) (1L << (x))
using ll = long long;
using namespace std;
template <typename T> vector<T> make_v(size_t a, T b) {
return vector<T>(a, b);
}
template <typenam... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define bit(x) (1L << (x))
using ll = long long;
using namespace std;
template <typename T> vector<T> make_v(size_t a, T b) {
return vector<T>(a, b);
}
template <typenam... | replace | 67 | 68 | 67 | 68 | 0 | |
p02868 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define dbg(S) \
{ \
int f = 1; \
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define dbg(S) \
{ \
int f = 1; \
... | replace | 19 | 20 | 19 | 20 | 0 | |
p02868 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
using P = pair<ll, ll>;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
using P = pair<ll, ll>;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl... | delete | 43 | 44 | 43 | 43 | TLE | |
p02868 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>>
q;
int n, m, l, r;
vector<pair<pair<int, int>... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>>
q;
int n, m, l, r;
vector<pair<pair<int, int>... | insert | 33 | 33 | 33 | 36 | TLE | |
p02868 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define r... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define r... | replace | 39 | 40 | 39 | 41 | TLE | |
p02868 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define r... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define r... | replace | 46 | 47 | 46 | 47 | TLE | |
p02868 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<pair<int, int>, ll> P;
const ll MOD = 1e9 + 7;
struct segtree {
int N;
ll dat[2 * 100000];
segtree() {}
segtree(int n) {
... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<pair<int, int>, ll> P;
const ll MOD = 1e9 + 7;
struct segtree {
int N;
ll dat[2 * 400000];
segtree() {}
segtree(int n) {
... | replace | 14 | 15 | 14 | 15 | 0 | |
p02868 | C++ | Runtime Error | #include <bits/stdc++.h>
#define INF 1e18
#define int long long
#define Rep(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) Rep(i, 0, n)
#define all(a) (a).begin(), (a).end()
using namespace std;
typedef pair<int, int> P;
typedef pair<int, P> PP;
const int mod = 1000000007;
struct edge {
int to, cost;
};
... | #include <bits/stdc++.h>
#define INF 1e18
#define int long long
#define Rep(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) Rep(i, 0, n)
#define all(a) (a).begin(), (a).end()
using namespace std;
typedef pair<int, int> P;
typedef pair<int, P> PP;
const int mod = 1000000007;
struct edge {
int to, cost;
};
... | replace | 15 | 16 | 15 | 16 | 0 | |
p02868 | C++ | Runtime Error | #include <bits/stdc++.h>
using i64 = long long;
int main() {
constexpr i64 inf = std::numeric_limits<i64>::max() / 2;
int n, m;
std::cin >> n >> m;
std::vector<std::tuple<int, int, i64, int>> evs;
for (int i = 0; i < m; i++) {
int l, r;
i64 c;
std::cin >> l >> r >> c;
evs.emplace_back(l - 1, ... | #include <bits/stdc++.h>
using i64 = long long;
int main() {
constexpr i64 inf = std::numeric_limits<i64>::max() / 2;
int n, m;
std::cin >> n >> m;
std::vector<std::tuple<int, int, i64, int>> evs;
for (int i = 0; i < m; i++) {
int l, r;
i64 c;
std::cin >> l >> r >> c;
evs.emplace_back(l - 1, ... | replace | 18 | 19 | 18 | 19 | 0 | |
p02868 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <fstream>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_set>
#include <vector>
#define MOD_BIG 1000000007
#define MOD_BIG2 998244353
using std::cerr;
using std::cin;
using std::... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <fstream>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_set>
#include <vector>
#define MOD_BIG 1000000007
#define MOD_BIG2 998244353
using std::cerr;
using std::cin;
using std::... | delete | 108 | 111 | 108 | 108 | TLE | |
p02868 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define rep(i, x) for (ll i = 0; i < (ll)(x); i++)
#define rrep(i, x) for (ll i = (ll)(x)-1; 0 <= i; i--)
#define reps(i, x) for (ll i = 1; i < (ll)(x) + 1; i++)
#d... | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define rep(i, x) for (ll i = 0; i < (ll)(x); i++)
#define rrep(i, x) for (ll i = (ll)(x)-1; 0 <= i; i--)
#define reps(i, x) for (ll i = 1; i < (ll)(x) + 1; i++)
#d... | replace | 149 | 150 | 149 | 150 | 0 | |
p02868 | C++ | Runtime Error | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | insert | 712 | 712 | 712 | 713 | -6 | terminate called after throwing an instance of 'std::length_error'
what(): cannot create std::vector larger than max_size()
|
p02868 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
class Edge {
public:
long long to;
long long cost;
Edge() {}
Edge(long long _to, long long _cost) {
to = _to;
cost = _cost;
}
};
class Mov {
public:
long long id;
long long cost;
Mov(long long _id, long long _cost) {
id = _id;
cost = _cost;... | #include <bits/stdc++.h>
using namespace std;
class Edge {
public:
long long to;
long long cost;
Edge() {}
Edge(long long _to, long long _cost) {
to = _to;
cost = _cost;
}
};
class Mov {
public:
long long id;
long long cost;
Mov(long long _id, long long _cost) {
id = _id;
cost = _cost;... | replace | 41 | 45 | 41 | 43 | TLE | |
p02868 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define reps(i, n) for (int i = 1; i <= (int)(n); ++i)
#define repd(i, n) for (int i = (int)(n - 1); i >= 0; --i)
#define repds(i, n) for (int i = (int)(n); i > 0; --i)
#define loop(i, x, n) for (int i = (int)(x); i < (n... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define reps(i, n) for (int i = 1; i <= (int)(n); ++i)
#define repd(i, n) for (int i = (int)(n - 1); i >= 0; --i)
#define repds(i, n) for (int i = (int)(n); i > 0; --i)
#define loop(i, x, n) for (int i = (int)(x); i < (n... | replace | 57 | 58 | 57 | 58 | TLE | |
p02868 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N, M;
vector<tuple<ll, ll, ll>> E;
typedef pair<ll, ll> P;
ll solve() {
ll v = 0, d = 0, e = 0;
priority_queue<P, vector<P>, greater<P>> que;
while (v != N - 1) {
for (; get<0>(E[e]) <= v; ++e) {
ll l, r, c;
tie(l, r, c) = E... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N, M;
vector<tuple<ll, ll, ll>> E;
typedef pair<ll, ll> P;
ll solve() {
ll v = 0, d = 0, e = 0;
priority_queue<P, vector<P>, greater<P>> que;
while (v != N - 1) {
for (; e < E.size() && get<0>(E[e]) <= v; ++e) {
ll l, r, c;
... | replace | 13 | 14 | 13 | 14 | 0 | |
p02868 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 5;
int n, m;
ll t[N << 2], lz[N << 2];
vector<pair<int, int>> v[N];
void build(int l, int r, int k) {
t[k] = lz[k] = 1e18;
if (l == r && l == 1)
t[k] = 0;
if (l == r)
return;
int m = l + r >> 1;
build(l, m, k << 1)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 5;
int n, m;
ll t[N << 2], lz[N << 2];
vector<pair<int, int>> v[N];
void build(int l, int r, int k) {
t[k] = lz[k] = 1e18;
if (l == r && l == 1)
t[k] = 0;
if (l == r)
return;
int m = l + r >> 1;
build(l, m, k << 1)... | replace | 43 | 44 | 43 | 45 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.