oj.uz

답안 #908904

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
908904 2024-01-17T01:36:48 Z daoquanglinh2007 Segments (IZhO18_segments) C++17
59 / 100
 1197 ms 33088 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define pii pair <int, int>
#define fi first
#define se second
#define mp make_pair
#define isz(a) (int)(a).size()
 
const int NM = 2e5, BL = 1e4, inf = INT_MAX;
 
int n, t, type[NM+5], a[NM+5], b[NM+5], id[NM+5], k[NM+5], lastans = 0;
int num = 0, l[NM+5], r[NM+5];
bool del[NM+5];
int sz, sz1, sz2;
vector <pii> v;
vector <int> arr, arr1, arr2;
vector <pii> bit1[NM+5], bit2[NM+5];
int cnt[NM+5];
 
void update(int n, vector <pii> bit[NM+5], int x, int y){
	while (x <= n){
		if (bit[x].empty()){
			bit[x].push_back(mp(y, 1));
		}
		else if (bit[x].back().fi < y){
			bit[x].push_back(mp(y, bit[x].back().se+1));
		}
		else{
			bit[x].back().se++;
		}
		x += x & (-x);
	}
}
 
int get(vector <pii> bit[NM+5], int x, int y){
	int res = 0, z;
	while (x > 0){
		if (bit[x].empty() || y < bit[x][0].fi);
		else if (y >= bit[x].back().fi){
			res += bit[x].back().se;
		}
		else{
			z = upper_bound(bit[x].begin(), bit[x].end(), mp(y, +inf))-bit[x].begin();
			res += bit[x][z-1].se;
		}
		x -= x & (-x);
	}
	return res;
}
 
void process(){
	v.clear();
	arr.clear();
	arr1.clear();
	arr2.clear();
	for (int i = 1; i <= num; i++)
		if (!del[i]){
			v.push_back(mp(l[i], r[i]));
			arr.push_back(-(r[i]-l[i]+1));
			arr1.push_back(-l[i]);
			arr2.push_back(r[i]);
		}
	sort(v.begin(), v.end(), [&](pii a, pii b){
		return a.se-a.fi+1 > b.se-b.fi+1;
	});	
	sort(arr.begin(), arr.end()); arr.erase(unique(arr.begin(), arr.end()), arr.end());
	sort(arr1.begin(), arr1.end()); arr1.erase(unique(arr1.begin(), arr1.end()), arr1.end());
	sort(arr2.begin(), arr2.end()); arr2.erase(unique(arr2.begin(), arr2.end()), arr2.end());
	
	sz = isz(arr), sz1 = isz(arr1), sz2 = isz(arr2);
	
	assert(sz <= NM);
	assert(sz1 <= NM);
	assert(sz2 <= NM);
	
	for (int i = 1; i <= sz1; i++) bit1[i].clear();
	for (int i = 1; i <= sz2; i++) bit2[i].clear();
	
	memset(cnt, 0, sizeof(cnt));
	int j = 0;
	for (pii P : v){
		update(sz1, bit1, lower_bound(arr1.begin(), arr1.end(), -P.fi)-arr1.begin()+1, -(P.se-P.fi+1));
		update(sz2, bit2, lower_bound(arr2.begin(), arr2.end(), P.se)-arr2.begin()+1, -(P.se-P.fi+1));
		while (arr[j] < -(P.se-P.fi+1)) j++;
		cnt[j+1]++;
	}
	
	for (int i = 1; i <= sz; i++) cnt[i] += cnt[i-1];
}
 
int find_pos(vector <int> &v, int x){
	if (v.empty()) return 0;
	if (x < v[0]) return 0;
	if (x >= v.back()) return isz(v);
	return upper_bound(v.begin(), v.end(), x)-v.begin();
}
 
