oj.uz

Submission #758577

# Submission time Handle Problem Language Result Execution time Memory
758577 2023-06-14T23:19:15 Z scanhex Segments (IZhO18_segments) C++17
75 / 100
 5000 ms 31804 KB 
#include <bits/stdc++.h>

using namespace std;
using nagai = long long;

struct dss {
	vector<pair<int,int>> segs;
	void insert(int l, int r) {
		segs.push_back({l, r});
	}
	int get(int l, int r, int k) {
		if (k == 0) return segs.size();
		int res = 0;
		for (auto& x : segs) {
			int ll = max(x.first, l), rr = min(x.second, r); 
			if (rr - ll + 1 >= k)
				++res;
		}
		return res;
	}
};

const int oo = 0x3f3f3f3f;
 
struct static1d {
	vector<int> coords;
	void clear() {
		coords.clear();
	}

	void add(int c) {
		coords.push_back(c);
	}

	void finalize() {
		sort(coords.begin(), coords.end());
	}

	int get(int l, int r) {
		if (l > r) return 0;
		auto itr = upper_bound(coords.begin(), coords.end(), r);
		auto itl = lower_bound(coords.begin(), coords.end(), l);
		//cerr << "coords\n";
		//for(auto& x : coords) 
			//cerr << x << ' ';
		//cerr << '\n';
		//cerr << l << ' ' << r << ' ' << itr - itl << '\n';
		return itr - itl;
	}
};

struct static2d {
	vector<static1d> v;
	vector<int> xs;

	void add(int x, int y) {
		for (++x; x < v.size(); x = (x | x - 1) + 1)
			v[x].add(y);
	}

	void build(vector<pair<int,int>> pts) {
		xs.clear();
		for (auto& x : v) 
			x.clear();
		for (auto& p : pts) 
			xs.push_back(p.first);
		xs.erase(unique(xs.begin(), xs.end()), xs.end());
		v.resize(xs.size() + 1);
		int ptr = 0; 
		for (auto p : pts) {
			while (xs[ptr] < p.first) ++ptr;
			add(ptr, p.second);
		}
		for (int i = 0; i < v.size(); ++i) 
			v[i].finalize();
	}

	int get(int xr, int y1, int y2) {
		++xr;
		int xrr = xr;
		xr = lower_bound(xs.begin(), xs.end(), xr) - xs.begin();
		int res = 0;
		for (; xr; xr &= xr - 1) 
			res += v[xr].get(y1, y2);
		//cerr << xrr << ' ' << y1 << ' ' << y2 << ' ' << res << '\n';
		return res;
	}

	// all inclusive
	int get(int x1, int x2, int y1, int y2) {
		if (x1 > x2) return 0;
		return get(x2, y1, y2) - get(x1 - 1, y1, y2);
	}
};

const int BL = 1000;

struct rofl2d {
	vector<pair<int,int>> all;
	vector<pair<int,int>> block;
	static2d st;
	
	void insert(int x, int y) {
		block.push_back({x, y});
		if (block.size() >= BL) {
			sort(block.begin(), block.end());
			vector<pair<int, int>> newall(all.size() + block.size());
			merge(all.begin(), all.end(), block.begin(), block.end(), newall.begin());
			all = std::move(newall);
			block.clear();
			st.build(all);
		}
	}

	int get(int x1, int x2, int y1, int y2) {
		int res = st.get(x1, x2, y1, y2);
		for (auto p : block) 
			if (x1 <= p.first && p.first <= x2 && y1 <= p.second && p.second <= y2) 
				++res;
		return res;
	}
};


struct ds {
	int tot = 0;
	rofl2d rofl_l, rofl_r;
	void insert(int l, int r) {
		++tot;
		rofl_l.insert(l, r - l);
		rofl_r.insert(r, r - l);
	}
	int get(int l, int r, int k) {
		if (r - l + 1 < k) return 0;
		if (k == 0) return tot;
		int res = tot;
		//cerr << "rofl_l" << '\n';
		res -= rofl_l.get(r - k + 2, oo, k - 1, oo);
		//cerr << "rofl_r" << '\n';
		res -= rofl_r.get(0, l + k - 2, k - 1, oo);
		//cerr << "rofl_l" << '\n';
		res -= rofl_l.get(0, oo, 0, k - 2);
		return res;
	}
};

