제출 #629959

#제출 시각아이디문제언어결과실행 시간메모리
629959TimDee송신탑 (IOI22_towers)C++17
4 / 100
885 ms1456 KiB
#include "towers.h"
#include <bits/stdc++.h>
using namespace std;

int k=0;
vector<int> a;
int n;

void init(int N, vector<int> h) {
  a=h;
  n=N;
  while (k<n-1 && a[k]<a[k+1]) ++k;
}

int max_towers(int L, int R, int d) {
  if (L>=k || R<=k) return 1;
  if (a[L]>a[k]-d || a[R]>a[k]-d) 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...