# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
892522 | 1075508020060209tc | Interval Collection (CCO20_day2problem2) | C++14 | 714 ms | 87636 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.
#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define X first
#define Y second
int Q;
map<pair<int,int>,int>freqseg;
multiset<int>mstv;
map<int,int>mp;
void add(int l,int r){
if(freqseg.size()==1){
mp[r]=l;
return;
}
auto it=mp.lower_bound(r);
if(it==mp.begin()){
mstv.insert((*it).first-l);
mp[r]=l;
return;
}
if(it==mp.end()){
it=prev(it);
mstv.insert(r-(*it).second);
mp[r]=l;
return;
}
int l1=(*it).second;int l2=(*prev(it)).second;
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... |