# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
908131 | allin27x | 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 <bits/stdc++.h>
using namespace std;
#define int long long
const int mod = 1e9+7;
signed init(signed n, int x[], int y[]){
int res = 0;
int p = 1;
for (int i=0; i<n; i++){
p*=x[i];
res = max(res, y[i]*p);
}
return res % mod;
}
signed updateX(signed pos, signed val);
signed updateY(signed pos, signed val);