Submission #960875

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
960875	2024-04-11T07:09:04 Z	pragmatist	Segments (IZhO18_segments)	C++17	0 / 100	5000 ms	4372 KB

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(y<l+k-1) {
					res++;
		   	    }
		   		if(x > r-k+1) {
		   			res++;
		   		}
			}
			cout << (int)s.size()-res << "\n";
			ans = (int)s.size()-res;
		}
	}
	return 0;
}

Subtask #1
0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Incorrect	2 ms	348 KB	Output isn't correct
4	Halted	0 ms	0 KB	-

Subtask #2
0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	5072 ms	3184 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #3
0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	55 ms	788 KB	Output is correct
2	Correct	37 ms	600 KB	Output is correct
3	Correct	72 ms	848 KB	Output is correct
4	Correct	32 ms	600 KB	Output is correct
5	Execution timed out	5028 ms	4372 KB	Time limit exceeded
6	Halted	0 ms	0 KB	-