# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1015564 | nam6 | Radio Towers (IOI22_towers) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "towers.h"
#include<bits/stdc++.h>
using namespace std;
int sommet;
vector<int> altitudes;
vector< pair<int, int> > intervalle;
set<int> choisis;
const int DECA = 1<<22;
arbre[2*DECA];
void modif(int pos, int val){
pos+=DECA;
arbre[pos] = val;
while(pos > 1){
pos/=2;
arbre[pos] = max(arbre[2*pos], arbre[2*pos+1]);
}
}
int calcMax(int deb, int fin){
if(deb==fin)
return arbre[fin];
if(deb%2==1)
return max(arbre[deb], calcMax(deb+1, fin));
if(fin%2==0)
return max(calcMax(deb, fin-1), fin);
return calcMax(deb/2, fin/2);
}
void init(int N, vector<int> H) {
altitudes = H;
}
int max_towers(int L, int R, int D) {
for(int pos=L; pos<=R; pos++){
intervalle.push_back({altitudes[pos],pos});
}
sort(intervalle.begin(), intervalle.end());
for(int i=0; i<intervalle.size(); i++){
auto igauche = choisis.lower_bound(intervalle[i].second); *
bool estOk = false;
if(igauche != choisis.begin()){
igauche--;
int gauche = *igauche;
int maxiGauche = calcMax(gauche + MAXI, intervalle[i].second+MAXI);
}
int droite= *choisis.upper_bound(intervalle[i].second);
int maxiDroite = calcMax(intervalle[i].second+MAXI, droite+MAXI);
if(maxiGauche - max(gauche, intervalle[i].second) >= D && maxiDroite- max(droite, intervalle[i].second) >= D){
choisis.insert(intervalle[i].second);
}
}
return 0;
}