#include <bits/stdc++.h>
using namespace std;
const long long N = 2e5 + 5 ;
#define ll long long
#define endl '\n'
struct segmentTree {
ll n;
vector<ll> sum, lz, sumB , maxi , mini;
void init(ll _n, ll b[]) {
n = _n;
sum.assign(4 * n + 6, 0);
lz.assign(4 * n + 6, 0);
sumB.assign(4 * n + 6, 0);
maxi.assign(4 * n + 6, -2e9);
mini.assign(4 * n + 6, 2e9);
build(b, 1, 1, n);
}
void build(ll b[], ll i, ll l, ll r) {
if (l == r) {
sumB[i] = b[l];
mini[i] = 0 ;
maxi[i] = 0 ;
return;
}
ll m = (l + r) >> 1;
build(b, i << 1, l, m); build(b, i << 1 | 1, m + 1, r);
sumB[i] = sumB[i << 1] + sumB[i << 1 | 1];
}
void pushdown(ll i) {
for(ll j=i<<1; j<=(i<<1|1); ++j) {
sum[j] += lz[i] * sumB[j];
maxi[j] += lz[i] ;
mini[j] += lz[i] ;
lz[j] += lz[i];
}
lz[i] = 0;
}
void upd(ll i, ll l, ll r, ll u, ll v, ll delta) {
if (l > r || u > v || l > v || r < u) return;
if (l >= u && r <= v) {
sum[i] += delta * sumB[i];
maxi[i] += delta ;
mini[i] += delta ;
lz[i] += delta;
return;
}
pushdown(i);
ll m = (l + r) >> 1;
upd(i << 1, l, m, u, v, delta); upd(i << 1 | 1, m + 1, r, u, v, delta);
sum[i] = sum[i << 1] + sum[i << 1 | 1];
maxi[i] = max(maxi[i<<1] , maxi[i<<1 | 1]) ;
mini[i] = min(mini[i<<1] , mini[i<<1 | 1]) ;
}
void upd(ll u, ll v, ll delta) {
upd(1, 1, n, u, v, delta);
}
ll f(ll x , ll y , ll tp)
{
if(tp==1) return x+y ;
if(tp==2) return min(x , y) ;
return max(x , y) ;
}
ll id(ll tp)
{
if(tp==1) return 0 ;
if(tp==2) return 2e9 ;
return -2e9 ;
}
ll get(ll i, ll l, ll r, ll u, ll v , ll tp) {
if (l > r || u > v || l > v || r < u) return id(tp);
if (l >= u && r <= v) return(tp == 1 ? sum[i] : tp==2 ? mini[i] : maxi[i]);
pushdown(i);
ll m = (l + r) >> 1;
return f(get(i << 1, l, m, u, v , tp) , get(i << 1 | 1, m + 1, r, u, v , tp) , tp);
}
ll get2(ll node , ll l , ll r , ll idx){
if(l==r) return sum[node];
pushdown(node) ;
ll md = (l+r)/2;
if(idx<=md) return get2(2*node,l,md,idx);
return get2(2*node+1,md+1,r,idx);
}
ll get(ll u, ll v , ll tp = 1) {
return get(1, 1, n, u, v , tp);
}
};
ll a[N] , b[N] ;
segmentTree st ;
ll n , q ;
int getlast(int node , int l , int r , int x)
{
if(st.mini[node]>x) return 0 ;
if(l==r) return l ;
int md = (l+r)/2 ;
if(x>=st.mini[2*node+1]) return getlast(2*node+1 , md+1 , r , x) ;
else return getlast(2*node , l , md , x) ;
}
int getlast(int x)
{
return getlast(1 , 1 , n , x) ;
}
int getfirst(int node , int l , int r , int x)
{
if(st.maxi[node]<x) return n+1 ;
if(l==r) return l ;
int md = (l+r)/2 ;
if(st.maxi[2*node]>=x) return getfirst(2*node , l , md , x) ;
else return getfirst(2*node+1 , md+1 , r , x) ;
}
int getfirst(int x)
{
return getfirst(1 , 1 , n , x) ;
}
int main()
{
ios::sync_with_stdio(0), cin.tie(0),cout.tie(0) ;
cin>>n>>q ;
for(ll i = 1 ; i<=n ; i++){
cin>>a[i] ;
b[i] = 1 ;
}
st.init(n , b) ;
sort(a+1 , a+n+1) ;
for(ll i = 1 ; i<=n ; i++){
st.upd(i , i ,a[i]) ;
}
// ll m ; cin>>m ;
// while(m--){
// ll a, b ; cin>>a>>b ;
// cout<<getfirst(a)<<' '<<getlast(b)<<endl;
// }
while(q--){
char c ; cin>>c ;
if(c=='F'){
ll c , h ; cin>>c>>h ;
ll l = getfirst(h) ;
if(l==n+1) continue ;
c = min(c , n - l+1) ;
ll r = min(n , l+c-1) ;
if(r==n){
st.upd(l , r , 1) ;
continue ;
}
ll x = st.get(r , r) ;
ll lr = getfirst(x)-1 ;
ll rr = getfirst(x+1)-1 ;
ll lefties = max(0LL , lr - l+1) ;
ll rl = (rr - (c - lefties) +1) ;
// upd [l , lr] , upd[rl , rr]
if(l<=lr){
st.upd(l , lr , 1) ;
}
if(rl<=rr){
st.upd(rl , rr , 1) ;
}
}
else{
ll a , b ; cin>>a>>b ;
cout<<getfirst(b+1) - getfirst(a)<<endl;
}
// for(ll i = 1 ; i<=n ; i++){
// cout<<st.get(i , i)<<' ';
// }
// cout<<endl;
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
76 ms |
15520 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
596 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
29 ms |
1716 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
27 ms |
1724 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
95 ms |
11600 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
120 ms |
13240 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
69 ms |
14120 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
96 ms |
15188 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
106 ms |
15068 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
129 ms |
17548 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
