# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1102239 | andro | 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"
int init(int N, int X[], int Y[]) {
int ans = 0;
int pref = 1;
int mod = 1e9 + 7;
for(int i = 0; i < N; i++) {
pref *= X[i];
pref %= mod;
ans = max(ans, pref * Y[i]);
}
return ans;
}
int updateX(int pos, int val) {
return 0;
}
int updateY(int pos, int val) {
return 0;
}