// #include <bits/stdc++.h> #include <iostream> #include <cmath> #include <algorithm> #include <map> #include <unordered_map> #include <vector> #include <iomanip> #include <string> #include <queue> #include <set> #include <deque> #include "horses.h" using namespace std; #define endl "\n" #define pb push_back #define ll long long #define fi first #define se second const ll N = 3e5 + 5, M = 1e9 + 7, LG = 20; ll n , A[N] , B[N]; int init(int N, int X[], int Y[]) { ll ans = 0; n = N; ll cr = 1; for (ll i=0 ; i<N; i++){ cr *= X[i]; cr %= M; ans = max(ans , cr * Y[i]); ans %= M; A[i] = X[i]; B[i] = Y[i]; } return ans; } int updateX(int pos, int val) { A[pos] = val; ll ans = 0; ll cr = 1; for (ll i=0 ; i<n; i++){ cr *= A[i]; cr %= M; ans = max(ans , cr * B[i]); ans %= M; } return ans; } int updateY(int pos, int val) { B[pos] = val; ll ans = 0; ll cr = 1; for (ll i=0 ; i<n; i++){ cr *= A[i]; cr %= M; ans = max(ans , cr * B[i]); ans %= M; } return ans; }