oj.uz

Submission #960882

# Submission time Handle Problem Language Result Execution time Memory
960882 2024-04-11T07:21:34 Z pragmatist Segments (IZhO18_segments) C++17
7 / 100
 5000 ms 4672 KB 
#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-x+1<k) {
					res++;
					continue;
				}
				if(y<l+k-1) {
					assert(x<=l);
					res++;
				}
		   		if(x > r-k+1) {
		   			res++;
		   		}
			}
			cout << (int)s.size()-res << "\n";
			ans = (int)s.size()-res;
		}
	}
	return 0;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 44 ms 692 KB Output is correct
6 Correct 57 ms 680 KB Output is correct
7 Correct 10 ms 344 KB Output is correct
8 Correct 26 ms 624 KB Output is correct
9 Correct 26 ms 604 KB Output is correct
10 Correct 12 ms 604 KB Output is correct
11 Correct 73 ms 600 KB Output is correct
12 Correct 74 ms 604 KB Output is correct
13 Correct 14 ms 604 KB Output is correct
14 Correct 26 ms 608 KB Output is correct
15 Correct 2 ms 348 KB Output is correct
16 Correct 2 ms 344 KB Output is correct
17 Correct 19 ms 348 KB Output is correct
18 Correct 19 ms 684 KB Output is correct
19 Correct 21 ms 544 KB Output is correct
20 Correct 20 ms 344 KB Output is correct

Subtask #2
0 / 15.0

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

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 60 ms 676 KB Output is correct
2 Correct 33 ms 644 KB Output is correct
3 Correct 105 ms 876 KB Output is correct
4 Correct 36 ms 600 KB Output is correct
5 Execution timed out 5048 ms 4384 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 604 KB Output is correct
2 Correct 41 ms 820 KB Output is correct
3 Correct 40 ms 792 KB Output is correct
4 Correct 52 ms 616 KB Output is correct
5 Execution timed out 5027 ms 4672 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 44 ms 692 KB Output is correct
6 Correct 57 ms 680 KB Output is correct
7 Correct 10 ms 344 KB Output is correct
8 Correct 26 ms 624 KB Output is correct
9 Correct 26 ms 604 KB Output is correct
10 Correct 12 ms 604 KB Output is correct
11 Correct 73 ms 600 KB Output is correct
12 Correct 74 ms 604 KB Output is correct
13 Correct 14 ms 604 KB Output is correct
14 Correct 26 ms 608 KB Output is correct
15 Correct 2 ms 348 KB Output is correct
16 Correct 2 ms 344 KB Output is correct
17 Correct 19 ms 348 KB Output is correct
18 Correct 19 ms 684 KB Output is correct
19 Correct 21 ms 544 KB Output is correct
20 Correct 20 ms 344 KB Output is correct
21 Execution timed out 5015 ms 3212 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 44 ms 692 KB Output is correct
6 Correct 57 ms 680 KB Output is correct
7 Correct 10 ms 344 KB Output is correct
8 Correct 26 ms 624 KB Output is correct
9 Correct 26 ms 604 KB Output is correct
10 Correct 12 ms 604 KB Output is correct
11 Correct 73 ms 600 KB Output is correct
12 Correct 74 ms 604 KB Output is correct
13 Correct 14 ms 604 KB Output is correct
14 Correct 26 ms 608 KB Output is correct
15 Correct 2 ms 348 KB Output is correct
16 Correct 2 ms 344 KB Output is correct
17 Correct 19 ms 348 KB Output is correct
18 Correct 19 ms 684 KB Output is correct
19 Correct 21 ms 544 KB Output is correct
20 Correct 20 ms 344 KB Output is correct
21 Execution timed out 5015 ms 3212 KB Time limit exceeded
22 Halted 0 ms 0 KB -