提出 #70631282

---

ソースコード 拡げる

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
#include <set>
#include <iostream> 

#include <set>
#include <iostream> 

template<typename T>
struct RangeSet {
	// ReadMe:閉区間なことに注意
	// member
	std::set<std::pair<T, T>>st;
	T TINF;
	// constructor
	RangeSet(T lim) {
		TINF = lim + 1;
		st.emplace(-TINF, -TINF);
		st.emplace(TINF, TINF);
	}
	// cover check
	bool IsCovered(T l, T r) {
		auto ite = prev(st.lower_bound({ l + 1,l + 1 }));
		return ((ite->first <= l) && (r <= ite->second));
	}
	bool IsCovered(T x) { return IsCovered(x, x); }
	// get by covered
	std::pair<T, T> ByCovered(T l, T r) {
		auto ite = prev(st.lower_bound({ l + 1,l + 1 }));
		if ((ite->first <= l) && (r <= ite->second)) return *ite;
		return { -TINF, -TINF };
	}
	std::pair<T, T> ByCovered(T  x) { return ByCovered(x, x); }
	// getFront
	std::pair<T, T>getFront() {
		auto itr = st.begin();
		itr++;
		return *itr;
	}
	// getBack
	std::pair<T, T>getBack() {
		auto itr = st.end();
		itr--;
		itr--;
		return *itr;
	}
	// insert
	T Insert(T l, T r, const std::function<void(int, int)> &insert, const std::function<void(int, int)> &erase) {
		//insertでmargeしないver
		//st.emplace(l, r);
		//return 0;
		T sumErase = T(0);
		auto ite = prev(st.lower_bound({ l + 1,l + 1 }));
		// no need merge
		if (IsCovered(l, r))return sumErase;
		// first merge pos
		if ((ite->first <= l) && (l <= (ite->second + 1))) {
			l = ite->first;
			sumErase += ite->second - ite->first + 1;
			erase(ite->first, ite->second);
			ite = st.erase(ite);
		}
		else ite = next(ite);
		// merge
		while (r > ite->second) {
			sumErase += ite->second - ite->first + 1;
			erase(ite->first, ite->second);
			ite = st.erase(ite);
		}
		if (((ite->first - 1) <= r) && (r <= ite->second)) {
			r = ite->second;
			sumErase += ite->second - ite->first + 1;
			erase(ite->first, ite->second);
			st.erase(ite);
		}
		insert(l, r);
		st.emplace(l, r);
		return (r - l + 1) - sumErase;
	}
	//T Insert(T x) { return Insert(x, x); }
	// erase
	T Erase(T l, T r, const std::function<void(int, int)> &insert, const std::function<void(int, int)> &erase) {
		T ret = T(0);
		auto get = ByCovered(l, r);
		if ((-TINF) != get.first) {
			erase(get.first, get.second);
			st.erase(get);
			if (get.first != l) {
				insert(get.first, l - 1);
				st.emplace(get.first, l - 1);
			}
			if (get.second != r) {
				insert(r + 1, get.second);
				st.emplace(r + 1, get.second);
			}
			ret += r - l + 1;
			return ret;
		}
		auto ite = prev(st.lower_bound({ l + 1,l + 1 }));
		// first erase
		if ((ite->first <= l) && (l <= ite->second)) {
			ret += ite->second - l + 1;
			if (ite->first != l) {
				insert(ite->first, l - 1);
				st.emplace(ite->first, l - 1);
			}
			erase(ite->first, ite->second);
			ite = st.erase(ite);
		}
		else ite = next(ite);
		// erase
		while (ite->second <= r) {
			ret += ite->second - ite->first + 1;
			erase(ite->first, ite->second);
			ite = st.erase(ite);
		}
		// last
		if ((ite->first <= r) && (r <= ite->second)) {
			ret += r - ite->first + 1;
			if (ite->second != r) {
				insert(r + 1, ite->second);
				st.emplace(r + 1, ite->second);
			}
			erase(ite->first, ite->second);
			st.erase(ite);
		}
		return ret;
	}
	//T Erase(T x) { return Erase(x, x); }
	// range count
	int size() { return st.size() - 2; }
	// mex
	T Mex(T x = 0) {
		if (!IsCovered(x)) return x;
		auto ite = prev(st.lower_bound({ x + 1, x + 1 }));
		return ite->second + 1;
	}
	// debug
	void Debug() {
		for (auto[l, r] : st)std::cout << l << " " << r << std::endl;
	}
};
namespace RangeAddRangeMax {
	// 区間加算・区間最大値取得(個数付き)
	using S = std::pair<long long, int>;
	using F = long long;
	//const S INF = {8e18;
	S op(S a, S b) {
		if (a.first > b.first)return a;
		else if (a.first < b.first)return b;
		return { a.first,a.second + b.second };
	}
	S e() { return { -8e18,0 }; }
	S mapping(F f, S x) { return { x.first + f,x.second }; }
	F composition(F f, F g) { return f + g; }
	F id() { return 0; }
	using lazy_segtree = atcoder::lazy_segtree<S, op, e, F, mapping, composition, id>;
}
int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int n, q; cin >> n >> q;
	RangeAddRangeMax::lazy_segtree seg(n);
	rep(i, n)seg.set(i, { 0,1 });

	vector<RangeSet<int>> rst(60, RangeSet<int>(INF));
	auto add = [&](int l, int r) -> void {
		//cout << l << " " << r << endl;
		seg.apply(l, r + 1, 1);
	};
	auto del = [&](int l, int r) -> void {
		//cout << l << "_" << r << endl;
		seg.apply(l, r + 1, -1);
	};
	while (q--) {
		int t, l, r; cin >> t >> l >> r;
		l--;
		if (t == 1) {
			int x; cin >> x;
			x--;
			rst[x].Insert(l, r - 1, add, del);
		}
		else if (t == 2) {
			int x; cin >> x;
			x--;
			rst[x].Erase(l, r - 1, add, del);
		}
		else {
			auto val = seg.prod(l, r);
			cout << val.first << " " << val.second << endl;
		}
		//rep(i, n) {
		//	cout << seg.get(i).first << "_";
		//}cout << endl;
	}
	return 0;
}

提出情報

ジャッジ結果