제출 #740467

#제출 시각아이디문제언어결과실행 시간메모리
740467alex_2008송신탑 (IOI22_towers)C++17
0 / 100
625 ms1056 KiB
#include "towers.h" #include <iostream> #include <vector> #include <cmath> using namespace std; int ind = -1; vector <int> h; void init(int n, vector<int> a) { for (int i = 0; i < n - 1; ++i) { if (a[i] > a[i+1]) { ind = i; break; } } } int max_towers(int L, int R, int D) { if (R < ind || L > ind) return 1; if (h[ind] >= (max(h[L], h[R]) + 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...