oj.uz

답안 #908890

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
908890 2024-01-17T01:23:08 Z daoquanglinh2007 Segments (IZhO18_segments) C++17
59 / 100
 1173 ms 35360 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--;
				}
			}
			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 12624 KB Output is correct
3 Correct 26 ms 12924 KB Output is correct
4 Correct 30 ms 12888 KB Output is correct
5 Correct 18 ms 12892 KB Output is correct
6 Correct 23 ms 12888 KB Output is correct
7 Correct 27 ms 12928 KB Output is correct
8 Correct 17 ms 12892 KB Output is correct
9 Correct 19 ms 12888 KB Output is correct
10 Correct 9 ms 12888 KB Output is correct
11 Correct 33 ms 12892 KB Output is correct
12 Correct 32 ms 13208 KB Output is correct
13 Correct 8 ms 12892 KB Output is correct
14 Correct 18 ms 12892 KB Output is correct
15 Correct 26 ms 12892 KB Output is correct
16 Correct 26 ms 12892 KB Output is correct
17 Correct 24 ms 12888 KB Output is correct
18 Correct 10 ms 12940 KB Output is correct
19 Correct 25 ms 12892 KB Output is correct
20 Correct 24 ms 12892 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 602 ms 26756 KB Output is correct
2 Correct 563 ms 27036 KB Output is correct
3 Correct 568 ms 27328 KB Output is correct
4 Correct 672 ms 27516 KB Output is correct
5 Correct 522 ms 35360 KB Output is correct
6 Correct 447 ms 35040 KB Output is correct
7 Correct 576 ms 26660 KB Output is correct
8 Correct 596 ms 26552 KB Output is correct
9 Correct 588 ms 26840 KB Output is correct
10 Correct 607 ms 20580 KB Output is correct
11 Correct 662 ms 22020 KB Output is correct
12 Correct 629 ms 31484 KB Output is correct

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1173 ms 15992 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1044 ms 16124 KB Output is correct
2 Correct 1032 ms 16200 KB Output is correct
3 Correct 1044 ms 16296 KB Output is correct
4 Correct 1039 ms 16248 KB Output is correct
5 Correct 609 ms 32720 KB Output is correct
6 Correct 677 ms 19936 KB Output is correct
7 Correct 589 ms 34148 KB Output is correct
8 Correct 642 ms 21172 KB Output is correct
9 Correct 977 ms 23340 KB Output is correct
10 Correct 722 ms 31464 KB Output is correct
11 Correct 1050 ms 18608 KB Output is correct
12 Correct 442 ms 35172 KB Output is correct
13 Correct 845 ms 26948 KB Output is correct
14 Correct 1014 ms 21804 KB Output is correct
15 Correct 522 ms 33736 KB Output is correct
16 Correct 817 ms 27952 KB Output is correct
17 Correct 578 ms 26876 KB Output is correct
18 Correct 596 ms 26560 KB Output is correct
19 Correct 613 ms 26876 KB Output is correct
20 Correct 594 ms 27000 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 12624 KB Output is correct
3 Correct 26 ms 12924 KB Output is correct
4 Correct 30 ms 12888 KB Output is correct
5 Correct 18 ms 12892 KB Output is correct
6 Correct 23 ms 12888 KB Output is correct
7 Correct 27 ms 12928 KB Output is correct
8 Correct 17 ms 12892 KB Output is correct
9 Correct 19 ms 12888 KB Output is correct
10 Correct 9 ms 12888 KB Output is correct
11 Correct 33 ms 12892 KB Output is correct
12 Correct 32 ms 13208 KB Output is correct
13 Correct 8 ms 12892 KB Output is correct
14 Correct 18 ms 12892 KB Output is correct
15 Correct 26 ms 12892 KB Output is correct
16 Correct 26 ms 12892 KB Output is correct
17 Correct 24 ms 12888 KB Output is correct
18 Correct 10 ms 12940 KB Output is correct
19 Correct 25 ms 12892 KB Output is correct
20 Correct 24 ms 12892 KB Output is correct
21 Correct 602 ms 26756 KB Output is correct
22 Correct 563 ms 27036 KB Output is correct
23 Correct 568 ms 27328 KB Output is correct
24 Correct 672 ms 27516 KB Output is correct
25 Correct 522 ms 35360 KB Output is correct
26 Correct 447 ms 35040 KB Output is correct
27 Correct 576 ms 26660 KB Output is correct
28 Correct 596 ms 26552 KB Output is correct
29 Correct 588 ms 26840 KB Output is correct
30 Correct 607 ms 20580 KB Output is correct
31 Correct 662 ms 22020 KB Output is correct
32 Correct 629 ms 31484 KB Output is correct
33 Correct 1044 ms 16124 KB Output is correct
34 Correct 1032 ms 16200 KB Output is correct
35 Correct 1044 ms 16296 KB Output is correct
36 Correct 1039 ms 16248 KB Output is correct
37 Correct 609 ms 32720 KB Output is correct
38 Correct 677 ms 19936 KB Output is correct
39 Correct 589 ms 34148 KB Output is correct
40 Correct 642 ms 21172 KB Output is correct
41 Correct 977 ms 23340 KB Output is correct
42 Correct 722 ms 31464 KB Output is correct
43 Correct 1050 ms 18608 KB Output is correct
44 Correct 442 ms 35172 KB Output is correct
45 Correct 845 ms 26948 KB Output is correct
46 Correct 1014 ms 21804 KB Output is correct
47 Correct 522 ms 33736 KB Output is correct
48 Correct 817 ms 27952 KB Output is correct
49 Correct 578 ms 26876 KB Output is correct
50 Correct 596 ms 26560 KB Output is correct
51 Correct 613 ms 26876 KB Output is correct
52 Correct 594 ms 27000 KB Output is correct
53 Correct 1042 ms 16384 KB Output is correct
54 Correct 1059 ms 16080 KB Output is correct
55 Correct 1056 ms 16020 KB Output is correct
56 Correct 1044 ms 16080 KB Output is correct
57 Correct 680 ms 22848 KB Output is correct
58 Correct 609 ms 19172 KB Output is correct
59 Correct 643 ms 28508 KB Output is correct
60 Correct 644 ms 18564 KB Output is correct
61 Correct 816 ms 27340 KB Output is correct
62 Correct 550 ms 34308 KB Output is correct
63 Correct 451 ms 34756 KB Output is correct
64 Correct 568 ms 34844 KB Output is correct
65 Correct 1083 ms 19852 KB Output is correct
66 Correct 1078 ms 18840 KB Output is correct
67 Correct 843 ms 28212 KB Output is correct
68 Correct 931 ms 25540 KB Output is correct
69 Correct 561 ms 26816 KB Output is correct
70 Correct 590 ms 26568 KB Output is correct
71 Correct 584 ms 26844 KB Output is correct
72 Correct 606 ms 26708 KB Output is correct
73 Correct 1008 ms 20436 KB Output is correct
74 Correct 894 ms 25112 KB Output is correct
75 Correct 419 ms 34504 KB Output is correct
76 Correct 460 ms 34864 KB Output is correct
77 Correct 1040 ms 16208 KB Output is correct
78 Correct 1047 ms 16272 KB Output is correct
79 Correct 1042 ms 16252 KB Output is correct
80 Correct 1029 ms 16200 KB Output is correct
81 Correct 947 ms 25032 KB Output is correct
82 Correct 1042 ms 20448 KB Output is correct
83 Correct 1043 ms 18224 KB Output is correct
84 Correct 913 ms 25032 KB Output is correct
85 Correct 806 ms 28220 KB Output is correct
86 Correct 773 ms 30452 KB Output is correct
87 Correct 1000 ms 23244 KB Output is correct
88 Correct 1069 ms 18440 KB Output is correct

