oj.uz

Submission #908892

# Submission time Handle Problem Language Result Execution time Memory
908892 2024-01-17T01:27:24 Z daoquanglinh2007 Segments (IZhO18_segments) C++17
59 / 100
 1088 ms 33060 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);
	
	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]);
			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--;
				}
			}
			assert(lastans >= 0);
			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 12636 KB Output is correct
3 Correct 25 ms 12804 KB Output is correct
4 Correct 27 ms 12636 KB Output is correct
5 Correct 18 ms 12636 KB Output is correct
6 Correct 22 ms 12636 KB Output is correct
7 Correct 26 ms 12636 KB Output is correct
8 Correct 20 ms 12632 KB Output is correct
9 Correct 20 ms 12636 KB Output is correct
10 Correct 8 ms 12632 KB Output is correct
11 Correct 30 ms 12636 KB Output is correct
12 Correct 32 ms 12824 KB Output is correct
13 Correct 8 ms 12632 KB Output is correct
14 Correct 19 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 24 ms 12636 KB Output is correct
18 Correct 12 ms 12632 KB Output is correct
19 Correct 25 ms 12832 KB Output is correct
20 Correct 23 ms 12636 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 544 ms 24236 KB Output is correct
2 Correct 532 ms 24260 KB Output is correct
3 Correct 582 ms 24640 KB Output is correct
4 Correct 682 ms 24876 KB Output is correct
5 Correct 591 ms 33060 KB Output is correct
6 Correct 501 ms 32704 KB Output is correct
7 Correct 572 ms 23756 KB Output is correct
8 Correct 506 ms 23888 KB Output is correct
9 Correct 507 ms 24036 KB Output is correct
10 Correct 498 ms 17804 KB Output is correct
11 Correct 591 ms 19128 KB Output is correct
12 Correct 596 ms 29156 KB Output is correct

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Runtime error 127 ms 25940 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1043 ms 14184 KB Output is correct
2 Correct 1042 ms 14012 KB Output is correct
3 Correct 1081 ms 14064 KB Output is correct
4 Correct 1066 ms 14352 KB Output is correct
5 Correct 564 ms 30104 KB Output is correct
6 Correct 539 ms 16644 KB Output is correct
7 Correct 583 ms 31684 KB Output is correct
8 Correct 473 ms 17992 KB Output is correct
9 Correct 975 ms 21164 KB Output is correct
10 Correct 742 ms 29060 KB Output is correct
11 Correct 1053 ms 16440 KB Output is correct
12 Correct 438 ms 32972 KB Output is correct
13 Correct 839 ms 24844 KB Output is correct
14 Correct 1014 ms 19680 KB Output is correct
15 Correct 524 ms 31612 KB Output is correct
16 Correct 826 ms 25652 KB Output is correct
17 Correct 496 ms 24136 KB Output is correct
18 Correct 485 ms 24052 KB Output is correct
19 Correct 507 ms 24112 KB Output is correct
20 Correct 535 ms 24524 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 12804 KB Output is correct
4 Correct 27 ms 12636 KB Output is correct
5 Correct 18 ms 12636 KB Output is correct
6 Correct 22 ms 12636 KB Output is correct
7 Correct 26 ms 12636 KB Output is correct
8 Correct 20 ms 12632 KB Output is correct
9 Correct 20 ms 12636 KB Output is correct
10 Correct 8 ms 12632 KB Output is correct
11 Correct 30 ms 12636 KB Output is correct
12 Correct 32 ms 12824 KB Output is correct
13 Correct 8 ms 12632 KB Output is correct
14 Correct 19 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 24 ms 12636 KB Output is correct
18 Correct 12 ms 12632 KB Output is correct
19 Correct 25 ms 12832 KB Output is correct
20 Correct 23 ms 12636 KB Output is correct
21 Correct 544 ms 24236 KB Output is correct
22 Correct 532 ms 24260 KB Output is correct
23 Correct 582 ms 24640 KB Output is correct
24 Correct 682 ms 24876 KB Output is correct
25 Correct 591 ms 33060 KB Output is correct
26 Correct 501 ms 32704 KB Output is correct
27 Correct 572 ms 23756 KB Output is correct
28 Correct 506 ms 23888 KB Output is correct
29 Correct 507 ms 24036 KB Output is correct
30 Correct 498 ms 17804 KB Output is correct
31 Correct 591 ms 19128 KB Output is correct
32 Correct 596 ms 29156 KB Output is correct
33 Correct 1043 ms 14184 KB Output is correct
34 Correct 1042 ms 14012 KB Output is correct
35 Correct 1081 ms 14064 KB Output is correct
36 Correct 1066 ms 14352 KB Output is correct
37 Correct 564 ms 30104 KB Output is correct
38 Correct 539 ms 16644 KB Output is correct
39 Correct 583 ms 31684 KB Output is correct
40 Correct 473 ms 17992 KB Output is correct
41 Correct 975 ms 21164 KB Output is correct
42 Correct 742 ms 29060 KB Output is correct
43 Correct 1053 ms 16440 KB Output is correct
44 Correct 438 ms 32972 KB Output is correct
45 Correct 839 ms 24844 KB Output is correct
46 Correct 1014 ms 19680 KB Output is correct
47 Correct 524 ms 31612 KB Output is correct
48 Correct 826 ms 25652 KB Output is correct
49 Correct 496 ms 24136 KB Output is correct
50 Correct 485 ms 24052 KB Output is correct
51 Correct 507 ms 24112 KB Output is correct
52 Correct 535 ms 24524 KB Output is correct
53 Correct 1045 ms 14120 KB Output is correct
54 Correct 1057 ms 14236 KB Output is correct
55 Correct 1049 ms 14388 KB Output is correct
56 Correct 1044 ms 14208 KB Output is correct
57 Correct 530 ms 20064 KB Output is correct
58 Correct 477 ms 15896 KB Output is correct
59 Correct 577 ms 26060 KB Output is correct
60 Correct 493 ms 15296 KB Output is correct
61 Correct 828 ms 25128 KB Output is correct
62 Correct 568 ms 31564 KB Output is correct
63 Correct 486 ms 32708 KB Output is correct
64 Correct 547 ms 32484 KB Output is correct
65 Correct 1063 ms 17696 KB Output is correct
66 Correct 1065 ms 16520 KB Output is correct
67 Correct 802 ms 26176 KB Output is correct
68 Correct 932 ms 23004 KB Output is correct
69 Correct 519 ms 24084 KB Output is correct
70 Correct 515 ms 23752 KB Output is correct
71 Correct 533 ms 24160 KB Output is correct
72 Correct 523 ms 23868 KB Output is correct
73 Correct 1025 ms 18224 KB Output is correct
74 Correct 884 ms 22984 KB Output is correct
75 Correct 414 ms 32452 KB Output is correct
76 Correct 474 ms 32724 KB Output is correct
77 Correct 1040 ms 14112 KB Output is correct
78 Correct 1049 ms 14364 KB Output is correct
79 Correct 1034 ms 13976 KB Output is correct
80 Correct 1040 ms 13980 KB Output is correct
81 Correct 914 ms 22884 KB Output is correct
82 Correct 1058 ms 18252 KB Output is correct
83 Correct 1088 ms 16436 KB Output is correct
84 Correct 917 ms 22988 KB Output is correct
85 Correct 813 ms 25888 KB Output is correct
86 Correct 777 ms 28312 KB Output is correct
87 Correct 1006 ms 21708 KB Output is correct
88 Correct 1085 ms 16176 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 12804 KB Output is correct
4 Correct 27 ms 12636 KB Output is correct
5 Correct 18 ms 12636 KB Output is correct
6 Correct 22 ms 12636 KB Output is correct
7 Correct 26 ms 12636 KB Output is correct
8 Correct 20 ms 12632 KB Output is correct
9 Correct 20 ms 12636 KB Output is correct
10 Correct 8 ms 12632 KB Output is correct
11 Correct 30 ms 12636 KB Output is correct
12 Correct 32 ms 12824 KB Output is correct
13 Correct 8 ms 12632 KB Output is correct
14 Correct 19 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 24 ms 12636 KB Output is correct
18 Correct 12 ms 12632 KB Output is correct
19 Correct 25 ms 12832 KB Output is correct
20 Correct 23 ms 12636 KB Output is correct
21 Correct 544 ms 24236 KB Output is correct
22 Correct 532 ms 24260 KB Output is correct
23 Correct 582 ms 24640 KB Output is correct
24 Correct 682 ms 24876 KB Output is correct
25 Correct 591 ms 33060 KB Output is correct
26 Correct 501 ms 32704 KB Output is correct
27 Correct 572 ms 23756 KB Output is correct
28 Correct 506 ms 23888 KB Output is correct
29 Correct 507 ms 24036 KB Output is correct
30 Correct 498 ms 17804 KB Output is correct
31 Correct 591 ms 19128 KB Output is correct
32 Correct 596 ms 29156 KB Output is correct
33 Runtime error 127 ms 25940 KB Execution killed with signal 6
34 Halted 0 ms 0 KB -