# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
986283 | alexdd | Interval Collection (CCO20_day2problem2) | C++17 | 2897 ms | 243092 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;
const int INF = 1e8;
const int maxv = 1000010;
struct node
{
int rez;
int tole,tori;
};
node combine(node x, node y)
{
node aux;
aux.rez = min(min(x.rez,y.rez),x.tole+y.tori);
aux.tori = min(y.tori, x.tori);
aux.tole = min(x.tole, y.tole);
return aux;
}
node aint[2100000];
void build(int nod, int st, int dr)
{
aint[nod].rez = aint[nod].tole = aint[nod].tori = INF;
if(st==dr)
return;
int mij=(st+dr)/2;
build(nod*2,st,mij);
build(nod*2+1,mij+1,dr);
}
void upd(int nod, int st, int dr, int poz, int tip, int newv)
{
if(st==dr)
# | 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... |