# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
715465 | mseebacher | Horses (IOI15_horses) | C++17 | 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 <bits/stdc++.h>
typedef long long ll;
int init(int N, int X[], int Y[]) {
ll ans = 0;
ll horses = 1;
const int MOD = 1e9+7;
for(int i = 0;i<N;i++){
ans = max(ans,horses*Y[i]%MOD);
horses*=X[i]%MOD;
}
return ans;
}
int updateX(int pos, int val) {
return 0;
}
int updateY(int pos, int val) {
return 0;
}