# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1011330 | nisanduu | 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.
/******************************************************************************
Online C++ Compiler.
Code, Compile, Run and Debug C++ program online.
Write your code in this editor and press "Run" button to compile and execute it.
*******************************************************************************/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N = 1e5 + 10;
vector<int> a,b;
ll mod = 1e9 + 7;
int init(int n,vector<int> X,vector<int> Y){
a=X;
b=Y;
N=n;
ll ans = 0;
ll cr = 1;
for(int i=0;i<n;i++){
cr = (cr*1LL*a[i])%mod;
ans = max(ans,(cr*b[i]*1LL)%mod);
}
return ans;
}
int updateX(int pos,int val){
a[pos]=val;
return 0;
}
int updateY(int pos,int val){
b[pos]=val;
return 0;
}