제출 #223932

#제출 시각아이디문제언어결과실행 시간메모리
223932a_playerWall (IOI14_wall)C++14
8 / 100
3083 ms18656 KiB
#include <bits/stdc++.h> using namespace std; #define fh finalHeight const int nax=2e6+6; const int inf=2e9; int m[nax][2]; void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[]){ for(int i=0;i<n;i++)m[i][0]=inf,m[i][1]=0; for(int i=0;i<k;i++){ if(op[i]==1) for(int j=left[i];j<=right[i];j++)m[j][1]=max(m[j][1],height[i]); else for(int j=left[i];j<=right[i];j++)m[j][1]=min(m[j][1],height[i]),min(m[j][0],height[i]); } for(int i=0;i<n;i++)fh[i]=m[i][1]; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...