# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
135391 | StevenH | Horses (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"
long long s[10000];
long long mx=-1;
int init(int N, int X[], int Y[]) {
s[0]=X[0];
for(int i=1;i<N;i++)
{
s[i]=s[i-1]*X[i];
if(s[i]*Y[i]>mx)mx=s[i]*Y[i];
}
return mx % 1e9+7;
}
int updateX(int pos, int val) {
return 0;
}
int updateY(int pos, int val) {
return 0;
}