# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
267075 | ChrisT | Interval Collection (CCO20_day2problem2) | C++17 | 4700 ms | 218816 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;
struct node
{
int maxl, minr, ans;
};
vector<node> seg;
vector<multiset<int>> lp, rp;
multiset<pair<int, int>> byl, byr;
node combine(node a, node b)
{
node c;
c.maxl=max(a.maxl, b.maxl);
c.minr=min(a.minr, b.minr);
c.ans=min(a.ans, b.ans);
if(b.minr!=0x3f3f3f3f && a.maxl!=-0x3f3f3f3f)
c.ans=min(c.ans, b.minr-a.maxl);
return c;
}
void build(int idx, int begin, int end)
{
if(begin==end)
seg[idx].maxl=-0x3f3f3f3f, seg[idx].minr=0x3f3f3f3f, seg[idx].ans=0x3f3f3f3f;
else
{
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... |