Submission #833701

#TimeUsernameProblemLanguageResultExecution timeMemory
833701TrumlingRadio Towers (IOI22_towers)C++17
0 / 100
4046 ms3136 KiB
#include "towers.h" #include <vector> #include<bits/stdc++.h> using namespace std; #define F first #define S second #define all(x) x.begin(),x.end() typedef long long ll; #define pb push_back #define INF 9999999999999999 ll n; vector<ll>h; void init(int N, vector<int> H) { n=N; for(int i=0;i<N;i++) h.pb(H[i]); } int max_towers(int L, int R, int D) { vector<pair<ll,ll>>v(n); for(int i=L;i<=R;i++) v[i]={1,h[i]}; for(int i=0;i<n;i++) { ll maxi=h[i]; for(int j=i-1;j>=0;j--) { maxi=max(maxi,h[j]); if(maxi-D>=h[j] && maxi-D>=h[i]) { if(v[i].F<v[j].F+1) v[i]={v[j].F+1,max(h[i],v[j].S)}; else if(v[i].F==v[j].F+1) v[i].S=min(v[i].S,max(v[j].S,h[i])); } } } ll maxi=0; for(int i=0;i<n;i++) maxi=max(maxi,v[i].F); return maxi; }
#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...