# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
40045 | igzi | 말 (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 <bits/stdc++.h>
#include "horses.h"
#define maxN 500005
#define mod 1000000007
using namespace std;
struct segment{
long long a,b;};
segment seg[4*maxN];
vector <long long> x,y;
void build(int n,int l,int d){
if(l==d){
seg[n].a=x[l];
seg[n].b=x[l]*y[l]%mod;
}
else{
int m=(l+d)/2;
build(2*n,l,m);
build(2*n+1,m+1,d);
seg[n].a=(seg[2*n].a*seg[2*n+1].a)%mod;
seg[n].b=(max(seg[2*n].b,seg[2*n+1].b*seg[2*n].a))%mod;
}
}
void updatex(int n,int l,int d,int p,long long v){
if(l==d){
x[l]=v;
seg[n].a=x[l];
seg[n].b=x[l]*y[l]%mod;
}
else{
int m=(l+d)/2;
if(p<=m) updatex(2*n,l,m,p,v);
else updatex(2*n+1,m+1,d,p,v);
seg[n].a=(seg[2*n].a*seg[2*n+1].a)%mod;
seg[n].b=(max(seg[2*n].b,seg[2*n+1].b*seg[2*n].a))%mod;
}
}
void updatey(int n,int l,int d,int p,long long v){
if(l==d){
y[l]=v;
seg[n].a=x[l];
seg[n].b=x[l]*y[l]%mod;
}
else{
int m=(l+d)/2;
if(p<=m) updatey(2*n,l,m,p,v);
else updatey(2*n+1,m+1,d,p,v);
seg[n].a=(seg[2*n].a*seg[2*n+1].a)%mod;
seg[n].b=(max(seg[2*n].b,seg[2*n+1].b*seg[2*n].a))%mod;
}
}
long long init(int n,long long a[],long long b[]){
int i;
for(i=0;i<n;i++){
x.push_back(a[i]%mod);
y.push_back(b[i]%mod);
}
build(1,0,n-1);
return seg[1].b;
}
long long updateX(int pos,long long val){
updatex(1,0,x.size()-1,pos,val);
return seg[1].b;
}
long long updateY(int pos,long long val){
updatey(1,0,y.size()-1,pos,val);
return seg[1].b;
}