oj.uz

Submission #908533

# Submission time Handle Problem Language Result Execution time Memory
908533 2024-01-16T13:42:05 Z daoquanglinh2007 Segments (IZhO18_segments) C++17
59 / 100
 1806 ms 35016 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define isz(a) (int)(a).size()
 
const int NM = 1e5, BL = 10000, 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;
vector <int> arr;
vector <int> node1[NM+5], node2[NM+5];
vector <int> bit1[NM+5], bit2[NM+5];
int cnt[NM+5];
 
void fake_update1(int x, int y){
	while (x <= sz){
		node1[x].push_back(y);
		x += x & (-x);
	}
}

void fake_update2(int x, int y){
	while (x <= sz){
		node2[x].push_back(y);
		x += x & (-x);
	}
}
 
void update1(int x, int yy){
	while (x <= sz){
		int y = lower_bound(node1[x].begin(), node1[x].end(), yy)-node1[x].begin()+1;
		while (y <= isz(node1[x])){
			bit1[x][y]++;
			y += y & (-y);
		}
		x += x & (-x);
	}
}

void update2(int x, int yy){
	while (x <= sz){
		int y = lower_bound(node2[x].begin(), node2[x].end(), yy)-node2[x].begin()+1;
		while (y <= isz(node2[x])){
			bit2[x][y]++;
			y += y & (-y);
		}
		x += x & (-x);
	}
}
 
void update_cnt(int x){
	while (x <= sz){
		cnt[x]++;
		x += x & (-x);
	}
}
 
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 find_pos_ll(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 get1(int x, int yy){
	int res = 0;
	while (x > 0){
		int y = find_pos_ll(node1[x], yy);
		while (y > 0){
			res += bit1[x][y];
			y -= y & (-y);
		}
		x -= x & (-x);
	}
	return res;
}

int get2(int x, int yy){
	int res = 0;
	while (x > 0){
		int y = find_pos_ll(node2[x], yy);
		while (y > 0){
			res += bit2[x][y];
			y -= y & (-y);
		}
		x -= x & (-x);
	}
	return res;
}

int get_cnt(int x){
	int res = 0;
	while (x > 0){
		res += cnt[x];
		x -= x & (-x);
	}
	return res;
}
 
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]);
			lastans = get_cnt(find_pos(arr, -k[i]))-get1(find_pos(arr, -k[i]), -b[i]+k[i]-2)
			          -get2(find_pos(arr, -k[i]), (a[i] < +inf-(k[i]-2) ? a[i]+k[i]-2 : +inf));
			          
			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){
			arr.clear();
			for (int j = 1; j <= num; j++)
				if (!del[j]){
					arr.push_back(-(r[j]-l[j]+1));
				}
			sort(arr.begin(), arr.end());
			arr.erase(unique(arr.begin(), arr.end()), arr.end());
			sz = isz(arr);
			for (int j = 1; j <= sz; j++){
				node1[j].clear();
				node2[j].clear();
			}
			for (int j = 1; j <= num; j++){
				if (del[j]) continue;
				int x = lower_bound(arr.begin(), arr.end(), -(r[j]-l[j]+1))-arr.begin()+1;
				fake_update1(x, -l[j]);
				fake_update2(x, r[j]);
			}
			for (int j = 1; j <= sz; j++){
				sort(node1[j].begin(), node1[j].end());
				sort(node2[j].begin(), node2[j].end());
				bit1[j].assign(isz(node1[j])+1, 0);
				bit2[j].assign(isz(node2[j])+1, 0);
			}
			memset(cnt, 0, sizeof(cnt));
			for (int j = 1; j <= num; j++){
				if (del[j]) continue;
				int x = lower_bound(arr.begin(), arr.end(), -(r[j]-l[j]+1))-arr.begin()+1;
				update1(x, -l[j]);
				update2(x, r[j]);
				update_cnt(x);
			}
		}
	}
	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 12636 KB Output is correct
