oj.uz

Submission #512576

# Submission time Handle Problem Language Result Execution time Memory
512576 2022-01-16T13:20:22 Z mars4 Growing Trees (BOI11_grow) C++17
100 / 100
 185 ms 9476 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp> 

using namespace std;
using namespace __gnu_pbds; 

#define ff              first
#define ss              second
#define ll              int64_t
#define ld              long double
#define nl              cout<<"\n"
#define all(v)          v.begin(),v.end()
#define mset(a,v)       memset((a),(v),sizeof(a))
#define forn(i,a,b)     for(int64_t i=int64_t(a);i<int64_t(b);++i)
#define forb(i,a,b)     for(int64_t i=int64_t(a);i>=int64_t(b);--i)
#define fastio()        ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);

#define mod         1'000'000'007
#define mod2        998'244'353 
#define inf         1'000'000'000'000'007
#define pi          3.14159265358979323846

template<class key,class cmp=std::less<key>>
using ordered_set=tree<key,null_type,cmp,rb_tree_tag,tree_order_statistics_node_update>;

template<class L,class R> ostream& operator<<(ostream& out,pair<L,R> &p)        {return out<<"("<<p.ff<<", "<<p.ss<<")";}
template<class T> ostream& operator<<(ostream& out,vector<T> &v)                {out<<"[";for(auto it=v.begin();it!=v.end();++it){if(it!=v.begin())out<<", ";out<<*it;}return out<<"]";}
template<class T> ostream& operator<<(ostream& out,deque<T> &v)                 {out<<"[";for(auto it=v.begin();it!=v.end();++it){if(it!=v.begin())out<<", ";out<<*it;}return out<<"]";}
template<class T> ostream& operator<<(ostream& out,set<T> &s)                   {out<<"{";for(auto it=s.begin();it!=s.end();++it){if(it!=s.begin())out<<", ";out<<*it;}return out<<"}";}
template<class T> ostream& operator<<(ostream& out,ordered_set<T> &s)           {out<<"{";for(auto it=s.begin();it!=s.end();++it){if(it!=s.begin())out<<", ";out<<*it;}return out<<"}";}
template<class L,class R> ostream& operator<<(ostream& out,map<L,R> &m)         {out<<"{";for(auto it=m.begin();it!=m.end();++it){if(it!=m.begin())out<<", ";out<<*it;}return out<<"}";}

void dbg_out() {cerr<<"]\n";}
template<typename Head,typename... Tail> 
void dbg_out(Head H,Tail... T) {cerr<<H;if(sizeof...(Tail))cerr<<", ";dbg_out(T...);}
#ifdef LOCAL
	#define dbg(...) cerr<<"["<<#__VA_ARGS__<<"] = [",dbg_out(__VA_ARGS__)
#else
	#define dbg(...)
#endif

//---------------------------------mars4---------------------------------

class SegtreeMax
{
	ll N=0;
	vector<ll> segtree;
	vector<ll> lazy;

	ll _build(vector<ll> &a,ll st,ll ed,ll i=1)
	{
		if(st==ed)
			return segtree[i]=a[st];
		ll mid=(st+ed)>>1;
		return segtree[i]=max(_build(a,st,mid,i<<1),_build(a,mid+1,ed,i<<1|1));
	}

	void _push(ll st,ll ed,ll val,ll i)
	{
		if(st!=ed)
		{
			lazy[i<<1]+=val;
			lazy[i<<1|1]+=val;
		}
	}

	void _update(ll st,ll ed,ll l,ll r,ll val,ll i=1)
	{
		if(lazy[i])
		{
			segtree[i]+=lazy[i];
			_push(st,ed,lazy[i],i);
			lazy[i]=0;
		}
		if(st>ed or st>r or ed<l)
			return;
		if(st>=l and ed<=r)
		{
			segtree[i]+=val;
			_push(st,ed,val,i);
			return;
		}
		ll mid=(st+ed)>>1;
		_update(st,mid,l,r,val,i<<1);
		_update(mid+1,ed,l,r,val,i<<1|1);
		segtree[i]=max(segtree[i<<1],segtree[i<<1|1]);
	}

	ll _query(ll st,ll ed,ll l,ll r,ll i=1)
	{
		if(lazy[i])
		{
			segtree[i]+=lazy[i];
			_push(st,ed,lazy[i],i);
			lazy[i]=0;
		}
		if(st>ed or st>r or ed<l)
			return -inf;
		if(st>=l and ed<=r)
			return segtree[i];
		ll mid=(st+ed)>>1;
		return max(_query(st,mid,l,r,i<<1),_query(mid+1,ed,l,r,i<<1|1));
	}

	ll _first_element_atleast_x(ll st,ll ed,ll l,ll r,ll val,ll i=1)
	{
		if(lazy[i])
		{
			segtree[i]+=lazy[i];
			_push(st,ed,lazy[i],i);
			lazy[i]=0;
		}
		if(st>ed or st>r or ed<l or segtree[i]<val)
			return -1;
		if(st==ed)
			return st;
		ll mid=(st+ed)>>1;
		ll ind=_first_element_atleast_x(st,mid,l,r,val,i<<1);
		if(ind==-1)
			ind=_first_element_atleast_x(mid+1,ed,l,r,val,i<<1|1);
		return ind;
	}

