# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|
971336 | | andro | 벽 (IOI14_wall) | C++14 | | 123 ms | 22132 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>.
using namespace std;
void buildWall(int n, int k, int op[], int left[], int right[],int height[], int finalHeight[]){
for(int i = 0; i < k; i++) {
finalHeight[i] = 0;
}
for(int i = 0 ; i < k; i++){
if(op[i] == 1){
for(int j = left[i] ; j <= right[i] ; j++) finalHeight[j] = max(finalHeight[j], height[i]);
}
else {
for(int j = left[i] ; j <= right[i] ; j++) finalHeight[j] = min(finalHeight[j], height[i]);
}
}
}/*
int main(){
int n,k;
cin>>n>>k;
int op[k];
int l[k];
int r[k];
int x[k];
for(int i=0;i<k;i++)cin>>op[i]>>l[i]>>r[i]>>x[i];
int ans[n];
for(int i=0;i<n;i++)ans[i]=0;
buildWall(n,k,op,l,r,x,ans);
for(int i=0;i<n;i++)cout<<ans[i]<<" ";
}*/
Compilation message (stderr)
wall.cpp:1:25: warning: extra tokens at end of #include directive
1 | #include <bits/stdc++.h>.
| ^
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |