제출 #441748

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
441748		fhvirus	Segments (IZhO18_segments)	C++17	100 / 100	4005 ms	13876 KiB

segments

// Knapsack DP is harder than FFT.
#include<bits/stdc++.h>
using namespace std;
typedef long long ll; typedef pair<int,int> pii; typedef pair<ll,ll> pll;
#define ff first
#define ss second
#define pb emplace_back
#define AI(x) begin(x),end(x)
template<class I>bool chmax(I&a,I b){return a<b?(a=b,true):false;}
template<class I>bool chmin(I&a,I b){return b<a?(a=b,true):false;} 
#ifdef OWO
#define debug(args...) SDF(#args, args)
#define OIU(args...) ostream& operator<<(ostream&O,args)
#define LKJ(S,B,E,F) template<class...T>OIU(S<T...>s){O<<B;int c=0;for(auto i:s)O<<(c++?", ":"")<<F;return O<<E;}
LKJ(vector,'[',']',i)LKJ(deque,'[',']',i)LKJ(set,'{','}',i)LKJ(multiset,'{','}',i)LKJ(unordered_set,'{','}',i)LKJ(map,'{','}',i.ff<<':'<<i.ss)LKJ(unordered_map,'{','}',i.ff<<':'<<i.ss)
template<class...T>void SDF(const char* s,T...a){int c=sizeof...(T);if(!c){cerr<<"\033[1;32mvoid\033[0m\n";return;}(cerr<<"\033[1;32m("<<s<<") = (",...,(cerr<<a<<(--c?", ":")\033[0m\n")));}
template<class T,size_t N>OIU(array<T,N>a){return O<<vector<T>(AI(a));}template<class...T>OIU(pair<T...>p){return O<<'('<<p.ff<<','<<p.ss<<')';}template<class...T>OIU(tuple<T...>t){return O<<'(',apply([&O](T...s){int c=0;(...,(O<<(c++?", ":"")<<s));},t),O<<')';}
#else
#pragma GCC optimize("Ofast")
#define debug(...) ((void)0)
#endif

const int inf = INT_MAX; 
const int kN = 200002;
const int kK = 512;
const int kB = kN / kK + 1;

struct PRE: vector<pii> {
	void build(){
		if(empty()) return;
		sort(AI());
		auto i = begin(), j = next(i);
		for(; j != end(); ++j){
			if(i->ff != j->ff){
				++i; *i = *j;
				i->ss += prev(i)->ss;
			} else i->ss += j->ss;
		}
		erase(next(i), end());
	}
	int que(int p){
		auto i = lower_bound(AI(), pii(p, inf));
		return i == begin() ? 0 : prev(i)->ss;
	}
};

int n, t; 
int tot = 0;
pii seg[kN]; 

int cnt, bnd, bn; 
vector<tuple<int, int, int>> all, tmp;

int mnl[kB], mxl[kB];
PRE sl[kB], sr[kB];
vector<tuple<int, int, int>> ms[kB];

bool cmp(tuple<int, int, int> a, tuple<int, int, int> b){
	auto &[al, ar, av] = a;
	auto &[bl, br, bv] = b;
	return ar - al > br - bl;
}
void build(){
	// rebuild
{
	sort(AI(tmp), cmp);
	all.insert(end(all), AI(tmp));
	auto e = end(all) - tmp.size();
	tmp.clear();
	inplace_merge(begin(all), e, end(all), cmp);
}

	int n = all.size();
	bn = n / kK + 1; 

	for(int i = 0; i < bn; ++i){
		sl[i].clear();
		sr[i].clear();
		ms[i].clear();
	}
	for(int i = 0, j = 0, k = 0; i < n; ++i){ 
		auto [l, r, v] = all[i];
		sl[j].pb(l, v);
		sr[j].pb(r, v);
		ms[j].pb(l, r, v);
		++k;
		if(k >= kK) k = 0, ++j;
	}
	for(int i = 0; i < bn; ++i){
		if(ms[i].empty()){
			mxl[i] = 0;
			mnl[i] = inf;
			continue;
		}
		sl[i].build();
		sr[i].build();
		{
			auto [l, r, v] = ms[i].front();
			mxl[i] = r - l + 1;
		}
		{
			auto [l, r, v] = ms[i].back();
			mnl[i] = r - l + 1;
		}
	}
}

void insert(int l, int r){
	seg[++tot] = pii(l, r);
	tmp.pb(l, r, 1); ++cnt;
}
void remove(int id){
	auto [l, r] = seg[id];
	tmp.pb(l, r, -1); ++cnt;
}
int query(int ql, int qr, int k){ 
	if(cnt >= bnd){
		cnt = 0;
		build();
	}

	int ans = 0;
	for(int i = 0; i < bn; ++i){
		if(mxl[i] < k) break;
		if(mnl[i] < k){
			for(auto [l, r, v]: ms[i]){
				if(r - l + 1 < k) continue;
				if(l <= qr - k + 1) ans += v;
				if(r <= ql + k - 2) ans -= v;
			}
			break;
		}
		ans += sl[i].que(qr - k + 1) - sr[i].que(ql + k - 2);
	}
	for(auto [l, r, v]: tmp){
		if(r - l + 1 < k) continue;
		if(l <= qr - k + 1) ans += v;
		if(r <= ql + k - 2) ans -= v;
	}
	return ans;
}

signed main(){
	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin >> n >> t;
	bnd = ceil(sqrt(n));
	int lastans = 0;
	for(int cmd, a, b, k, id, i = 0; i < n; ++i){
		cin >> cmd;
		if(cmd == 1){
			cin >> a >> b;
			int l = (a ^ (lastans * t));
			int r = (b ^ (lastans * t));
			if(l > r) swap(l, r);
			insert(l, r); 
		} else if(cmd == 2){
			cin >> id;
			remove(id);
		} else if(cmd == 3){
			cin >> a >> b >> k;
			int l = (a ^ (lastans * t));
			int r = (b ^ (lastans * t));
			if(l > r) swap(l, r);
			lastans = query(l, r, k);
			cout << lastans << '\n';
		}
	}
	return 0;
}

• Subtask 1: 7 / 7
• Subtask 2: 15 / 15
• Subtask 3: 16 / 16
• Subtask 4: 17 / 17
• Subtask 5: 20 / 20
• Subtask 6: 25 / 25