| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 344996 | ogibogi2004 | 말 (IOI15_horses) | C++14 | 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 "horses.h"
#include<bits/stdc++.h>
using namespace std;
#define y1 da
#define ll long long
const int MAXN=5e6+6;
const ll MOD=1e9+7;
int x1[MAXN],y1[MAXN];
ll fastpow(ll x,ll p)
{
if(p==0)return 1;
ll t=fastpow(x,p/2);
t*=t;t%=MOD;
if(p%2==1)t*=x;
t%=MOD;
return t;
}
ll inverse(ll x)
{
return fastpow(x,MOD-2);
}
set<int>notones;
int treeX[4*MAXN],treeY[4*MAXN];
void updateY(int idx,int l,int r,int q,int val)
{
if(l>q||r<q)return;
if(l==r)
{
treeY[idx]=val;
return;
}
int mid=(l+r)/2;
if(mid>=q)updateY(idx*2,l,mid,q,val);
else updateY(idx*2+1,mid+1,r,q,val);
treeY[idx]=max(treeY[idx*2],treeY[idx*2+1]);
}
int n;
int queryY(int idx,int l,int r,int ql,int qr)
{
if(l>qr)return 0;
if(r<ql)return 0;
if(l>=ql&&r<=qr)return treeY[idx];
int mid=(l+r)/2;
return max(queryY(idx*2,l,mid,ql,qr),queryY(idx*2+1,mid+1,r,ql,qr));
}
void updateX(int idx,int l,int r,int q,int val)
{
if(l>q||r<q)return;
if(l==r)
{
treeX[idx]=val;
return;
}
int mid=(l+r)/2;
if(mid>=q)updateX(idx*2,l,mid,q,val);
else updateX(idx*2+1,mid+1,r,q,val);
treeX[idx]=((ll)*treeX[idx*2]*treeX[idx*2+1])%MOD;
}
int queryX(int idx,int l,int r,int ql,int qr)
{
if(l>qr)return 1;
if(r<ql)return 1;
if(l>=ql&&r<=qr)return treeX[idx];
int mid=(l+r)/2;
return ((ll)queryX(idx*2,l,mid,ql,qr)*queryX(idx*2+1,mid+1,r,ql,qr))%MOD;
}
ll solve()
{
if(notones.size()==0)
{
return queryY(1,0,n-1,0,n-1);
}
int last=n;
auto it=notones.end();--it;
ll d1=1;
int cnt=0,j;
pair<int,int>ans;
ans={-1,-1};
for(;;--it)
{
++cnt;
int y1=queryY(1,0,n-1,(*it),last-1);
if(ans.first==-1)
{
j=cnt;
ans.first=y1;
ans.second=d1;
}
else if(ans.first*d1<y1*ans.second)
{
ans.first=y1;
ans.second=d1;
j=cnt;
}
if(it==notones.begin())break;
last=(*it);d1*=x1[(*it)];
if(d1>(ll)1e9)break;
}
it=notones.end();--it;
last=n;
for(;;--it)
{
--j;
if(j==0)
{
//cout<<queryX(1,0,n-1,0,(*it))<<" "<<queryY(1,0,n-1,(*it),last-1)<<endl;
return ((ll)queryX(1,0,n-1,0,(*it))*queryY(1,0,n-1,(*it),last-1))%MOD;
}
last=(*it);
}
return 0;
}
int init(int N, int X[], int Y[]) {
n=N;
for(int i=0;i<N;++i)
{
x1[i]=X[i];
y1[i]=Y[i];
if(X[i]>0)
{
notones.insert(i);
}
updateX(1,0,N-1,i,X[i]);
}
for(int i=0;i<N;++i)
{
updateY(1,0,N-1,i,Y[i]);
}
return solve();
}
int updateX(int pos, int val) {
x1[pos]=val;
if(val==1)
{
notones.erase(pos);
}
else notones.insert(pos);
updateX(1,0,n-1,pos,x1[pos]);
return solve();
}
int updateY(int pos, int val) {
y1[pos]=val;
updateY(1,0,n-1,pos,y1[pos]);
return solve();
}