Subtask #6
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 12636 KB Output is correct
2 Correct 3 ms 12624 KB Output is correct
3 Correct 26 ms 12924 KB Output is correct
4 Correct 30 ms 12888 KB Output is correct
5 Correct 18 ms 12892 KB Output is correct
6 Correct 23 ms 12888 KB Output is correct
7 Correct 27 ms 12928 KB Output is correct
8 Correct 17 ms 12892 KB Output is correct
9 Correct 19 ms 12888 KB Output is correct
10 Correct 9 ms 12888 KB Output is correct
11 Correct 33 ms 12892 KB Output is correct
12 Correct 32 ms 13208 KB Output is correct
13 Correct 8 ms 12892 KB Output is correct
14 Correct 18 ms 12892 KB Output is correct
15 Correct 26 ms 12892 KB Output is correct
16 Correct 26 ms 12892 KB Output is correct
17 Correct 24 ms 12888 KB Output is correct
18 Correct 10 ms 12940 KB Output is correct
19 Correct 25 ms 12892 KB Output is correct
20 Correct 24 ms 12892 KB Output is correct
21 Correct 602 ms 26756 KB Output is correct
22 Correct 563 ms 27036 KB Output is correct
23 Correct 568 ms 27328 KB Output is correct
24 Correct 672 ms 27516 KB Output is correct
25 Correct 522 ms 35360 KB Output is correct
26 Correct 447 ms 35040 KB Output is correct
27 Correct 576 ms 26660 KB Output is correct
28 Correct 596 ms 26552 KB Output is correct
29 Correct 588 ms 26840 KB Output is correct
30 Correct 607 ms 20580 KB Output is correct
31 Correct 662 ms 22020 KB Output is correct
32 Correct 629 ms 31484 KB Output is correct
33 Incorrect 1173 ms 15992 KB Output isn't correct
34 Halted 0 ms 0 KB -