Submission #966291

#TimeUsernameProblemLanguageResultExecution timeMemory
96629142kangarooRadio Towers (IOI22_towers)C++17
4 / 100
575 ms1604 KiB
#include "towers.h"
#include "bits/stdc++.h"

#include <vector>

std::vector<int> act;

int maxI = 0;

void init(int N, std::vector<int> H) {
	using namespace std;
	act = H;
	maxI = max_element(act.begin(), act.end()) - act.begin();
}

int max_towers(int L, int R, int D) {
    if (maxI < L || maxI > R) return 1;
	if (act[maxI] - act[L] >= D && act[maxI] - act[R] >= D )return 2;
	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...