Submission #1056039

#TimeUsernameProblemLanguageResultExecution timeMemory
1056039pawned송신탑 (IOI22_towers)C++17
0 / 100
2142 ms1368 KiB
#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops")

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

#define fi first
#define se second
#define pb push_back
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;

#include "towers.h"

int N;
vi H;

void init(int N_g, vi H_g) {
	N = N_g;
	H = H_g;
}

int max_towers(int L, int R, int D) {
	int maxv = 0;
	for (int i = 0; i < N; i++) {
		maxv = max(maxv, H[i]);
	}
	if (H[0] <= maxv - D && H[N - 1] <= maxv - 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...