# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
234213 | AASG | Horses (IOI15_horses) | C++11 | 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 <algorithm>
int init(int N, int X[], int Y[]) {
int v[N];
V[0]=X[0];
int mx=0;
for(int i=1;i<N;i++)V[i]=V[i-1]*X[i];
for(int i=0;i<N;i++)mx=max(V[i]*Y[i]);
return mx;
}
int updateX(int pos, int val) {
return 0;
}
int updateY(int pos, int val) {
return 0;
}