Submission #1280498

#TimeUsernameProblemLanguageResultExecution timeMemory
1280498nicolo_010Radio Towers (IOI22_towers)C++20
4 / 100
285 ms1556 KiB
#include <bits/stdc++.h>
#include "towers.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;

vector<int> h;
int k;

void init(int N, vector<int> H) {
	h = H;
	for (int i=0; i<N; i++) {
		int left = (i==0 ? 0 : H[i-1]);
		int right = (i==N-1 ? 0 : H[i+1]);
		if (H[i] > left && H[i] > right) {
			k = i;
			break;
		}
	}
}

int max_towers(int l, int r, int d) {
	if (r <= k) return 1;
	if (l >= k) return 1;
	if (h[k]-d >= h[l] && h[k]-d >= h[r]) {
		return 2;
	}
	else {
		return 1;
	}
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...