3 Correct 25 ms 12780 KB Output is correct
4 Correct 26 ms 12636 KB Output is correct
5 Correct 18 ms 12636 KB Output is correct
6 Correct 23 ms 12636 KB Output is correct
7 Correct 25 ms 12888 KB Output is correct
8 Correct 17 ms 12636 KB Output is correct
9 Correct 19 ms 12632 KB Output is correct
10 Correct 8 ms 12636 KB Output is correct
11 Correct 29 ms 12776 KB Output is correct
12 Correct 30 ms 12796 KB Output is correct
13 Correct 8 ms 12636 KB Output is correct
14 Correct 18 ms 12636 KB Output is correct
15 Correct 26 ms 12636 KB Output is correct
16 Correct 27 ms 12636 KB Output is correct
17 Correct 23 ms 12636 KB Output is correct
18 Correct 10 ms 12636 KB Output is correct
19 Correct 25 ms 12636 KB Output is correct
20 Correct 23 ms 12632 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1181 ms 25388 KB Output is correct
2 Correct 1208 ms 24976 KB Output is correct
3 Correct 1249 ms 24944 KB Output is correct
4 Correct 1303 ms 25640 KB Output is correct
5 Correct 1576 ms 34392 KB Output is correct
6 Correct 1624 ms 34504 KB Output is correct
7 Correct 1179 ms 25040 KB Output is correct
8 Correct 1211 ms 24852 KB Output is correct
9 Correct 1187 ms 25304 KB Output is correct
10 Correct 718 ms 17644 KB Output is correct
11 Correct 875 ms 19500 KB Output is correct
12 Correct 1540 ms 30108 KB Output is correct

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 1191 ms 13392 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1046 ms 13144 KB Output is correct
2 Correct 1048 ms 13340 KB Output is correct
3 Correct 1057 ms 13580 KB Output is correct
4 Correct 1060 ms 13160 KB Output is correct
5 Correct 1642 ms 31252 KB Output is correct
6 Correct 672 ms 16584 KB Output is correct
7 Correct 1646 ms 33128 KB Output is correct
8 Correct 718 ms 18000 KB Output is correct
9 Correct 1447 ms 21472 KB Output is correct
10 Correct 1729 ms 30628 KB Output is correct
11 Correct 1193 ms 15696 KB Output is correct
12 Correct 1570 ms 34260 KB Output is correct
13 Correct 1653 ms 25856 KB Output is correct
14 Correct 1361 ms 19796 KB Output is correct
15 Correct 1705 ms 34032 KB Output is correct
16 Correct 1581 ms 27148 KB Output is correct
17 Correct 1214 ms 24848 KB Output is correct
18 Correct 1197 ms 24928 KB Output is correct
19 Correct 1163 ms 24944 KB Output is correct
20 Correct 1206 ms 24916 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 12636 KB Output is correct
3 Correct 25 ms 12780 KB Output is correct
4 Correct 26 ms 12636 KB Output is correct
5 Correct 18 ms 12636 KB Output is correct
6 Correct 23 ms 12636 KB Output is correct
7 Correct 25 ms 12888 KB Output is correct
8 Correct 17 ms 12636 KB Output is correct
9 Correct 19 ms 12632 KB Output is correct
10 Correct 8 ms 12636 KB Output is correct
11 Correct 29 ms 12776 KB Output is correct
12 Correct 30 ms 12796 KB Output is correct
13 Correct 8 ms 12636 KB Output is correct
14 Correct 18 ms 12636 KB Output is correct
15 Correct 26 ms 12636 KB Output is correct
16 Correct 27 ms 12636 KB Output is correct
17 Correct 23 ms 12636 KB Output is correct
18 Correct 10 ms 12636 KB Output is correct
19 Correct 25 ms 12636 KB Output is correct
20 Correct 23 ms 12632 KB Output is correct
21 Correct 1181 ms 25388 KB Output is correct
22 Correct 1208 ms 24976 KB Output is correct
23 Correct 1249 ms 24944 KB Output is correct
24 Correct 1303 ms 25640 KB Output is correct
25 Correct 1576 ms 34392 KB Output is correct
26 Correct 1624 ms 34504 KB Output is correct
27 Correct 1179 ms 25040 KB Output is correct
28 Correct 1211 ms 24852 KB Output is correct
29 Correct 1187 ms 25304 KB Output is correct
30 Correct 718 ms 17644 KB Output is correct
31 Correct 875 ms 19500 KB Output is correct
32 Correct 1540 ms 30108 KB Output is correct
33 Correct 1046 ms 13144 KB Output is correct
34 Correct 1048 ms 13340 KB Output is correct
35 Correct 1057 ms 13580 KB Output is correct
36 Correct 1060 ms 13160 KB Output is correct
37 Correct 1642 ms 31252 KB Output is correct
38 Correct 672 ms 16584 KB Output is correct
39 Correct 1646 ms 33128 KB Output is correct
40 Correct 718 ms 18000 KB Output is correct
41 Correct 1447 ms 21472 KB Output is correct
42 Correct 1729 ms 30628 KB Output is correct
43 Correct 1193 ms 15696 KB Output is correct
44 Correct 1570 ms 34260 KB Output is correct
45 Correct 1653 ms 25856 KB Output is correct
46 Correct 1361 ms 19796 KB Output is correct
47 Correct 1705 ms 34032 KB Output is correct
48 Correct 1581 ms 27148 KB Output is correct
49 Correct 1214 ms 24848 KB Output is correct
50 Correct 1197 ms 24928 KB Output is correct
51 Correct 1163 ms 24944 KB Output is correct
52 Correct 1206 ms 24916 KB Output is correct
53 Correct 1050 ms 13136 KB Output is correct
54 Correct 1051 ms 13012 KB Output is correct
55 Correct 1091 ms 13472 KB Output is correct
56 Correct 1060 ms 12988 KB Output is correct
57 Correct 882 ms 20168 KB Output is correct
58 Correct 568 ms 15456 KB Output is correct
59 Correct 1344 ms 27172 KB Output is correct
60 Correct 557 ms 15056 KB Output is correct
61 Correct 1649 ms 26652 KB Output is correct
62 Correct 1689 ms 33736 KB Output is correct
63 Correct 1621 ms 34924 KB Output is correct
64 Correct 1614 ms 33972 KB Output is correct
65 Correct 1340 ms 17424 KB Output is correct
66 Correct 1257 ms 16312 KB Output is correct
67 Correct 1602 ms 27096 KB Output is correct
68 Correct 1530 ms 23876 KB Output is correct
69 Correct 1189 ms 25104 KB Output is correct
70 Correct 1180 ms 24888 KB Output is correct
71 Correct 1180 ms 25096 KB Output is correct
72 Correct 1221 ms 24820 KB Output is correct
73 Correct 1268 ms 18004 KB Output is correct
74 Correct 1468 ms 24080 KB Output is correct
75 Correct 1522 ms 35016 KB Output is correct
76 Correct 1530 ms 34508 KB Output is correct
77 Correct 1044 ms 13272 KB Output is correct
78 Correct 1056 ms 13392 KB Output is correct
79 Correct 1045 ms 13136 KB Output is correct
80 Correct 1047 ms 13012 KB Output is correct
81 Correct 1507 ms 23232 KB Output is correct
82 Correct 1298 ms 18216 KB Output is correct
83 Correct 1182 ms 15764 KB Output is correct
84 Correct 1565 ms 23900 KB Output is correct
85 Correct 1601 ms 27408 KB Output is correct
86 Correct 1806 ms 28904 KB Output is correct
87 Correct 1464 ms 21196 KB Output is correct
88 Correct 1224 ms 15816 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 12636 KB Output is correct
3 Correct 25 ms 12780 KB Output is correct
4 Correct 26 ms 12636 KB Output is correct
5 Correct 18 ms 12636 KB Output is correct
6 Correct 23 ms 12636 KB Output is correct
7 Correct 25 ms 12888 KB Output is correct
8 Correct 17 ms 12636 KB Output is correct
9 Correct 19 ms 12632 KB Output is correct
10 Correct 8 ms 12636 KB Output is correct
11 Correct 29 ms 12776 KB Output is correct
12 Correct 30 ms 12796 KB Output is correct
13 Correct 8 ms 12636 KB Output is correct
14 Correct 18 ms 12636 KB Output is correct
15 Correct 26 ms 12636 KB Output is correct
16 Correct 27 ms 12636 KB Output is correct
17 Correct 23 ms 12636 KB Output is correct
18 Correct 10 ms 12636 KB Output is correct
19 Correct 25 ms 12636 KB Output is correct
20 Correct 23 ms 12632 KB Output is correct
21 Correct 1181 ms 25388 KB Output is correct
22 Correct 1208 ms 24976 KB Output is correct
23 Correct 1249 ms 24944 KB Output is correct
24 Correct 1303 ms 25640 KB Output is correct
25 Correct 1576 ms 34392 KB Output is correct
26 Correct 1624 ms 34504 KB Output is correct
27 Correct 1179 ms 25040 KB Output is correct
28 Correct 1211 ms 24852 KB Output is correct
29 Correct 1187 ms 25304 KB Output is correct
30 Correct 718 ms 17644 KB Output is correct
31 Correct 875 ms 19500 KB Output is correct
32 Correct 1540 ms 30108 KB Output is correct
33 Incorrect 1191 ms 13392 KB Output isn't correct
34 Halted 0 ms 0 KB -