Submission #1037506

#TimeUsernameProblemLanguageResultExecution timeMemory
1037506HappyCapybaraRadio Towers (IOI22_towers)C++17
4 / 100
629 ms1368 KiB
#include "towers.h"
#include<bits/stdc++.h>
using namespace std;

int k;
vector<int> h;

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

int max_towers(int L, int R, int D){
  if (L < k && k < R && max(h[L], h[R]) <= h[k]-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...