제출 #1160793

#제출 시각아이디문제언어결과실행 시간메모리
1160793hackstarWall (IOI14_wall)C++17
0 / 100
0 ms328 KiB
#include<bits/stdc++.h> using namespace std; void buildWall(int n,int k,int op[],int left[],int right[],int height[],int finalHeight[]){ int a[n]={0}; for(int i=0;i<k;++i){ int l=left[i]-1,r=right[i]-1; if(op[i]==1){ for(int j=l;j<=r;++j){ a[j]=max(a[j],height[i]); } } else if(op[i]==2){ for(int j=l;j<=r;++j){ a[j]=min(a[j],height[i]); } } } for(int i=0;i<n;++i){ finalHeight[i]=a[i]; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...