	public:
	void init(ll n,ll val=0)
	{
		N=n;
		segtree=vector<ll>(N<<2,val);
		lazy=vector<ll>(N<<2);
	}

	void build(vector<ll> &a)
	{
		_build(a,0,N-1);
	}

	void update(ll l,ll r,ll val)
	{
		_update(0,N-1,l,r,val);
	}

	ll query(ll l,ll r)
	{
		return _query(0,N-1,l,r);
	}

	ll first_element_atleast_x(ll l,ll r,ll val)
	{
		return _first_element_atleast_x(0,N-1,l,r,val);
	}

	void clear()
	{
		segtree=vector<ll>(N<<2);
		lazy=vector<ll>(N<<2);
	}
};

int main()
{
	fastio();
	ll z,n,m,t,k,i,j,l,d,h,r;
	cin>>n>>m;
	vector<ll> a(n);
	for(ll &i:a)
	{
		cin>>i;
	}
	sort(all(a));
	SegtreeMax s;
	s.init(n);
	s.build(a);
	while(m--)
	{
		char ch;
		cin>>ch>>l>>r;
		if(ch=='F')
		{
			ll lind=s.first_element_atleast_x(0,n-1,r);
			if(lind==-1)
			{
				continue;
			}
			ll rind=lind+l-1;
			if(rind>=n)
			{
				s.update(lind,n-1,1);
				continue;
			}
			ll rval=s.query(rind,rind);
			ll mind=s.first_element_atleast_x(0,n-1,rval);
			s.update(lind,mind-1,1);
			ll cnt=(mind-1)-lind+1;
			ll Rind=s.first_element_atleast_x(0,n-1,rval+1);
			if(Rind==-1)
			{
				Rind=n;
			}
			ll rem=l-cnt;
			s.update(Rind-rem,Rind-1,1);
		}
		else
		{
			ll rind=s.first_element_atleast_x(0,n-1,r+1);
			if(rind==-1)
			{
				rind=n;
			}
			ll lind=s.first_element_atleast_x(0,n-1,l);
			if(lind==-1)
			{
				lind=n;
			}
			cout<<rind-lind<<"\n";
		}
	}
	cerr<<"\nTime elapsed: "<<1000*clock()/CLOCKS_PER_SEC<<"ms\n";
	return 0;
}

Compilation message

grow.cpp: In function 'int main()':
grow.cpp:163:5: warning: unused variable 'z' [-Wunused-variable]
  163 |  ll z,n,m,t,k,i,j,l,d,h,r;
      |     ^
grow.cpp:163:11: warning: unused variable 't' [-Wunused-variable]
  163 |  ll z,n,m,t,k,i,j,l,d,h,r;
      |           ^
grow.cpp:163:13: warning: unused variable 'k' [-Wunused-variable]
  163 |  ll z,n,m,t,k,i,j,l,d,h,r;
      |             ^
grow.cpp:163:15: warning: unused variable 'i' [-Wunused-variable]
  163 |  ll z,n,m,t,k,i,j,l,d,h,r;
      |               ^
grow.cpp:163:17: warning: unused variable 'j' [-Wunused-variable]
  163 |  ll z,n,m,t,k,i,j,l,d,h,r;
      |                 ^
grow.cpp:163:21: warning: unused variable 'd' [-Wunused-variable]
  163 |  ll z,n,m,t,k,i,j,l,d,h,r;
      |                     ^
grow.cpp:163:23: warning: unused variable 'h' [-Wunused-variable]
  163 |  ll z,n,m,t,k,i,j,l,d,h,r;
      |                       ^

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 129 ms 7776 KB Output is correct
2 Correct 124 ms 8128 KB Output is correct
3 Correct 116 ms 7728 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 2 ms 452 KB Output is correct
3 Correct 3 ms 460 KB Output is correct
4 Correct 2 ms 448 KB Output is correct
5 Correct 67 ms 1688 KB Output is correct
6 Correct 51 ms 1904 KB Output is correct
7 Correct 6 ms 716 KB Output is correct
8 Correct 27 ms 1444 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 2084 KB Output is correct
2 Correct 56 ms 2160 KB Output is correct
3 Correct 2 ms 708 KB Output is correct
4 Correct 33 ms 1700 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 2224 KB Output is correct
2 Correct 67 ms 2080 KB Output is correct
3 Correct 10 ms 844 KB Output is correct
4 Correct 74 ms 2128 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 86 ms 6032 KB Output is correct
2 Correct 136 ms 6756 KB Output is correct
3 Correct 18 ms 1940 KB Output is correct
4 Correct 100 ms 6728 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 122 ms 6664 KB Output is correct
2 Correct 127 ms 7288 KB Output is correct
3 Correct 120 ms 6864 KB Output is correct
4 Correct 15 ms 1828 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 7060 KB Output is correct
2 Correct 96 ms 7784 KB Output is correct
3 Correct 123 ms 7652 KB Output is correct
4 Correct 16 ms 1920 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 133 ms 8132 KB Output is correct
2 Correct 126 ms 6960 KB Output is correct
3 Correct 30 ms 8004 KB Output is correct
4 Correct 67 ms 7748 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 112 ms 7764 KB Output is correct
2 Correct 126 ms 8064 KB Output is correct
3 Correct 185 ms 9068 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 108 ms 9476 KB Output is correct