제출 #307478

#제출 시각아이디문제언어결과실행 시간메모리
307478juggernaut벽 (IOI14_wall)C++14
8 / 100
3078 ms8568 KiB
#include"wall.h"
#include<bits/stdc++.h>
using namespace std;
int ans[100005];
void update(int l,int r,int mn,int mx){
    for(int i=l;i<=r;i++){
        ans[i]=max(mn,ans[i]);
        ans[i]=min(mx,ans[i]);
    }
}
void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[]){
    for(int i=0;i<k;i++){
        if(op[i]==1)update(left[i],right[i],height[i],2e9);
        else update(left[i],right[i],0,height[i]);
    }
    for(int i=0;i<n;i++)finalHeight[i]=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...