Submission #59797609

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;

int main(){
	int N,Q;
	cin >> N >> Q;
	vector<int>cnt(N,1);
	set<pair<int,int>>s;
	for(int i=0;i<N;i++)s.insert({i,i});
	s.insert({-1,2e9});
	s.insert({N,2e9});
	
	while(Q--){
		int t;
		cin >> t;
		if(t==1){
			int x,c;
			cin >> x >> c;
			x--,c--;
			auto it=s.lower_bound({x,2e9});
			auto[R,Rc]=*it;
			auto[L,Mc]=*--it;
			auto[_,Lc]=*--it;
			cnt[Mc]-=R-L;
			cnt[c]+=R-L;
			it++;
			it=s.erase(it);//[R,Rc]
			if(c==Rc){
				it=s.erase(it);
			}
			if(c==Lc){
				//pass
			}else{
				s.insert({L,c});
			}
		}else{
			int c;
			cin >> c;
			c--;
			cout << cnt[c] << endl;
		}
	}
}

Submission Info

Judge Result