Submission #888567

#	Time	Username	Problem	Language	Result	Execution time	Memory
888567		shadow_sami	Growing Trees (BOI11_grow)	C++17	0 / 100	417 ms	11540 KiB

grow

#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef pair<ll,ll> pi;
typedef map<ll,ll> mi;
typedef long double ld;
typedef vector<ld> vd;
typedef vector<vector<ld>> vvd;
typedef pair<ld,ld> pd;
#define ff first
#define ss second
#define srt(a) sort(a.begin(),a.end());
#define fip(k, n) for (ll i = k; i < n; i++)
#define fjp(k, n) for (ll j = k; j < n; j++)
#define fin(k, n) for (ll i = k; i >= n; i--)
#define fjn(k, n) for (ll j = k; j >= n; j--)
#define fp(k, n, m) for (ll k = n; k < m; k++)
#define fn(k, n, m) for (ll k = n; k >= m; k--)
#define ordered_set tree<pi, null_type,less< pi >, rb_tree_tag,tree_order_statistics_node_update>
#define totalOne(n) __builtin_popcount(n)
#define backZero(n) __builtin_ctzll(n)
#define frontZero(n) __builtin_clzll(n)
#define fx(k) for ( auto x : k )
#define test ll t;cin >> t;while (t--)
#define nli "\n"

// ==========================(debug)============================================================================================== //

#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x <<" "; _printn(x); cerr << nli;
#else
#define debug(x)
#endif

