oj.uz

Submission #758580

# Submission time Handle Problem Language Result Execution time Memory
758580 2023-06-14T23:29:38 Z scanhex Segments (IZhO18_segments) C++17
55 / 100
 5000 ms 31112 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() {
	}

	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;
	}
};

bool ycmp(pair<int, int> a, pair<int, int> b) {
	return a.second < b.second;
}

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);
		sort(xs.begin(), xs.end());
		xs.erase(unique(xs.begin(), xs.end()), xs.end());
		v.resize(xs.size() + 1);
		for (auto p : pts) {
			add(lower_bound(xs.begin(), xs.end(), p.first) - xs.begin(), 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 = 500;

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(), ycmp);
			vector<pair<int, int>> newall(all.size() + block.size());
			merge(all.begin(), all.end(), block.begin(), block.end(), newall.begin(), ycmp);
			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:60:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<static1d>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   60 |   for (++x; x < v.size(); x = (x | x - 1) + 1)
      |             ~~^~~~~~~~~~
segments.cpp:60:38: warning: suggest parentheses around arithmetic in operand of '|' [-Wparentheses]
   60 |   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:76:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<static1d>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   76 |   for (int i = 0; i < v.size(); ++i)
      |                   ~~^~~~~~~~~~
segments.cpp: In member function 'int static2d::get(int, int, int)':
segments.cpp:82:7: warning: unused variable 'xrr' [-Wunused-variable]
   82 |   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 0 ms 212 KB Output is correct
3 Correct 14 ms 892 KB Output is correct
4 Correct 14 ms 892 KB Output is correct
5 Correct 12 ms 1096 KB Output is correct
6 Correct 12 ms 980 KB Output is correct
7 Correct 13 ms 780 KB Output is correct
8 Correct 11 ms 980 KB Output is correct
9 Correct 10 ms 852 KB Output is correct
10 Correct 13 ms 1364 KB Output is correct
11 Correct 10 ms 864 KB Output is correct
12 Correct 18 ms 716 KB Output is correct
13 Correct 12 ms 1312 KB Output is correct
14 Correct 12 ms 860 KB Output is correct
15 Correct 16 ms 852 KB Output is correct
16 Correct 13 ms 776 KB Output is correct
17 Correct 16 ms 944 KB Output is correct
18 Correct 10 ms 980 KB Output is correct
19 Correct 14 ms 944 KB Output is correct
20 Correct 12 ms 880 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1458 ms 12040 KB Output is correct
2 Correct 1389 ms 12144 KB Output is correct
3 Correct 1432 ms 12828 KB Output is correct
4 Correct 1659 ms 13860 KB Output is correct
5 Correct 4354 ms 24208 KB Output is correct
6 Correct 4931 ms 31112 KB Output is correct
7 Correct 1521 ms 11368 KB Output is correct
8 Correct 1481 ms 11404 KB Output is correct
9 Correct 1512 ms 12072 KB Output is correct
10 Correct 662 ms 4948 KB Output is correct
11 Correct 646 ms 6616 KB Output is correct
12 Correct 2696 ms 17984 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1186 ms 14192 KB Output is correct
2 Correct 1315 ms 15420 KB Output is correct
3 Correct 1266 ms 15384 KB Output is correct
4 Correct 1171 ms 14564 KB Output is correct
5 Correct 2629 ms 19712 KB Output is correct
6 Correct 1881 ms 15144 KB Output is correct
7 Correct 2285 ms 16912 KB Output is correct
8 Correct 4793 ms 22416 KB Output is correct
9 Correct 4953 ms 25860 KB Output is correct
10 Correct 3381 ms 19916 KB Output is correct
11 Correct 1248 ms 18648 KB Output is correct
12 Correct 3319 ms 22548 KB Output is correct
13 Correct 2763 ms 19032 KB Output is correct
14 Correct 1774 ms 16620 KB Output is correct
15 Correct 1526 ms 16224 KB Output is correct
16 Correct 1448 ms 15812 KB Output is correct
17 Correct 1327 ms 11836 KB Output is correct
18 Correct 1450 ms 12172 KB Output is correct
19 Correct 1409 ms 14180 KB Output is correct
20 Correct 1230 ms 12972 KB Output is correct
21 Correct 1230 ms 18044 KB Output is correct
22 Correct 1841 ms 18428 KB Output is correct
23 Correct 2239 ms 19968 KB Output is correct
24 Correct 1936 ms 18544 KB Output is correct
25 Correct 1205 ms 14992 KB Output is correct
26 Correct 1259 ms 15876 KB Output is correct
27 Correct 1207 ms 14208 KB Output is correct
28 Correct 1228 ms 15128 KB Output is correct
29 Correct 2516 ms 20296 KB Output is correct
30 Correct 2599 ms 21260 KB Output is correct
31 Correct 4518 ms 23704 KB Output is correct
32 Correct 3141 ms 20828 KB Output is correct
33 Correct 2613 ms 19948 KB Output is correct
34 Correct 1540 ms 15956 KB Output is correct
35 Correct 2179 ms 20684 KB Output is correct
36 Correct 2925 ms 19616 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1358 ms 15628 KB Output is correct
2 Correct 1348 ms 15372 KB Output is correct
3 Correct 1288 ms 15204 KB Output is correct
4 Correct 1318 ms 15156 KB Output is correct
5 Correct 3168 ms 21396 KB Output is correct
6 Correct 497 ms 3616 KB Output is correct
7 Correct 3417 ms 21000 KB Output is correct
8 Correct 468 ms 5264 KB Output is correct
9 Correct 1853 ms 17596 KB Output is correct
10 Correct 3546 ms 22568 KB Output is correct
11 Correct 1533 ms 16104 KB Output is correct
12 Correct 4791 ms 23508 KB Output is correct
13 Correct 2519 ms 19428 KB Output is correct
14 Correct 1787 ms 16932 KB Output is correct
15 Correct 4498 ms 21972 KB Output is correct
16 Correct 2934 ms 19308 KB Output is correct
17 Correct 1522 ms 12544 KB Output is correct
18 Correct 1581 ms 11880 KB Output is correct
19 Correct 1572 ms 11924 KB Output is correct
20 Correct 1498 ms 12296 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 14 ms 892 KB Output is correct
4 Correct 14 ms 892 KB Output is correct
5 Correct 12 ms 1096 KB Output is correct
6 Correct 12 ms 980 KB Output is correct
7 Correct 13 ms 780 KB Output is correct
8 Correct 11 ms 980 KB Output is correct
9 Correct 10 ms 852 KB Output is correct
10 Correct 13 ms 1364 KB Output is correct
11 Correct 10 ms 864 KB Output is correct
12 Correct 18 ms 716 KB Output is correct
13 Correct 12 ms 1312 KB Output is correct
14 Correct 12 ms 860 KB Output is correct
15 Correct 16 ms 852 KB Output is correct
16 Correct 13 ms 776 KB Output is correct
17 Correct 16 ms 944 KB Output is correct
18 Correct 10 ms 980 KB Output is correct
19 Correct 14 ms 944 KB Output is correct
20 Correct 12 ms 880 KB Output is correct
21 Correct 1458 ms 12040 KB Output is correct
22 Correct 1389 ms 12144 KB Output is correct
23 Correct 1432 ms 12828 KB Output is correct
24 Correct 1659 ms 13860 KB Output is correct
25 Correct 4354 ms 24208 KB Output is correct
26 Correct 4931 ms 31112 KB Output is correct
27 Correct 1521 ms 11368 KB Output is correct
28 Correct 1481 ms 11404 KB Output is correct
29 Correct 1512 ms 12072 KB Output is correct
30 Correct 662 ms 4948 KB Output is correct
31 Correct 646 ms 6616 KB Output is correct
32 Correct 2696 ms 17984 KB Output is correct
33 Correct 1358 ms 15628 KB Output is correct
34 Correct 1348 ms 15372 KB Output is correct
35 Correct 1288 ms 15204 KB Output is correct
36 Correct 1318 ms 15156 KB Output is correct
37 Correct 3168 ms 21396 KB Output is correct
38 Correct 497 ms 3616 KB Output is correct
39 Correct 3417 ms 21000 KB Output is correct
40 Correct 468 ms 5264 KB Output is correct
41 Correct 1853 ms 17596 KB Output is correct
42 Correct 3546 ms 22568 KB Output is correct
43 Correct 1533 ms 16104 KB Output is correct
44 Correct 4791 ms 23508 KB Output is correct
45 Correct 2519 ms 19428 KB Output is correct
46 Correct 1787 ms 16932 KB Output is correct
47 Correct 4498 ms 21972 KB Output is correct
48 Correct 2934 ms 19308 KB Output is correct
49 Correct 1522 ms 12544 KB Output is correct
50 Correct 1581 ms 11880 KB Output is correct
51 Correct 1572 ms 11924 KB Output is correct
52 Correct 1498 ms 12296 KB Output is correct
53 Correct 1307 ms 14124 KB Output is correct
54 Correct 1313 ms 15724 KB Output is correct
55 Correct 1258 ms 14960 KB Output is correct
56 Correct 1269 ms 15484 KB Output is correct
57 Correct 955 ms 8248 KB Output is correct
58 Correct 318 ms 2756 KB Output is correct
59 Correct 2070 ms 16824 KB Output is correct
60 Correct 558 ms 2128 KB Output is correct
61 Correct 2756 ms 20356 KB Output is correct
62 Correct 4316 ms 22708 KB Output is correct
63 Correct 4857 ms 22696 KB Output is correct
64 Correct 4632 ms 27844 KB Output is correct
65 Correct 1544 ms 15388 KB Output is correct
66 Correct 1501 ms 15432 KB Output is correct
67 Correct 2964 ms 18792 KB Output is correct
68 Correct 2191 ms 19832 KB Output is correct
69 Correct 1393 ms 13608 KB Output is correct
70 Correct 1387 ms 10808 KB Output is correct
71 Correct 1419 ms 12432 KB Output is correct
72 Correct 1477 ms 11872 KB Output is correct
73 Correct 1496 ms 15928 KB Output is correct
74 Correct 2117 ms 19288 KB Output is correct
75 Correct 4892 ms 29324 KB Output is correct
76 Execution timed out 5040 ms 24244 KB Time limit exceeded
77 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 14 ms 892 KB Output is correct
4 Correct 14 ms 892 KB Output is correct
5 Correct 12 ms 1096 KB Output is correct
6 Correct 12 ms 980 KB Output is correct
7 Correct 13 ms 780 KB Output is correct
8 Correct 11 ms 980 KB Output is correct
9 Correct 10 ms 852 KB Output is correct
10 Correct 13 ms 1364 KB Output is correct
11 Correct 10 ms 864 KB Output is correct
12 Correct 18 ms 716 KB Output is correct
13 Correct 12 ms 1312 KB Output is correct
14 Correct 12 ms 860 KB Output is correct
15 Correct 16 ms 852 KB Output is correct
16 Correct 13 ms 776 KB Output is correct
17 Correct 16 ms 944 KB Output is correct
18 Correct 10 ms 980 KB Output is correct
19 Correct 14 ms 944 KB Output is correct
20 Correct 12 ms 880 KB Output is correct
21 Correct 1458 ms 12040 KB Output is correct
22 Correct 1389 ms 12144 KB Output is correct
23 Correct 1432 ms 12828 KB Output is correct
24 Correct 1659 ms 13860 KB Output is correct
25 Correct 4354 ms 24208 KB Output is correct
26 Correct 4931 ms 31112 KB Output is correct
27 Correct 1521 ms 11368 KB Output is correct
28 Correct 1481 ms 11404 KB Output is correct
29 Correct 1512 ms 12072 KB Output is correct
30 Correct 662 ms 4948 KB Output is correct
31 Correct 646 ms 6616 KB Output is correct
32 Correct 2696 ms 17984 KB Output is correct
33 Correct 1186 ms 14192 KB Output is correct
34 Correct 1315 ms 15420 KB Output is correct
35 Correct 1266 ms 15384 KB Output is correct
36 Correct 1171 ms 14564 KB Output is correct
37 Correct 2629 ms 19712 KB Output is correct
38 Correct 1881 ms 15144 KB Output is correct
39 Correct 2285 ms 16912 KB Output is correct
40 Correct 4793 ms 22416 KB Output is correct
41 Correct 4953 ms 25860 KB Output is correct
42 Correct 3381 ms 19916 KB Output is correct
43 Correct 1248 ms 18648 KB Output is correct
44 Correct 3319 ms 22548 KB Output is correct
45 Correct 2763 ms 19032 KB Output is correct
46 Correct 1774 ms 16620 KB Output is correct
47 Correct 1526 ms 16224 KB Output is correct
48 Correct 1448 ms 15812 KB Output is correct
49 Correct 1327 ms 11836 KB Output is correct
50 Correct 1450 ms 12172 KB Output is correct
51 Correct 1409 ms 14180 KB Output is correct
52 Correct 1230 ms 12972 KB Output is correct
53 Correct 1230 ms 18044 KB Output is correct
54 Correct 1841 ms 18428 KB Output is correct
55 Correct 2239 ms 19968 KB Output is correct
56 Correct 1936 ms 18544 KB Output is correct
57 Correct 1205 ms 14992 KB Output is correct
58 Correct 1259 ms 15876 KB Output is correct
59 Correct 1207 ms 14208 KB Output is correct
60 Correct 1228 ms 15128 KB Output is correct
61 Correct 2516 ms 20296 KB Output is correct
62 Correct 2599 ms 21260 KB Output is correct
63 Correct 4518 ms 23704 KB Output is correct
64 Correct 3141 ms 20828 KB Output is correct
65 Correct 2613 ms 19948 KB Output is correct
66 Correct 1540 ms 15956 KB Output is correct
67 Correct 2179 ms 20684 KB Output is correct
68 Correct 2925 ms 19616 KB Output is correct
69 Correct 1358 ms 15628 KB Output is correct
70 Correct 1348 ms 15372 KB Output is correct
71 Correct 1288 ms 15204 KB Output is correct
72 Correct 1318 ms 15156 KB Output is correct
73 Correct 3168 ms 21396 KB Output is correct
74 Correct 497 ms 3616 KB Output is correct
75 Correct 3417 ms 21000 KB Output is correct
76 Correct 468 ms 5264 KB Output is correct
77 Correct 1853 ms 17596 KB Output is correct
78 Correct 3546 ms 22568 KB Output is correct
79 Correct 1533 ms 16104 KB Output is correct
80 Correct 4791 ms 23508 KB Output is correct
81 Correct 2519 ms 19428 KB Output is correct
82 Correct 1787 ms 16932 KB Output is correct
83 Correct 4498 ms 21972 KB Output is correct
84 Correct 2934 ms 19308 KB Output is correct
85 Correct 1522 ms 12544 KB Output is correct
86 Correct 1581 ms 11880 KB Output is correct
87 Correct 1572 ms 11924 KB Output is correct
88 Correct 1498 ms 12296 KB Output is correct
89 Correct 1307 ms 14124 KB Output is correct
90 Correct 1313 ms 15724 KB Output is correct
91 Correct 1258 ms 14960 KB Output is correct
92 Correct 1269 ms 15484 KB Output is correct
93 Correct 955 ms 8248 KB Output is correct
94 Correct 318 ms 2756 KB Output is correct
95 Correct 2070 ms 16824 KB Output is correct
96 Correct 558 ms 2128 KB Output is correct
97 Correct 2756 ms 20356 KB Output is correct
98 Correct 4316 ms 22708 KB Output is correct
99 Correct 4857 ms 22696 KB Output is correct
100 Correct 4632 ms 27844 KB Output is correct
101 Correct 1544 ms 15388 KB Output is correct
102 Correct 1501 ms 15432 KB Output is correct
103 Correct 2964 ms 18792 KB Output is correct
104 Correct 2191 ms 19832 KB Output is correct
105 Correct 1393 ms 13608 KB Output is correct
106 Correct 1387 ms 10808 KB Output is correct
107 Correct 1419 ms 12432 KB Output is correct
108 Correct 1477 ms 11872 KB Output is correct
109 Correct 1496 ms 15928 KB Output is correct
110 Correct 2117 ms 19288 KB Output is correct
111 Correct 4892 ms 29324 KB Output is correct
112 Execution timed out 5040 ms 24244 KB Time limit exceeded
113 Halted 0 ms 0 KB -