Submission #128505

#TimeUsernameProblemLanguageResultExecution timeMemory
128505antimirageWall (IOI14_wall)C++14
8 / 100
3095 ms18168 KiB
#include "wall.h"
//#include "grader.cpp"
#include <bits/stdc++.h>

#define fr first
#define sc second
#define mk make_pair
#define pb push_back
#define all(s) s.begin(), s.end()

using namespace std;

void buildWall(int n, int k, int op[], int left[], int right[], int height[], int a[]) {
	
	for (int i = 0; i < k; i++) {
		if (op[i] == 1) {
			for (int j = left[i]; j <= right[i]; j++) {
				a[j] = max( a[j], height[i] );
			}
		}
		else {
			for (int j = left[i]; j <= right[i]; j++) {
				a[j] = min( a[j], height[i] );
			}
		}
	}
}
/**
10 3
1 3 4 91220
1 5 9 48623
2 3 5 39412
**/
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...