| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1052961 | modwwe | Horses (IOI15_horses) | 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.
//https://www.instagram.com/_modwwe/
#pragma GCC optimize("Ofast,unroll-loops")
#include<bits/stdc++.h>
#define int long long
#define ll long long
#define down cout<<'\n';
#define debug cout<<" cucuucucuuu",down
#define NHP ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define modwwe int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".ans","w",stdout)
#define pb push_back
#define checktime cerr << (double)clock() / CLOCKS_PER_SEC * 1000 << " ms";
using namespace std;
void phongbeo();
const ll inf=1e18;
const int mod2=1e9+7;
const int mod1=998244353;
struct icd
{
long double a;
int b;
};
struct ib
{
ll a;
ll b;
};
struct ic
{
int a,b,c;
};
struct id
{
int a,b,c,d;
};
struct ie
{
int a,b,c,d,e;
};
int n,m,s1,s2,s4,s3,sf,k,s5,s6,mx,s7,s8,s9,mx2,res,dem2=0,dem=0,s33,dem3,l,r,mid;
int i,s10,s12;
int kk;
int el=29;
set<int> s;
int a[500001];
int b[500001];
struct IT
{ int t[2000001];
void build(int node,int l,int r)
{
if(l==r){t[node]=a[l]; return;}
int mid=l+r>>1;
build(node<<1,l,mid);
build(node<<1|1,mid+1,r);
t[node]=t[node<<1]*t[node<<1|1]%mod2;
}
void upd(int node,int l,int r,int l1)
{
if(l==r){t[node]=a[l]; return;}
int mid=l+r>>1;
if(l1<=mid)upd(node<<1,l,mid,l1);
else upd(node<<1|1,mid+1,r,l1);
t[node]=t[node<<1]*t[node<<1|1]%mod2;
}
int get(int node,int l,int r,int l1,int r1)
{
if(l>r1||r<l1) return 1;
if(l>=l1&&r<=r1) return t[node];
int mid=l+r>>1;
return get(node<<1,l,mid,l1,r1)*get(node<<1|1,mid+1,r,l1,r1)%mod2;
}
}st;
struct IT2{
int t[2000001];
void build(int node,int l,int r)
{
if(l==r){t[node]=b[l]; return;}
int mid=l+r>>1;
build(node<<1,l,mid);
build(node<<1|1,mid+1,r);
t[node]=max(t[node<<1],t[node<<1|1]);
}
void upd(int node,int l,int r,int l1)
{
if(l==r){t[node]=b[l]; return;}
int mid=l+r>>1;
if(l1<=mid)upd(node<<1,l,mid,l1);
else upd(node<<1|1,mid+1,r,l1);
t[node]=max(t[node<<1],t[node<<1|1]);
}
int get(int node,int l,int r,int l1,int r1)
{
if(l>r1||r<l1) return 1;
if(l>=l1&&r<=r1) return t[node];
int mid=l+r>>1;
return max(get(node<<1,l,mid,l1,r1),get(node<<1|1,mid+1,r,l1,r1));
}
}st2;
void setup()
{
for(int i=n;i>=1;--i)
if(a[i]!=1)
s.insert(i);
s.insert(1);
auto x=s.end();
x--;
s2=0;
s5=n;
while(1)
{
s6=st2.get(1,1,n,*x,s5);
if(s6>s2) s3=*x,s2=s6,s8=s6;
s2=s2*a[*x];
s5=*x-1;
if(x==s.begin()) break;
x--;
if(s2>1e9) break;
}
}
void setup2()
{
auto x=s.end();
s.insert(1);
x--;
s2=0;
s5=n;
s3=0;
s8=0;
while(1)
{
s6=st2.get(1,1,n,*x,s5);
if(s6>s2) s3=*x,s2=s6,s8=s6;
s2=s2*a[*x];
s5=*x-1;
if(x==s.begin()) break;
x--;
if(s2>1e9) break;
}
}
int init(int N,int X[],int Y[])
{
n=N;
for(int i=1;i<=n;i++)
a[i]=X[i-1];
for(int i=1;i<=n;i++)
b[i]=Y[i-1];
st.build(1,1,n);
st2.build(1,1,n);
setup();
s3=s8*st.get(1,1,n,1,s3)%mod2;
return s3;
}
int updateX(int pos, int val)
{
l=pos;
r=val;
l++;
b[l]=r;
st2.upd(1,1,n,l);
setup2();
s3=s8*st.get(1,1,n,1,s3)%mod2;
return s3;
}
int updateY(int pos, int val)
{
l=pos;
r=val;
l++;
if(a[l]!=1&&r==1) s.erase(l);
if(a[l]==1&&r!=1) s.insert(l);
a[l]=r;
st.upd(1,1,n,l);
setup2();
s3=s8*st.get(1,1,n,1,s3)%mod2;
return s3;
}