제출 #739815

#제출 시각아이디문제언어결과실행 시간메모리
739815Nonoze송신탑 (IOI22_towers)C++17
4 / 100
888 ms1480 KiB
#include "towers.h"

#include <bits/stdc++.h>
using namespace std;

int k=INT_MAX, n;
vector<int> h;

void init(int tempn, vector<int> temph) {
	n=tempn;
	h=temph;
	for (int i = 1; i < n; ++i)
	{
		if (temph[i]>temph[i+1])
		{
			k=i;
			return;
		}
	}
	return;
}

int max_towers(int L, int R, int D) {
	if (k<L || k>R || h[k]-D<max(h[L], h[R])) return 1;
	return 2;
}
#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...