oj.uz

답안 #908909

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
908909 2024-01-17T01:47:26 Z daoquanglinh2007 Segments (IZhO18_segments) C++17
75 / 100
 4719 ms 42468 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 = 2e4, inf = 2e9+11;
 
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 12636 KB Output is correct
2 Correct 3 ms 12784 KB Output is correct
3 Correct 26 ms 12888 KB Output is correct
4 Correct 27 ms 12636 KB Output is correct
5 Correct 20 ms 12836 KB Output is correct
6 Correct 26 ms 12840 KB Output is correct
7 Correct 27 ms 12632 KB Output is correct
8 Correct 18 ms 12632 KB Output is correct
9 Correct 20 ms 12636 KB Output is correct
10 Correct 11 ms 12636 KB Output is correct
11 Correct 36 ms 12632 KB Output is correct
12 Correct 37 ms 12888 KB Output is correct
13 Correct 8 ms 12636 KB Output is correct
14 Correct 19 ms 12752 KB Output is correct
15 Correct 28 ms 12808 KB Output is correct
16 Correct 26 ms 12812 KB Output is correct
17 Correct 23 ms 12636 KB Output is correct
18 Correct 11 ms 12632 KB Output is correct
19 Correct 27 ms 12636 KB Output is correct
20 Correct 24 ms 12632 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 949 ms 24036 KB Output is correct
2 Correct 952 ms 24152 KB Output is correct
3 Correct 962 ms 24540 KB Output is correct
4 Correct 798 ms 25264 KB Output is correct
5 Correct 579 ms 30660 KB Output is correct
6 Correct 430 ms 31696 KB Output is correct
7 Correct 931 ms 23852 KB Output is correct
8 Correct 947 ms 24308 KB Output is correct
9 Correct 991 ms 24112 KB Output is correct
10 Correct 797 ms 18036 KB Output is correct
11 Correct 1031 ms 19328 KB Output is correct
12 Correct 856 ms 29104 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2580 ms 14180 KB Output is correct
2 Correct 2549 ms 14020 KB Output is correct
3 Correct 2578 ms 14260 KB Output is correct
4 Correct 2591 ms 14400 KB Output is correct
5 Correct 835 ms 29652 KB Output is correct
6 Correct 486 ms 25992 KB Output is correct
7 Correct 799 ms 28968 KB Output is correct
8 Correct 593 ms 30956 KB Output is correct
9 Correct 504 ms 32320 KB Output is correct
10 Correct 1255 ms 26384 KB Output is correct
11 Correct 2548 ms 14944 KB Output is correct
12 Correct 1201 ms 29412 KB Output is correct
13 Correct 1267 ms 25176 KB Output is correct
14 Correct 1888 ms 19596 KB Output is correct
15 Correct 1959 ms 19004 KB Output is correct
16 Correct 2094 ms 17164 KB Output is correct
17 Correct 959 ms 24116 KB Output is correct
18 Correct 952 ms 24076 KB Output is correct
19 Correct 1000 ms 24052 KB Output is correct
20 Correct 970 ms 24320 KB Output is correct
21 Correct 2559 ms 15108 KB Output is correct
22 Correct 1970 ms 21592 KB Output is correct
23 Correct 1701 ms 23688 KB Output is correct
24 Correct 1901 ms 21604 KB Output is correct
25 Correct 2558 ms 14192 KB Output is correct
26 Correct 2565 ms 14308 KB Output is correct
27 Correct 2587 ms 14152 KB Output is correct
28 Correct 2556 ms 14104 KB Output is correct
29 Correct 1564 ms 24784 KB Output is correct
30 Correct 1549 ms 24716 KB Output is correct
31 Correct 502 ms 30408 KB Output is correct
32 Correct 1359 ms 26480 KB Output is correct
33 Correct 1279 ms 25180 KB Output is correct
34 Correct 2001 ms 18568 KB Output is correct
35 Correct 1542 ms 23040 KB Output is correct
36 Correct 1143 ms 26524 KB Output is correct

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2346 ms 14224 KB Output is correct
2 Correct 2334 ms 14256 KB Output is correct
3 Correct 2404 ms 14644 KB Output is correct
4 Correct 2357 ms 14176 KB Output is correct
5 Correct 595 ms 31052 KB Output is correct
6 Correct 1048 ms 16856 KB Output is correct
7 Correct 538 ms 31204 KB Output is correct
8 Correct 724 ms 18104 KB Output is correct
9 Correct 1821 ms 20864 KB Output is correct
10 Correct 999 ms 29120 KB Output is correct
11 Correct 2238 ms 16724 KB Output is correct
12 Correct 339 ms 30144 KB Output is correct
13 Correct 1396 ms 25036 KB Output is correct
14 Correct 1998 ms 19672 KB Output is correct
15 Correct 525 ms 30360 KB Output is correct
16 Correct 1278 ms 25920 KB Output is correct
17 Correct 964 ms 24224 KB Output is correct
18 Correct 967 ms 24180 KB Output is correct
19 Correct 939 ms 24092 KB Output is correct
20 Correct 912 ms 24136 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 12636 KB Output is correct
2 Correct 3 ms 12784 KB Output is correct
3 Correct 26 ms 12888 KB Output is correct
4 Correct 27 ms 12636 KB Output is correct
5 Correct 20 ms 12836 KB Output is correct
6 Correct 26 ms 12840 KB Output is correct
7 Correct 27 ms 12632 KB Output is correct
8 Correct 18 ms 12632 KB Output is correct
9 Correct 20 ms 12636 KB Output is correct
10 Correct 11 ms 12636 KB Output is correct
11 Correct 36 ms 12632 KB Output is correct
12 Correct 37 ms 12888 KB Output is correct
13 Correct 8 ms 12636 KB Output is correct
14 Correct 19 ms 12752 KB Output is correct
15 Correct 28 ms 12808 KB Output is correct
16 Correct 26 ms 12812 KB Output is correct
17 Correct 23 ms 12636 KB Output is correct
18 Correct 11 ms 12632 KB Output is correct
19 Correct 27 ms 12636 KB Output is correct
20 Correct 24 ms 12632 KB Output is correct
21 Correct 949 ms 24036 KB Output is correct
22 Correct 952 ms 24152 KB Output is correct
23 Correct 962 ms 24540 KB Output is correct
24 Correct 798 ms 25264 KB Output is correct
25 Correct 579 ms 30660 KB Output is correct
26 Correct 430 ms 31696 KB Output is correct
27 Correct 931 ms 23852 KB Output is correct
28 Correct 947 ms 24308 KB Output is correct
29 Correct 991 ms 24112 KB Output is correct
30 Correct 797 ms 18036 KB Output is correct
31 Correct 1031 ms 19328 KB Output is correct
32 Correct 856 ms 29104 KB Output is correct
33 Correct 2346 ms 14224 KB Output is correct
34 Correct 2334 ms 14256 KB Output is correct
35 Correct 2404 ms 14644 KB Output is correct
36 Correct 2357 ms 14176 KB Output is correct
37 Correct 595 ms 31052 KB Output is correct
38 Correct 1048 ms 16856 KB Output is correct
39 Correct 538 ms 31204 KB Output is correct
40 Correct 724 ms 18104 KB Output is correct
41 Correct 1821 ms 20864 KB Output is correct
42 Correct 999 ms 29120 KB Output is correct
43 Correct 2238 ms 16724 KB Output is correct
44 Correct 339 ms 30144 KB Output is correct
45 Correct 1396 ms 25036 KB Output is correct
46 Correct 1998 ms 19672 KB Output is correct
47 Correct 525 ms 30360 KB Output is correct
48 Correct 1278 ms 25920 KB Output is correct
49 Correct 964 ms 24224 KB Output is correct
50 Correct 967 ms 24180 KB Output is correct
51 Correct 939 ms 24092 KB Output is correct
52 Correct 912 ms 24136 KB Output is correct
53 Correct 2352 ms 14320 KB Output is correct
54 Correct 2334 ms 14112 KB Output is correct
55 Correct 2354 ms 14144 KB Output is correct
56 Correct 2373 ms 14532 KB Output is correct
57 Correct 985 ms 20284 KB Output is correct
58 Correct 1092 ms 15952 KB Output is correct
59 Correct 642 ms 25912 KB Output is correct
60 Correct 1175 ms 15456 KB Output is correct
61 Correct 1431 ms 25044 KB Output is correct
62 Correct 679 ms 30460 KB Output is correct
63 Correct 450 ms 30936 KB Output is correct
64 Correct 652 ms 31336 KB Output is correct
65 Correct 2348 ms 17576 KB Output is correct
66 Correct 2390 ms 16596 KB Output is correct
67 Correct 1237 ms 26076 KB Output is correct
68 Correct 1650 ms 23100 KB Output is correct
69 Correct 924 ms 23884 KB Output is correct
70 Correct 955 ms 23792 KB Output is correct
71 Correct 1030 ms 24348 KB Output is correct
72 Correct 961 ms 24000 KB Output is correct
73 Correct 2016 ms 18188 KB Output is correct
74 Correct 1568 ms 22980 KB Output is correct
75 Correct 279 ms 30428 KB Output is correct
76 Correct 371 ms 31096 KB Output is correct
77 Correct 2360 ms 14000 KB Output is correct
78 Correct 2354 ms 14284 KB Output is correct
79 Correct 2375 ms 14604 KB Output is correct
80 Correct 2327 ms 14084 KB Output is correct
81 Correct 1620 ms 22920 KB Output is correct
82 Correct 2081 ms 18616 KB Output is correct
83 Correct 2245 ms 16400 KB Output is correct
84 Correct 1651 ms 22692 KB Output is correct
85 Correct 1245 ms 26324 KB Output is correct
86 Correct 1218 ms 28384 KB Output is correct
87 Correct 1961 ms 20916 KB Output is correct
88 Correct 2395 ms 16460 KB Output is correct

