# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
672317 | Trisanu_Das | 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 MOD 1000000007
int init(int n, int x[], int y[]){
int ans = 0, hrspr = 1;
for(int i = 0; i < n; i++){
h *= x[i];
(ans = max(ans, h * y[i])) %= MOD;
}
return ans;
}
int updateX(int pos, int val){return 0;}
int updateY(int pos, int val){return 0;}