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>
#include "wall.h"
using namespace std;
void buildWall(int n, int k, int t[], int l[], int r[], int h[], int a[]){
for(int i=0;i<n;i++)a[i]=0;
for(int i=0;i<k;i++){
for(int j=l[i];j<=r[i];j++){
if(t[i]==1){
a[j]=max(a[j],h[i]);
}else{
a[j]=min(a[j],h[i]);
}
}
}return;
}
# | 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... |