# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
79490 | Plurm | Port Facility (JOI17_port_facility) | C++11 | 3 ms | 1656 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;
int segT[20005];
int lb[20005];
int rb[20005];
vector<int> cmpsegT[20005];
vector<int> cmpsegTmn[20005];
vector<int> cmpsegTmx[20005];
vector<pair<int,int> > pts;
void build(int c,int l,int r){
lb[c] = l;
rb[c] = r;
if(l == r){
segT[c] = pts[l].first;
cmpsegT[c].push_back(0);
cmpsegT[c].push_back(pts[l].first);
cmpsegTmx[c].push_back(0);
cmpsegTmx[c].push_back(-1);
cmpsegTmn[c].push_back(0);
cmpsegTmn[c].push_back(2);
return;
}
int k = (l + r)/2;
build(2*c,l,k);
build(2*c+1,k+1,r);
segT[c] = min(segT[2*c],segT[2*c+1]);
int ll = 1;
int rr = 1;
cmpsegT[c].push_back(0);
cmpsegTmx[c].push_back(0);
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... |