oj.uz

Submission #908924

# Submission time Handle Problem Language Result Execution time Memory
908924 2024-01-17T02:12:29 Z daoquanglinh2007 Segments (IZhO18_segments) C++17
75 / 100
 5000 ms 28204 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 = 2e3, S = 450, 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> f[NM+5], g[NM+5], sf[S+5], sg[S+5];
int cnt[NM+5];
 
void update(vector <pii> f[NM+5], vector <pii> sf[S+5], int x, int y){
	if (f[x].empty()) f[x].push_back(mp(y, 1));
	else if (f[x].back().fi < y) f[x].push_back(mp(y, f[x].back().se+1));
	else f[x].back().se++;
	
	int sx = x/S;
	if (sf[sx].empty()) sf[sx].push_back(mp(y, 1));
	else if (sf[sx].back().fi < y) sf[sx].push_back(mp(y, sf[sx].back().se+1));
	else sf[sx].back().se++;
}
 
int get(vector <pii> f[NM+5], vector <pii> sf[S+5], int x, int y){
	int res = 0, z;
	for (int i = 0; i < x/S; i++){
		if (sf[i].empty() || y < sf[i][0].fi);
		else if (y >= sf[i].back().fi) res += sf[i].back().se;
		else{
			z = upper_bound(sf[i].begin(), sf[i].end(), mp(y, +inf))-sf[i].begin();
			res += sf[i][z-1].se;
		}
	}
	for (int i = x/S*S; i <= x; i++){
		if (f[i].empty() || y < f[i][0].fi);
		else if (y >= f[i].back().fi) res += f[i].back().se;
		else{
			z = upper_bound(f[i].begin(), f[i].end(), mp(y, +inf))-f[i].begin();
			res += f[i][z-1].se;
		}
	}
	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++) f[i].clear();
	for (int i = 1; i <= sz2; i++) g[i].clear();
	
	for (int i = 0; i < S; i++){
		sf[i].clear();
		sg[i].clear();
	}
	
	memset(cnt, 0, sizeof(cnt));
	int j = 0;
	for (pii P : v){
		update(f, sf, lower_bound(arr1.begin(), arr1.end(), -P.fi)-arr1.begin()+1, -(P.se-P.fi+1));
		update(g, sg, 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(f, sf, find_pos(arr1, -b[i]+k[i]-2), -k[i])
			          -get(g, sg, 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

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12632 KB Output is correct
2 Correct 3 ms 12632 KB Output is correct
3 Correct 11 ms 12892 KB Output is correct
4 Correct 11 ms 13144 KB Output is correct
5 Correct 9 ms 13424 KB Output is correct
6 Correct 11 ms 13404 KB Output is correct
7 Correct 13 ms 12892 KB Output is correct
8 Correct 11 ms 13144 KB Output is correct
9 Correct 12 ms 13148 KB Output is correct
10 Correct 8 ms 13404 KB Output is correct
11 Correct 19 ms 13468 KB Output is correct
12 Correct 15 ms 13280 KB Output is correct
13 Correct 8 ms 13404 KB Output is correct
14 Correct 12 ms 13032 KB Output is correct
15 Correct 11 ms 12892 KB Output is correct
16 Correct 12 ms 12892 KB Output is correct
17 Correct 14 ms 13164 KB Output is correct
18 Correct 11 ms 13244 KB Output is correct
19 Correct 12 ms 13148 KB Output is correct
20 Correct 12 ms 13148 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1176 ms 19376 KB Output is correct
2 Correct 1184 ms 19372 KB Output is correct
3 Correct 1177 ms 19292 KB Output is correct
4 Correct 1272 ms 19820 KB Output is correct
5 Correct 1318 ms 23800 KB Output is correct
6 Correct 1272 ms 24148 KB Output is correct
7 Correct 1281 ms 19404 KB Output is correct
8 Correct 1286 ms 19228 KB Output is correct
9 Correct 1262 ms 19680 KB Output is correct
10 Correct 721 ms 16528 KB Output is correct
11 Correct 905 ms 16856 KB Output is correct
12 Correct 1341 ms 21512 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 218 ms 14272 KB Output is correct
2 Correct 211 ms 14172 KB Output is correct
3 Correct 220 ms 14160 KB Output is correct
4 Correct 209 ms 14236 KB Output is correct
5 Correct 1185 ms 21800 KB Output is correct
6 Correct 1090 ms 20208 KB Output is correct
7 Correct 1144 ms 21424 KB Output is correct
8 Correct 1266 ms 24064 KB Output is correct
9 Correct 1251 ms 23236 KB Output is correct
10 Correct 1149 ms 21072 KB Output is correct
11 Correct 299 ms 14420 KB Output is correct
12 Correct 1141 ms 21228 KB Output is correct
13 Correct 1089 ms 20340 KB Output is correct
14 Correct 681 ms 17104 KB Output is correct
15 Correct 595 ms 16748 KB Output is correct
16 Correct 467 ms 15776 KB Output is correct
17 Correct 958 ms 19312 KB Output is correct
18 Correct 965 ms 19456 KB Output is correct
19 Correct 952 ms 19452 KB Output is correct
20 Correct 942 ms 19404 KB Output is correct
21 Correct 329 ms 14672 KB Output is correct
22 Correct 816 ms 17892 KB Output is correct
23 Correct 968 ms 19140 KB Output is correct
24 Correct 901 ms 18300 KB Output is correct
25 Correct 216 ms 14216 KB Output is correct
26 Correct 216 ms 14156 KB Output is correct
27 Correct 214 ms 14164 KB Output is correct
28 Correct 212 ms 14172 KB Output is correct
29 Correct 1034 ms 19788 KB Output is correct
30 Correct 1035 ms 19580 KB Output is correct
31 Correct 1219 ms 23500 KB Output is correct
32 Correct 1176 ms 20808 KB Output is correct
33 Correct 1066 ms 20380 KB Output is correct
34 Correct 576 ms 16588 KB Output is correct
35 Correct 915 ms 19148 KB Output is correct
36 Correct 1104 ms 20680 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 186 ms 14160 KB Output is correct
2 Correct 187 ms 14160 KB Output is correct
3 Correct 187 ms 14120 KB Output is correct
4 Correct 195 ms 14208 KB Output is correct
5 Correct 1382 ms 22100 KB Output is correct
6 Correct 599 ms 15716 KB Output is correct
7 Correct 1346 ms 22708 KB Output is correct
8 Correct 737 ms 16192 KB Output is correct
9 Correct 868 ms 17900 KB Output is correct
10 Correct 1223 ms 21552 KB Output is correct
11 Correct 506 ms 15440 KB Output is correct
12 Correct 1263 ms 23724 KB Output is correct
13 Correct 1090 ms 19976 KB Output is correct
14 Correct 793 ms 17592 KB Output is correct
15 Correct 1243 ms 23120 KB Output is correct
16 Correct 1163 ms 20668 KB Output is correct
17 Correct 1206 ms 19464 KB Output is correct
18 Correct 1183 ms 19400 KB Output is correct
19 Correct 1205 ms 19236 KB Output is correct
20 Correct 1170 ms 19332 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12632 KB Output is correct
2 Correct 3 ms 12632 KB Output is correct
3 Correct 11 ms 12892 KB Output is correct
4 Correct 11 ms 13144 KB Output is correct
5 Correct 9 ms 13424 KB Output is correct
6 Correct 11 ms 13404 KB Output is correct
7 Correct 13 ms 12892 KB Output is correct
8 Correct 11 ms 13144 KB Output is correct
9 Correct 12 ms 13148 KB Output is correct
10 Correct 8 ms 13404 KB Output is correct
11 Correct 19 ms 13468 KB Output is correct
12 Correct 15 ms 13280 KB Output is correct
13 Correct 8 ms 13404 KB Output is correct
14 Correct 12 ms 13032 KB Output is correct
15 Correct 11 ms 12892 KB Output is correct
16 Correct 12 ms 12892 KB Output is correct
17 Correct 14 ms 13164 KB Output is correct
18 Correct 11 ms 13244 KB Output is correct
19 Correct 12 ms 13148 KB Output is correct
20 Correct 12 ms 13148 KB Output is correct
21 Correct 1176 ms 19376 KB Output is correct
22 Correct 1184 ms 19372 KB Output is correct
23 Correct 1177 ms 19292 KB Output is correct
24 Correct 1272 ms 19820 KB Output is correct
25 Correct 1318 ms 23800 KB Output is correct
26 Correct 1272 ms 24148 KB Output is correct
27 Correct 1281 ms 19404 KB Output is correct
28 Correct 1286 ms 19228 KB Output is correct
29 Correct 1262 ms 19680 KB Output is correct
30 Correct 721 ms 16528 KB Output is correct
31 Correct 905 ms 16856 KB Output is correct
32 Correct 1341 ms 21512 KB Output is correct
33 Correct 186 ms 14160 KB Output is correct
34 Correct 187 ms 14160 KB Output is correct
35 Correct 187 ms 14120 KB Output is correct
36 Correct 195 ms 14208 KB Output is correct
37 Correct 1382 ms 22100 KB Output is correct
38 Correct 599 ms 15716 KB Output is correct
39 Correct 1346 ms 22708 KB Output is correct
40 Correct 737 ms 16192 KB Output is correct
41 Correct 868 ms 17900 KB Output is correct
42 Correct 1223 ms 21552 KB Output is correct
43 Correct 506 ms 15440 KB Output is correct
44 Correct 1263 ms 23724 KB Output is correct
45 Correct 1090 ms 19976 KB Output is correct
46 Correct 793 ms 17592 KB Output is correct
47 Correct 1243 ms 23120 KB Output is correct
48 Correct 1163 ms 20668 KB Output is correct
49 Correct 1206 ms 19464 KB Output is correct
50 Correct 1183 ms 19400 KB Output is correct
51 Correct 1205 ms 19236 KB Output is correct
52 Correct 1170 ms 19332 KB Output is correct
53 Correct 193 ms 14020 KB Output is correct
54 Correct 195 ms 14124 KB Output is correct
55 Correct 194 ms 14204 KB Output is correct
56 Correct 187 ms 14200 KB Output is correct
57 Correct 944 ms 17576 KB Output is correct
58 Correct 487 ms 15440 KB Output is correct
59 Correct 1312 ms 20484 KB Output is correct
60 Correct 445 ms 15176 KB Output is correct
61 Correct 1136 ms 20008 KB Output is correct
62 Correct 1304 ms 23068 KB Output is correct
63 Correct 1301 ms 23668 KB Output is correct
64 Correct 1308 ms 23108 KB Output is correct
65 Correct 577 ms 15984 KB Output is correct
66 Correct 515 ms 15756 KB Output is correct
67 Correct 1153 ms 20384 KB Output is correct
68 Correct 993 ms 19096 KB Output is correct
69 Correct 1182 ms 19564 KB Output is correct
70 Correct 1202 ms 19200 KB Output is correct
71 Correct 1207 ms 19372 KB Output is correct
72 Correct 1183 ms 19520 KB Output is correct
73 Correct 695 ms 16824 KB Output is correct
74 Correct 1032 ms 18892 KB Output is correct
75 Correct 1285 ms 23988 KB Output is correct
76 Correct 1294 ms 23884 KB Output is correct
77 Correct 193 ms 14036 KB Output is correct
78 Correct 189 ms 14168 KB Output is correct
79 Correct 200 ms 14416 KB Output is correct
80 Correct 187 ms 14160 KB Output is correct
81 Correct 1002 ms 18644 KB Output is correct
82 Correct 698 ms 16544 KB Output is correct
83 Correct 483 ms 15480 KB Output is correct
84 Correct 1062 ms 18940 KB Output is correct
85 Correct 1141 ms 20428 KB Output is correct
86 Correct 1173 ms 21276 KB Output is correct
87 Correct 840 ms 17728 KB Output is correct
88 Correct 477 ms 15380 KB Output is correct

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12632 KB Output is correct
2 Correct 3 ms 12632 KB Output is correct
3 Correct 11 ms 12892 KB Output is correct
4 Correct 11 ms 13144 KB Output is correct
5 Correct 9 ms 13424 KB Output is correct
6 Correct 11 ms 13404 KB Output is correct
7 Correct 13 ms 12892 KB Output is correct
8 Correct 11 ms 13144 KB Output is correct
9 Correct 12 ms 13148 KB Output is correct
10 Correct 8 ms 13404 KB Output is correct
11 Correct 19 ms 13468 KB Output is correct
12 Correct 15 ms 13280 KB Output is correct
13 Correct 8 ms 13404 KB Output is correct
14 Correct 12 ms 13032 KB Output is correct
15 Correct 11 ms 12892 KB Output is correct
16 Correct 12 ms 12892 KB Output is correct
17 Correct 14 ms 13164 KB Output is correct
18 Correct 11 ms 13244 KB Output is correct
19 Correct 12 ms 13148 KB Output is correct
20 Correct 12 ms 13148 KB Output is correct
21 Correct 1176 ms 19376 KB Output is correct
22 Correct 1184 ms 19372 KB Output is correct
23 Correct 1177 ms 19292 KB Output is correct
24 Correct 1272 ms 19820 KB Output is correct
25 Correct 1318 ms 23800 KB Output is correct
26 Correct 1272 ms 24148 KB Output is correct
27 Correct 1281 ms 19404 KB Output is correct
28 Correct 1286 ms 19228 KB Output is correct
29 Correct 1262 ms 19680 KB Output is correct
30 Correct 721 ms 16528 KB Output is correct
31 Correct 905 ms 16856 KB Output is correct
32 Correct 1341 ms 21512 KB Output is correct
33 Correct 218 ms 14272 KB Output is correct
34 Correct 211 ms 14172 KB Output is correct
35 Correct 220 ms 14160 KB Output is correct
36 Correct 209 ms 14236 KB Output is correct
37 Correct 1185 ms 21800 KB Output is correct
38 Correct 1090 ms 20208 KB Output is correct
39 Correct 1144 ms 21424 KB Output is correct
40 Correct 1266 ms 24064 KB Output is correct
41 Correct 1251 ms 23236 KB Output is correct
42 Correct 1149 ms 21072 KB Output is correct
43 Correct 299 ms 14420 KB Output is correct
44 Correct 1141 ms 21228 KB Output is correct
45 Correct 1089 ms 20340 KB Output is correct
46 Correct 681 ms 17104 KB Output is correct
47 Correct 595 ms 16748 KB Output is correct
48 Correct 467 ms 15776 KB Output is correct
49 Correct 958 ms 19312 KB Output is correct
50 Correct 965 ms 19456 KB Output is correct
51 Correct 952 ms 19452 KB Output is correct
52 Correct 942 ms 19404 KB Output is correct
53 Correct 329 ms 14672 KB Output is correct
54 Correct 816 ms 17892 KB Output is correct
55 Correct 968 ms 19140 KB Output is correct
56 Correct 901 ms 18300 KB Output is correct
57 Correct 216 ms 14216 KB Output is correct
58 Correct 216 ms 14156 KB Output is correct
59 Correct 214 ms 14164 KB Output is correct
60 Correct 212 ms 14172 KB Output is correct
61 Correct 1034 ms 19788 KB Output is correct
62 Correct 1035 ms 19580 KB Output is correct
63 Correct 1219 ms 23500 KB Output is correct
64 Correct 1176 ms 20808 KB Output is correct
65 Correct 1066 ms 20380 KB Output is correct
66 Correct 576 ms 16588 KB Output is correct
67 Correct 915 ms 19148 KB Output is correct
68 Correct 1104 ms 20680 KB Output is correct
69 Correct 186 ms 14160 KB Output is correct
70 Correct 187 ms 14160 KB Output is correct
71 Correct 187 ms 14120 KB Output is correct
72 Correct 195 ms 14208 KB Output is correct
73 Correct 1382 ms 22100 KB Output is correct
74 Correct 599 ms 15716 KB Output is correct
75 Correct 1346 ms 22708 KB Output is correct
76 Correct 737 ms 16192 KB Output is correct
77 Correct 868 ms 17900 KB Output is correct
78 Correct 1223 ms 21552 KB Output is correct
79 Correct 506 ms 15440 KB Output is correct
80 Correct 1263 ms 23724 KB Output is correct
81 Correct 1090 ms 19976 KB Output is correct
82 Correct 793 ms 17592 KB Output is correct
83 Correct 1243 ms 23120 KB Output is correct
84 Correct 1163 ms 20668 KB Output is correct
85 Correct 1206 ms 19464 KB Output is correct
86 Correct 1183 ms 19400 KB Output is correct
87 Correct 1205 ms 19236 KB Output is correct
88 Correct 1170 ms 19332 KB Output is correct
89 Correct 193 ms 14020 KB Output is correct
90 Correct 195 ms 14124 KB Output is correct
91 Correct 194 ms 14204 KB Output is correct
92 Correct 187 ms 14200 KB Output is correct
93 Correct 944 ms 17576 KB Output is correct
94 Correct 487 ms 15440 KB Output is correct
95 Correct 1312 ms 20484 KB Output is correct
96 Correct 445 ms 15176 KB Output is correct
97 Correct 1136 ms 20008 KB Output is correct
98 Correct 1304 ms 23068 KB Output is correct
99 Correct 1301 ms 23668 KB Output is correct
100 Correct 1308 ms 23108 KB Output is correct
101 Correct 577 ms 15984 KB Output is correct
102 Correct 515 ms 15756 KB Output is correct
103 Correct 1153 ms 20384 KB Output is correct
104 Correct 993 ms 19096 KB Output is correct
105 Correct 1182 ms 19564 KB Output is correct
106 Correct 1202 ms 19200 KB Output is correct
107 Correct 1207 ms 19372 KB Output is correct
108 Correct 1183 ms 19520 KB Output is correct
109 Correct 695 ms 16824 KB Output is correct
110 Correct 1032 ms 18892 KB Output is correct
111 Correct 1285 ms 23988 KB Output is correct
112 Correct 1294 ms 23884 KB Output is correct
113 Correct 193 ms 14036 KB Output is correct
114 Correct 189 ms 14168 KB Output is correct
115 Correct 200 ms 14416 KB Output is correct
116 Correct 187 ms 14160 KB Output is correct
117 Correct 1002 ms 18644 KB Output is correct
118 Correct 698 ms 16544 KB Output is correct
119 Correct 483 ms 15480 KB Output is correct
120 Correct 1062 ms 18940 KB Output is correct
121 Correct 1141 ms 20428 KB Output is correct
122 Correct 1173 ms 21276 KB Output is correct
123 Correct 840 ms 17728 KB Output is correct
124 Correct 477 ms 15380 KB Output is correct
125 Correct 387 ms 15500 KB Output is correct
126 Correct 390 ms 15388 KB Output is correct
127 Correct 425 ms 15764 KB Output is correct
128 Correct 394 ms 15448 KB Output is correct
129 Correct 390 ms 15268 KB Output is correct
130 Correct 400 ms 15320 KB Output is correct
131 Correct 1560 ms 17740 KB Output is correct
132 Correct 4834 ms 24728 KB Output is correct
133 Execution timed out 5033 ms 28204 KB Time limit exceeded
134 Halted 0 ms 0 KB -