제출 #1290020

#제출 시각아이디문제언어결과실행 시간메모리
1290020MMihalevRadio Towers (IOI22_towers)C++20
4 / 100
276 ms1556 KiB
#include<iostream> #include<algorithm> #include "towers.h" #include <vector> using namespace std; int k=-1; vector<int>h; void init(int N, std::vector<int> H) { h=H; for(int i=1;i<N-1;i++) { if(H[i]>H[i-1] && H[i]>H[i+1])k=i; } } int max_towers(int L, int R, int D) { if(k==-1 or k<=L or k>=R)return 1; if(max(h[L],h[R])+D<=h[k])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...