Submission #337097

#TimeUsernameProblemLanguageResultExecution timeMemory
337097blueWall (IOI14_wall)C++11
8 / 100
3097 ms18284 KiB
#include "wall.h"
#include <algorithm>
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 q = 0; q < k; q++)
    {
        if(op[q] == 1)
        {
            for(int i = left[q]; i <= right[q]; i++) finalHeight[i] = max(finalHeight[i], height[q]);
        }
        else
        {
            for(int i = left[q]; i <= right[q]; i++) finalHeight[i] = min(finalHeight[i], height[q]);
        }
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...