# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
203601 | mohammad | 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.
/*
░░░░██████████████████
░░▄███████▀▀▀▀▀▀███████▄
░▐████▀▒mohammad▒▀██████▄
░███▀▒▒▒▒alaa▒▒▒▒▒▒▀█████
░▐██▒▒▒alwrawrah▒▒▒▒▒████▌
░▐█▌▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒████▌
░░█▒▄▀▀▀▀▀▄▒▒▄▀▀▀▀▀▄▒▐███▌
░░░▐░░░▄▄░░▌▐░░░▄▄░░▌▐███▌
░▄▀▌░░░▀▀░░▌▐░░░▀▀░░▌▒▀▒█▌
░▌▒▀▄░░░░▄▀▒▒▀▄░░░▄▀▒▒▄▀▒▌
░▀▄▐▒▀▀▀▀▒▒▒▒▒▒▀▀▀▒▒▒▒▒▒█
░░░▀▌▒▄██▄▄▄▄████▄▒▒▒▒█▀
░░░░▄██████████████▒▒▐▌
░░░▀███▀▀████▀█████▀▒▌
░░░░░▌▒▒▒▄▒▒▒▄▒▒▒▒▒▒▐
░░░░░▌▒▒▒▒▀▀▀▒▒▒▒▒▒▒▐
*/
#include<bits/stdc++.h>
#include "horses.h"
using namespace std;
typedef long long ll ;
const ll oo = 1e13 ;
const double PI = acos(-1) ;
const ll M = 1e9 + 7 ;
ll x[500010] , y[500010] , n;
ll f = 1 , mp[33] ;
ll fastpower( ll x , ll n ){
ll res = 1 ;
while(n > 0){
if(n % 2 == 1)
res = (res * x) % M;
x = ( x * x ) % M;
n = n / 2 ;
}
return res;
}
int init(int N, int X[], int Y[]){
n = N;
for(int i = 0 ; i < N ; ++i)x[i] = X[i] , y[i] = Y[i] , f = (x[i] * f) % M;
ll x1 = 1 , pl = 0 , ans = 1;
for(int i = max(0ll,n - 31) ; i < N ; ++i){
x1 *= x[i];
if(y[pl] < x1 * y[i])
x1 = 1 ,pl = i ;
if(i != max(0ll , n - 31))
mp[i] = (mp[i - 1] * x[i]) % M;
else mp[i] = x[i];
}
ans = (f * fastpower(((mp[N - 1] * fastpower(mp[pl] , M - 2)) % M) , M - 2)) % M;
return (ans * y[pl]) % M;
}
int updateX(int pos, int val){
ll pr = x[pos];
f = (f * fastpower(pr , M - 2)) % M;
f = (f * val) % M;
x[pos] = val;
ll x1 = 1 , pl = 0 , ans = 1;
for(int i = max(0ll,n - 31) ; i < n ; ++i){
x1 *= x[i];
if(y[pl] < x1 * y[i])
x1 = 1 ,pl = i ;
if(i != max(0ll , n - 31))
mp[i] = (mp[i - 1] * x[i]) % M;
else mp[i] = x[i];
}
ans = (f * fastpower(((mp[N - 1] * fastpower(mp[pl] , M - 2)) % M) , M - 2)) % M;
return (ans * y[pl]) % M;
}
int updateY(int pos, int val){
y[pos] = val;
ll x1 = 1 , pl = 0 , ans = 1;
for(int i = max(0ll,n - 31) ; i < n; ++i){
x1 *= x[i];
if(y[pl] < x1 * y[i])
x1 = 1 ,pl = i ;
}
ans = (f * fastpower(((mp[N - 1] * fastpower(mp[pl] , M - 2)) % M) , M - 2)) % M;
return (ans * y[pl]) % M;
}