oj.uz

Submission #908512

# Submission time Handle Problem Language Result Execution time Memory
908512 2024-01-16T13:15:01 Z daoquanglinh2007 Segments (IZhO18_segments) C++17
59 / 100
 4271 ms 38604 KB 
#include <bits/stdc++.h>
using namespace std;

#define isz(a) (int)(a).size()

const int NM = 1e5, BL = 4000, 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_update(vector <int> node[NM+5], int x, int y){
	while (x <= sz){
		node[x].push_back(y);
		x += x & (-x);
	}
}

void update(vector <int> node[NM+5], vector <int> bit[NM+5], int x, int yy){
	while (x <= sz){
		int y = lower_bound(node[x].begin(), node[x].end(), yy)-node[x].begin()+1;
		while (y <= isz(node[x])){
			bit[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 get(vector <int> node[NM+5], vector <int> bit[NM+5], int x, int yy){
	int res = 0;
	while (x > 0){
		int y = find_pos_ll(node[x], yy);
		while (y > 0){
			res += bit[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]))-get(node1, bit1, find_pos(arr, -k[i]), -b[i]+k[i]-2)
			          -get(node2, bit2, 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_update(node1, x, -l[j]);
				fake_update(node2, 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;
				update(node1, bit1, x, -l[j]);
				update(node2, bit2, 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 12632 KB Output is correct
3 Correct 18 ms 12888 KB Output is correct
4 Correct 17 ms 12892 KB Output is correct
5 Correct 11 ms 13712 KB Output is correct
6 Correct 19 ms 13660 KB Output is correct
7 Correct 19 ms 12892 KB Output is correct
8 Correct 17 ms 13404 KB Output is correct
9 Correct 17 ms 13280 KB Output is correct
10 Correct 11 ms 13660 KB Output is correct
11 Correct 26 ms 13288 KB Output is correct
12 Correct 26 ms 13400 KB Output is correct
13 Correct 11 ms 13660 KB Output is correct
14 Correct 20 ms 13404 KB Output is correct
15 Correct 18 ms 12892 KB Output is correct
16 Correct 18 ms 12792 KB Output is correct
17 Correct 19 ms 13032 KB Output is correct
18 Correct 13 ms 13660 KB Output is correct
19 Correct 19 ms 13148 KB Output is correct
20 Correct 19 ms 13148 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2633 ms 25004 KB Output is correct
2 Correct 2635 ms 24600 KB Output is correct
3 Correct 2596 ms 24904 KB Output is correct
4 Correct 2756 ms 26196 KB Output is correct
5 Correct 4043 ms 35560 KB Output is correct
6 Correct 4098 ms 38460 KB Output is correct
7 Correct 2659 ms 27592 KB Output is correct
8 Correct 2595 ms 27664 KB Output is correct
9 Correct 2554 ms 27928 KB Output is correct
10 Correct 1084 ms 20804 KB Output is correct
11 Correct 1369 ms 22208 KB Output is correct
12 Correct 3806 ms 32952 KB Output is correct

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 416 ms 13192 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 349 ms 13116 KB Output is correct
2 Correct 358 ms 13136 KB Output is correct
3 Correct 353 ms 12956 KB Output is correct
4 Correct 363 ms 13140 KB Output is correct
5 Correct 3877 ms 31836 KB Output is correct
6 Correct 822 ms 19440 KB Output is correct
7 Correct 4078 ms 35608 KB Output is correct
8 Correct 1153 ms 20844 KB Output is correct
9 Correct 2035 ms 23708 KB Output is correct
10 Correct 3724 ms 33128 KB Output is correct
11 Correct 857 ms 18260 KB Output is correct
12 Correct 4174 ms 37972 KB Output is correct
13 Correct 2932 ms 27952 KB Output is correct
14 Correct 1597 ms 22128 KB Output is correct
15 Correct 4098 ms 36372 KB Output is correct
16 Correct 3095 ms 29064 KB Output is correct
17 Correct 2574 ms 27708 KB Output is correct
18 Correct 2627 ms 27640 KB Output is correct
19 Correct 2610 ms 27700 KB Output is correct
20 Correct 2614 ms 27864 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 18 ms 12888 KB Output is correct
4 Correct 17 ms 12892 KB Output is correct
5 Correct 11 ms 13712 KB Output is correct
6 Correct 19 ms 13660 KB Output is correct
7 Correct 19 ms 12892 KB Output is correct
8 Correct 17 ms 13404 KB Output is correct
9 Correct 17 ms 13280 KB Output is correct
10 Correct 11 ms 13660 KB Output is correct
11 Correct 26 ms 13288 KB Output is correct
12 Correct 26 ms 13400 KB Output is correct
13 Correct 11 ms 13660 KB Output is correct
14 Correct 20 ms 13404 KB Output is correct
15 Correct 18 ms 12892 KB Output is correct
16 Correct 18 ms 12792 KB Output is correct
17 Correct 19 ms 13032 KB Output is correct
18 Correct 13 ms 13660 KB Output is correct
19 Correct 19 ms 13148 KB Output is correct
20 Correct 19 ms 13148 KB Output is correct
21 Correct 2633 ms 25004 KB Output is correct
22 Correct 2635 ms 24600 KB Output is correct
23 Correct 2596 ms 24904 KB Output is correct
24 Correct 2756 ms 26196 KB Output is correct
25 Correct 4043 ms 35560 KB Output is correct
26 Correct 4098 ms 38460 KB Output is correct
27 Correct 2659 ms 27592 KB Output is correct
28 Correct 2595 ms 27664 KB Output is correct
29 Correct 2554 ms 27928 KB Output is correct
30 Correct 1084 ms 20804 KB Output is correct
31 Correct 1369 ms 22208 KB Output is correct
32 Correct 3806 ms 32952 KB Output is correct
33 Correct 349 ms 13116 KB Output is correct
34 Correct 358 ms 13136 KB Output is correct
35 Correct 353 ms 12956 KB Output is correct
36 Correct 363 ms 13140 KB Output is correct
37 Correct 3877 ms 31836 KB Output is correct
38 Correct 822 ms 19440 KB Output is correct
39 Correct 4078 ms 35608 KB Output is correct
40 Correct 1153 ms 20844 KB Output is correct
41 Correct 2035 ms 23708 KB Output is correct
42 Correct 3724 ms 33128 KB Output is correct
43 Correct 857 ms 18260 KB Output is correct
44 Correct 4174 ms 37972 KB Output is correct
45 Correct 2932 ms 27952 KB Output is correct
46 Correct 1597 ms 22128 KB Output is correct
47 Correct 4098 ms 36372 KB Output is correct
48 Correct 3095 ms 29064 KB Output is correct
49 Correct 2574 ms 27708 KB Output is correct
50 Correct 2627 ms 27640 KB Output is correct
51 Correct 2610 ms 27700 KB Output is correct
52 Correct 2614 ms 27864 KB Output is correct
53 Correct 370 ms 15156 KB Output is correct
54 Correct 363 ms 15464 KB Output is correct
55 Correct 374 ms 15440 KB Output is correct
56 Correct 353 ms 15220 KB Output is correct
57 Correct 1551 ms 23260 KB Output is correct
58 Correct 642 ms 18332 KB Output is correct
59 Correct 3118 ms 29912 KB Output is correct
60 Correct 536 ms 17908 KB Output is correct
61 Correct 2984 ms 28900 KB Output is correct
62 Correct 4201 ms 36156 KB Output is correct
63 Correct 4271 ms 37992 KB Output is correct
64 Correct 4187 ms 36168 KB Output is correct
65 Correct 1143 ms 19392 KB Output is correct
66 Correct 927 ms 18240 KB Output is correct
67 Correct 3268 ms 29364 KB Output is correct
68 Correct 2526 ms 25996 KB Output is correct
69 Correct 2646 ms 27732 KB Output is correct
70 Correct 2690 ms 27620 KB Output is correct
71 Correct 2583 ms 27452 KB Output is correct
72 Correct 2652 ms 27700 KB Output is correct
73 Correct 1303 ms 20376 KB Output is correct
74 Correct 2562 ms 26064 KB Output is correct
75 Correct 4205 ms 38604 KB Output is correct
76 Correct 4041 ms 38280 KB Output is correct
77 Correct 361 ms 15108 KB Output is correct
78 Correct 358 ms 15012 KB Output is correct
79 Correct 363 ms 15172 KB Output is correct
80 Correct 361 ms 15188 KB Output is correct
81 Correct 3102 ms 25404 KB Output is correct
82 Correct 1298 ms 20168 KB Output is correct
83 Correct 809 ms 17656 KB Output is correct
84 Correct 2406 ms 25644 KB Output is correct
85 Correct 3115 ms 29500 KB Output is correct
86 Correct 3512 ms 31496 KB Output is correct
87 Correct 1910 ms 23536 KB Output is correct
88 Correct 837 ms 18004 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 18 ms 12888 KB Output is correct
4 Correct 17 ms 12892 KB Output is correct
5 Correct 11 ms 13712 KB Output is correct
6 Correct 19 ms 13660 KB Output is correct
7 Correct 19 ms 12892 KB Output is correct
8 Correct 17 ms 13404 KB Output is correct
9 Correct 17 ms 13280 KB Output is correct
10 Correct 11 ms 13660 KB Output is correct
11 Correct 26 ms 13288 KB Output is correct
12 Correct 26 ms 13400 KB Output is correct
13 Correct 11 ms 13660 KB Output is correct
14 Correct 20 ms 13404 KB Output is correct
15 Correct 18 ms 12892 KB Output is correct
16 Correct 18 ms 12792 KB Output is correct
17 Correct 19 ms 13032 KB Output is correct
18 Correct 13 ms 13660 KB Output is correct
19 Correct 19 ms 13148 KB Output is correct
20 Correct 19 ms 13148 KB Output is correct
21 Correct 2633 ms 25004 KB Output is correct
22 Correct 2635 ms 24600 KB Output is correct
23 Correct 2596 ms 24904 KB Output is correct
24 Correct 2756 ms 26196 KB Output is correct
25 Correct 4043 ms 35560 KB Output is correct
26 Correct 4098 ms 38460 KB Output is correct
27 Correct 2659 ms 27592 KB Output is correct
28 Correct 2595 ms 27664 KB Output is correct
29 Correct 2554 ms 27928 KB Output is correct
30 Correct 1084 ms 20804 KB Output is correct
31 Correct 1369 ms 22208 KB Output is correct
32 Correct 3806 ms 32952 KB Output is correct
33 Incorrect 416 ms 13192 KB Output isn't correct
34 Halted 0 ms 0 KB -