Submission #1264030

#TimeUsernameProblemLanguageResultExecution timeMemory
1264030aren_danceWall (IOI14_wall)C++20
8 / 100
3095 ms8520 KiB
#include "wall.h"
#include <bits/stdc++.h>
using namespace std;

void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[]){
    vector<int> a(n,0);
    for(int i=0;i<k;++i){
        if(op[i]==2){
            for(int j=left[i];j<=right[i];++j){
                a[j]=min(a[j],height[i]);
            }
        }
        else{
            for(int j=left[i];j<=right[i];++j){
                a[j]=max(a[j],height[i]);
            }
        }
    }
    for(int i=0;i<n;++i){
        finalHeight[i]=a[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...