| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1109308 | Muhammet | Segments (IZhO18_segments) | C++17 | 0 ms | 0 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define sz(s) (int)s.size()
#define ff first
#define ss second
int main(){
	ios::sync_with_stdio(false); cin.tie(nullptr);
	int n, t, ans = 0, ind = 0;
	cin >> n >> t;
	vector <pair<int,int>> v;
	vector <int> vis(n+1,0);
	for(int i = 1; i <= n; i++){
		int t1;
		cin >> t1;
		if(t1 == 1){
			int a, b;
			cin >> a >> b;
			ind++;
			a = (a ^ (t * ans));
			b = (b ^ (t * ans));
			if(a > b) swap(a,b);
			v.push_back({a,b});
		}
		if(t1 == 2){
			int id, in = 0;
			cin >> id;
			vis[--id] = true;
		}
		if(t1 == 3){
			int a, b, k;
			cin >> a >> b >> k;
			a = (a ^ (t * ans));
			b = (b ^ (t * ans));
			if(a > b) swap(a,b);
			ans = 0;
			for(int j = 0; j < sz(v); j++){
				if(vis[j]) continue;
				ans += ((min(b,v[j].ss) - max(a,v[j].ff)) >= k-1);
			}
			cout << ans << '\n';
		}
	}
}#include <bits/stdc++.h>
using namespace std;
#define sz(s) (int)s.size()
#define ff first
#define ss second
int main(){
	ios::sync_with_stdio(false); cin.tie(nullptr);
	int n, t, ans = 0, ind = 0;
	cin >> n >> t;
	vector <pair<int,int>> v;
	vector <int> vis(n+1,0);
	for(int i = 1; i <= n; i++){
		int t1;
		cin >> t1;
		if(t1 == 1){
			int a, b;
			cin >> a >> b;
			ind++;
			a = (a ^ (t * ans));
			b = (b ^ (t * ans));
			if(a > b) swap(a,b);
			v.push_back({a,b});
		}
		if(t1 == 2){
			int id, in = 0;
			cin >> id;
			vis[--id] = true;
		}
		if(t1 == 3){
			int a, b, k;
			cin >> a >> b >> k;
			a = (a ^ (t * ans));
			b = (b ^ (t * ans));
			if(a > b) swap(a,b);
			ans = 0;
			for(int j = 0; j < sz(v); j++){
				if(vis[j]) continue;
				ans += ((min(b,v[j].ss) - max(a,v[j].ff)) >= k-1);
			}
			cout << ans << '\n';
		}
	}
}
