oj.uz

Submission #960855

# Submission time Handle Problem Language Result Execution time Memory
960855 2024-04-11T06:34:09 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(x<=l) {
		   			res += (y<l+k-1);
		   		}
		   		if(y>=r) {
		   			res += (x>r-k+1);
		   		}
		   		if(x > l && x<=r-k+1) {
		   			res += (y<x+k-1);
		   		}
		   		if(x > r-k+1 && x<r) {
		   			res += (y<r);
		   		}
			}
			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 1 ms 600 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 36 ms 856 KB Output is correct
6 Correct 51 ms 604 KB Output is correct
7 Correct 8 ms 344 KB Output is correct
8 Correct 20 ms 604 KB Output is correct
9 Correct 21 ms 604 KB Output is correct
10 Correct 9 ms 604 KB Output is correct
11 Correct 55 ms 348 KB Output is correct
12 Correct 60 ms 600 KB Output is correct
13 Correct 12 ms 604 KB Output is correct
14 Correct 20 ms 608 KB Output is correct
15 Correct 2 ms 348 KB Output is correct
16 Correct 2 ms 348 KB Output is correct
17 Correct 14 ms 348 KB Output is correct
18 Correct 15 ms 536 KB Output is correct
19 Correct 14 ms 556 KB Output is correct
20 Correct 14 ms 344 KB Output is correct

Subtask #2
0 / 15.0

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

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 760 KB Output is correct
2 Correct 35 ms 600 KB Output is correct
3 Correct 101 ms 732 KB Output is correct
4 Correct 39 ms 800 KB Output is correct
5 Execution timed out 5053 ms 4368 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 784 KB Output is correct
2 Correct 40 ms 600 KB Output is correct
3 Correct 41 ms 600 KB Output is correct
4 Correct 50 ms 700 KB Output is correct
5 Execution timed out 5020 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 1 ms 600 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 36 ms 856 KB Output is correct
6 Correct 51 ms 604 KB Output is correct
7 Correct 8 ms 344 KB Output is correct
8 Correct 20 ms 604 KB Output is correct
9 Correct 21 ms 604 KB Output is correct
10 Correct 9 ms 604 KB Output is correct
11 Correct 55 ms 348 KB Output is correct
12 Correct 60 ms 600 KB Output is correct
13 Correct 12 ms 604 KB Output is correct
14 Correct 20 ms 608 KB Output is correct
15 Correct 2 ms 348 KB Output is correct
16 Correct 2 ms 348 KB Output is correct
17 Correct 14 ms 348 KB Output is correct
18 Correct 15 ms 536 KB Output is correct
19 Correct 14 ms 556 KB Output is correct
20 Correct 14 ms 344 KB Output is correct
21 Execution timed out 5038 ms 3452 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 36 ms 856 KB Output is correct
6 Correct 51 ms 604 KB Output is correct
7 Correct 8 ms 344 KB Output is correct
8 Correct 20 ms 604 KB Output is correct
9 Correct 21 ms 604 KB Output is correct
10 Correct 9 ms 604 KB Output is correct
11 Correct 55 ms 348 KB Output is correct
12 Correct 60 ms 600 KB Output is correct
13 Correct 12 ms 604 KB Output is correct
14 Correct 20 ms 608 KB Output is correct
15 Correct 2 ms 348 KB Output is correct
16 Correct 2 ms 348 KB Output is correct
17 Correct 14 ms 348 KB Output is correct
18 Correct 15 ms 536 KB Output is correct
19 Correct 14 ms 556 KB Output is correct
20 Correct 14 ms 344 KB Output is correct
21 Execution timed out 5038 ms 3452 KB Time limit exceeded
22 Halted 0 ms 0 KB -