Submission #472706

#TimeUsernameProblemLanguageResultExecution timeMemory
472706HaidaraWall (IOI14_wall)C++17
0 / 100
35 ms62848 KiB
#include "wall.h" #include<algorithm> using namespace std; const int maxn=2000001,inf=1e9+7; struct segtree { int mx,mn; segtree():mn(0),mx(inf){} } st[maxn*4]; bool add=0; void pull(int inx) { st[inx*2].mn=max(min(st[inx].mx,st[inx*2].mn),st[inx].mn); st[inx*2].mx=min(max(st[inx*2].mx,st[inx].mn),st[inx].mx); st[inx*2+1].mn=max(min(st[inx*2+1].mn,st[inx].mx),st[inx].mn); st[inx*2+1].mx=min(max(st[inx*2+1].mx,st[inx].mn),st[inx].mx); st[inx].mn=0; st[inx].mx=inf; } void update(int ul,int ur,int val,int l,int r,int inx=1) { if(ul<=l&&r<=ur) { if(add) { st[inx].mn=max(st[inx].mn,val); st[inx].mx=max(st[inx].mn,st[inx].mx); } else { st[inx].mx=min(st[inx].mx,val); st[inx].mn=min(st[inx].mn,st[inx].mx); } if(l!=r) pull(inx); return ; } if(l>ur||ul>r) return ; pull(inx); int mid=l+(r-l)/2; update(ul,ur,val,l,mid,inx*2); update(ul,ur,val,mid+1,r,inx*2+1); } int query(int pos,int l,int r,int inx=1) { if(l==r) return st[inx].mx; int mid=l+(r-l)/2; pull(inx); if(pos<=mid) return query(pos,l,mid,inx*2); return query(pos,mid+1,r,inx*2+1); } void buildWall(int n, int k, int op[], int left[], int right[],int height[], int finalHeight[]) { for(int i=0; i<k; i++) { if(op[i]==1) add=1; else add=0; update(left[i]+1,right[i]+1,height[i],1,n); } for(int i=0; i<n; i++) finalHeight[i]=query(i+1,1,n); }

Compilation message (stderr)

wall.cpp: In constructor 'segtree::segtree()':
wall.cpp:7:12: warning: 'segtree::mn' will be initialized after [-Wreorder]
    7 |     int mx,mn;
      |            ^~
wall.cpp:7:9: warning:   'int segtree::mx' [-Wreorder]
    7 |     int mx,mn;
      |         ^~
wall.cpp:8:5: warning:   when initialized here [-Wreorder]
    8 |     segtree():mn(0),mx(inf){}
      |     ^~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...