int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	
	cin >> n >> t;
	for (int i = 0; i < n; i++){
		cin >> type[i];
		if (type[i] == 1){
			cin >> a[i] >> b[i];
			a[i] ^= (t*lastans), b[i] ^= (t*lastans);
			if (a[i] > b[i]) swap(a[i], b[i]);
			l[++num] = a[i], r[num] = b[i];
		}
		else if (type[i] == 2){
			cin >> id[i];
			del[id[i]] = 1;
		}
		else{
			cin >> a[i] >> b[i] >> k[i];
			a[i] ^= (t*lastans), b[i] ^= (t*lastans);
			if (a[i] > b[i]) swap(a[i], b[i]);
			if (b[i]-a[i]+1 < k[i]) lastans = 0;
			else{
				lastans = cnt[find_pos(arr, -k[i])]-get(bit1, find_pos(arr1, -b[i]+k[i]-2), -k[i])
			          -get(bit2, find_pos(arr2, a[i] < +inf-(k[i]-2) ? a[i]+k[i]-2 : +inf), -k[i]);
			          
				for (int j = i-i%BL; j < i; j++){
					if (type[j] == 1){
						int lo = max(a[j], a[i]), hi = min(b[j], b[i]);
						if (hi-lo+1 >= k[i]) lastans++;
					}
					else if (type[j] == 2){
						int lo = max(l[id[j]], a[i]), hi = min(r[id[j]], b[i]);
						if (hi-lo+1 >= k[i]) lastans--;
					}
				}
			}
			cout << lastans << '\n';
		}
		if (i%BL == BL-1 && i < n-1){
			process();
		}
	}
	return 0;
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 12632 KB Output is correct
2 Correct 3 ms 12636 KB Output is correct
3 Correct 27 ms 12832 KB Output is correct
4 Correct 30 ms 12636 KB Output is correct
5 Correct 22 ms 12632 KB Output is correct
6 Correct 26 ms 12636 KB Output is correct
7 Correct 26 ms 12636 KB Output is correct
8 Correct 17 ms 12636 KB Output is correct
9 Correct 21 ms 12632 KB Output is correct
10 Correct 8 ms 12636 KB Output is correct
11 Correct 32 ms 12820 KB Output is correct
12 Correct 34 ms 12636 KB Output is correct
13 Correct 9 ms 12632 KB Output is correct
14 Correct 19 ms 12836 KB Output is correct
15 Correct 26 ms 12812 KB Output is correct
16 Correct 27 ms 12648 KB Output is correct
17 Correct 25 ms 12632 KB Output is correct
18 Correct 11 ms 12632 KB Output is correct
19 Correct 24 ms 12632 KB Output is correct
20 Correct 24 ms 12636 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 556 ms 23976 KB Output is correct
2 Correct 534 ms 24336 KB Output is correct
3 Correct 530 ms 24668 KB Output is correct
4 Correct 636 ms 25044 KB Output is correct
5 Correct 552 ms 33068 KB Output is correct
6 Correct 504 ms 32652 KB Output is correct
7 Correct 510 ms 23752 KB Output is correct
8 Correct 557 ms 24024 KB Output is correct
9 Correct 487 ms 23992 KB Output is correct
10 Correct 479 ms 17780 KB Output is correct
11 Correct 584 ms 19008 KB Output is correct
12 Correct 560 ms 28868 KB Output is correct

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1197 ms 14244 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1089 ms 14044 KB Output is correct
2 Correct 1056 ms 14148 KB Output is correct
3 Correct 1100 ms 14156 KB Output is correct
4 Correct 1086 ms 14184 KB Output is correct
5 Correct 592 ms 30268 KB Output is correct
6 Correct 573 ms 16660 KB Output is correct
7 Correct 619 ms 31724 KB Output is correct
8 Correct 528 ms 17892 KB Output is correct
9 Correct 1016 ms 21024 KB Output is correct
10 Correct 749 ms 29204 KB Output is correct
11 Correct 1092 ms 16476 KB Output is correct
12 Correct 453 ms 33088 KB Output is correct
13 Correct 901 ms 24924 KB Output is correct
14 Correct 1016 ms 19696 KB Output is correct
15 Correct 543 ms 31428 KB Output is correct
16 Correct 805 ms 26180 KB Output is correct
17 Correct 507 ms 24204 KB Output is correct
18 Correct 507 ms 24084 KB Output is correct
19 Correct 578 ms 24220 KB Output is correct
20 Correct 499 ms 24268 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 12632 KB Output is correct
2 Correct 3 ms 12636 KB Output is correct
3 Correct 27 ms 12832 KB Output is correct
4 Correct 30 ms 12636 KB Output is correct
5 Correct 22 ms 12632 KB Output is correct
6 Correct 26 ms 12636 KB Output is correct
7 Correct 26 ms 12636 KB Output is correct
8 Correct 17 ms 12636 KB Output is correct
9 Correct 21 ms 12632 KB Output is correct
10 Correct 8 ms 12636 KB Output is correct
11 Correct 32 ms 12820 KB Output is correct
12 Correct 34 ms 12636 KB Output is correct
13 Correct 9 ms 12632 KB Output is correct
14 Correct 19 ms 12836 KB Output is correct
15 Correct 26 ms 12812 KB Output is correct
16 Correct 27 ms 12648 KB Output is correct
17 Correct 25 ms 12632 KB Output is correct
18 Correct 11 ms 12632 KB Output is correct
19 Correct 24 ms 12632 KB Output is correct
20 Correct 24 ms 12636 KB Output is correct
21 Correct 556 ms 23976 KB Output is correct
22 Correct 534 ms 24336 KB Output is correct
23 Correct 530 ms 24668 KB Output is correct
24 Correct 636 ms 25044 KB Output is correct
25 Correct 552 ms 33068 KB Output is correct
26 Correct 504 ms 32652 KB Output is correct
27 Correct 510 ms 23752 KB Output is correct
28 Correct 557 ms 24024 KB Output is correct
29 Correct 487 ms 23992 KB Output is correct
30 Correct 479 ms 17780 KB Output is correct
31 Correct 584 ms 19008 KB Output is correct
32 Correct 560 ms 28868 KB Output is correct
33 Correct 1089 ms 14044 KB Output is correct
34 Correct 1056 ms 14148 KB Output is correct
35 Correct 1100 ms 14156 KB Output is correct
36 Correct 1086 ms 14184 KB Output is correct
37 Correct 592 ms 30268 KB Output is correct
38 Correct 573 ms 16660 KB Output is correct
39 Correct 619 ms 31724 KB Output is correct
40 Correct 528 ms 17892 KB Output is correct
41 Correct 1016 ms 21024 KB Output is correct
42 Correct 749 ms 29204 KB Output is correct
43 Correct 1092 ms 16476 KB Output is correct
44 Correct 453 ms 33088 KB Output is correct
45 Correct 901 ms 24924 KB Output is correct
46 Correct 1016 ms 19696 KB Output is correct
47 Correct 543 ms 31428 KB Output is correct
48 Correct 805 ms 26180 KB Output is correct
49 Correct 507 ms 24204 KB Output is correct
50 Correct 507 ms 24084 KB Output is correct
51 Correct 578 ms 24220 KB Output is correct
52 Correct 499 ms 24268 KB Output is correct
53 Correct 1092 ms 14400 KB Output is correct
54 Correct 1076 ms 14540 KB Output is correct
55 Correct 1107 ms 14148 KB Output is correct
56 Correct 1101 ms 14068 KB Output is correct
57 Correct 572 ms 20188 KB Output is correct
58 Correct 481 ms 15904 KB Output is correct
59 Correct 620 ms 26060 KB Output is correct
60 Correct 504 ms 15440 KB Output is correct
61 Correct 842 ms 25112 KB Output is correct
62 Correct 597 ms 31672 KB Output is correct
63 Correct 486 ms 32940 KB Output is correct
64 Correct 590 ms 32572 KB Output is correct
65 Correct 1077 ms 17580 KB Output is correct
66 Correct 1117 ms 16664 KB Output is correct
67 Correct 819 ms 25700 KB Output is correct
68 Correct 934 ms 23024 KB Output is correct
69 Correct 545 ms 23992 KB Output is correct
70 Correct 569 ms 23580 KB Output is correct
71 Correct 505 ms 24172 KB Output is correct
72 Correct 528 ms 23936 KB Output is correct
73 Correct 1042 ms 18324 KB Output is correct
74 Correct 944 ms 22980 KB Output is correct
75 Correct 402 ms 32364 KB Output is correct
76 Correct 487 ms 32708 KB Output is correct
77 Correct 1066 ms 14136 KB Output is correct
78 Correct 1088 ms 14388 KB Output is correct
79 Correct 1098 ms 14116 KB Output is correct
80 Correct 1066 ms 14016 KB Output is correct
81 Correct 975 ms 22732 KB Output is correct
82 Correct 1052 ms 18340 KB Output is correct
83 Correct 1086 ms 16312 KB Output is correct
84 Correct 961 ms 22892 KB Output is correct
85 Correct 803 ms 25820 KB Output is correct
86 Correct 866 ms 28312 KB Output is correct
87 Correct 1065 ms 21312 KB Output is correct
88 Correct 1137 ms 16224 KB Output is correct

