Submission #1130626

#TimeUsernameProblemLanguageResultExecution timeMemory
1130626lopkusWall (IOI14_wall)C++20
8 / 100
3095 ms8512 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]);
        }
    }

}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...