oj.uz

Submission #758578

# Submission time Handle Problem Language Result Execution time Memory
758578 2023-06-14T23:24:53 Z scanhex Segments (IZhO18_segments) C++17
75 / 100
 5000 ms 27772 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 = 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) {
			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 1 ms 212 KB Output is correct
3 Correct 25 ms 384 KB Output is correct
4 Correct 27 ms 384 KB Output is correct
5 Correct 7 ms 1108 KB Output is correct
6 Correct 39 ms 448 KB Output is correct
7 Correct 26 ms 436 KB Output is correct
8 Correct 23 ms 340 KB Output is correct
9 Correct 20 ms 448 KB Output is correct
10 Correct 6 ms 1108 KB Output is correct
11 Correct 52 ms 340 KB Output is correct
12 Correct 51 ms 428 KB Output is correct
13 Correct 6 ms 1108 KB Output is correct
14 Correct 24 ms 340 KB Output is correct
15 Correct 26 ms 340 KB Output is correct
16 Correct 26 ms 412 KB Output is correct
17 Correct 27 ms 392 KB Output is correct
18 Correct 8 ms 1040 KB Output is correct
19 Correct 24 ms 456 KB Output is correct
20 Correct 21 ms 452 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1163 ms 10652 KB Output is correct
2 Correct 1197 ms 11068 KB Output is correct
3 Correct 1192 ms 11072 KB Output is correct
4 Correct 1413 ms 11952 KB Output is correct
5 Correct 736 ms 22516 KB Output is correct
6 Correct 695 ms 23216 KB Output is correct
7 Correct 1144 ms 10692 KB Output is correct
8 Correct 1187 ms 11068 KB Output is correct
9 Correct 1184 ms 11064 KB Output is correct
10 Correct 2481 ms 3960 KB Output is correct
11 Correct 2098 ms 5784 KB Output is correct
12 Correct 1028 ms 18000 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1185 ms 12604 KB Output is correct
2 Correct 1149 ms 12740 KB Output is correct
3 Correct 1197 ms 12868 KB Output is correct
4 Correct 1261 ms 12712 KB Output is correct
5 Correct 1170 ms 18296 KB Output is correct
6 Correct 480 ms 13976 KB Output is correct
7 Correct 791 ms 15380 KB Output is correct
8 Correct 725 ms 21424 KB Output is correct
9 Correct 682 ms 21208 KB Output is correct
10 Correct 835 ms 18360 KB Output is correct
11 Correct 1178 ms 12676 KB Output is correct
12 Correct 809 ms 19924 KB Output is correct
13 Correct 680 ms 17424 KB Output is correct
14 Correct 899 ms 14492 KB Output is correct
15 Correct 879 ms 14724 KB Output is correct
16 Correct 913 ms 14188 KB Output is correct
17 Correct 973 ms 11084 KB Output is correct
18 Correct 1024 ms 10936 KB Output is correct
19 Correct 1128 ms 10424 KB Output is correct
20 Correct 1099 ms 11048 KB Output is correct
21 Correct 1232 ms 13468 KB Output is correct
22 Correct 897 ms 16100 KB Output is correct
23 Correct 863 ms 17092 KB Output is correct
24 Correct 923 ms 16120 KB Output is correct
25 Correct 1158 ms 12688 KB Output is correct
26 Correct 1087 ms 12772 KB Output is correct
27 Correct 1106 ms 12664 KB Output is correct
28 Correct 1124 ms 12772 KB Output is correct
29 Correct 841 ms 19296 KB Output is correct
30 Correct 905 ms 19408 KB Output is correct
31 Correct 791 ms 20844 KB Output is correct
32 Correct 852 ms 18456 KB Output is correct
33 Correct 757 ms 18312 KB Output is correct
34 Correct 930 ms 14664 KB Output is correct
35 Correct 732 ms 16092 KB Output is correct
36 Correct 743 ms 17472 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1603 ms 12872 KB Output is correct
2 Correct 1446 ms 12760 KB Output is correct
3 Correct 1553 ms 12596 KB Output is correct
4 Correct 1533 ms 12872 KB Output is correct
5 Correct 705 ms 19528 KB Output is correct
6 Correct 1537 ms 3016 KB Output is correct
7 Correct 1084 ms 20088 KB Output is correct
8 Correct 652 ms 4728 KB Output is correct
9 Correct 1144 ms 16472 KB Output is correct
10 Correct 868 ms 19600 KB Output is correct
11 Correct 1425 ms 13620 KB Output is correct
12 Correct 800 ms 22592 KB Output is correct
13 Correct 810 ms 17384 KB Output is correct
14 Correct 1103 ms 14516 KB Output is correct
15 Correct 718 ms 20308 KB Output is correct
16 Correct 840 ms 17132 KB Output is correct
17 Correct 1138 ms 11012 KB Output is correct
18 Correct 1169 ms 10804 KB Output is correct
19 Correct 1205 ms 10940 KB Output is correct
20 Correct 1176 ms 10856 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 25 ms 384 KB Output is correct
4 Correct 27 ms 384 KB Output is correct
5 Correct 7 ms 1108 KB Output is correct
6 Correct 39 ms 448 KB Output is correct
7 Correct 26 ms 436 KB Output is correct
8 Correct 23 ms 340 KB Output is correct
9 Correct 20 ms 448 KB Output is correct
10 Correct 6 ms 1108 KB Output is correct
11 Correct 52 ms 340 KB Output is correct
12 Correct 51 ms 428 KB Output is correct
13 Correct 6 ms 1108 KB Output is correct
14 Correct 24 ms 340 KB Output is correct
15 Correct 26 ms 340 KB Output is correct
16 Correct 26 ms 412 KB Output is correct
17 Correct 27 ms 392 KB Output is correct
18 Correct 8 ms 1040 KB Output is correct
19 Correct 24 ms 456 KB Output is correct
20 Correct 21 ms 452 KB Output is correct
21 Correct 1163 ms 10652 KB Output is correct
22 Correct 1197 ms 11068 KB Output is correct
23 Correct 1192 ms 11072 KB Output is correct
24 Correct 1413 ms 11952 KB Output is correct
25 Correct 736 ms 22516 KB Output is correct
26 Correct 695 ms 23216 KB Output is correct
27 Correct 1144 ms 10692 KB Output is correct
28 Correct 1187 ms 11068 KB Output is correct
29 Correct 1184 ms 11064 KB Output is correct
30 Correct 2481 ms 3960 KB Output is correct
31 Correct 2098 ms 5784 KB Output is correct
32 Correct 1028 ms 18000 KB Output is correct
33 Correct 1603 ms 12872 KB Output is correct
34 Correct 1446 ms 12760 KB Output is correct
35 Correct 1553 ms 12596 KB Output is correct
36 Correct 1533 ms 12872 KB Output is correct
37 Correct 705 ms 19528 KB Output is correct
38 Correct 1537 ms 3016 KB Output is correct
39 Correct 1084 ms 20088 KB Output is correct
40 Correct 652 ms 4728 KB Output is correct
41 Correct 1144 ms 16472 KB Output is correct
42 Correct 868 ms 19600 KB Output is correct
43 Correct 1425 ms 13620 KB Output is correct
44 Correct 800 ms 22592 KB Output is correct
45 Correct 810 ms 17384 KB Output is correct
46 Correct 1103 ms 14516 KB Output is correct
47 Correct 718 ms 20308 KB Output is correct
48 Correct 840 ms 17132 KB Output is correct
49 Correct 1138 ms 11012 KB Output is correct
50 Correct 1169 ms 10804 KB Output is correct
51 Correct 1205 ms 10940 KB Output is correct
52 Correct 1176 ms 10856 KB Output is correct
53 Correct 1502 ms 12748 KB Output is correct
54 Correct 1438 ms 12604 KB Output is correct
55 Correct 1405 ms 12740 KB Output is correct
56 Correct 1554 ms 12808 KB Output is correct
57 Correct 2615 ms 6464 KB Output is correct
58 Correct 1032 ms 2332 KB Output is correct
59 Correct 877 ms 13612 KB Output is correct
60 Correct 2909 ms 1564 KB Output is correct
61 Correct 979 ms 18532 KB Output is correct
62 Correct 749 ms 19332 KB Output is correct
63 Correct 724 ms 20892 KB Output is correct
64 Correct 749 ms 21232 KB Output is correct
65 Correct 1121 ms 13920 KB Output is correct
66 Correct 1153 ms 13360 KB Output is correct
67 Correct 954 ms 17140 KB Output is correct
68 Correct 961 ms 16160 KB Output is correct
69 Correct 1216 ms 10500 KB Output is correct
70 Correct 1245 ms 10508 KB Output is correct
71 Correct 1303 ms 11300 KB Output is correct
72 Correct 1220 ms 10832 KB Output is correct
73 Correct 1306 ms 14956 KB Output is correct
74 Correct 1062 ms 16380 KB Output is correct
75 Correct 828 ms 23100 KB Output is correct
76 Correct 754 ms 21140 KB Output is correct
77 Correct 1508 ms 12840 KB Output is correct
78 Correct 1516 ms 12820 KB Output is correct
79 Correct 1509 ms 12652 KB Output is correct
80 Correct 1425 ms 12804 KB Output is correct
81 Correct 1031 ms 15428 KB Output is correct
82 Correct 1242 ms 14956 KB Output is correct
83 Correct 1407 ms 13752 KB Output is correct
84 Correct 1080 ms 15280 KB Output is correct
85 Correct 813 ms 17080 KB Output is correct
86 Correct 821 ms 17444 KB Output is correct
87 Correct 1115 ms 15716 KB Output is correct
88 Correct 1158 ms 13340 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 25 ms 384 KB Output is correct
4 Correct 27 ms 384 KB Output is correct
5 Correct 7 ms 1108 KB Output is correct
6 Correct 39 ms 448 KB Output is correct
7 Correct 26 ms 436 KB Output is correct
8 Correct 23 ms 340 KB Output is correct
9 Correct 20 ms 448 KB Output is correct
10 Correct 6 ms 1108 KB Output is correct
11 Correct 52 ms 340 KB Output is correct
12 Correct 51 ms 428 KB Output is correct
13 Correct 6 ms 1108 KB Output is correct
14 Correct 24 ms 340 KB Output is correct
15 Correct 26 ms 340 KB Output is correct
16 Correct 26 ms 412 KB Output is correct
17 Correct 27 ms 392 KB Output is correct
18 Correct 8 ms 1040 KB Output is correct
19 Correct 24 ms 456 KB Output is correct
20 Correct 21 ms 452 KB Output is correct
21 Correct 1163 ms 10652 KB Output is correct
22 Correct 1197 ms 11068 KB Output is correct
23 Correct 1192 ms 11072 KB Output is correct
24 Correct 1413 ms 11952 KB Output is correct
25 Correct 736 ms 22516 KB Output is correct
26 Correct 695 ms 23216 KB Output is correct
27 Correct 1144 ms 10692 KB Output is correct
28 Correct 1187 ms 11068 KB Output is correct
29 Correct 1184 ms 11064 KB Output is correct
30 Correct 2481 ms 3960 KB Output is correct
31 Correct 2098 ms 5784 KB Output is correct
32 Correct 1028 ms 18000 KB Output is correct
33 Correct 1185 ms 12604 KB Output is correct
34 Correct 1149 ms 12740 KB Output is correct
35 Correct 1197 ms 12868 KB Output is correct
36 Correct 1261 ms 12712 KB Output is correct
37 Correct 1170 ms 18296 KB Output is correct
38 Correct 480 ms 13976 KB Output is correct
39 Correct 791 ms 15380 KB Output is correct
40 Correct 725 ms 21424 KB Output is correct
41 Correct 682 ms 21208 KB Output is correct
42 Correct 835 ms 18360 KB Output is correct
43 Correct 1178 ms 12676 KB Output is correct
44 Correct 809 ms 19924 KB Output is correct
45 Correct 680 ms 17424 KB Output is correct
46 Correct 899 ms 14492 KB Output is correct
47 Correct 879 ms 14724 KB Output is correct
48 Correct 913 ms 14188 KB Output is correct
49 Correct 973 ms 11084 KB Output is correct
50 Correct 1024 ms 10936 KB Output is correct
51 Correct 1128 ms 10424 KB Output is correct
52 Correct 1099 ms 11048 KB Output is correct
53 Correct 1232 ms 13468 KB Output is correct
54 Correct 897 ms 16100 KB Output is correct
55 Correct 863 ms 17092 KB Output is correct
56 Correct 923 ms 16120 KB Output is correct
57 Correct 1158 ms 12688 KB Output is correct
58 Correct 1087 ms 12772 KB Output is correct
59 Correct 1106 ms 12664 KB Output is correct
60 Correct 1124 ms 12772 KB Output is correct
61 Correct 841 ms 19296 KB Output is correct
62 Correct 905 ms 19408 KB Output is correct
63 Correct 791 ms 20844 KB Output is correct
64 Correct 852 ms 18456 KB Output is correct
65 Correct 757 ms 18312 KB Output is correct
66 Correct 930 ms 14664 KB Output is correct
67 Correct 732 ms 16092 KB Output is correct
68 Correct 743 ms 17472 KB Output is correct
69 Correct 1603 ms 12872 KB Output is correct
70 Correct 1446 ms 12760 KB Output is correct
71 Correct 1553 ms 12596 KB Output is correct
72 Correct 1533 ms 12872 KB Output is correct
73 Correct 705 ms 19528 KB Output is correct
74 Correct 1537 ms 3016 KB Output is correct
75 Correct 1084 ms 20088 KB Output is correct
76 Correct 652 ms 4728 KB Output is correct
77 Correct 1144 ms 16472 KB Output is correct
78 Correct 868 ms 19600 KB Output is correct
79 Correct 1425 ms 13620 KB Output is correct
80 Correct 800 ms 22592 KB Output is correct
81 Correct 810 ms 17384 KB Output is correct
82 Correct 1103 ms 14516 KB Output is correct
83 Correct 718 ms 20308 KB Output is correct
84 Correct 840 ms 17132 KB Output is correct
85 Correct 1138 ms 11012 KB Output is correct
86 Correct 1169 ms 10804 KB Output is correct
87 Correct 1205 ms 10940 KB Output is correct
88 Correct 1176 ms 10856 KB Output is correct
89 Correct 1502 ms 12748 KB Output is correct
90 Correct 1438 ms 12604 KB Output is correct
91 Correct 1405 ms 12740 KB Output is correct
92 Correct 1554 ms 12808 KB Output is correct
93 Correct 2615 ms 6464 KB Output is correct
94 Correct 1032 ms 2332 KB Output is correct
95 Correct 877 ms 13612 KB Output is correct
96 Correct 2909 ms 1564 KB Output is correct
97 Correct 979 ms 18532 KB Output is correct
98 Correct 749 ms 19332 KB Output is correct
99 Correct 724 ms 20892 KB Output is correct
100 Correct 749 ms 21232 KB Output is correct
101 Correct 1121 ms 13920 KB Output is correct
102 Correct 1153 ms 13360 KB Output is correct
103 Correct 954 ms 17140 KB Output is correct
104 Correct 961 ms 16160 KB Output is correct
105 Correct 1216 ms 10500 KB Output is correct
106 Correct 1245 ms 10508 KB Output is correct
107 Correct 1303 ms 11300 KB Output is correct
108 Correct 1220 ms 10832 KB Output is correct
109 Correct 1306 ms 14956 KB Output is correct
110 Correct 1062 ms 16380 KB Output is correct
111 Correct 828 ms 23100 KB Output is correct
112 Correct 754 ms 21140 KB Output is correct
113 Correct 1508 ms 12840 KB Output is correct
114 Correct 1516 ms 12820 KB Output is correct
115 Correct 1509 ms 12652 KB Output is correct
116 Correct 1425 ms 12804 KB Output is correct
117 Correct 1031 ms 15428 KB Output is correct
118 Correct 1242 ms 14956 KB Output is correct
119 Correct 1407 ms 13752 KB Output is correct
120 Correct 1080 ms 15280 KB Output is correct
121 Correct 813 ms 17080 KB Output is correct
122 Correct 821 ms 17444 KB Output is correct
123 Correct 1115 ms 15716 KB Output is correct
124 Correct 1158 ms 13340 KB Output is correct
125 Correct 3508 ms 27320 KB Output is correct
126 Correct 3291 ms 27772 KB Output is correct
127 Correct 3313 ms 26936 KB Output is correct
128 Correct 3281 ms 27240 KB Output is correct
129 Correct 3264 ms 27052 KB Output is correct
130 Correct 3363 ms 26892 KB Output is correct
131 Execution timed out 5018 ms 4200 KB Time limit exceeded
132 Halted 0 ms 0 KB -