Submission #1043735

#TimeUsernameProblemLanguageResultExecution timeMemory
1043735pravcoderWall (IOI14_wall)C++14
8 / 100
3049 ms13648 KiB
#include "wall.h"
#include <vector>
#include <cmath>
#include <iostream>
#include <cstdio>
#include <algorithm>

using namespace std;

typedef vector<int> vi;

#define rep(i, n) for (int i=0; i<n; i++)
#define pb push_back


/*

plan:

i dont know

ya

*/

void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[]){

	vi h(n, 0);

	rep(i, k) {
		for (int j = left[i]; j <= right[i]; j++) {
			if (op[i] == 1) {
				h[j] = max(h[j], height[i]);
			}
			else {
				h[j] = min(h[j], height[i]);
			}
		}
	}

	rep(i, n) {
		finalHeight[i] = h[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...