| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 773146 | 1ne | 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;
vector<long long>cur;
const int mod = 1e9 + 7;
long long inf = 1e9 + 1;
vector<long long>x,y;
int n;
int valid = -1;
long long ans = 0;
struct dataa{
long long vx,vy,ans =0;
void add(long long left,long long right,long long val,int op){
if (op == 1){
vx = val;
}
else{
vy = val;
}
ans = vx * vy;
//sum += val *(right - left + 1);
}
};
long long power(long long a,long long b){
long long result =1;
while(b>0){
if(b&1)result=(result*a)%mod; //if you want you can add mod here!
a=(a*a)%mod; //here also.
b>>=1;// shifted one bit similar to divide by 2 :)
}
return result;}
//if m is prime then a^n = a^(n%(mod-1));
struct Segment_Tree{
vector<dataa>tree;
void build(long long node,long long left,long long right,vector<long long>&arr,long long n){
if (left == right){
tree[node].vx = arr[left];
tree[node].vy = brr[left];
tree[node].ans = min(inf,arr[left] * brr[left]);
return ;
}
long long mid = (left + right)>>1;
long long z = node + ((mid - left + 1)<<1);
build(node + 1,left,mid,arr,brr,n);
build(z,mid + 1,right,arr,brr,n);
tree[node] = combine(tree[node + 1],tree[z]);
}
void init(long long n,vector<long long>&arr,vector<long long>&brr){
tree.resize(2*n - 1);
build(0,0,n-1,arr,brr,n);
}
dataa combine(dataa left,dataa right){
dataa res;
res.vx = min(left.vx * right.vx,inf);
res.vy = right.vy;
res.ans = max(left.ans,min(left.vx * right.ans,inf));
return res;
}
dataa query(long long node,long long left,long long right,long long qleft,long long qright){
if (qright<left|| qleft > right)return {0,0,0};
if (qleft<=left && qright>=right){
return tree[node];
}
long long mid = (left + right)>>1;
long long z = node + ((mid - left + 1)<<1);
return combine(query(node + 1,left,mid,qleft,qright),query(z,mid + 1,right,qleft,qright));
}
void update(long long node,long long left,long long right,long long uleft,long long uright,long long v,int op){
if (left > uright || right < uleft) return;
if (uleft <= left && right <=uright){
tree[node].add(left,right,v,op);
return;
}
long long mid = (left + right)>>1;
long long z = node + ((mid - left + 1)<<1);
if (uleft<=mid){
update(node + 1,left,mid,uleft,uright,v,op);
}
if (uright > mid){
update(z,mid + 1,right,uleft,uright,v,op);
}
tree[node] = combine(tree[node + 1],tree[z]);
}
};
Segment_Tree st;
int init(int N, int X[], int Y[]) {
cur.resize(N);
n = N;
for (int i = 0;i<n;++i){
x.push_back(X[i]);
y.push_back(Y[i]);
}
st.init(n,x,y);
long long v = 1;
for (int i = 0;i<N;++i){
bool ok = true;
long long u = 1;
for (int j = i + 1;j<N;++j){
if (u * y[j] * x[j] > y[i]){
ok = false;
break;
}
u*=x[j];
}
v = (v * x[i])%mod;
if (ok){
valid = i;
return ans=(v * y[i])%mod;
}
}
}
int updateX(int pos, int val) {
pos--;
if (pos <= valid){
ans = ((ans * power(x[pos],mod - 2))%mod * val)%mod;
x[pos] = val;
}
else if (x[pos] >= val){
x[pos] = val;
}
else{
ans = ((ans * power(y[valid],mod - 2))%mod);
while(valid < n - 1 && st.query(0,0,n - 1,valid + 1,n - 1).ans > y[valid]){
++valid;
ans = (ans * x[valid])%mod;
}
ans = (ans * y[valid])%mod;
}
return ans;
}
int updateY(int pos, int val) {
}