void _printn(ll x){ cerr<<x<<" "; }
void _printn(int x){ cerr<<x<<" "; }
void _printn(ld x){ cerr<<x<<" "; }
void _printn(double x){ cerr<<x<<" "; }
void _printn(string x){ cerr<<x<<" "; }
void _printn(char x){ cerr<<x<<" "; }
void _printn(bool x){ cerr<<x<<" "; }
template<class T,class V>void _printn(pair<T,V> vv);
template<class T> void _printn(vector<T> vv);
template<class T> void _printn(set<T> vv);
template<class T,class V> void _printn(map<T,V> vv);
template<class T> void _printn(multiset<T> vv);
template<class T,class V>void _printn(pair<T,V> vv){ cerr<<"( ";_printn(vv.ff);cerr<<",";_printn(vv.ss);cerr<<")";}
template<class T> void _printn(vector<T> vv){ cerr<<"[ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"]"; };
template<class T> void _printn(set<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T> void _printn(multiset<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T,class V> void _printn(map<T,V> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };

// ==========================(debug)============================================================================================== //

ll n,m,tp,tp2,res,cnt,sum,tptp,ans;
const ll mx = 5e5+5;
const ll mod = 1e9+7;

// ==========================(MOD)=============================================================================================== //

ll mod_add(ll aa,ll bb){ return ((aa%mod)+(bb%mod))%mod; }
ll mod_minus(ll aa,ll bb){ return (((aa%mod)-(bb%mod))+10*mod)%mod; }
ll mod_mul(ll aa,ll bb){ return ((aa%mod)*(bb%mod))%mod; }
ll mod_power(ll aa,ll bb){ aa%=mod; ll empowered = 1; bb%=mod-1; while(bb > 0){ if(bb & 1) empowered = mod_mul(empowered,aa); bb = bb >> 1; aa = mod_mul(aa,aa); } return empowered; }
ll mod_divi(ll aa,ll bb){ aa=mod_mul(aa,mod_power(bb,mod-2)); return aa; }

// ==========================(MOD)=============================================================================================== //

bool f = false;
ll a[mx];
char c;
ll sr,de,l,r,mid,u,v;;

typedef struct SEGMENT_TREE{
	vi arr,laz;
	ll range;
	void init(ll k){
		range = log2(k);
		range = 1 << (range + 3);
		arr.resize(range,0);
		laz.resize(range,0);
		return;
	}
	ll construct(ll ptr,ll l,ll r){
		if(l==r){
			arr[ptr] = a[l];
			return arr[ptr];
		}
		ll mid = l + (r-l) / 2;
		construct(2*ptr,l,mid);
		construct(2*ptr+1,mid+1,r);
		arr[ptr] = (arr[2*ptr]+arr[2*ptr+1]);
		return arr[ptr];
	}
	ll update(ll ptr,ll l,ll r,ll st,ll en,ll val){
		if(laz[ptr]){
			arr[ptr] += laz[ptr] * (r-l+1);
			if(l!=r){
				laz[2*ptr] += laz[ptr];
				laz[2*ptr+1] += laz[ptr];
			}
			laz[ptr] = 0;			
		}
		if(l>=st && r<=en){
			arr[ptr] += (val) * (r-l+1);
			if(l!=r){
				laz[2*ptr] += val;
				laz[2*ptr+1] += val;
			}
			return arr[ptr];
		}
		if(l>en || r<st)
			return arr[ptr];
		ll mid = l + (r-l) / 2;
		arr[ptr] = (update(2*ptr,l,mid,st,en,val)+update(2*ptr+1,mid+1,r,st,en,val));
		return arr[ptr];
	}
	ll query(ll ptr,ll l,ll r,ll st,ll en){
		if(laz[ptr]){
			arr[ptr] += laz[ptr] * (r-l+1);
			if(l!=r){
				laz[2*ptr] += laz[ptr];
				laz[2*ptr+1] += laz[ptr];
			}
			laz[ptr] = 0;			
		}
		if(l>=st && r<=en)
			return arr[ptr];
		if(l>en || r<st)
			return 0;
		ll mid = l + (r-l) / 2;
		return (query(2*ptr,l,mid,st,en)+query(2*ptr+1,mid+1,r,st,en));
	}
}SGT;

SGT sgt;

int main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    // #ifndef ONLINE_JUDGE
    //     freopen("input1.txt", "r", stdin);
    //     freopen("output1.txt", "w", stdout);
    //     freopen("error1.txt", "w", stderr);
    // #endif // ONLINE_JUDGE

        cin>>n>>m;
        sgt.init(n);
        fip(0,n)
        	cin>>a[i];
        sort(a,a+n);
        sgt.construct(1,0,n-1);
        // fip(0,n)
    	// 	cout<<sgt.query(1,0,n-1,i,i)<<" ";
    	// cout<<nli;
        while(m--){
        	cin>>c;
        	if(c=='F'){
        		cin>>sr>>de;
        		swap(sr,de);
        		l = 0;
        		r = n-1;
        		tp = n;
        		while(l<=r){
        			mid = l + (r-l) / 2;
        			if(sgt.query(1,0,n-1,mid,mid)>=sr){
        				tp = mid;
        				r = mid - 1;
        			}else
        				l = mid + 1;
        		}
        		if(tp==n)
        			continue;
        		u = tp;
        		v = min(tp + de - 1,n-1);
        		if(v>=n-1 || a[v]<a[v+1]){
        			sgt.update(1,0,n-1,u,v,1);
        		}else{
        			l = 0;
	        		r = n-1;
	        		tp2 = r;
	        		res = sgt.query(1,0,n-1,v,v);
	        		while(l<=r){
	        			mid = l + (r-l) / 2;
	        			if(sgt.query(1,0,n-1,mid,mid)<=res){
	        				tp2 = mid;
	        				l = mid + 1;	        				
	        			}else
	        				r = mid - 1;	        				
	        		}
	        		l = 0;
	        		r = n-1;
	        		tptp = u-1;
	        		while(l<=r){
	        			mid = l + (r-l) / 2;
	        			if(sgt.query(1,0,n-1,mid,mid)<res){
	        				tptp = mid;
	        				l = mid + 1;	        				
	        			}else
	        				r = mid - 1;	        				
	        		}
	        		if(u<=tptp)
	        			sgt.update(1,0,n-1,u,tptp,1);
	        		res = (v-u+1) - (u<=tptp?(tptp-u+1):0);
	        		sgt.update(1,0,n-1,tp2-res+1,tp2,1);
        		}
        	}else{
        		cin>>sr>>de;
        		l = 0;
        		r = n-1;
        		tp = n;
        		while(l<=r){
        			mid = l + (r-l) / 2;
        			if(sgt.query(1,0,n-1,mid,mid)>=sr){
        				tp = mid;
        				r = mid - 1;
        			}else
        				l = mid + 1;
        		}
        		l = 0;
        		r = n-1;
        		tp2 = -1;
        		while(l<=r){
        			mid = l + (r-l) / 2;
        			if(sgt.query(1,0,n-1,mid,mid)<=de){
        				tp2 = mid;
        				l = mid + 1;	        				
        			}else
        				r = mid - 1;	        				
        		}
        		cout<<max(0ll,tp2-tp+1)<<nli;
        	}
        	// fip(0,n)
        	// 	cout<<sgt.query(1,0,n-1,i,i)<<" ";
        	// cout<<nli;
        }
        
    cerr << "Time elapsed: " << setprecision(6) << 1000.0 * clock() / CLOCKS_PER_SEC << "ms\n";
    return 0;
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10