void stress() {
	int C = 5;
	for (int i = 0; i < 10000; ++i) {
		ds smart;
		dss stupid;
		stringstream ss;
		for (int i = 0; i < 10; ++i) {
			int x = rand() % C, y = rand() % C;
			if (x > y) swap(x, y);
			ss << "1 " << x << ' ' << y << '\n';
			smart.insert(x, y);
			stupid.insert(x, y);

			int a = rand() % C, b = rand() % C, k = rand() % C;
			if (a > b) swap(a, b);
			if (smart.get(a, b, k) != stupid.get(a, b, k)) {
				ss << smart.get(a, b, k) << ' ' << stupid.get(a, b, k) << '\n';
				ss << "3 " << a << ' ' << b << ' ' << k << '\n';
				cerr << ss.str();
				exit(1);
			}
		}
	}
	exit(0);
}


int main() {
	//stress();
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n, t; 
	cin >> n >> t; 
	int lastans = 0;
	vector<pair<int, int>> segs;
	ds add, del;
	while (n--) {
		int tt;
		cin >> tt; 
		if (tt == 1) {
			int a, b;
			cin >> a >> b; 
			a ^= t * lastans;
			b ^= t * lastans;
			if (a > b) swap(a, b);
			segs.push_back({a, b});
			add.insert(a, b);
		}
		else if (tt == 2) {
			int id; 
			cin >> id; 
			--id;
			del.insert(segs[id].first, segs[id].second);
		}
		else {
			int a, b, k;
			cin >> a >> b >> k;
			a ^= t * lastans;
			b ^= t * lastans;
			if (a > b) swap(a, b);
			lastans = add.get(a, b, k) - del.get(a, b, k);
			cout << lastans << '\n';
		}
	}
}

Compilation message

segments.cpp: In member function 'void static2d::add(int, int)':
segments.cpp:57:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<static1d>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |   for (++x; x < v.size(); x = (x | x - 1) + 1)
      |             ~~^~~~~~~~~~
segments.cpp:57:38: warning: suggest parentheses around arithmetic in operand of '|' [-Wparentheses]
   57 |   for (++x; x < v.size(); x = (x | x - 1) + 1)
      |                                    ~~^~~
segments.cpp: In member function 'void static2d::build(std::vector<std::pair<int, int> >)':
segments.cpp:74:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<static1d>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   74 |   for (int i = 0; i < v.size(); ++i)
      |                   ~~^~~~~~~~~~
segments.cpp: In member function 'int static2d::get(int, int, int)':
segments.cpp:80:7: warning: unused variable 'xrr' [-Wunused-variable]
   80 |   int xrr = xr;
      |       ^~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 16 ms 700 KB Output is correct
