# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
132352 | reda | 말 (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>
using namespace std ;
#define MOD 1000000007
# include "horses.h"
int X[10001];
int Y[10001];
int N;
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];
long long h=1,ans=0;
for(int i=0;i<N;i++)
{
h*=X[i];
h%=MOD;
ans=max((h*Y[i])%MOD,ans);
}
return ans%MOD;
}
int updateX(int pos, int val)
{
X[pos]=val;
return init(N,X,Y);
}
int updateY(int pos, int val)
{
Y[pos]=val;
return init(N,X,Y)
}