Submission #1239040

#	Time	Username	Problem	Language	Result	Execution time	Memory
1239040		AlperenT_	Radio Towers (IOI22_towers)	C++20	4 / 100	324 ms	7016 KiB

towers

#include "towers.h"

#include <vector>
#include <bits/stdc++.h> 
#pragma GCC optimize("O3,unroll-loops") 
#pragma GCC target("avx2") 
#define pb push_back
#define F first
#define pii pair<int,int> 
#define all(a) a.begin(),a.end()
#define S second 
#define sz(a) (int)a.size()
#define rep(i , a , b) for(int i = (a) ; i <= (b) ; i++)
#define per(i , a , b) for(int i = (a) ; i >= (b) ; i--)
#define ld double
#define ll long long 
using namespace std ;
const int maxn = 1e6 + 10 , inf = 1e9+ 10 , mod = 998244353;
int n  ;
vector <int> h  ; 

struct segtree{
  int mn[4*maxn] , id[4*maxn] ;
  vector <int> a ;  
  void bui(int p = 1,  int l = 0 , int r= n){
    int mid = (l+r)/2 ,pl =p <<1,pr=p<<1|1; 
    if(l==r){
      mn[p] = a[l] ;
      id[p] = l ;
      return; 
    }
    bui(pl,l,mid);
    bui(pr,mid+1,r) ;
    mn[p] = min(mn[pl] , mn[pr]) ;
    id[p] = id[pl] ;
    if(mn[p] == mn[pr])id[p] = id[pr] ;
  }
  pii que(int le ,int ri , int p =1 , int l = 0 , int r= n){
    int mid = (l+r)/2 ,pl =p <<1,pr=p<<1|1; 
    if(le > r || l > ri)return {inf , 0 };
    if(le <= l && r <= ri)return {mn[p] , id[p]} ;
    pii a= que(le,ri,pl,l,mid) ;
    pii b = que(le,ri,pr,mid+1,r);
    pii c ;
    c.F = min(a.F ,b.F); 
    c.S = a.S ;
    if(c.F == b.F)c.S = b.S ;
    return c;
  }
};
segtree mn , mx ;
void init(int N, std::vector<int> H) {
  n = N ; 
  h.pb(0);
  rep(i , 0 , n-1)h.pb(H[i]) ; 
  mn.a = h;
  vector <int> h2 ;
  rep(i , 0 ,n){
    h2.pb(-h[i]) ;
  }
  mx.a = h2 ;
  mn.bui();
  mx.bui() ;
}

int solve(int l , int r ,int d){
  int m =  mx.que(l,r).S ;
  if(mn.que(l,m-1).F + d > h[m] && mn.que(m+1,r).F + d > h[m])return 1 ;
  int sm =0 ;
  if(mn.que(l,m-1).F+ d <= h[m])sm += solve(l,m-1,d);
  if(mn.que(m+1,r).F+ d <= h[m])sm += solve(m+1,r,d); 
  return sm ; 
}

int max_towers(int L, int R, int D) {
  L++;
  R++;
  if(-mx.que(L ,R).F >= h[L]+D && -mx.que(L,R).F >= h[R]+D)return 2;
  return 1; 
  return solve(L,R,D);
}

• Subtask 1: 4 / 4
• Subtask 2: 0 / 11
• Subtask 3: 0 / 12
• Subtask 4: 0 / 14
• Subtask 5: 0 / 17
• Subtask 6: 0 / 19
• Subtask 7: 0 / 23