# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
21026 | ainta | Port Facility (JOI17_port_facility) | C++14 | 2783 ms | 156568 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 <cstdio>
#include <algorithm>
#define SZ 2097152
#define pii pair<int,int>
using namespace std;
int n, chk[1010000];
int P[2010000];
pii IT[SZ+SZ][2];
struct point{
int b, e;
}w[1010000];
void Ins(int ck, int a, pii b){
a += SZ;
IT[a][ck] = b;
while(a!=1){
a>>=1;
if(ck) IT[a][ck] = min(IT[a+a][ck], IT[a+a+1][ck]);
else IT[a][ck] = max(IT[a+a][ck], IT[a+a+1][ck]);
}
}
pii Get(int ck, int b, int e){
b += SZ, e += SZ;
pii r;
if(ck) r = pii(n+n+1,0);
else r = pii(0,0);
while(b<=e){
if(ck) r = min(r, min(IT[b][ck], IT[e][ck]));
else r = max(r, max(IT[b][ck],IT[e][ck]));
b=(b+1)>>1,e=(e-1)>>1;
}
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... |