제출 #631047

#제출 시각아이디문제언어결과실행 시간메모리
631047rainboy송신탑 (IOI22_towers)C++17
4 / 100
881 ms1432 KiB
#include "towers.h" #include <vector> using namespace std; const int N = 100000; typedef vector<int> vi; int aa[N], i; void init(int n, vi aa_) { for (i = 0; i < n; i++) aa[i] = aa_[i]; i = 0; while (i < n - 1 && aa[i] < aa[i + 1]) i++; } int max_towers(int l, int r, int d) { return l < i && i < r && aa[i] - aa[l] >= d && aa[i] - aa[r] >= d ? 2 : 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...