# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|
754380 | | A_D | Wall (IOI14_wall) | C++17 | | 193 ms | 13924 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 "wall.h"
#include <bits/stdc++.h>
#define ii pair<int,int>
#define F first
#define S second
using namespace std;
const int N=2e6+100;
int mn[4*N];
int mx[4*N];
ii com(ii a, ii b)
{
if(a.S<b.F){
return {a.S,a.S};
}
if(b.S<a.F){
return {a.F,a.F};
}
if(a.F<=b.F&&b.S<=a.S){
return b;
}
if(b.F<=a.F&&a.S<=b.S){
return a;
}
return make_pair(max(a.F,b.F),min(a.S,b.S));
}
void update(int p,int s,int e,int a,int b,int h,int t,ii v)
{
ii r;
r.F=mn[p];
r.S=mx[p];
v=com(v,r);
mn[p]=v.F;
mx[p]=v.S;
if(a<=s&&e<=b){
if(t==1){
mn[p]=h;
if(h>mx[p]){
mx[p]=h;
}
}
else{
mx[p]=h;
if(h<mn[p]){
mn[p]=h;
}
}
return;
}
if(a>e || b<s){
return;
}
mn[p]=0;
mx[p]=1e5;
int mid=(s+e)/2;
update(p*2,s,mid,a,b,h,t,v);
update(p*2+1,mid+1,e,a,b,h,t,v);
}
int get(int p,int s,int e,int i,ii v)
{
v=com(v,{mn[p],mx[p]});
if(s==e){
return v.F;
}
int mid=(s+e)/2;
if(i<=mid){
return get(p*2,s,mid,i,v);
}
else{
return get(p*2+1,mid+1,e,i,v);
}
}
void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[])
{
for(int i=0;i<4*n;i++){
mn[i]=0;
mx[i]=1e5;
}
for(int i=0;i<k;i++){
update(1,0,n-1,left[i],right[i],height[i],op[i],make_pair(0,1e5));
}
for(int i=0;i<n;i++){
finalHeight[i]=get(1,0,n-1,i,{0,1e5});
}
//cout<<"\n";
}
# | 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... |