제출 #1026378

#제출 시각아이디문제언어결과실행 시간메모리
1026378Mardonbekhazratov송신탑 (IOI22_towers)C++17
4 / 100
698 ms1600 KiB
#include "towers.h" #include <vector> using namespace std; int n,k; vector<int>h; void init(int N, std::vector<int> H) { n=N; h=H; k=0; for(int i=1;i<n;i++){ if(h[i]>h[i-1]) k=i; } } int max_towers(int L, int R, int D) { if(L<k && R>k && h[k]-D>=h[L] && h[k]-D>=h[R]) 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...