# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
30823 | inqr | 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.
#include "horses.h"
#include <bits/stdc++.h>
using namespace std;
#define maxn 500005
#define pdl pair<double,long long>
#define mod (long long)1000000007
int n;
long long a[maxn];
long long b[maxn];
pdl tree[maxn*4];
pdl lazy[maxn*4];
pdl fus(pdl x,pdl y) {
return {x.first+y.first,(x.second*y.second+mod)%mod};//
}
/*
long long inv(long long value){
if(value == 1) return 1;
long long tmp = (inv(mod%value)*((-mod)/value));
tmp %= mod;
if(tmp < 0) tmp += mod;
return tmp;
}
*/
ll inv(ll base){
ll res=1;
ll exp=MOD-2;
while(exp>0){
if(exp&1){