제출 #944823

#제출 시각아이디문제언어결과실행 시간메모리
944823ezzzay벽 (IOI14_wall)C++14
8 / 100
3067 ms18184 KiB
#include "wall.h" #include<bits/stdc++.h> int max(int a, int b){ if(a>b)return a; return b; } int min(int a, int b){ if(a<b)return a; return b; } void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[]){ for(int i=0;i<k;i++){ int c=op[i]; int l=left[i],r=right[i]; int h=height[i]; if(c==1){ for(int j=l;j<=r;j++){ finalHeight[j]=max(finalHeight[j],h); } } else{ for(int j=l;j<=r;j++){ finalHeight[j]=min(finalHeight[j],h); } } } return; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...