# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
282259 | arnold518 | Interval Collection (CCO20_day2problem2) | C++14 | 3602 ms | 386084 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 1e6;
const ll INF = 1e15;
int Q;
multiset<ll, greater<ll>> L[MAXN+10], LL;
multiset<ll> R[MAXN+10], RR;
struct Node
{
ll maxl, minr, val;
Node() : maxl(-INF), minr(INF), val(INF) {}
};
Node operator + (const Node &p, const Node &q)
{
Node ret;
ret.maxl=max(p.maxl, q.maxl);
ret.minr=min(p.minr, q.minr);
ret.val=min({p.val, q.val, q.minr-p.maxl});
return ret;
}
Node tree[MAXN*4+10];
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |