제출 #1016609

#제출 시각아이디문제언어결과실행 시간메모리
1016609bozho벽 (IOI14_wall)C++14
0 / 100
67 ms16448 KiB
#include<wall.h> #include<bits/stdc++.h> #define endl '\n' using namespace std; void buildWall(int n, int k, int op[], int l[], int r[], int h[], int fh[]) { for(int i=0;i<n;i++) fh[i]=0; for(int i=0;i<k;i++) { for(int j=l[i];j<=r[i];j++) { if(op[i]==1) fh[i]=max(fh[i],h[i]); else fh[i]=min(fh[i],h[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...