# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
312632 | giorgikob | Interval Collection (CCO20_day2problem2) | C++14 | 4626 ms | 290896 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>
#define ll long long
#define ff first
#define ss second
#define pb push_back
using namespace std;
const int N = 1e6+5;
struct bla{
bla *left = NULL, *right = NULL;
int answer = 1e9;
int l = -1e9;
int r = 1e9;
};
multiset<int>b[N],e[N],L,R;
inline void upd(bla* &node,int tl,int tr,int pos,bool ok){
if(tl == tr){
if(!ok){
if(e[tl].size()){
node->l = *e[tl].rbegin();
} else {
node->l = -1e9;
}
} else {
# | 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... |