| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 234188 | celeste | 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"
#include <algorthm>
using namespace std;
int init(int N, int X[], int Y[]) {
int V[N];
V[0]=X[0];
for( int i=1; i<N; i++){
V[i]=V[i-1]*X[i];
int mx=0;
for (int i=0; i<N i++){
mx=max(mx, V[i]*Y[i]);
}
}
return mx;
}