제출 #795578

#제출 시각아이디문제언어결과실행 시간메모리
795578ln_e송신탑 (IOI22_towers)C++17
4 / 100
876 ms1472 KiB
#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho #include "towers.h" using ll=long long; using ld=long double; int const INF=1000000005; ll const LINF=1000000000000000005; ll const mod=1000000007; ld const PI=3.14159265359; ll const MAX_N=3e5+5; ld const EPS=0.00000001; #pragma GCC optimize("O3") #pragma GCC optimize("Ofast") #define f first #define s second #define pb push_back #define mp make_pair #define endl '\n' #define sz(a) (int)a.size() #define CODE_START ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0); using namespace std; int a[100005],pos=0,n; void init(int N, std::vector<int> H) { n=N; for(ll i=0;i<N;i++) { a[i+1]=H[i]; } for(ll i=1;i<=n;i++) { if(a[i]>a[i-1]&&a[i]>a[i+1]){ pos=i; } } return; } int max_towers(int L, int R, int D) { if(pos-1>=R){ return 1; } if(pos-1<=L){ return 1; } if(a[L+1]<=a[pos]-D&&a[R+1]<=a[pos]-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...