Subtask #6
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 12636 KB Output is correct
2 Correct 3 ms 12784 KB Output is correct
3 Correct 26 ms 12888 KB Output is correct
4 Correct 27 ms 12636 KB Output is correct
5 Correct 20 ms 12836 KB Output is correct
6 Correct 26 ms 12840 KB Output is correct
7 Correct 27 ms 12632 KB Output is correct
8 Correct 18 ms 12632 KB Output is correct
9 Correct 20 ms 12636 KB Output is correct
10 Correct 11 ms 12636 KB Output is correct
11 Correct 36 ms 12632 KB Output is correct
12 Correct 37 ms 12888 KB Output is correct
13 Correct 8 ms 12636 KB Output is correct
14 Correct 19 ms 12752 KB Output is correct
15 Correct 28 ms 12808 KB Output is correct
16 Correct 26 ms 12812 KB Output is correct
17 Correct 23 ms 12636 KB Output is correct
18 Correct 11 ms 12632 KB Output is correct
19 Correct 27 ms 12636 KB Output is correct
20 Correct 24 ms 12632 KB Output is correct
21 Correct 949 ms 24036 KB Output is correct
22 Correct 952 ms 24152 KB Output is correct
23 Correct 962 ms 24540 KB Output is correct
24 Correct 798 ms 25264 KB Output is correct
25 Correct 579 ms 30660 KB Output is correct
26 Correct 430 ms 31696 KB Output is correct
27 Correct 931 ms 23852 KB Output is correct
28 Correct 947 ms 24308 KB Output is correct
29 Correct 991 ms 24112 KB Output is correct
30 Correct 797 ms 18036 KB Output is correct
31 Correct 1031 ms 19328 KB Output is correct
32 Correct 856 ms 29104 KB Output is correct
33 Correct 2580 ms 14180 KB Output is correct
34 Correct 2549 ms 14020 KB Output is correct
35 Correct 2578 ms 14260 KB Output is correct
36 Correct 2591 ms 14400 KB Output is correct
37 Correct 835 ms 29652 KB Output is correct
38 Correct 486 ms 25992 KB Output is correct
39 Correct 799 ms 28968 KB Output is correct
40 Correct 593 ms 30956 KB Output is correct
41 Correct 504 ms 32320 KB Output is correct
42 Correct 1255 ms 26384 KB Output is correct
43 Correct 2548 ms 14944 KB Output is correct
44 Correct 1201 ms 29412 KB Output is correct
45 Correct 1267 ms 25176 KB Output is correct
46 Correct 1888 ms 19596 KB Output is correct
47 Correct 1959 ms 19004 KB Output is correct
48 Correct 2094 ms 17164 KB Output is correct
49 Correct 959 ms 24116 KB Output is correct
50 Correct 952 ms 24076 KB Output is correct
51 Correct 1000 ms 24052 KB Output is correct
52 Correct 970 ms 24320 KB Output is correct
53 Correct 2559 ms 15108 KB Output is correct
54 Correct 1970 ms 21592 KB Output is correct
55 Correct 1701 ms 23688 KB Output is correct
56 Correct 1901 ms 21604 KB Output is correct
57 Correct 2558 ms 14192 KB Output is correct
58 Correct 2565 ms 14308 KB Output is correct
59 Correct 2587 ms 14152 KB Output is correct
60 Correct 2556 ms 14104 KB Output is correct
61 Correct 1564 ms 24784 KB Output is correct
62 Correct 1549 ms 24716 KB Output is correct
63 Correct 502 ms 30408 KB Output is correct
64 Correct 1359 ms 26480 KB Output is correct
65 Correct 1279 ms 25180 KB Output is correct
66 Correct 2001 ms 18568 KB Output is correct
67 Correct 1542 ms 23040 KB Output is correct
68 Correct 1143 ms 26524 KB Output is correct
69 Correct 2346 ms 14224 KB Output is correct
70 Correct 2334 ms 14256 KB Output is correct
71 Correct 2404 ms 14644 KB Output is correct
72 Correct 2357 ms 14176 KB Output is correct
73 Correct 595 ms 31052 KB Output is correct
74 Correct 1048 ms 16856 KB Output is correct
75 Correct 538 ms 31204 KB Output is correct
76 Correct 724 ms 18104 KB Output is correct
77 Correct 1821 ms 20864 KB Output is correct
78 Correct 999 ms 29120 KB Output is correct
79 Correct 2238 ms 16724 KB Output is correct
80 Correct 339 ms 30144 KB Output is correct
81 Correct 1396 ms 25036 KB Output is correct
82 Correct 1998 ms 19672 KB Output is correct
83 Correct 525 ms 30360 KB Output is correct
84 Correct 1278 ms 25920 KB Output is correct
85 Correct 964 ms 24224 KB Output is correct
86 Correct 967 ms 24180 KB Output is correct
87 Correct 939 ms 24092 KB Output is correct
88 Correct 912 ms 24136 KB Output is correct
89 Correct 2352 ms 14320 KB Output is correct
90 Correct 2334 ms 14112 KB Output is correct
91 Correct 2354 ms 14144 KB Output is correct
92 Correct 2373 ms 14532 KB Output is correct
93 Correct 985 ms 20284 KB Output is correct
94 Correct 1092 ms 15952 KB Output is correct
95 Correct 642 ms 25912 KB Output is correct
96 Correct 1175 ms 15456 KB Output is correct
97 Correct 1431 ms 25044 KB Output is correct
98 Correct 679 ms 30460 KB Output is correct
99 Correct 450 ms 30936 KB Output is correct
100 Correct 652 ms 31336 KB Output is correct
101 Correct 2348 ms 17576 KB Output is correct
102 Correct 2390 ms 16596 KB Output is correct
103 Correct 1237 ms 26076 KB Output is correct
104 Correct 1650 ms 23100 KB Output is correct
105 Correct 924 ms 23884 KB Output is correct
106 Correct 955 ms 23792 KB Output is correct
107 Correct 1030 ms 24348 KB Output is correct
108 Correct 961 ms 24000 KB Output is correct
109 Correct 2016 ms 18188 KB Output is correct
110 Correct 1568 ms 22980 KB Output is correct
111 Correct 279 ms 30428 KB Output is correct
112 Correct 371 ms 31096 KB Output is correct
113 Correct 2360 ms 14000 KB Output is correct
114 Correct 2354 ms 14284 KB Output is correct
115 Correct 2375 ms 14604 KB Output is correct
116 Correct 2327 ms 14084 KB Output is correct
117 Correct 1620 ms 22920 KB Output is correct
118 Correct 2081 ms 18616 KB Output is correct
119 Correct 2245 ms 16400 KB Output is correct
120 Correct 1651 ms 22692 KB Output is correct
121 Correct 1245 ms 26324 KB Output is correct
122 Correct 1218 ms 28384 KB Output is correct
123 Correct 1961 ms 20916 KB Output is correct
124 Correct 2395 ms 16460 KB Output is correct
125 Correct 4681 ms 15456 KB Output is correct
126 Correct 4654 ms 15408 KB Output is correct
127 Correct 4683 ms 15404 KB Output is correct
128 Correct 4708 ms 15568 KB Output is correct
129 Correct 4663 ms 15428 KB Output is correct
130 Correct 4719 ms 15644 KB Output is correct
131 Correct 1561 ms 19244 KB Output is correct
132 Correct 1888 ms 34816 KB Output is correct
133 Runtime error 1929 ms 42468 KB Memory limit exceeded
134 Halted 0 ms 0 KB -