Subtask #6
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 12632 KB Output is correct
2 Correct 3 ms 12636 KB Output is correct
3 Correct 27 ms 12832 KB Output is correct
4 Correct 30 ms 12636 KB Output is correct
5 Correct 22 ms 12632 KB Output is correct
6 Correct 26 ms 12636 KB Output is correct
7 Correct 26 ms 12636 KB Output is correct
8 Correct 17 ms 12636 KB Output is correct
9 Correct 21 ms 12632 KB Output is correct
10 Correct 8 ms 12636 KB Output is correct
11 Correct 32 ms 12820 KB Output is correct
12 Correct 34 ms 12636 KB Output is correct
13 Correct 9 ms 12632 KB Output is correct
14 Correct 19 ms 12836 KB Output is correct
15 Correct 26 ms 12812 KB Output is correct
16 Correct 27 ms 12648 KB Output is correct
17 Correct 25 ms 12632 KB Output is correct
18 Correct 11 ms 12632 KB Output is correct
19 Correct 24 ms 12632 KB Output is correct
20 Correct 24 ms 12636 KB Output is correct
21 Correct 556 ms 23976 KB Output is correct
22 Correct 534 ms 24336 KB Output is correct
23 Correct 530 ms 24668 KB Output is correct
24 Correct 636 ms 25044 KB Output is correct
25 Correct 552 ms 33068 KB Output is correct
26 Correct 504 ms 32652 KB Output is correct
27 Correct 510 ms 23752 KB Output is correct
28 Correct 557 ms 24024 KB Output is correct
29 Correct 487 ms 23992 KB Output is correct
30 Correct 479 ms 17780 KB Output is correct
31 Correct 584 ms 19008 KB Output is correct
32 Correct 560 ms 28868 KB Output is correct
33 Incorrect 1197 ms 14244 KB Output isn't correct
34 Halted 0 ms 0 KB -