# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
135275 | tinjyu | Horses (IOI15_horses) | C++14 | 34 ms | 12284 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"
long long int n,x[1000005],y[1000005];
int init(int N, int X[], int Y[]) {
n=N;
for(int i=0;i<n;i++)x[i]=X[i];
for(int i=0;i<n;i++)y[i]=Y[i];
long long int tmp=1,ans=0;
for(int i=0;i<n;i++)
{
tmp*=x[i];
if(tmp*y[i]>ans)
{
ans=tmp*y[i];
}
}
return ans%1000000007;
}
int updateX(int pos, int val) {
x[pos]=val;
long long int tmp=1,ans=0;
for(int i=0;i<n;i++)
{
tmp*=x[i];
if(tmp*y[i]>ans)
{
ans=tmp*y[i];
}
}
return 0;
}
int updateY(int pos, int val) {
y[pos]=val;
long long int tmp=1,ans=0;
for(int i=0;i<n;i++)
{
tmp*=x[i];
if(tmp*y[i]>ans)
{
ans=tmp*y[i];
}
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |