oj.uz

Submission #758576

# Submission time Handle Problem Language Result Execution time Memory
758576 2023-06-14T23:16:13 Z scanhex Segments (IZhO18_segments) C++17
75 / 100
 5000 ms 26280 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);
		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 = 4000;

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) {
			 for (auto& x : block)
				 all.push_back(x);
			 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:73:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<static1d>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   73 |   for (int i = 0; i < v.size(); ++i)
      |                   ~~^~~~~~~~~~
segments.cpp: In member function 'int static2d::get(int, int, int)':
segments.cpp:79:7: warning: unused variable 'xrr' [-Wunused-variable]
   79 |   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 296 KB Output is correct
3 Correct 24 ms 340 KB Output is correct
4 Correct 26 ms 436 KB Output is correct
5 Correct 8 ms 1108 KB Output is correct
6 Correct 47 ms 340 KB Output is correct
7 Correct 38 ms 492 KB Output is correct
8 Correct 25 ms 340 KB Output is correct
9 Correct 20 ms 340 KB Output is correct
10 Correct 7 ms 1148 KB Output is correct
11 Correct 57 ms 436 KB Output is correct
12 Correct 56 ms 432 KB Output is correct
13 Correct 7 ms 1080 KB Output is correct
14 Correct 28 ms 448 KB Output is correct
15 Correct 28 ms 468 KB Output is correct
16 Correct 32 ms 412 KB Output is correct
17 Correct 32 ms 396 KB Output is correct
18 Correct 10 ms 1108 KB Output is correct
19 Correct 23 ms 388 KB Output is correct
20 Correct 23 ms 392 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1349 ms 10540 KB Output is correct
2 Correct 1402 ms 10508 KB Output is correct
3 Correct 1376 ms 10732 KB Output is correct
4 Correct 1695 ms 11584 KB Output is correct
5 Correct 1485 ms 20120 KB Output is correct
6 Correct 1450 ms 21232 KB Output is correct
7 Correct 1429 ms 10600 KB Output is correct
8 Correct 1393 ms 10520 KB Output is correct
9 Correct 1313 ms 10496 KB Output is correct
10 Correct 2718 ms 4088 KB Output is correct
11 Correct 2261 ms 5644 KB Output is correct
12 Correct 1404 ms 17108 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1295 ms 12644 KB Output is correct
2 Correct 1333 ms 12768 KB Output is correct
3 Correct 1260 ms 12916 KB Output is correct
4 Correct 1250 ms 12732 KB Output is correct
5 Correct 1398 ms 16544 KB Output is correct
6 Correct 723 ms 12896 KB Output is correct
7 Correct 946 ms 14016 KB Output is correct
8 Correct 1361 ms 20140 KB Output is correct
9 Correct 1313 ms 20060 KB Output is correct
10 Correct 1206 ms 17760 KB Output is correct
11 Correct 1261 ms 12572 KB Output is correct
12 Correct 1210 ms 18304 KB Output is correct
13 Correct 1111 ms 17404 KB Output is correct
14 Correct 1030 ms 14704 KB Output is correct
15 Correct 1010 ms 14472 KB Output is correct
16 Correct 1102 ms 14184 KB Output is correct
17 Correct 1089 ms 10316 KB Output is correct
18 Correct 1099 ms 10580 KB Output is correct
19 Correct 1094 ms 10576 KB Output is correct
20 Correct 1062 ms 10548 KB Output is correct
21 Correct 1270 ms 13496 KB Output is correct
22 Correct 1129 ms 15844 KB Output is correct
23 Correct 1194 ms 16672 KB Output is correct
24 Correct 1247 ms 15908 KB Output is correct
25 Correct 1332 ms 12728 KB Output is correct
26 Correct 1373 ms 12700 KB Output is correct
27 Correct 1294 ms 12624 KB Output is correct
28 Correct 1326 ms 13036 KB Output is correct
29 Correct 1199 ms 19224 KB Output is correct
30 Correct 1190 ms 19104 KB Output is correct
31 Correct 1369 ms 20232 KB Output is correct
32 Correct 1249 ms 17876 KB Output is correct
33 Correct 1061 ms 18196 KB Output is correct
34 Correct 1028 ms 14464 KB Output is correct
35 Correct 1056 ms 16020 KB Output is correct
36 Correct 1088 ms 17548 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1604 ms 13072 KB Output is correct
2 Correct 1589 ms 12688 KB Output is correct
3 Correct 1528 ms 12660 KB Output is correct
4 Correct 1571 ms 13108 KB Output is correct
5 Correct 1126 ms 16980 KB Output is correct
6 Correct 1552 ms 3200 KB Output is correct
7 Correct 1473 ms 17952 KB Output is correct
8 Correct 712 ms 4840 KB Output is correct
9 Correct 1341 ms 16112 KB Output is correct
10 Correct 1319 ms 19224 KB Output is correct
11 Correct 1500 ms 13984 KB Output is correct
12 Correct 1381 ms 21100 KB Output is correct
13 Correct 1156 ms 17572 KB Output is correct
14 Correct 1226 ms 14940 KB Output is correct
15 Correct 1394 ms 19420 KB Output is correct
16 Correct 1205 ms 17372 KB Output is correct
17 Correct 1387 ms 10828 KB Output is correct
18 Correct 1309 ms 10764 KB Output is correct
19 Correct 1342 ms 10420 KB Output is correct
20 Correct 1345 ms 10912 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 296 KB Output is correct
3 Correct 24 ms 340 KB Output is correct
4 Correct 26 ms 436 KB Output is correct
5 Correct 8 ms 1108 KB Output is correct
6 Correct 47 ms 340 KB Output is correct
7 Correct 38 ms 492 KB Output is correct
8 Correct 25 ms 340 KB Output is correct
9 Correct 20 ms 340 KB Output is correct
10 Correct 7 ms 1148 KB Output is correct
11 Correct 57 ms 436 KB Output is correct
12 Correct 56 ms 432 KB Output is correct
13 Correct 7 ms 1080 KB Output is correct
14 Correct 28 ms 448 KB Output is correct
15 Correct 28 ms 468 KB Output is correct
16 Correct 32 ms 412 KB Output is correct
17 Correct 32 ms 396 KB Output is correct
18 Correct 10 ms 1108 KB Output is correct
19 Correct 23 ms 388 KB Output is correct
20 Correct 23 ms 392 KB Output is correct
21 Correct 1349 ms 10540 KB Output is correct
22 Correct 1402 ms 10508 KB Output is correct
23 Correct 1376 ms 10732 KB Output is correct
24 Correct 1695 ms 11584 KB Output is correct
25 Correct 1485 ms 20120 KB Output is correct
26 Correct 1450 ms 21232 KB Output is correct
27 Correct 1429 ms 10600 KB Output is correct
28 Correct 1393 ms 10520 KB Output is correct
29 Correct 1313 ms 10496 KB Output is correct
30 Correct 2718 ms 4088 KB Output is correct
31 Correct 2261 ms 5644 KB Output is correct
32 Correct 1404 ms 17108 KB Output is correct
33 Correct 1604 ms 13072 KB Output is correct
34 Correct 1589 ms 12688 KB Output is correct
35 Correct 1528 ms 12660 KB Output is correct
36 Correct 1571 ms 13108 KB Output is correct
37 Correct 1126 ms 16980 KB Output is correct
38 Correct 1552 ms 3200 KB Output is correct
39 Correct 1473 ms 17952 KB Output is correct
40 Correct 712 ms 4840 KB Output is correct
41 Correct 1341 ms 16112 KB Output is correct
42 Correct 1319 ms 19224 KB Output is correct
43 Correct 1500 ms 13984 KB Output is correct
44 Correct 1381 ms 21100 KB Output is correct
45 Correct 1156 ms 17572 KB Output is correct
46 Correct 1226 ms 14940 KB Output is correct
47 Correct 1394 ms 19420 KB Output is correct
48 Correct 1205 ms 17372 KB Output is correct
49 Correct 1387 ms 10828 KB Output is correct
50 Correct 1309 ms 10764 KB Output is correct
51 Correct 1342 ms 10420 KB Output is correct
52 Correct 1345 ms 10912 KB Output is correct
53 Correct 1577 ms 12700 KB Output is correct
54 Correct 1583 ms 12840 KB Output is correct
55 Correct 1550 ms 12920 KB Output is correct
56 Correct 1564 ms 13076 KB Output is correct
57 Correct 2603 ms 6444 KB Output is correct
58 Correct 996 ms 2916 KB Output is correct
59 Correct 1022 ms 12776 KB Output is correct
60 Correct 2865 ms 1868 KB Output is correct
61 Correct 1206 ms 17932 KB Output is correct
62 Correct 1252 ms 19356 KB Output is correct
63 Correct 1270 ms 20432 KB Output is correct
64 Correct 1271 ms 19652 KB Output is correct
65 Correct 1251 ms 13948 KB Output is correct
66 Correct 1278 ms 13836 KB Output is correct
67 Correct 1145 ms 17428 KB Output is correct
68 Correct 1170 ms 16032 KB Output is correct
69 Correct 1322 ms 10352 KB Output is correct
70 Correct 1336 ms 10300 KB Output is correct
71 Correct 1355 ms 10608 KB Output is correct
72 Correct 1331 ms 10764 KB Output is correct
73 Correct 1398 ms 14832 KB Output is correct
74 Correct 1291 ms 16100 KB Output is correct
75 Correct 1323 ms 21024 KB Output is correct
76 Correct 1281 ms 20216 KB Output is correct
77 Correct 1542 ms 12904 KB Output is correct
78 Correct 1531 ms 12936 KB Output is correct
79 Correct 1527 ms 12872 KB Output is correct
80 Correct 1501 ms 12812 KB Output is correct
81 Correct 1228 ms 15304 KB Output is correct
82 Correct 1398 ms 14860 KB Output is correct
83 Correct 1436 ms 13992 KB Output is correct
84 Correct 1226 ms 15344 KB Output is correct
85 Correct 1132 ms 17464 KB Output is correct
86 Correct 1172 ms 17592 KB Output is correct
87 Correct 1190 ms 15580 KB Output is correct
88 Correct 1281 ms 13880 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 296 KB Output is correct
3 Correct 24 ms 340 KB Output is correct
4 Correct 26 ms 436 KB Output is correct
5 Correct 8 ms 1108 KB Output is correct
6 Correct 47 ms 340 KB Output is correct
7 Correct 38 ms 492 KB Output is correct
8 Correct 25 ms 340 KB Output is correct
9 Correct 20 ms 340 KB Output is correct
10 Correct 7 ms 1148 KB Output is correct
11 Correct 57 ms 436 KB Output is correct
12 Correct 56 ms 432 KB Output is correct
13 Correct 7 ms 1080 KB Output is correct
14 Correct 28 ms 448 KB Output is correct
15 Correct 28 ms 468 KB Output is correct
16 Correct 32 ms 412 KB Output is correct
17 Correct 32 ms 396 KB Output is correct
18 Correct 10 ms 1108 KB Output is correct
19 Correct 23 ms 388 KB Output is correct
20 Correct 23 ms 392 KB Output is correct
21 Correct 1349 ms 10540 KB Output is correct
22 Correct 1402 ms 10508 KB Output is correct
23 Correct 1376 ms 10732 KB Output is correct
24 Correct 1695 ms 11584 KB Output is correct
25 Correct 1485 ms 20120 KB Output is correct
26 Correct 1450 ms 21232 KB Output is correct
27 Correct 1429 ms 10600 KB Output is correct
28 Correct 1393 ms 10520 KB Output is correct
29 Correct 1313 ms 10496 KB Output is correct
30 Correct 2718 ms 4088 KB Output is correct
31 Correct 2261 ms 5644 KB Output is correct
32 Correct 1404 ms 17108 KB Output is correct
33 Correct 1295 ms 12644 KB Output is correct
34 Correct 1333 ms 12768 KB Output is correct
35 Correct 1260 ms 12916 KB Output is correct
36 Correct 1250 ms 12732 KB Output is correct
37 Correct 1398 ms 16544 KB Output is correct
38 Correct 723 ms 12896 KB Output is correct
39 Correct 946 ms 14016 KB Output is correct
40 Correct 1361 ms 20140 KB Output is correct
41 Correct 1313 ms 20060 KB Output is correct
42 Correct 1206 ms 17760 KB Output is correct
43 Correct 1261 ms 12572 KB Output is correct
44 Correct 1210 ms 18304 KB Output is correct
45 Correct 1111 ms 17404 KB Output is correct
46 Correct 1030 ms 14704 KB Output is correct
47 Correct 1010 ms 14472 KB Output is correct
48 Correct 1102 ms 14184 KB Output is correct
49 Correct 1089 ms 10316 KB Output is correct
50 Correct 1099 ms 10580 KB Output is correct
51 Correct 1094 ms 10576 KB Output is correct
52 Correct 1062 ms 10548 KB Output is correct
53 Correct 1270 ms 13496 KB Output is correct
54 Correct 1129 ms 15844 KB Output is correct
55 Correct 1194 ms 16672 KB Output is correct
56 Correct 1247 ms 15908 KB Output is correct
57 Correct 1332 ms 12728 KB Output is correct
58 Correct 1373 ms 12700 KB Output is correct
59 Correct 1294 ms 12624 KB Output is correct
60 Correct 1326 ms 13036 KB Output is correct
61 Correct 1199 ms 19224 KB Output is correct
62 Correct 1190 ms 19104 KB Output is correct
63 Correct 1369 ms 20232 KB Output is correct
64 Correct 1249 ms 17876 KB Output is correct
65 Correct 1061 ms 18196 KB Output is correct
66 Correct 1028 ms 14464 KB Output is correct
67 Correct 1056 ms 16020 KB Output is correct
68 Correct 1088 ms 17548 KB Output is correct
69 Correct 1604 ms 13072 KB Output is correct
70 Correct 1589 ms 12688 KB Output is correct
71 Correct 1528 ms 12660 KB Output is correct
72 Correct 1571 ms 13108 KB Output is correct
73 Correct 1126 ms 16980 KB Output is correct
74 Correct 1552 ms 3200 KB Output is correct
75 Correct 1473 ms 17952 KB Output is correct
76 Correct 712 ms 4840 KB Output is correct
77 Correct 1341 ms 16112 KB Output is correct
78 Correct 1319 ms 19224 KB Output is correct
79 Correct 1500 ms 13984 KB Output is correct
80 Correct 1381 ms 21100 KB Output is correct
81 Correct 1156 ms 17572 KB Output is correct
82 Correct 1226 ms 14940 KB Output is correct
83 Correct 1394 ms 19420 KB Output is correct
84 Correct 1205 ms 17372 KB Output is correct
85 Correct 1387 ms 10828 KB Output is correct
86 Correct 1309 ms 10764 KB Output is correct
87 Correct 1342 ms 10420 KB Output is correct
88 Correct 1345 ms 10912 KB Output is correct
89 Correct 1577 ms 12700 KB Output is correct
90 Correct 1583 ms 12840 KB Output is correct
91 Correct 1550 ms 12920 KB Output is correct
92 Correct 1564 ms 13076 KB Output is correct
93 Correct 2603 ms 6444 KB Output is correct
94 Correct 996 ms 2916 KB Output is correct
95 Correct 1022 ms 12776 KB Output is correct
96 Correct 2865 ms 1868 KB Output is correct
97 Correct 1206 ms 17932 KB Output is correct
98 Correct 1252 ms 19356 KB Output is correct
99 Correct 1270 ms 20432 KB Output is correct
100 Correct 1271 ms 19652 KB Output is correct
101 Correct 1251 ms 13948 KB Output is correct
102 Correct 1278 ms 13836 KB Output is correct
103 Correct 1145 ms 17428 KB Output is correct
104 Correct 1170 ms 16032 KB Output is correct
105 Correct 1322 ms 10352 KB Output is correct
106 Correct 1336 ms 10300 KB Output is correct
107 Correct 1355 ms 10608 KB Output is correct
108 Correct 1331 ms 10764 KB Output is correct
109 Correct 1398 ms 14832 KB Output is correct
110 Correct 1291 ms 16100 KB Output is correct
111 Correct 1323 ms 21024 KB Output is correct
112 Correct 1281 ms 20216 KB Output is correct
113 Correct 1542 ms 12904 KB Output is correct
114 Correct 1531 ms 12936 KB Output is correct
115 Correct 1527 ms 12872 KB Output is correct
116 Correct 1501 ms 12812 KB Output is correct
117 Correct 1228 ms 15304 KB Output is correct
118 Correct 1398 ms 14860 KB Output is correct
119 Correct 1436 ms 13992 KB Output is correct
120 Correct 1226 ms 15344 KB Output is correct
121 Correct 1132 ms 17464 KB Output is correct
122 Correct 1172 ms 17592 KB Output is correct
123 Correct 1190 ms 15580 KB Output is correct
124 Correct 1281 ms 13880 KB Output is correct
125 Correct 3668 ms 26280 KB Output is correct
126 Correct 3668 ms 26240 KB Output is correct
127 Correct 3684 ms 25888 KB Output is correct
128 Correct 3721 ms 25948 KB Output is correct
129 Correct 3744 ms 26016 KB Output is correct
130 Correct 3851 ms 26008 KB Output is correct
131 Execution timed out 5051 ms 4144 KB Time limit exceeded
132 Halted 0 ms 0 KB -