# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
819681 | Gangsta | 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.
/*
ID: didarco1
LANG: C++17
TASK:
*/
// a >> b = a / pow(2,b)
// a << b = a * pow(2,b)
#include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define sz size()
#define ss second
#define ff first
#define N 200001
#define pii pair<int,int>
#define all(x) (x.begin(),x.end())
using namespace std;
ll MOD = 1e9+7;
ll mod(ll x){
if(x >= MOD) x %= MOD;
return x;
}
void updateX(int pos, int val){
pos++;
val++;
}
void updateY(int pos, int val){
pos++;
val++;
}
//
//void upd(int nd, int l, int r, int x, int y){
// if(l == r and l == y){
// sell[i]
// }
//}
int init(int n, vector <int> X, vector<int> Y){
ll hrs = 1, mx = 0;
// for(int i = 1; i <= n; i++){
// hrs *= X[i];
// sell[i] = hrs * Y[i];
// }
// for(int i = 1; i <= n; i++){
// upd(1,1,n,i,sell[i]);
// }
for(int i = 0; i < n; i++){
hrs = mod((ll)(hrs * X[i]));
mx = max(mx,mod((ll)(hrs*Y[i])));
}
return mx;
}
//int main(){
// int x;
// cin >> n;
// for(int i = 0; i < n; i++){
// cin >> x;
// X.pb(x);
// }
// for(int i = 0; i < n; i++){
// cin >> x;
// Y.pb(x);
// }
// init(n,X,Y);
//}