제출 #711534

#제출 시각아이디문제언어결과실행 시간메모리
711534t6twotwo송신탑 (IOI22_towers)C++17
4 / 100
915 ms1480 KiB
#include "towers.h" #include <bits/stdc++.h> using namespace std; using ll = long long; int N, X; vector<int> H; void init(int _N, vector<int> _H) { N = _N; H = _H; X = max_element(H.begin(), H.end()) - H.begin(); } int max_towers(int L, int R, int D) { if (L < X && X < R && max(H[L], H[R]) <= H[X] - D) { return 2; } else { 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...