Submission #682536

#TimeUsernameProblemLanguageResultExecution timeMemory
682536phoenixSegments (IZhO18_segments)C++17
7 / 100
5060 ms3672 KiB
#include<bits/stdc++.h>

using namespace std;
vector<bool> us;
vector<pair<int, int>> v;
int lastans;
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);cout.tie(0);
	us.push_back(0);
	v.push_back({0, 0});
	
	int n, t;
	cin >> n >> t;
	for(int i = 1; i <= n; i++) {
		int type;
		cin >> type;
		if(type == 1) {
			int l, r;
			cin >> l >> r;
			l = (l ^ (t * lastans));
			r = (r ^ (t * lastans));
			if(l > r) swap(l, r);

			v.push_back({l, r});
			us.push_back(1);
		}
		if(type == 2) {
			int id;
			cin >> id;
			us[id] = 0; 
		}
		if(type == 3) {
			int l, r, k;
			cin >> l >> r >> k;
			l = (l ^ (t * lastans));
			r = (r ^ (t * lastans));
			if(l > r) swap(l, r);
			lastans = 0;
			for(int i = 0; i < (int)v.size(); i++) {
				if(!us[i]) continue;
				if(min(r, v[i].second) - max(l, v[i].first) + 1 >= k) 
					lastans++;
			}
			cout << lastans << '\n';
		}
	}
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...