#include "horses.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
const int lim = 5e5 + 5;
int n, st[lim << 2], x_st[lim << 2], y[lim], f[lim];
int get_x_prod(int id, int l, int r, int u, int v){
if(l > v || r < u){
return 1;
}
if(u <= l && v >= r){
return x_st[id];
}
int m = (l + r) >> 1, left = get_x_prod(id << 1, l, m, u, v);
if(left == mod){
return mod;
}
return min(ll(mod), 1LL * left * get_x_prod(id << 1 | 1, m + 1, r, u, v));
}
bool left_better(int l, int r){
return 1LL * get_x_prod(1, 1, n, l + 1, r) * y[r] < y[l];
}
int merge(int pl, int pr){
return left_better(pl, pr) ? pl : pr;
}
void update_X(int id, int l, int r, int p, int x){
if(l == r){
st[id] = l;
x_st[id] = x;
}
else{
int m = (l + r) >> 1;
if(m < p){
update_X(id << 1 | 1, m + 1, r, p, x);
}
else{
update_X(id << 1, l, m, p, x);
}
st[id] = merge(st[id << 1], st[id << 1 | 1]);
x_st[id] = min(ll(mod), 1LL * x_st[id << 1] * x_st[id << 1 | 1]);
}
}
void update_Y(int p, int Y){
y[p] = Y;
int id = 1, l = 1, r = n;
while(l < r){
int m = (l + r) >> 1;
id <<= 1;
if(m < p){
l = m + 1;
id |= 1;
}
else{
r = m;
}
}
while((id >>= 1) > 0){
st[id] = merge(st[id << 1], st[id << 1 | 1]);
}
}
int init(int N, int X[], int Y[]){
n = N;
for(int i = f[0] = 1; i <= n; i++){
f[i] = 1LL * f[i - 1] * X[i - 1] % mod;
y[i] = Y[i - 1];
}
fill(x_st, x_st + (lim << 2), 1);
for(int i = 1; i <= n; i++){
update_X(1, 1, n, i, X[i - 1]);
}
}
int updateX(int pos, int val) {
update_X(1, 1, n, pos + 1, val);
return 1LL * f[st[1]] * y[st[1]] % mod;
}
int updateY(int pos, int val) {
update_Y(pos + 1, val);
return 1LL * f[st[1]] * y[st[1]] % mod;
}
Compilation message
horses.cpp: In function 'int get_x_prod(int, int, int, int, int)':
horses.cpp:19:12: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
19 | return min(ll(mod), 1LL * left * get_x_prod(id << 1 | 1, m + 1, r, u, v));
| ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
horses.cpp: In function 'void update_X(int, int, int, int, int)':
horses.cpp:41:17: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
41 | x_st[id] = min(ll(mod), 1LL * x_st[id << 1] * x_st[id << 1 | 1]);
| ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:65:36: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
65 | f[i] = 1LL * f[i - 1] * X[i - 1] % mod;
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
horses.cpp:72:1: warning: no return statement in function returning non-void [-Wreturn-type]
72 | }
| ^
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:75:35: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
75 | return 1LL * f[st[1]] * y[st[1]] % mod;
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:79:35: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
79 | return 1LL * f[st[1]] * y[st[1]] % mod;
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
12 ms |
25432 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
12 ms |
25436 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
507 ms |
44116 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
12 ms |
25436 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
12 ms |
25436 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
