oj.uz

답안 #960881

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
960881 2024-04-11T07:20:52 Z pragmatist Segments (IZhO18_segments) C++17
7 / 100
 5000 ms 4668 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(x <= l) {
					res += (y<l+k-1);
				}
		   		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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 2 ms 344 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 40 ms 696 KB Output is correct
6 Correct 54 ms 604 KB Output is correct
7 Correct 8 ms 348 KB Output is correct
8 Correct 23 ms 620 KB Output is correct
9 Correct 20 ms 756 KB Output is correct
10 Correct 12 ms 712 KB Output is correct
11 Correct 66 ms 592 KB Output is correct
12 Correct 62 ms 600 KB Output is correct
13 Correct 14 ms 604 KB Output is correct
14 Correct 22 ms 600 KB Output is correct
15 Correct 2 ms 348 KB Output is correct
16 Correct 2 ms 348 KB Output is correct
17 Correct 16 ms 348 KB Output is correct
18 Correct 16 ms 604 KB Output is correct
19 Correct 14 ms 348 KB Output is correct
20 Correct 15 ms 344 KB Output is correct

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5041 ms 3208 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 604 KB Output is correct
2 Correct 32 ms 732 KB Output is correct
3 Correct 73 ms 768 KB Output is correct
4 Correct 33 ms 600 KB Output is correct
5 Execution timed out 5012 ms 4632 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 44 ms 580 KB Output is correct
2 Correct 38 ms 592 KB Output is correct
3 Correct 37 ms 604 KB Output is correct
4 Correct 47 ms 724 KB Output is correct
5 Execution timed out 5099 ms 4668 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 2 ms 344 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 40 ms 696 KB Output is correct
6 Correct 54 ms 604 KB Output is correct
7 Correct 8 ms 348 KB Output is correct
8 Correct 23 ms 620 KB Output is correct
9 Correct 20 ms 756 KB Output is correct
10 Correct 12 ms 712 KB Output is correct
11 Correct 66 ms 592 KB Output is correct
12 Correct 62 ms 600 KB Output is correct
13 Correct 14 ms 604 KB Output is correct
14 Correct 22 ms 600 KB Output is correct
15 Correct 2 ms 348 KB Output is correct
16 Correct 2 ms 348 KB Output is correct
17 Correct 16 ms 348 KB Output is correct
18 Correct 16 ms 604 KB Output is correct
19 Correct 14 ms 348 KB Output is correct
20 Correct 15 ms 344 KB Output is correct
21 Execution timed out 5041 ms 3208 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 2 ms 344 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 40 ms 696 KB Output is correct
6 Correct 54 ms 604 KB Output is correct
7 Correct 8 ms 348 KB Output is correct
8 Correct 23 ms 620 KB Output is correct
9 Correct 20 ms 756 KB Output is correct
10 Correct 12 ms 712 KB Output is correct
11 Correct 66 ms 592 KB Output is correct
12 Correct 62 ms 600 KB Output is correct
13 Correct 14 ms 604 KB Output is correct
14 Correct 22 ms 600 KB Output is correct
15 Correct 2 ms 348 KB Output is correct
16 Correct 2 ms 348 KB Output is correct
17 Correct 16 ms 348 KB Output is correct
18 Correct 16 ms 604 KB Output is correct
19 Correct 14 ms 348 KB Output is correct
20 Correct 15 ms 344 KB Output is correct
21 Execution timed out 5041 ms 3208 KB Time limit exceeded
22 Halted 0 ms 0 KB -