제출 #960843

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
960843		pragmatist	Segments (IZhO18_segments)	C++17	0 / 100	5079 ms	4336 KiB

segments

#include <bits/stdc++.h>

using namespace std;

const int N = 2e5+7;

int n, t;
pair<int, int> a[N];

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
	cin >> n >> t;
	int ans = 0, timer = 0;
	multiset<pair<int, int> > s;	
	for(int i = 1; i <= n; ++i) {
		char tp;
		cin >> tp;
		if(tp == '1') {
			int l, r;
			cin >> l >> r;
			l = (l^(t*ans));
			r = (r^(t*ans));
			if(l>r) {
				swap(l, r);
			}
			a[++timer] = {l, r};
			s.insert({l, r});
		} else if(tp == '2') {
			int id;
			cin >> id;
			auto it = s.find(a[id]);
			s.erase(it);
		} else {
			int l, r, k;
			cin >> l >> r >> k;
			l = (l^(t*ans));
			r = (r^(t*ans));
			if(l>r) {
				swap(l, r);
			}
			if(r-l+1<k) {
				cout << (ans=0) << "\n";
				continue;
			}
			int res = 0;
			for(auto [x, y] : s) {
		   		if(x<=l) {
		   			res += (y<l+k-1);
		   		}
		   		if(y>=r) {
		   			res += (x>r-k+1);
		   		}
		   		if(y<r) {
		   			res += (y-x+1<k);
		   		}
			}
			cout << (int)s.size()-res << "\n";
			ans = (int)s.size()-res;
		}
	}
	return 0;
}

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