Submission #112663

#TimeUsernameProblemLanguageResultExecution timeMemory
112663sochoWall (IOI14_wall)C++14
8 / 100
3099 ms16248 KiB
#include <bits/stdc++.h>
using namespace std;
#include "wall.h"

void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[]){
    int fin[n];
    memset(fin, 0, sizeof fin);
    for (int i=0; i<k; i++) {
        if (op[i] == 1) {
            // adding
            for (int j=left[i]; j<=right[i]; j++) {
                fin[j] = max(height[i], fin[j]);
            }
        }
        else {
            // removing
            for (int j=left[i]; j<=right[i]; j++) {
                fin[j] = min(height[i], fin[j]);
            }
        }
    }
    for (int i=0; i<n; i++) {
        finalHeight[i] = fin[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...