제출 #882276

#제출 시각아이디문제언어결과실행 시간메모리
882276andro벽 (IOI14_wall)C++14
8 / 100
3054 ms18272 KiB
#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<n;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]<<" ";
}*/
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...