제출 #785278

#제출 시각아이디문제언어결과실행 시간메모리
785278ono_de206송신탑 (IOI22_towers)C++17
0 / 100
517 ms1328 KiB
#include "towers.h" #include<bits/stdc++.h> using namespace std; #define in insert #define all(x) x.begin(),x.end() #define pb push_back #define eb emplace_back #define ff first #define ss second //#define int long long typedef long long ll; typedef vector<int> vi; typedef set<int> si; typedef multiset<int> msi; typedef pair<int, int> pii; typedef vector<pii> vpii; const int mxn = 1e5 + 10; int h[mxn], n, pos; void init(int _n, vector<int> H) { n = _n; for(int i = 1; i <= n; i++) { h[i] = H[i - 1]; } for(int i = 2; i < n; i++) { if(h[i] > max(h[i - 1], h[i + 1])) pos = i; } } int max_towers(int L, int R, int D) { L++; R++; return (L < pos && R > pos && max(h[L], h[R]) <= h[pos] - D ? 1 : 0); }
#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...