Submission #1207030

#	Time	Username	Problem	Language	Result	Execution time	Memory
1207030		pera	Horses (IOI15_horses)	C++20	0 / 100	1596 ms	51280 KiB

horses

#include<bits/stdc++.h>
#include "horses.h"
#define LL long long
using namespace std;
const int N_MAX = 5E5 + 1;
const LL mod = 1E9 + 7;
const __int128 oo = 1E9;
int n;
set<int> S;
vector<LL> x(N_MAX) , y(N_MAX);
template<typename T>
struct segment_tree{
   vector<T> st , a;
   T neutral;
   int size;
   function<T(T , T)> join;
   segment_tree(int _size , vector<T> _a , T _neutral , function<T(T , T)> _join){
      join = _join;
      size = _size;
      neutral = _neutral;
      a = _a;
      st = vector<T>(2 * _size , _neutral);
      build();
   }
   segment_tree(int _size , T _neutral , function<T(T , T)> _join){
      join = _join;
      size = _size;
      neutral = _neutral;
      st = vector<T>(2 * _size , _neutral);
   }
   void build(){
      for(int i = 2 * size - 1;i > 0;i --){
         st[i] = (i < size ? join(st[i << 1] , st[i << 1 | 1]) : a[i - size + 1]);
      }
   }
   void point_update(int x , T val){
      --x;
      st[x + size] = join(val , st[x + size]);
      for(x += size;x > 1;x >>= 1){
         st[x >> 1] = join(st[x] , st[x ^ 1]);
      }
   }
   void point_assign(int x , T val){
      --x;
      st[x + size] = val;
      for(x += size;x > 1;x >>= 1){
         st[x >> 1] = join(st[x] , st[x ^ 1]);
      }
   }
   T range_query(int l , int r){
      if(l > r){
         return neutral;
      }
      --l;
      T resL = neutral , resR = neutral;
      for(l += size , r += size;l < r;l >>= 1 , r >>= 1){
         if(l & 1){
            resL = join(resL , st[l++]);
         }
         if(r & 1){
            resR = join(st[--r] , resR);
         }
      }
      return join(resL , resR);
   }
};
LL stf(LL x , LL y){
   return max(x , y);
};
LL sff(LL x , LL y){
   return x * y % mod;
};
segment_tree<LL> st(N_MAX , 0LL , stf);
segment_tree<LL> sf(N_MAX , 1LL , sff);
int calc(){
   if(S.empty()){
      LL mx = 0;
      for(int i = 0;i < n;i ++){
         mx = max(mx , y[i]);
      }
      return mx;
   }
   int j = 0; 
   __int128 prd = 1;
   auto it = --S.end();
   while(true){
      j = *it;
      if(__int128(x[*it]) * prd > oo){
         break;
      }
      if(it == S.begin()){
         j = 0;
         break;
      }
      prd *= __int128(x[*it]);
      --it;
   }
   prd = 1;
   __int128 best = 0;
   S.insert(n);
   for(int i = j;i < n;i = *S.upper_bound(i)){
      prd *= __int128(x[i]);
      int R = *S.upper_bound(i);
      __int128 vy = st.range_query(i + 1 , R);
      __int128 A = __int128(prd) * vy;
      best = max(best , A);
   }
   S.erase(n);
   best %= mod;
   for(int i = 0;i < j;i ++){
      best = x[i] * best % mod;
   }
   best %= mod;
   return (int)best;
}

int init(int N, int X[], int Y[]) {
   n = N;
   for(int i = 0;i < N;i ++){
      x[i] = X[i];
      y[i] = Y[i];
      if(x[i] > 1){
         S.insert(i);
      }
   }
   return calc();
}

int updateX(int pos, int val) {	
   if(x[pos] > 1){
      S.erase(pos);
   }
   x[pos] = val;
   if(x[pos] > 1){
      S.insert(pos);
   }
   sf.point_assign(pos + 1, x[pos]);
	return calc();
}

int updateY(int pos, int val) {
   y[pos] = val;
   st.point_assign(pos + 1 , val);
	return calc();
}

• Subtask 1: 0 / 17
• Subtask 2: 0 / 17
• Subtask 3: 0 / 20
• Subtask 4: 0 / 23
• Subtask 5: 0 / 23