Submission #1043325

#TimeUsernameProblemLanguageResultExecution timeMemory
1043325deeraWall (IOI14_wall)C++14
8 / 100
80 ms14044 KiB
// ioi 2014
// Day 2: Wall
#include <bits/stdc++.h>
#include "wall.h"
using namespace std;

void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[]){
    // subtask 1
    if (n <= 10000 && k <= 5000) {
        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]);
            }
        }
        return;
    }
}

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