Submission #337160

#TimeUsernameProblemLanguageResultExecution timeMemory
337160danielcm585Wall (IOI14_wall)C++14
8 / 100
3074 ms8580 KiB
#include "wall.h"

#include <bits/stdc++.h>
using namespace std;

void buildWall(int n, int k, int op[], int l[], int r[], int h[], int ans[]) {
    for (int i = 0; i < k; i++) {
        for (int j = l[i]; j <= r[i]; j++) {
            if (op[i] == 1) ans[j] = max(ans[j],h[i]);
            else ans[j] = min(ans[j],h[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...