# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
216854 | kshitij_sodani | 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 <iostream>
#include <bits/stdc++.h>
//#include <horses.h>
using namespace std;
typedef long long int llo;
#define mp make_pair
#define pb push_back
#define a first
#define b second
#define endl "\n"
llo mod=1000000007;
llo init(llo n,vector<llo> aa,vector<llo> bb){
llo ma=0;
llo no=1;
for(llo i=0;i<n;i++){
no*=aa[i];
no%=mod;
ma=max(ma,(no*bb[i])%mod);
}
return ma;
}
llo updateX(llo pos,llo val){
}
llo updateY(llo pos,llo val){
}