4 Correct 16 ms 596 KB Output is correct
5 Correct 12 ms 980 KB Output is correct
6 Correct 15 ms 852 KB Output is correct
7 Correct 17 ms 820 KB Output is correct
8 Correct 11 ms 852 KB Output is correct
9 Correct 11 ms 928 KB Output is correct
10 Correct 7 ms 980 KB Output is correct
11 Correct 17 ms 612 KB Output is correct
12 Correct 17 ms 712 KB Output is correct
13 Correct 8 ms 980 KB Output is correct
14 Correct 12 ms 848 KB Output is correct
15 Correct 17 ms 596 KB Output is correct
16 Correct 15 ms 608 KB Output is correct
17 Correct 15 ms 852 KB Output is correct
18 Correct 9 ms 1096 KB Output is correct
19 Correct 13 ms 784 KB Output is correct
20 Correct 12 ms 780 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1301 ms 12272 KB Output is correct
2 Correct 1327 ms 11932 KB Output is correct
3 Correct 1276 ms 12040 KB Output is correct
4 Correct 1337 ms 13004 KB Output is correct
5 Correct 2944 ms 23392 KB Output is correct
6 Correct 3072 ms 24092 KB Output is correct
7 Correct 1258 ms 11348 KB Output is correct
8 Correct 1258 ms 11856 KB Output is correct
9 Correct 1228 ms 11800 KB Output is correct
10 Correct 525 ms 5120 KB Output is correct
11 Correct 445 ms 6304 KB Output is correct
12 Correct 1691 ms 18456 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 905 ms 14560 KB Output is correct
2 Correct 904 ms 15756 KB Output is correct
3 Correct 905 ms 16320 KB Output is correct
4 Correct 907 ms 15640 KB Output is correct
5 Correct 1711 ms 18680 KB Output is correct
6 Correct 1335 ms 15308 KB Output is correct
7 Correct 1454 ms 17488 KB Output is correct
8 Correct 2914 ms 22516 KB Output is correct
9 Correct 2817 ms 25120 KB Output is correct
10 Correct 1979 ms 20216 KB Output is correct
11 Correct 925 ms 15332 KB Output is correct
12 Correct 2029 ms 22548 KB Output is correct
13 Correct 1751 ms 18752 KB Output is correct
14 Correct 1157 ms 16024 KB Output is correct
15 Correct 1091 ms 15448 KB Output is correct
16 Correct 1014 ms 15444 KB Output is correct
17 Correct 822 ms 11672 KB Output is correct
18 Correct 1114 ms 11888 KB Output is correct
19 Correct 1100 ms 12460 KB Output is correct
20 Correct 841 ms 11836 KB Output is correct
21 Correct 923 ms 15012 KB Output is correct
22 Correct 1296 ms 18332 KB Output is correct
23 Correct 1515 ms 19928 KB Output is correct
24 Correct 1321 ms 18048 KB Output is correct
25 Correct 912 ms 15784 KB Output is correct
26 Correct 899 ms 16024 KB Output is correct
27 Correct 896 ms 15304 KB Output is correct
28 Correct 917 ms 16152 KB Output is correct
29 Correct 1638 ms 20556 KB Output is correct
30 Correct 1619 ms 20572 KB Output is correct
31 Correct 2874 ms 21992 KB Output is correct
32 Correct 1961 ms 21204 KB Output is correct
33 Correct 1807 ms 19448 KB Output is correct
34 Correct 1062 ms 16024 KB Output is correct
35 Correct 1456 ms 17260 KB Output is correct
36 Correct 1933 ms 20536 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1032 ms 16048 KB Output is correct
2 Correct 1033 ms 16220 KB Output is correct
3 Correct 1055 ms 15520 KB Output is correct
4 Correct 1058 ms 16072 KB Output is correct
5 Correct 2114 ms 19044 KB Output is correct
6 Correct 752 ms 3488 KB Output is correct
7 Correct 2284 ms 20300 KB Output is correct
8 Correct 701 ms 5060 KB Output is correct
9 Correct 1374 ms 17812 KB Output is correct
10 Correct 2192 ms 21144 KB Output is correct
11 Correct 1109 ms 15796 KB Output is correct
12 Correct 3017 ms 23460 KB Output is correct
13 Correct 1801 ms 18616 KB Output is correct
14 Correct 1270 ms 16252 KB Output is correct
15 Correct 2801 ms 21660 KB Output is correct
16 Correct 1915 ms 18712 KB Output is correct
17 Correct 1294 ms 12320 KB Output is correct
18 Correct 1263 ms 11344 KB Output is correct
19 Correct 1280 ms 11892 KB Output is correct
20 Correct 1289 ms 11424 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 16 ms 700 KB Output is correct
4 Correct 16 ms 596 KB Output is correct
5 Correct 12 ms 980 KB Output is correct
6 Correct 15 ms 852 KB Output is correct
7 Correct 17 ms 820 KB Output is correct
8 Correct 11 ms 852 KB Output is correct
9 Correct 11 ms 928 KB Output is correct
10 Correct 7 ms 980 KB Output is correct
11 Correct 17 ms 612 KB Output is correct
12 Correct 17 ms 712 KB Output is correct
13 Correct 8 ms 980 KB Output is correct
14 Correct 12 ms 848 KB Output is correct
15 Correct 17 ms 596 KB Output is correct
16 Correct 15 ms 608 KB Output is correct
17 Correct 15 ms 852 KB Output is correct
18 Correct 9 ms 1096 KB Output is correct
19 Correct 13 ms 784 KB Output is correct
20 Correct 12 ms 780 KB Output is correct
21 Correct 1301 ms 12272 KB Output is correct
22 Correct 1327 ms 11932 KB Output is correct
23 Correct 1276 ms 12040 KB Output is correct
24 Correct 1337 ms 13004 KB Output is correct
25 Correct 2944 ms 23392 KB Output is correct
26 Correct 3072 ms 24092 KB Output is correct
27 Correct 1258 ms 11348 KB Output is correct
28 Correct 1258 ms 11856 KB Output is correct
29 Correct 1228 ms 11800 KB Output is correct
30 Correct 525 ms 5120 KB Output is correct
31 Correct 445 ms 6304 KB Output is correct
32 Correct 1691 ms 18456 KB Output is correct
33 Correct 1032 ms 16048 KB Output is correct
34 Correct 1033 ms 16220 KB Output is correct
35 Correct 1055 ms 15520 KB Output is correct
36 Correct 1058 ms 16072 KB Output is correct
37 Correct 2114 ms 19044 KB Output is correct
38 Correct 752 ms 3488 KB Output is correct
39 Correct 2284 ms 20300 KB Output is correct
40 Correct 701 ms 5060 KB Output is correct
41 Correct 1374 ms 17812 KB Output is correct
42 Correct 2192 ms 21144 KB Output is correct
43 Correct 1109 ms 15796 KB Output is correct
44 Correct 3017 ms 23460 KB Output is correct
45 Correct 1801 ms 18616 KB Output is correct
46 Correct 1270 ms 16252 KB Output is correct
47 Correct 2801 ms 21660 KB Output is correct
48 Correct 1915 ms 18712 KB Output is correct
49 Correct 1294 ms 12320 KB Output is correct
50 Correct 1263 ms 11344 KB Output is correct
51 Correct 1280 ms 11892 KB Output is correct
52 Correct 1289 ms 11424 KB Output is correct
53 Correct 1063 ms 14568 KB Output is correct
54 Correct 1096 ms 14696 KB Output is correct
55 Correct 1051 ms 14964 KB Output is correct
56 Correct 1049 ms 16844 KB Output is correct
57 Correct 967 ms 7536 KB Output is correct
58 Correct 222 ms 2512 KB Output is correct
59 Correct 1342 ms 15448 KB Output is correct
60 Correct 531 ms 2052 KB Output is correct
61 Correct 1827 ms 20208 KB Output is correct
62 Correct 2693 ms 22852 KB Output is correct
63 Correct 2915 ms 22640 KB Output is correct
64 Correct 2769 ms 22280 KB Output is correct
65 Correct 1113 ms 14952 KB Output is correct
66 Correct 1072 ms 15760 KB Output is correct
67 Correct 1952 ms 19528 KB Output is correct
68 Correct 1513 ms 16516 KB Output is correct
69 Correct 1267 ms 11796 KB Output is correct
70 Correct 1282 ms 12476 KB Output is correct
71 Correct 1269 ms 12524 KB Output is correct
72 Correct 1291 ms 13040 KB Output is correct
73 Correct 1221 ms 15292 KB Output is correct
74 Correct 1573 ms 18688 KB Output is correct
75 Correct 3131 ms 23260 KB Output is correct
76 Correct 2931 ms 23076 KB Output is correct
77 Correct 1040 ms 16908 KB Output is correct
78 Correct 1033 ms 16088 KB Output is correct
79 Correct 1058 ms 14460 KB Output is correct
80 Correct 1028 ms 15368 KB Output is correct
81 Correct 1511 ms 18128 KB Output is correct
82 Correct 1250 ms 16612 KB Output is correct
83 Correct 1149 ms 15132 KB Output is correct
84 Correct 1556 ms 18352 KB Output is correct
85 Correct 2043 ms 18776 KB Output is correct
86 Correct 2050 ms 20048 KB Output is correct
87 Correct 1321 ms 16620 KB Output is correct
88 Correct 1054 ms 15620 KB Output is correct

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 16 ms 700 KB Output is correct
4 Correct 16 ms 596 KB Output is correct
5 Correct 12 ms 980 KB Output is correct
6 Correct 15 ms 852 KB Output is correct
7 Correct 17 ms 820 KB Output is correct
8 Correct 11 ms 852 KB Output is correct
9 Correct 11 ms 928 KB Output is correct
10 Correct 7 ms 980 KB Output is correct
11 Correct 17 ms 612 KB Output is correct
12 Correct 17 ms 712 KB Output is correct
13 Correct 8 ms 980 KB Output is correct
14 Correct 12 ms 848 KB Output is correct
15 Correct 17 ms 596 KB Output is correct
16 Correct 15 ms 608 KB Output is correct
17 Correct 15 ms 852 KB Output is correct
18 Correct 9 ms 1096 KB Output is correct
19 Correct 13 ms 784 KB Output is correct
20 Correct 12 ms 780 KB Output is correct
21 Correct 1301 ms 12272 KB Output is correct
22 Correct 1327 ms 11932 KB Output is correct
23 Correct 1276 ms 12040 KB Output is correct
24 Correct 1337 ms 13004 KB Output is correct
25 Correct 2944 ms 23392 KB Output is correct
26 Correct 3072 ms 24092 KB Output is correct
27 Correct 1258 ms 11348 KB Output is correct
28 Correct 1258 ms 11856 KB Output is correct
29 Correct 1228 ms 11800 KB Output is correct
30 Correct 525 ms 5120 KB Output is correct
31 Correct 445 ms 6304 KB Output is correct
32 Correct 1691 ms 18456 KB Output is correct
33 Correct 905 ms 14560 KB Output is correct
34 Correct 904 ms 15756 KB Output is correct
35 Correct 905 ms 16320 KB Output is correct
36 Correct 907 ms 15640 KB Output is correct
37 Correct 1711 ms 18680 KB Output is correct
38 Correct 1335 ms 15308 KB Output is correct
39 Correct 1454 ms 17488 KB Output is correct
40 Correct 2914 ms 22516 KB Output is correct
41 Correct 2817 ms 25120 KB Output is correct
42 Correct 1979 ms 20216 KB Output is correct
43 Correct 925 ms 15332 KB Output is correct
44 Correct 2029 ms 22548 KB Output is correct
45 Correct 1751 ms 18752 KB Output is correct
46 Correct 1157 ms 16024 KB Output is correct
47 Correct 1091 ms 15448 KB Output is correct
48 Correct 1014 ms 15444 KB Output is correct
49 Correct 822 ms 11672 KB Output is correct
50 Correct 1114 ms 11888 KB Output is correct
51 Correct 1100 ms 12460 KB Output is correct
52 Correct 841 ms 11836 KB Output is correct
53 Correct 923 ms 15012 KB Output is correct
54 Correct 1296 ms 18332 KB Output is correct
55 Correct 1515 ms 19928 KB Output is correct
56 Correct 1321 ms 18048 KB Output is correct
57 Correct 912 ms 15784 KB Output is correct
58 Correct 899 ms 16024 KB Output is correct
59 Correct 896 ms 15304 KB Output is correct
60 Correct 917 ms 16152 KB Output is correct
61 Correct 1638 ms 20556 KB Output is correct
62 Correct 1619 ms 20572 KB Output is correct
63 Correct 2874 ms 21992 KB Output is correct
64 Correct 1961 ms 21204 KB Output is correct
65 Correct 1807 ms 19448 KB Output is correct
66 Correct 1062 ms 16024 KB Output is correct
67 Correct 1456 ms 17260 KB Output is correct
68 Correct 1933 ms 20536 KB Output is correct
69 Correct 1032 ms 16048 KB Output is correct
70 Correct 1033 ms 16220 KB Output is correct
71 Correct 1055 ms 15520 KB Output is correct
72 Correct 1058 ms 16072 KB Output is correct
73 Correct 2114 ms 19044 KB Output is correct
74 Correct 752 ms 3488 KB Output is correct
75 Correct 2284 ms 20300 KB Output is correct
76 Correct 701 ms 5060 KB Output is correct
77 Correct 1374 ms 17812 KB Output is correct
78 Correct 2192 ms 21144 KB Output is correct
79 Correct 1109 ms 15796 KB Output is correct
80 Correct 3017 ms 23460 KB Output is correct
81 Correct 1801 ms 18616 KB Output is correct
82 Correct 1270 ms 16252 KB Output is correct
83 Correct 2801 ms 21660 KB Output is correct
84 Correct 1915 ms 18712 KB Output is correct
85 Correct 1294 ms 12320 KB Output is correct
86 Correct 1263 ms 11344 KB Output is correct
87 Correct 1280 ms 11892 KB Output is correct
88 Correct 1289 ms 11424 KB Output is correct
89 Correct 1063 ms 14568 KB Output is correct
90 Correct 1096 ms 14696 KB Output is correct
91 Correct 1051 ms 14964 KB Output is correct
92 Correct 1049 ms 16844 KB Output is correct
93 Correct 967 ms 7536 KB Output is correct
94 Correct 222 ms 2512 KB Output is correct
95 Correct 1342 ms 15448 KB Output is correct
96 Correct 531 ms 2052 KB Output is correct
97 Correct 1827 ms 20208 KB Output is correct
98 Correct 2693 ms 22852 KB Output is correct
99 Correct 2915 ms 22640 KB Output is correct
100 Correct 2769 ms 22280 KB Output is correct
101 Correct 1113 ms 14952 KB Output is correct
102 Correct 1072 ms 15760 KB Output is correct
103 Correct 1952 ms 19528 KB Output is correct
104 Correct 1513 ms 16516 KB Output is correct
105 Correct 1267 ms 11796 KB Output is correct
106 Correct 1282 ms 12476 KB Output is correct
107 Correct 1269 ms 12524 KB Output is correct
108 Correct 1291 ms 13040 KB Output is correct
109 Correct 1221 ms 15292 KB Output is correct
110 Correct 1573 ms 18688 KB Output is correct
111 Correct 3131 ms 23260 KB Output is correct
112 Correct 2931 ms 23076 KB Output is correct
113 Correct 1040 ms 16908 KB Output is correct
114 Correct 1033 ms 16088 KB Output is correct
115 Correct 1058 ms 14460 KB Output is correct
116 Correct 1028 ms 15368 KB Output is correct
117 Correct 1511 ms 18128 KB Output is correct
118 Correct 1250 ms 16612 KB Output is correct
119 Correct 1149 ms 15132 KB Output is correct
120 Correct 1556 ms 18352 KB Output is correct
121 Correct 2043 ms 18776 KB Output is correct
122 Correct 2050 ms 20048 KB Output is correct
123 Correct 1321 ms 16620 KB Output is correct
124 Correct 1054 ms 15620 KB Output is correct
125 Correct 3573 ms 31404 KB Output is correct
126 Correct 3560 ms 31804 KB Output is correct
127 Correct 3561 ms 30572 KB Output is correct
128 Correct 3583 ms 30336 KB Output is correct
129 Correct 3537 ms 30476 KB Output is correct
130 Correct 3580 ms 30180 KB Output is correct
131 Correct 1786 ms 5632 KB Output is correct
132 Correct 3492 ms 20948 KB Output is correct
133 Execution timed out 5053 ms 30824 KB Time limit exceeded
134 Halted 0 ms 0 KB -