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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p03032 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
const int dx[4] = {1, 0, -1, 0... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
const int dx[4] = {1, 0, -1, 0... | replace | 37 | 38 | 37 | 38 | 0 | |
p03032 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
deque<int> V;
for (int i = 0; i < N; i++) {
int j;
cin >> j;
V.push_back(j);
}
int sol = 0;
for (int i = 0; i <= K; i++) {
for (int j = 0; j + i <= K; j++) {
// 左からi個、右からj個取る
deque<int> V_sub... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
deque<int> V;
for (int i = 0; i < N; i++) {
int j;
cin >> j;
V.push_back(j);
}
int sol = 0;
for (int i = 0; i <= K; i++) {
for (int j = 0; j + i <= K; j++) {
// 左からi個、右からj個取る
deque<int> V_sub... | insert | 29 | 29 | 29 | 31 | 0 | |
p03032 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
int value = -1000000000;
for (int a = 0; a <= K; a++) {
for (int b = 0; b <= K - a; b++) {
vector<int> juel(0);
int sum = 0;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
int value = -1000000000;
for (int a = 0; a <= min(K, N - 1); a++) {
for (int b = 0; b <= min(K - a, N - a); b++) {
vector<int> juel(0);
... | replace | 11 | 13 | 11 | 13 | 0 | |
p03032 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i,... | replace | 46 | 47 | 46 | 47 | -6 | a469a272-d956-470b-bfcf-78115e11ae4f.out: /home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03032/C++/s467802606.cpp:38: int main(): Assertion `n>50 || k>100' failed.
|
p03032 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define all(x) begin(x), end(x)
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using vi = vector<int>;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, k;
cin >> n >> k;
vi a(n);
for (int i = 0; i <... | #include <bits/stdc++.h>
using namespace std;
#define all(x) begin(x), end(x)
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using vi = vector<int>;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, k;
cin >> n >> k;
vi a(n);
for (int i = 0; i <... | replace | 67 | 68 | 67 | 68 | 0 | |
p03032 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i,... | delete | 49 | 52 | 49 | 49 | TLE | |
p03032 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int n, k, ans = 0;
cin >> n >> k;
vector<int> v;
rep(i, n) { cin >> v[i]; }
rep(l, k + 1) {
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int n, k, ans = 0;
cin >> n >> k;
vector<int> v(n);
rep(i, n) { cin >> v[i]; }
rep(l, k + 1) {... | replace | 13 | 14 | 13 | 14 | -11 | |
p03032 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int mod = pow(10, 9) + 7;
// const int mod = 998244353;
// const int mod = ;
const int INF = 1LL << 60;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string abc = "abcdefghijklmnopqrstuvwxyz";
template <class T> bool chmin(T &a, T b) {
... | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int mod = pow(10, 9) + 7;
// const int mod = 998244353;
// const int mod = ;
const int INF = 1LL << 60;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string abc = "abcdefghijklmnopqrstuvwxyz";
template <class T> bool chmin(T &a, T b) {
... | replace | 61 | 62 | 61 | 62 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 0) >= this->size() (which is 0)
|
p03032 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define int long long
#define double long double
#define mod 1000000007
#define F first
#define S second
#define P pair<long long, long long>
#define all(a) a.begin(), a.end()
#define INF 10000000000000000
#define endl '\n'
template <class T> inli... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define int long long
#define double long double
#define mod 1000000007
#define F first
#define S second
#define P pair<long long, long long>
#define all(a) a.begin(), a.end()
#define INF 10000000000000000
#define endl '\n'
template <class T> inli... | replace | 37 | 50 | 37 | 53 | 0 | |
p03032 | C++ | Runtime Error | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, K;
cin >> N >> K;
vector<int> values(N + 1);
vector<int> ruisekiValues(N + 2);
vector<int> revRuisekiValues(N + 2);
// value, index
vector<pair<int, int>> minusValues(0);
for (int i = 1; i <=... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, K;
cin >> N >> K;
vector<int> values(N + 1);
vector<int> ruisekiValues(N + 2);
vector<int> revRuisekiValues(N + 2);
// value, index
vector<pair<int, int>> minusValues(0);
for (int i = 1; i <=... | replace | 33 | 35 | 33 | 35 | 0 | |
p03032 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
long long ma = 0;
vector<int> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
vector<int> s(0);
for (int a = 0; a <= min(k, n); a++) {
for (int b = 0; a + b <= min(k, n); b++) {
s.clear();
for (int i = 0... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
long long ma = 0;
vector<int> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
vector<int> s(0);
for (int a = 0; a <= min(k, n); a++) {
for (int b = 0; a + b <= min(k, n); b++) {
s.clear();
for (int i = 0... | replace | 21 | 24 | 21 | 27 | -11 | |
p03032 | C++ | Time Limit Exceeded | //============================================================================
// Everyone has a different way of thinking, so God Created us
// Hope You Respect My Way..,Thank You ):
// Author : Murad
// Name : Codeforces.cpp & Atcoder.cpp
// Description : Problem name
//=================================... | //============================================================================
// Everyone has a different way of thinking, so God Created us
// Hope You Respect My Way..,Thank You ):
// Author : Murad
// Name : Codeforces.cpp & Atcoder.cpp
// Description : Problem name
//=================================... | replace | 113 | 114 | 113 | 115 | TLE | |
p03032 | C++ | Runtime Error | #pragma GCC optimize("O3")
#pragma GCC target("sse4,sse4.1,sse4.2,avx,avx2,tune=native")
#include <bits/stdc++.h>
#define rep2(x, fr, to) for (int(x) = (fr); (x) < (to); (x)++)
#define rep(x, to) for (int(x) = 0; (x) < (to); (x)++)
#define repr(x, fr, to) for (int(x) = (fr); (x) >= (to); (x)--)
#define all(c) (c).begi... | #include <bits/stdc++.h>
#define rep2(x, fr, to) for (int(x) = (fr); (x) < (to); (x)++)
#define rep(x, to) for (int(x) = 0; (x) < (to); (x)++)
#define repr(x, fr, to) for (int(x) = (fr); (x) >= (to); (x)--)
#define all(c) (c).begin(), (c).end()
#define sz(v) (int)(v).size()
using namespace std;
typedef long long ll;
... | delete | 0 | 2 | 0 | 0 | 0 | |
p03033 | C++ | Runtime Error | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, s, f) for (int i = s; i < f; i++)
#define INF 1000000000000000000
#define MOD 1000000007
#define endl "\n"
#define fcout cout << fixed << setprecision(15)
typedef p... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, s, f) for (int i = s; i < f; i++)
#define INF 1000000000000000000
#define MOD 1000000007
#define endl "\n"
#define fcout cout << fixed << setprecision(15)
typedef p... | replace | 139 | 140 | 139 | 140 | -11 | |
p03033 | C++ | Runtime Error | #pragma GCC optimize("O3")
#include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
using QWORD = uint64... | #pragma GCC optimize("O3")
#include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
using QWORD = uint64... | replace | 234 | 235 | 234 | 237 | 0 | |
p03033 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <numeric>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
const int INF = 1 << 30;
const long long LINF = 1LL << 60;
int main() {
int n, q;
cin >> n >> q;
vector<ll> s(n), t(n... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
const int INF = 1 << 30;
const long long LINF = 1LL << 60;
int main() {
int n, q;
cin >> n >> q;
vector<ll> s(n), t(n... | replace | 34 | 35 | 34 | 35 | 0 | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define in(x, y, h, w) x >= 0 && x < h &&y >= 0 && y < w
#define int long lon... | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define in(x, y, h, w) x >= 0 && x < h &&y >= 0 && y < w
#define int long lon... | replace | 31 | 33 | 31 | 33 | -11 | |
p03033 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
int main() {
int n, q;
scanf("%d %d\n", &n, &q);
vector<tuple<int, int, int>> r;
for (int i = 0; i < n; ++i) {
int s, t, x;... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
int main() {
int n, q;
scanf("%d %d\n", &n, &q);
vector<tuple<int, int, int>> r;
for (int i = 0; i < n; ++i) {
int s, t, x;... | replace | 40 | 41 | 40 | 41 | TLE | |
p03033 | C++ | Time Limit Exceeded | #define _USE_MATH_DEFINES
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <random>
#in... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <random>
#in... | replace | 132 | 133 | 132 | 133 | TLE | |
p03033 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
// #include "prettyprint.hpp"
bool comp(tuple<long, long, bool> a, tuple<long, long, bool> b) {
if (get<0>(a) == get<0>... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
// #include "prettyprint.hpp"
bool comp(tuple<long, long, bool> a, tuple<long, long, bool> b) {
if (get<0>(a) == get<0>... | replace | 41 | 42 | 41 | 42 | 0 | |
p03033 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPi(i, a, b) for (int i = int(a); i < int(b); i++)
#define MEMS(a, b) memset(a, b, sizeof(a))
#define mp make_pair
template <class T> bool chmax(T &a, const T &b) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPi(i, a, b) for (int i = int(a); i < int(b); i++)
#define MEMS(a, b) memset(a, b, sizeof(a))
#define mp make_pair
template <class T> bool chmax(T &a, const T &b) ... | replace | 58 | 60 | 58 | 60 | TLE | |
p03033 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
#define in std::cin
#define out std::cout
#define rep(i, N) for (LL i = 0; i < N; ++i)
typedef long long int LL;
const LL inf = 112345678901234;
int main() {
LL N, Q;
in >> N >> Q;
std::vector<LL> S(N), T(N), X(N), D(Q);
rep(i, N) in >> S[i] >> T[i] >> X[i];
rep(i, Q) in >> D[i];
... | #include "bits/stdc++.h"
#define in std::cin
#define out std::cout
#define rep(i, N) for (LL i = 0; i < N; ++i)
typedef long long int LL;
const LL inf = 112345678901234;
int main() {
LL N, Q;
in >> N >> Q;
std::vector<LL> S(N), T(N), X(N), D(Q);
rep(i, N) in >> S[i] >> T[i] >> X[i];
rep(i, Q) in >> D[i];
... | replace | 22 | 29 | 22 | 32 | TLE | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
#define For(i, a, b) for (int(i) = (int)(a); (i) < (int)(b); ++(i))
#define rFor(i, a, b) for (int(i) = (int)(a)-1; (i) >= (int)(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;
typ... | #include <bits/stdc++.h>
#define For(i, a, b) for (int(i) = (int)(a); (i) < (int)(b); ++(i))
#define rFor(i, a, b) for (int(i) = (int)(a)-1; (i) >= (int)(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;
typ... | replace | 46 | 47 | 46 | 47 | 0 | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <cstdio>
using namespace std;
#define ll long long
#define PB push_back
#define ld long double
#define ff first
#define ss second
#define st(v) (v).begin(), (v).end()
const int dx[4] = {1, 0, 0, -1};
const int dy[4] = {0, -1, 1, 0};
const int nmax = 2e5 + 5;
vector<int> seg_tree(4 * nm... | #include <bits/stdc++.h>
#include <cstdio>
using namespace std;
#define ll long long
#define PB push_back
#define ld long double
#define ff first
#define ss second
#define st(v) (v).begin(), (v).end()
const int dx[4] = {1, 0, 0, -1};
const int dy[4] = {0, -1, 1, 0};
const int nmax = 8e5 + 5;
vector<int> seg_tree(4 * nm... | replace | 11 | 12 | 11 | 12 | 0 | |
p03033 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
const ll INF = 1e18 + 10;
int... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
const ll INF = 1e18 + 10;
int... | replace | 35 | 37 | 35 | 37 | TLE | |
p03033 | C++ | Time Limit Exceeded | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define MOD (1000000007)
using namespace std;
... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define MOD (1000000007)
using namespace std;
... | replace | 50 | 51 | 50 | 51 | TLE | |
p03033 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define BIT(X, i) ((X >> i) & 1)
#define REP(i, a, b) for (int i = (a); i < ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define BIT(X, i) ((X >> i) & 1)
#define REP(i, a, b) for (int i = (a); i < ... | replace | 53 | 54 | 53 | 54 | 0 | |
p03033 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include ... | replace | 58 | 59 | 58 | 59 | 0 | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define PP pair<int, int>
int inf = 1 << 30;
int N, Q;
int S[300010], T[300010], X;
vector<int> D;
vector<PP> xs;
int n, q, dat[500010];
void init(int &n_) {
int n = 1;
while (n < n_)
n *= 2;
n_ = n;
for (int i = 0; i < 2 * n - 1; i++)
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define PP pair<int, int>
int inf = 1 << 30;
int N, Q;
int S[300010], T[300010], X;
vector<int> D;
vector<PP> xs;
int n, q, dat[600010];
void init(int &n_) {
int n = 1;
while (n < n_)
n *= 2;
n_ = n;
for (int i = 0; i < 2 * n - 1; i++)
... | replace | 10 | 11 | 10 | 11 | 0 | |
p03033 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
int main(int argc, char *argv[]) {
// VARIABLES
int N, Q;
vector<tuple<int, int, int>> L;
set<tuple<int, int>> D;
// INPUT
cin >> N >> Q;
for (int i = 0; i... | #include <algorithm>
#include <iostream>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
int main(int argc, char *argv[]) {
// VARIABLES
int N, Q;
vector<tuple<int, int, int>> L;
set<tuple<int, int>> D;
// INPUT
cin >> N >> Q;
for (int i = 0; i... | replace | 31 | 33 | 31 | 39 | 0 | |
p03033 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
int main(int argc, char *argv[]) {
// VARIABLES
int N, Q;
vector<tuple<int, int, int>> L;
set<tuple<int, int>> D;
// INPUT
cin >> N >> Q;
for (int i = 0; i... | #include <algorithm>
#include <iostream>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
int main(int argc, char *argv[]) {
// VARIABLES
int N, Q;
vector<tuple<int, int, int>> L;
set<tuple<int, int>> D;
// INPUT
cin >> N >> Q;
for (int i = 0; i... | replace | 31 | 33 | 31 | 39 | 0 | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long signed int LL;
typedef long long unsigned int LU;
#define incID(i, l, r) for (LL i = (l); i < (r); ++i)
#define incII(i, l, r) for (LL i = (l); i <= (r); ++i)
#define decID(i, l, r) for (LL i = (r)-1; i >= (l); --i)
#define decII(i, l, r) for (LL i = (r); ... | #include <bits/stdc++.h>
using namespace std;
typedef long long signed int LL;
typedef long long unsigned int LU;
#define incID(i, l, r) for (LL i = (l); i < (r); ++i)
#define incII(i, l, r) for (LL i = (l); i <= (r); ++i)
#define decID(i, l, r) for (LL i = (r)-1; i >= (l); --i)
#define decII(i, l, r) for (LL i = (r); ... | replace | 124 | 125 | 124 | 125 | 0 | |
p03033 | C++ | Time Limit Exceeded | // #include <boost/multiprecision/cpp_dec_float.hpp>
// #include <boost/multiprecision/cpp_int.hpp>
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
// namespace mp = boo... | // #include <boost/multiprecision/cpp_dec_float.hpp>
// #include <boost/multiprecision/cpp_int.hpp>
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
// namespace mp = boo... | replace | 49 | 51 | 49 | 53 | TLE | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
struct event {
int t;
bool add;
int pos;
};
bool event_sort(const event &e1, const event &e2) { return e1.t < e2.t; }
int main() {
int N, Q;
cin >> N >> Q;
vector<int> S(N);
vector<int> T(N);
vector<int> X(N);
vector<int> D(Q);
for (int i = 0; i < N;... | #include <bits/stdc++.h>
using namespace std;
struct event {
int t;
bool add;
int pos;
};
bool event_sort(const event &e1, const event &e2) {
if (e1.t != e2.t)
return e1.t < e2.t;
else
return !e1.add;
}
int main() {
int N, Q;
cin >> N >> Q;
vector<int> S(N);
vector<int> T(N);
vector<int>... | replace | 9 | 10 | 9 | 15 | 0 | |
p03033 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <float.h>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#inclu... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <float.h>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#inclu... | insert | 256 | 256 | 256 | 257 | TLE | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
// order statistics tree
typedef tree<pii, null_type, less<pii>, rb_tree_tag,
tree_... | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
// order statistics tree
typedef tree<pii, null_type, less<pii>, rb_tree_tag,
tree_... | replace | 46 | 47 | 46 | 47 | 0 | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < ((int)b); ++i)
#define RFOR(i, a) for (int i = (a); i >= 0; --i)
#define FOE(i, a) for (auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define DUMP(x) cerr << #x << " = " << (x) << endl;
#define SUM(x) std::... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < ((int)b); ++i)
#define RFOR(i, a) for (int i = (a); i >= 0; --i)
#define FOE(i, a) for (auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define DUMP(x) cerr << #x << " = " << (x) << endl;
#define SUM(x) std::... | insert | 341 | 341 | 341 | 344 | 0 | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define forx(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, q;
cin >> n >> q;
vector<tuple<int, int, int>> a(n);
map<int, int> d, f;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define forx(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, q;
cin >> n >> q;
vector<tuple<int, int, int>> a(n);
map<int, int> d, f;
... | replace | 30 | 35 | 30 | 33 | -11 | |
p03033 | C++ | Runtime Error |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#inclu... |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#inclu... | replace | 97 | 98 | 97 | 98 | 0 | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
/// TONI BO$$ was here
/// #MLC
using namespace std;
struct inter {
int s, t, x;
} v[200001];
int d[200001];
int arbint[800001];
void update(int a, int b, int x, int st, int dr, int nod) {
if (st >= a && dr <= b) {
arbint[nod] = min(arbint[nod], x);
return;
}
int mij = (st +... | #include <bits/stdc++.h>
/// TONI BO$$ was here
/// #MLC
using namespace std;
struct inter {
int s, t, x;
} v[200001];
int d[200001];
int arbint[800001];
void update(int a, int b, int x, int st, int dr, int nod) {
if (st >= a && dr <= b) {
arbint[nod] = min(arbint[nod], x);
return;
}
int mij = (st +... | replace | 62 | 63 | 62 | 63 | 0 | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int ll
#define ll long long
#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807LL
#define I64_MAX2 1223372036854775807LL
#define INF I64_MAX2
#define MOD 1000000007
// #define MOD 998244353
#define MEM_SIZE 100010
#define DEBUG_OUT true
#define ALL(x) (x... | #include <bits/stdc++.h>
using namespace std;
#define int ll
#define ll long long
#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807LL
#define I64_MAX2 1223372036854775807LL
#define INF I64_MAX2
#define MOD 1000000007
// #define MOD 998244353
#define MEM_SIZE 100010
#define DEBUG_OUT true
#define ALL(x) (x... | replace | 71 | 72 | 71 | 72 | 0 | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n, q, s, t, x, d, u;
vector<pair<int, pair<int, bool>>> pr;
set<int> st;
int main() {
scanf("%d%d", &n, &q);
for (int i = 0; i < n; i++) {
scanf("%d%d%d", &s, &t, &x);
pr.push_back(make_pair(s - x, make_pair(x, true)));
pr.push_back(make_pair(t - x, mak... | #include <bits/stdc++.h>
using namespace std;
int n, q, s, t, x, d, u;
vector<pair<int, pair<int, bool>>> pr;
set<int> st;
int main() {
scanf("%d%d", &n, &q);
for (int i = 0; i < n; i++) {
scanf("%d%d%d", &s, &t, &x);
pr.push_back(make_pair(s - x, make_pair(x, true)));
pr.push_back(make_pair(t - x, mak... | replace | 16 | 17 | 16 | 17 | 0 | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
#define FOR(i, a, b) for (ll i = (... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
#define FOR(i, a, b) for (ll i = (... | replace | 85 | 86 | 85 | 86 | 0 | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
// #define int long long
typedef long long ll;
using namespace std;
const int MOD = 1000000007;
const int INF = 1010000000;
const double EPS = 1e-10;
const pair<int, int> fd[] = {make_pair(1, 0), make_pair(-1,... | #include <bits/stdc++.h>
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
// #define int long long
typedef long long ll;
using namespace std;
const int MOD = 1000000007;
const int INF = 1010000000;
const double EPS = 1e-10;
const pair<int, int> fd[] = {make_pair(1, 0), make_pair(-1,... | insert | 66 | 66 | 66 | 68 | 0 | |
p03033 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <queue>
#include <vector>
#define F first
#define S second
using namespace std;
typedef long long ll;
const ll M = 4e18;
struct st {
ll s, e, i;
};
bool operator<(st p, st q) { return p.i > q.i; }
bool cmp(st p, st q) { return p.s < q.s; }
ll ... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <queue>
#include <vector>
#define F first
#define S second
using namespace std;
typedef long long ll;
const ll M = 4e18;
struct st {
ll s, e, i;
};
bool operator<(st p, st q) { return p.i > q.i; }
bool cmp(st p, st q) { return p.s < q.s; }
ll ... | replace | 39 | 40 | 39 | 40 | 0 | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int maxn = 600060, mod = 998244353;
#define lson o << 1, l, mid
#define rson o << 1 | 1, mid + 1, r
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define ROF(i, a, b) for (int i = (a); i >= (b); i--)
#define MEM(x, v) memset(x, v, sizeof(x))
inline int read() ... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 600060, mod = 998244353;
#define lson o << 1, l, mid
#define rson o << 1 | 1, mid + 1, r
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define ROF(i, a, b) for (int i = (a); i >= (b); i--)
#define MEM(x, v) memset(x, v, sizeof(x))
inline int read() ... | replace | 21 | 23 | 21 | 23 | 0 | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define N 200010
#define mid ((l + r) >> 1)
#define ls a[t].l
#define rs a[t].r
using namespace std;
struct dat {
int c, l, r;
} e[N];
struct segt {
dat a[N * 60];
int cnt = 1;
void psd(int t) {
if (!ls)
ls = ++cnt;
if (!rs)
rs = ++cnt;
if (!... | #include <bits/stdc++.h>
#define ll long long
#define N 200010
#define mid ((l + r) >> 1)
#define ls a[t].l
#define rs a[t].r
using namespace std;
struct dat {
int c, l, r;
} e[N];
struct segt {
dat a[N * 80];
int cnt = 1;
void psd(int t) {
if (!ls)
ls = ++cnt;
if (!rs)
rs = ++cnt;
if (!... | replace | 11 | 12 | 11 | 12 | -11 | |
p03033 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, q;
int s, t, x;
int d;
cin >> n >> q;
vector<pair<pair<int, int>, int>>... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, q;
int s, t, x;
int d;
cin >> n >> q;
vector<pair<pair<int, int>, int>>... | replace | 36 | 37 | 36 | 37 | 0 | |
p03033 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define all(a) a.begin(), a.end()
#define forn(l, r) for (int i = l; i < (r); ++i)
#define F first
#define S second
#define $ ios::sync_with_stdio(0);
/// #define int long long int
using namespace std;
using namespace __gnu_pbds;
using ll = long long i... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define all(a) a.begin(), a.end()
#define forn(l, r) for (int i = l; i < (r); ++i)
#define F first
#define S second
#define $ ios::sync_with_stdio(0);
/// #define int long long int
using namespace std;
using namespace __gnu_pbds;
using ll = long long i... | replace | 62 | 63 | 62 | 63 | TLE | |
p03033 | C++ | Runtime Error | /// kAAzuki Hoshino
/*
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ex... | /// kAAzuki Hoshino
/*
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ex... | insert | 78 | 78 | 78 | 80 | 0 | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
vector<tuple<int, int, int>> v;
vector<int> d(Q);
for (int i = 0; i < N; i++) {
int S, T, X;
cin >> S >> T >> X;
S -= X;
T -= X;
v.push_back(make_tuple(S, 1, X));
v.push_back(make_tuple(T, 0, X));
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
vector<tuple<int, int, int>> v;
vector<int> d(Q);
for (int i = 0; i < N; i++) {
int S, T, X;
cin >> S >> T >> X;
S -= X;
T -= X;
v.push_back(make_tuple(S, 1, X));
v.push_back(make_tuple(T, 0, X));
}
... | insert | 37 | 37 | 37 | 38 | 0 | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <sys/types.h>
#include <unistd.h>
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) _range(i, 0, n)
#define _range(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload(__VA_ARGS__, _range, _rep, )(__VA_ARGS__)
#define _rrep(i, n) _rrange(i, n, 0)
#... | #include <bits/stdc++.h>
#include <sys/types.h>
#include <unistd.h>
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) _range(i, 0, n)
#define _range(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload(__VA_ARGS__, _range, _rep, )(__VA_ARGS__)
#define _rrep(i, n) _rrange(i, n, 0)
#... | delete | 71 | 72 | 71 | 71 | 0 | |
p03033 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <utility>
#include <vector>
#define fir first
#define sec second
#define sz(s) (s).size()
#define pb push_back
#define get(n) scanf("%d", &n);
#define gets(s) ... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <utility>
#include <vector>
#define fir first
#define sec second
#define sz(s) (s).size()
#define pb push_back
#define get(n) scanf("%d", &n);
#define gets(s) ... | replace | 221 | 222 | 221 | 222 | 0 | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main() {
int N, Q, i, j;
typedef pair<int, int> P;
cin >> N >> Q;
vector<int> X(N), S(N), T(N), D(Q);
set<pair<int, int>> shugo;
rep(i, N) { cin >> S[i] >> T[i] >> X[i]; }
rep(i, Q) { cin >> D[i]; }
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main() {
int N, Q, i, j;
typedef pair<int, int> P;
cin >> N >> Q;
vector<int> X(N), S(N), T(N), D(Q);
set<pair<int, int>> shugo;
rep(i, N) { cin >> S[i] >> T[i] >> X[i]; }
rep(i, Q) { cin >> D[i]; }
... | replace | 22 | 23 | 22 | 23 | -11 | |
p03033 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
#define ll long long
#define ... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
#define ll long long
#define ... | replace | 44 | 45 | 44 | 45 | -11 | |
p03033 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef int ll;
typedef double db;
typedef pair<ll, ll> P;
#define pb push_back
#define ft first
#define sd second
#define mp make_pair
#define fr(i, n) for (int i = 0; i < (n); i++)
#define Fr(i, n) for (int i = 0; i++ < (n);)
#define ifr(i, n) for (int i = (n)-1; i >= 0; ... | #include <bits/stdc++.h>
using namespace std;
typedef int ll;
typedef double db;
typedef pair<ll, ll> P;
#define pb push_back
#define ft first
#define sd second
#define mp make_pair
#define fr(i, n) for (int i = 0; i < (n); i++)
#define Fr(i, n) for (int i = 0; i++ < (n);)
#define ifr(i, n) for (int i = (n)-1; i >= 0; ... | insert | 53 | 53 | 53 | 55 | TLE | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#ifdef DEBUG
#include "../include/debug.hpp"
#else
#define debug(...) 42
#endif
class LazySegTree {
public:
int n;
vector<int> nodes;
LazySegTree(int _n) {
n = 1 << (int)ceil(log2(_n));
nodes.resize(n * 2 - 1, INT_MAX);
}
void update(int l, int r, int ... | #include <bits/stdc++.h>
using namespace std;
#ifdef DEBUG
#include "../include/debug.hpp"
#else
#define debug(...) 42
#endif
class LazySegTree {
public:
int n;
vector<int> nodes;
LazySegTree(int _n) {
n = 1 << (int)ceil(log2(_n));
nodes.resize(n * 2 - 1, INT_MAX);
}
void update(int l, int r, int ... | replace | 77 | 78 | 77 | 78 | 0 | |
p03033 | C++ | Runtime Error |
#include <algorithm>
#include <array>
#include <bitset>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
#include <vector>
long long mod = 1e9 + 7;
class Mint {
pub... |
#include <algorithm>
#include <array>
#include <bitset>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
#include <vector>
long long mod = 1e9 + 7;
class Mint {
pub... | replace | 199 | 200 | 199 | 200 | 0 | |
p03033 | C++ | Runtime Error | #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;
#defin... | #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;
#defin... | insert | 35 | 35 | 35 | 36 | 0 | |
p03033 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define L (nod << 1)
#define R (L | 1)
#define smax(X, Y) ((X) > (Y) ? (X) : (Y))
#define smin(X, Y) ((X) < (Y) ? (X) : (Y))
#define N 200005
int n, q, lzy[4 * N], d[N], sol[N];
struct lol {
int t, s, x;
bool operator<(const lol &aux) const { return (x < aux.x); }
} ... | #include <bits/stdc++.h>
using namespace std;
#define L (nod << 1)
#define R (L | 1)
#define smax(X, Y) ((X) > (Y) ? (X) : (Y))
#define smin(X, Y) ((X) < (Y) ? (X) : (Y))
#define N 200005
int n, q, lzy[4 * N], d[N], sol[N];
struct lol {
int t, s, x;
bool operator<(const lol &aux) const { return (x < aux.x); }
} ... | replace | 69 | 73 | 69 | 71 | TLE | |
p03033 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
const double PI = acos(-1);
const double EPS = 1e-15;
long long INF = (long long)1E17;
#define i_7 (long long)(1E9 + 7)
long mod(long a) {
long long c = a % i_7;
if (c >= 0)
return c;
return ... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
const double PI = acos(-1);
const double EPS = 1e-15;
long long INF = (long long)1E17;
#define i_7 (long long)(1E9 + 7)
long mod(long a) {
long long c = a % i_7;
if (c >= 0)
return c;
return ... | replace | 121 | 122 | 121 | 122 | TLE | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// マクロ
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)
#define FORD(i, a, b) for (ll i = (a); i >= (b); i--)
#define ALL(x) (x).begin(), (x... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// マクロ
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)
#define FORD(i, a, b) for (ll i = (a); i >= (b); i--)
#define ALL(x) (x).begin(), (x... | replace | 54 | 55 | 54 | 55 | 0 | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 200005;
vector<pair<int, pair<int, int>>> a;
multiset<int> s;
int main() {
int n, q;
scanf("%d%d", &n, &q);
for (int i = 1; i <= n; i++) {
int s, t, x;
scanf("%d%d%d", &s, &t, &x);
a.push_back(make_pair(s - x, make_pair(1, x)));
a.push_ba... | #include <bits/stdc++.h>
using namespace std;
const int N = 200005;
vector<pair<int, pair<int, int>>> a;
multiset<int> s;
int main() {
int n, q;
scanf("%d%d", &n, &q);
for (int i = 1; i <= n; i++) {
int s, t, x;
scanf("%d%d%d", &s, &t, &x);
a.push_back(make_pair(s - x, make_pair(1, x)));
a.push_ba... | replace | 19 | 20 | 19 | 20 | 0 | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll MOD = 1e9 + 7;
using P = pair<int, int>;
int main() {
int n, q;
cin >> n >> q;
multimap<int, P> m;
for (int i = 0; i < n; i++) {
int s, t, x;
cin >> s >> t >> x;
m.insert(make_pair(x, P(s, t)));
}
map<int, int> ans; // <time,... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll MOD = 1e9 + 7;
using P = pair<int, int>;
int main() {
int n, q;
cin >> n >> q;
multimap<int, P> m;
for (int i = 0; i < n; i++) {
int s, t, x;
cin >> s >> t >> x;
m.insert(make_pair(x, P(s, t)));
}
map<int, int> ans; // <time,... | replace | 29 | 30 | 29 | 30 | 0 | |
p03033 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int main() {
ll n, q;
cin >> n >> q;
vector<pair<ll, ll>> v;
rep(i, n) {
ll s, t, x;
cin >> s >> t >> x;
s -= x;
if (s < 0)
s = 0;
t -= x;
if (t < 0)
t = 0;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int main() {
ll n, q;
cin >> n >> q;
vector<pair<ll, ll>> v;
rep(i, n) {
ll s, t, x;
cin >> s >> t >> x;
s -= x;
if (s < 0)
s = 0;
t -= x;
if (t < 0)
t = 0;... | replace | 18 | 20 | 18 | 22 | TLE | |
p03033 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
typedef long long ll;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> PP;
using vi = vector<ll>;
using vvi = vector<vector<ll>>;
int main() {
int n, q;
cin >> n >> q;
vector<PP> p(n);
rep(i, n) {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
typedef long long ll;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> PP;
using vi = vector<ll>;
using vvi = vector<vector<ll>>;
int main() {
int n, q;
cin >> n >> q;
vector<PP> p(n);
rep(i, n) {
... | replace | 31 | 32 | 31 | 32 | TLE | |
p03033 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define FOR(... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define FOR(... | replace | 45 | 46 | 45 | 46 | -11 | |
p03033 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
// BEGIN CUT HERE
struct RUP {
int n;
vector<int> dat, laz;
const int def = INT_MAX;
RUP() {}
RUP(int n_) { init(n_); }
void init(int n_) {
n = 1;
while (n < n_)
n *= 2;
dat.clear();
dat.resize(2 * n - 1, def);
laz... | #include <bits/stdc++.h>
using namespace std;
#define int long long
// BEGIN CUT HERE
struct RUP {
int n;
vector<int> dat, laz;
const int def = INT_MAX;
RUP() {}
RUP(int n_) { init(n_); }
void init(int n_) {
n = 1;
while (n < n_)
n *= 2;
dat.clear();
dat.resize(2 * n - 1, def);
laz... | replace | 70 | 71 | 70 | 74 | TLE | |
p03033 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <set>
#include <tuple>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, q, c = (int)1e9 + 7;
cin >> n >> q;
tuple<int, int> a[2 * n + q];
rep(i, n) {
int s, t, x;
cin >> s >> t >> x;
a[2 * i] = tuple<in... | #include <algorithm>
#include <iostream>
#include <set>
#include <tuple>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, q, c = (int)1e9 + 7;
cin >> n >> q;
tuple<int, int> a[2 * n + q];
rep(i, n) {
int s, t, x;
cin >> s >> t >> x;
a[2 * i] = tuple<in... | replace | 32 | 33 | 32 | 33 | TLE | |
p03033 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main() {
int N, Q;
cin >> N >> Q;
int Si, Ti, Xi, Di;
vector<array<int, 3>> stx(N);
for (int i = 0; i < N; i++) {
cin >> Si >> Ti >> Xi;
auto l = Si - Xi;
auto r = Ti - Xi;
if (l < 0)
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main() {
int N, Q;
cin >> N >> Q;
int Si, Ti, Xi, Di;
vector<array<int, 3>> stx(N);
for (int i = 0; i < N; i++) {
cin >> Si >> Ti >> Xi;
auto l = Si - Xi;
auto r = Ti - Xi;
if (l < 0)
... | replace | 29 | 31 | 29 | 31 | TLE | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template <class T> using pvector = vector<pair<T, T>>;
template <class T>
using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;
constexpr const ll dx[4] = {1, 0, -1, 0};
con... | #include <bits/stdc++.h>
using namespace std;
// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template <class T> using pvector = vector<pair<T, T>>;
template <class T>
using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;
constexpr const ll dx[4] = {1, 0, -1, 0};
con... | replace | 181 | 182 | 181 | 182 | 0 | |
p03033 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (l... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (l... | replace | 75 | 76 | 75 | 76 | TLE | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int INF = 1e9;
int main() {
int n, q;
cin >> n >> q;
vector<pair<int, pair<int, int>>> v(n);
for (int i = 0; i < n; i++) {
int s, t, x;
cin >> s >> t >> x;
v[i] = {x, {s, t}};
}
sort(v.begin(), v.... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int INF = 1e9;
int main() {
int n, q;
cin >> n >> q;
vector<pair<int, pair<int, int>>> v(n);
for (int i = 0; i < n; i++) {
int s, t, x;
cin >> s >> t >> x;
v[i] = {x, {s, t}};
}
sort(v.begin(), v.... | insert | 39 | 39 | 39 | 41 | 0 | |
p03033 | C++ | Runtime Error | #include <algorithm>
#include <assert.h>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define LL long long
int n, q;
int S[200005], T[200005], X[200005];
vector<int> id;
vector<int> comp;
int st[200005 * 4], lazy[200005 ... | #include <algorithm>
#include <assert.h>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define LL long long
int n, q;
int S[200005], T[200005], X[200005];
vector<int> id;
vector<int> comp;
int st[1000005 * 4], lazy[100000... | replace | 16 | 17 | 16 | 17 | 0 | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i <= (n); i++)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
using ll = long long;
using Grid = vector<vector<int>>;
using vi = vector<int>;
int main() {
i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i <= (n); i++)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
using ll = long long;
using Grid = vector<vector<int>>;
using vi = vector<int>;
int main() {
i... | replace | 25 | 26 | 25 | 26 | -6 | double free or corruption (out)
|
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
// debug
#define dump(x) cerr << #x << " = " << (x) <<... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
// debug
#define dump(x) cerr << #x << " = " << (x) <<... | insert | 76 | 76 | 76 | 78 | 0 | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
priority_queue<P, vector<P>, greater<P>> p;
priority_queue<P, vector<P>, greater<P>> pq;
int main() {
int n, q;
int t[100009], x[100009];
cin >> n >> q;
for (int i = 0; i < n; i++) {
int s;
cin >> s >> t[i] >> x[i];
t[i] -= x[i... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
priority_queue<P, vector<P>, greater<P>> p;
priority_queue<P, vector<P>, greater<P>> pq;
int main() {
int n, q;
int t[200009], x[200009];
cin >> n >> q;
for (int i = 0; i < n; i++) {
int s;
cin >> s >> t[i] >> x[i];
t[i] -= x[i... | replace | 8 | 9 | 8 | 9 | 0 | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
template <typename T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
// std::vector Declaration
t... | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
template <typename T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
// std::vector Declaration
t... | insert | 125 | 125 | 125 | 127 | 0 | |
p03033 | C++ | Time Limit Exceeded | #include <ext/pb_ds/assoc_container.hpp>
#include <iostream>
#include <vector>
#define int long long
#include <map>
#include <set>
#define x first
#define y second
#define all(p) p.begin(), p.end()
#define pb push_back
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less_equal<int>, rb_... | #include <ext/pb_ds/assoc_container.hpp>
#include <iostream>
#include <vector>
#define int long long
#include <map>
#include <set>
#define x first
#define y second
#define all(p) p.begin(), p.end()
#define pb push_back
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less_equal<int>, rb_... | insert | 99 | 99 | 99 | 104 | TLE | |
p03033 | C++ | Runtime Error | #include <algorithm> //sort,二分探索,など
#include <bitset> //固定長bit集合
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#include <functional> //sortのgreater
#include <iomanip> //setprecision(浮動小数点の出力の誤差)
#include <iostream> //入出力
#include <iter... | #include <algorithm> //sort,二分探索,など
#include <bitset> //固定長bit集合
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#include <functional> //sortのgreater
#include <iomanip> //setprecision(浮動小数点の出力の誤差)
#include <iostream> //入出力
#include <iter... | replace | 76 | 77 | 76 | 77 | 0 | |
p03033 | Python | Time Limit Exceeded | from heapq import heappush, heappop
n, q = map(int, input().split())
STX = [list(map(int, input().split())) for _ in range(n)]
task = []
for s, t, x in STX:
task.append((t - x, 0, x))
task.append((s - x, 1, x))
for i in range(q):
d = int(input())
task.append((d, 2, i))
task.sort()
kouho = set()
kouho_... | from heapq import heappush, heappop
import sys
input = sys.stdin.buffer.readline
n, q = map(int, input().split())
STX = [list(map(int, input().split())) for _ in range(n)]
task = []
for s, t, x in STX:
task.append((t - x, 0, x))
task.append((s - x, 1, x))
for i in range(q):
d = int(input())
task.appe... | insert | 1 | 1 | 1 | 5 | TLE | |
p03033 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#includ... | replace | 66 | 67 | 66 | 67 | 0 | |
p03033 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
#define SIZE 200005
struct LOC {
bool operator<(const struct LOC &arg) const { return X < arg.X;... | #include <bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
#define SIZE 200005
struct LOC {
bool operator<(const struct LOC &arg) const { return X < arg.X;... | insert | 53 | 53 | 53 | 57 | TLE | |
p03033 | C++ | Runtime Error | //{{{
#include <algorithm>
#include <cmath>
#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 = long long;
enu... | //{{{
#include <algorithm>
#include <cmath>
#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 = long long;
enu... | replace | 74 | 75 | 74 | 75 | 0 | |
p03033 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <climits>
#include <complex>
#include <cstring>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
... | #include <algorithm>
#include <bitset>
#include <climits>
#include <complex>
#include <cstring>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
... | replace | 130 | 132 | 130 | 132 | TLE | |
p03033 | C++ | Runtime Error | // Author: Shusuke Ueda
// AtCoder Beginner Contest 128 - Problem E
#include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <vector>
struct Con {
int s, t, x;
};
int main() {
int n, q;
std::cin >> n >> q;
std::vector<Con> c(n);
for (auto &e : c) {
int s, t, x;
std::cin >> s ... | // Author: Shusuke Ueda
// AtCoder Beginner Contest 128 - Problem E
#include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <vector>
struct Con {
int s, t, x;
};
int main() {
int n, q;
std::cin >> n >> q;
std::vector<Con> c(n);
for (auto &e : c) {
int s, t, x;
std::cin >> s ... | replace | 38 | 39 | 38 | 39 | 0 | |
p03033 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll(i) = 0; (i) < (ll)(n); (i)++)
#define frep(i, m, n) for (ll(i) = (m); (i) <= (ll)(n); (i)++)
#define rrep(i, n) for (ll(i) = (n)-1; (i) > -1; (i)--)
#define frrep(i, m, n) for (ll(i) = (n); (i) > (ll)(m); (i)--)
#define ALL(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll(i) = 0; (i) < (ll)(n); (i)++)
#define frep(i, m, n) for (ll(i) = (m); (i) <= (ll)(n); (i)++)
#define rrep(i, n) for (ll(i) = (n)-1; (i) > -1; (i)--)
#define frrep(i, m, n) for (ll(i) = (n); (i) > (ll)(m); (i)--)
#define ALL(... | replace | 76 | 80 | 76 | 79 | TLE | |
p03033 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0... | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0... | replace | 72 | 73 | 72 | 73 | 0 | |
p03033 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define ll int64_t
#define Rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
int main() {
cin.tie(0);
ios::s... | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define ll int64_t
#define Rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
int main() {
cin.tie(0);
ios::s... | replace | 42 | 43 | 42 | 43 | 0 | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> P;
typedef pair<int, P> PPI;
typedef pair<LL, LL> PL;
typedef long long LL;
// LLONG_MIN, INT_MIN
#define xx first
#define yy second
int n, q;
vector<vector<int>> vp;
// int seg[810000];
// void build(int id=1, int l=0, int r = ... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> P;
typedef pair<int, P> PPI;
typedef pair<LL, LL> PL;
typedef long long LL;
// LLONG_MIN, INT_MIN
#define xx first
#define yy second
int n, q;
vector<vector<int>> vp;
// int seg[810000];
// void build(int id=1, int l=0, int r = ... | replace | 47 | 48 | 47 | 48 | 0 | |
p03033 | C++ | Time Limit Exceeded | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#include <immintrin.h>
#include <iostream>
#include <random>
#include <unordered_map>
#include <unordered_set>
#ifdef _MSC_VER
#include <ppl.h>
#endif
using namespace std;
// 呪文
#define DUMPOUT cerr
#define dump(...) ... | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#include <immintrin.h>
#include <iostream>
#include <random>
#include <unordered_map>
#include <unordered_set>
#ifdef _MSC_VER
#include <ppl.h>
#endif
using namespace std;
// 呪文
#define DUMPOUT cerr
#define dump(...) ... | replace | 189 | 192 | 189 | 192 | TLE | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Vi = vector<int>;
using Vl = vector<ll>;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
constexpr int I_INF = (1 << 30);
constexpr ll L_INF = (1ll << 62);
//==================================
inline int get_iter(const Vl &vec, ll x) {... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Vi = vector<int>;
using Vl = vector<ll>;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
constexpr int I_INF = (1 << 30);
constexpr ll L_INF = (1ll << 62);
//==================================
inline int get_iter(const Vl &vec, ll x) {... | delete | 22 | 25 | 22 | 22 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define zero_pad(num) setfill('0') << std::right << setw(num)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
int n, q;
cin >> n >> q;
vector<P> e;
rep(i, n) {
int s, t, x;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define zero_pad(num) setfill('0') << std::right << setw(num)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
int n, q;
cin >> n >> q;
vector<P> e;
rep(i, n) {
int s, t, x;
... | replace | 26 | 27 | 26 | 27 | 0 | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define pii_ pair<int, int>
#define mp_ make_pair
#define pb push_back
#define fi first
#define se second
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define show1(a) cout << #a << " = " << a << endl
#define sh... | #include <bits/stdc++.h>
#define ll long long
#define pii_ pair<int, int>
#define mp_ make_pair
#define pb push_back
#define fi first
#define se second
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define show1(a) cout << #a << " = " << a << endl
#define sh... | insert | 76 | 76 | 76 | 78 | 0 | |
p03033 | C++ | Time Limit Exceeded | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdint>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <memory>
#include <numeric>
#inclu... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdint>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <memory>
#include <numeric>
#inclu... | replace | 109 | 110 | 109 | 110 | TLE | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, n) for (int i = n - 1; i >= 0; --i)
#define fi first
#define se second
#define sz(x) (int)(x).size()
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, n) for (int i = n - 1; i >= 0; --i)
#define fi first
#define se second
#define sz(x) (int)(x).size()
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int... | replace | 64 | 65 | 64 | 67 | 0 | |
p03033 | C++ | Runtime Error | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vecto... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vecto... | replace | 32 | 33 | 32 | 43 | 0 | |
p03033 | Python | Runtime Error | # https://atcoder.jp/contests/abc128/submissions/8312583
# 写経
def solve():
from heapq import heappush, heappop
from collections import defaultdict
from operator import itemgetter
import sys
input = sys.stdin.readline
inf = 1 << 31
n, q = map(int, input().split())
S = [0] * n
T ... | # https://atcoder.jp/contests/abc128/submissions/8312583
# 写経
def solve():
from heapq import heappush, heappop
from collections import defaultdict
from operator import itemgetter
import sys
input = sys.stdin.readline
inf = 1 << 31
n, q = map(int, input().split())
S = [0] * n
T ... | replace | 22 | 27 | 22 | 29 | 0 | |
p03033 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
#define maxn 200005
#define inf 1e9
#define eps 1e-10
using namespace std;
inline int read() {
int x = 0, w = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
w = -1;
c = getchar();
}
while (c <= '9' && c >= '0') {
x = (x << 1) ... | #include <bits/stdc++.h>
#define ll long long
#define maxn 200005
#define inf 1e9
#define eps 1e-10
using namespace std;
inline int read() {
int x = 0, w = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
w = -1;
c = getchar();
}
while (c <= '9' && c >= '0') {
x = (x << 1) ... | delete | 37 | 38 | 37 | 37 | TLE | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define N 200010
#define pii pair<int, int>
#define fi first
#define se second
int n, q;
struct node {
int s, t, x;
void scan() {
scanf("%d%d%d", &s, &t, &x);
s -= x;
t -= x;
}
bool operator<(const node &other) const { return x < other.x; }
} qrr[N];
se... | #include <bits/stdc++.h>
using namespace std;
#define N 200010
#define pii pair<int, int>
#define fi first
#define se second
int n, q;
struct node {
int s, t, x;
void scan() {
scanf("%d%d%d", &s, &t, &x);
s -= x;
t -= x;
}
bool operator<(const node &other) const { return x < other.x; }
} qrr[N];
se... | insert | 38 | 38 | 38 | 41 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.