oj.uz

Submission #758579

# Submission time Handle Problem Language Result Execution time Memory
758579 2023-06-14T23:25:15 Z scanhex Segments (IZhO18_segments) C++17
75 / 100
 5000 ms 40284 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 = 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(), 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 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 17 ms 700 KB Output is correct
4 Correct 18 ms 680 KB Output is correct
5 Correct 11 ms 1036 KB Output is correct
6 Correct 14 ms 852 KB Output is correct
7 Correct 17 ms 816 KB Output is correct
8 Correct 10 ms 852 KB Output is correct
9 Correct 13 ms 868 KB Output is correct
10 Correct 8 ms 980 KB Output is correct
11 Correct 20 ms 716 KB Output is correct
12 Correct 17 ms 716 KB Output is correct
13 Correct 8 ms 980 KB Output is correct
14 Correct 16 ms 852 KB Output is correct
15 Correct 18 ms 580 KB Output is correct
16 Correct 18 ms 636 KB Output is correct
17 Correct 17 ms 864 KB Output is correct
18 Correct 9 ms 980 KB Output is correct
19 Correct 13 ms 860 KB Output is correct
20 Correct 13 ms 852 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1201 ms 11516 KB Output is correct
2 Correct 1256 ms 12452 KB Output is correct
3 Correct 1154 ms 11372 KB Output is correct
4 Correct 1249 ms 13304 KB Output is correct
5 Correct 2448 ms 23112 KB Output is correct
6 Correct 2568 ms 24908 KB Output is correct
7 Correct 1163 ms 11072 KB Output is correct
8 Correct 1191 ms 12236 KB Output is correct
9 Correct 1266 ms 13020 KB Output is correct
10 Correct 653 ms 5064 KB Output is correct
11 Correct 497 ms 6752 KB Output is correct
12 Correct 1383 ms 19572 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 835 ms 15040 KB Output is correct
2 Correct 816 ms 15312 KB Output is correct
3 Correct 849 ms 15832 KB Output is correct
4 Correct 839 ms 15508 KB Output is correct
5 Correct 1377 ms 20304 KB Output is correct
6 Correct 1038 ms 14320 KB Output is correct
7 Correct 1189 ms 17000 KB Output is correct
8 Correct 2479 ms 22948 KB Output is correct
9 Correct 2331 ms 23884 KB Output is correct
10 Correct 1663 ms 19712 KB Output is correct
11 Correct 818 ms 15416 KB Output is correct
12 Correct 1716 ms 20848 KB Output is correct
13 Correct 1367 ms 19208 KB Output is correct
14 Correct 996 ms 15604 KB Output is correct
15 Correct 950 ms 16152 KB Output is correct
16 Correct 917 ms 15700 KB Output is correct
17 Correct 758 ms 12112 KB Output is correct
18 Correct 1054 ms 11760 KB Output is correct
19 Correct 994 ms 11464 KB Output is correct
20 Correct 718 ms 12520 KB Output is correct
21 Correct 856 ms 14528 KB Output is correct
22 Correct 1082 ms 17388 KB Output is correct
23 Correct 1287 ms 19596 KB Output is correct
24 Correct 1075 ms 17468 KB Output is correct
25 Correct 886 ms 15532 KB Output is correct
26 Correct 821 ms 15452 KB Output is correct
27 Correct 819 ms 14564 KB Output is correct
28 Correct 814 ms 16308 KB Output is correct
29 Correct 1372 ms 20512 KB Output is correct
30 Correct 1305 ms 22100 KB Output is correct
31 Correct 2285 ms 24500 KB Output is correct
32 Correct 1532 ms 20556 KB Output is correct
33 Correct 1441 ms 19456 KB Output is correct
34 Correct 853 ms 15416 KB Output is correct
35 Correct 1183 ms 17432 KB Output is correct
36 Correct 1583 ms 19832 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 952 ms 15704 KB Output is correct
2 Correct 948 ms 16088 KB Output is correct
3 Correct 952 ms 16040 KB Output is correct
4 Correct 988 ms 16000 KB Output is correct
5 Correct 1794 ms 19060 KB Output is correct
6 Correct 813 ms 3468 KB Output is correct
7 Correct 1770 ms 20264 KB Output is correct
8 Correct 742 ms 4956 KB Output is correct
9 Correct 1153 ms 17672 KB Output is correct
10 Correct 1961 ms 20880 KB Output is correct
11 Correct 998 ms 15120 KB Output is correct
12 Correct 2600 ms 23500 KB Output is correct
13 Correct 1374 ms 19200 KB Output is correct
14 Correct 1125 ms 15968 KB Output is correct
15 Correct 2232 ms 22088 KB Output is correct
16 Correct 1592 ms 19224 KB Output is correct
17 Correct 1258 ms 11916 KB Output is correct
18 Correct 1335 ms 11860 KB Output is correct
19 Correct 1205 ms 10908 KB Output is correct
20 Correct 1224 ms 11452 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 17 ms 700 KB Output is correct
4 Correct 18 ms 680 KB Output is correct
5 Correct 11 ms 1036 KB Output is correct
6 Correct 14 ms 852 KB Output is correct
7 Correct 17 ms 816 KB Output is correct
8 Correct 10 ms 852 KB Output is correct
9 Correct 13 ms 868 KB Output is correct
10 Correct 8 ms 980 KB Output is correct
11 Correct 20 ms 716 KB Output is correct
12 Correct 17 ms 716 KB Output is correct
13 Correct 8 ms 980 KB Output is correct
14 Correct 16 ms 852 KB Output is correct
15 Correct 18 ms 580 KB Output is correct
16 Correct 18 ms 636 KB Output is correct
17 Correct 17 ms 864 KB Output is correct
18 Correct 9 ms 980 KB Output is correct
19 Correct 13 ms 860 KB Output is correct
20 Correct 13 ms 852 KB Output is correct
21 Correct 1201 ms 11516 KB Output is correct
22 Correct 1256 ms 12452 KB Output is correct
23 Correct 1154 ms 11372 KB Output is correct
24 Correct 1249 ms 13304 KB Output is correct
25 Correct 2448 ms 23112 KB Output is correct
26 Correct 2568 ms 24908 KB Output is correct
27 Correct 1163 ms 11072 KB Output is correct
28 Correct 1191 ms 12236 KB Output is correct
29 Correct 1266 ms 13020 KB Output is correct
30 Correct 653 ms 5064 KB Output is correct
31 Correct 497 ms 6752 KB Output is correct
32 Correct 1383 ms 19572 KB Output is correct
33 Correct 952 ms 15704 KB Output is correct
34 Correct 948 ms 16088 KB Output is correct
35 Correct 952 ms 16040 KB Output is correct
36 Correct 988 ms 16000 KB Output is correct
37 Correct 1794 ms 19060 KB Output is correct
38 Correct 813 ms 3468 KB Output is correct
39 Correct 1770 ms 20264 KB Output is correct
40 Correct 742 ms 4956 KB Output is correct
41 Correct 1153 ms 17672 KB Output is correct
42 Correct 1961 ms 20880 KB Output is correct
43 Correct 998 ms 15120 KB Output is correct
44 Correct 2600 ms 23500 KB Output is correct
45 Correct 1374 ms 19200 KB Output is correct
46 Correct 1125 ms 15968 KB Output is correct
47 Correct 2232 ms 22088 KB Output is correct
48 Correct 1592 ms 19224 KB Output is correct
49 Correct 1258 ms 11916 KB Output is correct
50 Correct 1335 ms 11860 KB Output is correct
51 Correct 1205 ms 10908 KB Output is correct
52 Correct 1224 ms 11452 KB Output is correct
53 Correct 996 ms 15008 KB Output is correct
54 Correct 990 ms 15036 KB Output is correct
55 Correct 992 ms 15220 KB Output is correct
56 Correct 932 ms 16324 KB Output is correct
57 Correct 1014 ms 7656 KB Output is correct
58 Correct 232 ms 2528 KB Output is correct
59 Correct 1116 ms 15112 KB Output is correct
60 Correct 575 ms 2100 KB Output is correct
61 Correct 1523 ms 20548 KB Output is correct
62 Correct 2272 ms 22268 KB Output is correct
63 Correct 2285 ms 22436 KB Output is correct
64 Correct 2339 ms 23312 KB Output is correct
65 Correct 998 ms 15012 KB Output is correct
66 Correct 901 ms 14652 KB Output is correct
67 Correct 1488 ms 19908 KB Output is correct
68 Correct 1282 ms 16844 KB Output is correct
69 Correct 1128 ms 11176 KB Output is correct
70 Correct 1138 ms 11092 KB Output is correct
71 Correct 1191 ms 11176 KB Output is correct
72 Correct 1183 ms 11716 KB Output is correct
73 Correct 1038 ms 15608 KB Output is correct
74 Correct 1329 ms 18016 KB Output is correct
75 Correct 2556 ms 23392 KB Output is correct
76 Correct 2431 ms 26400 KB Output is correct
77 Correct 997 ms 16224 KB Output is correct
78 Correct 1000 ms 15432 KB Output is correct
79 Correct 962 ms 15860 KB Output is correct
80 Correct 991 ms 16048 KB Output is correct
81 Correct 1445 ms 19196 KB Output is correct
82 Correct 1079 ms 16072 KB Output is correct
83 Correct 962 ms 16568 KB Output is correct
84 Correct 1250 ms 19360 KB Output is correct
85 Correct 1481 ms 18716 KB Output is correct
86 Correct 1571 ms 20068 KB Output is correct
87 Correct 1068 ms 17040 KB Output is correct
88 Correct 943 ms 15640 KB Output is correct

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 17 ms 700 KB Output is correct
4 Correct 18 ms 680 KB Output is correct
5 Correct 11 ms 1036 KB Output is correct
6 Correct 14 ms 852 KB Output is correct
7 Correct 17 ms 816 KB Output is correct
8 Correct 10 ms 852 KB Output is correct
9 Correct 13 ms 868 KB Output is correct
10 Correct 8 ms 980 KB Output is correct
11 Correct 20 ms 716 KB Output is correct
12 Correct 17 ms 716 KB Output is correct
13 Correct 8 ms 980 KB Output is correct
14 Correct 16 ms 852 KB Output is correct
15 Correct 18 ms 580 KB Output is correct
16 Correct 18 ms 636 KB Output is correct
17 Correct 17 ms 864 KB Output is correct
18 Correct 9 ms 980 KB Output is correct
19 Correct 13 ms 860 KB Output is correct
20 Correct 13 ms 852 KB Output is correct
21 Correct 1201 ms 11516 KB Output is correct
22 Correct 1256 ms 12452 KB Output is correct
23 Correct 1154 ms 11372 KB Output is correct
24 Correct 1249 ms 13304 KB Output is correct
25 Correct 2448 ms 23112 KB Output is correct
26 Correct 2568 ms 24908 KB Output is correct
27 Correct 1163 ms 11072 KB Output is correct
28 Correct 1191 ms 12236 KB Output is correct
29 Correct 1266 ms 13020 KB Output is correct
30 Correct 653 ms 5064 KB Output is correct
31 Correct 497 ms 6752 KB Output is correct
32 Correct 1383 ms 19572 KB Output is correct
33 Correct 835 ms 15040 KB Output is correct
34 Correct 816 ms 15312 KB Output is correct
35 Correct 849 ms 15832 KB Output is correct
36 Correct 839 ms 15508 KB Output is correct
37 Correct 1377 ms 20304 KB Output is correct
38 Correct 1038 ms 14320 KB Output is correct
39 Correct 1189 ms 17000 KB Output is correct
40 Correct 2479 ms 22948 KB Output is correct
41 Correct 2331 ms 23884 KB Output is correct
42 Correct 1663 ms 19712 KB Output is correct
43 Correct 818 ms 15416 KB Output is correct
44 Correct 1716 ms 20848 KB Output is correct
45 Correct 1367 ms 19208 KB Output is correct
46 Correct 996 ms 15604 KB Output is correct
47 Correct 950 ms 16152 KB Output is correct
48 Correct 917 ms 15700 KB Output is correct
49 Correct 758 ms 12112 KB Output is correct
50 Correct 1054 ms 11760 KB Output is correct
51 Correct 994 ms 11464 KB Output is correct
52 Correct 718 ms 12520 KB Output is correct
53 Correct 856 ms 14528 KB Output is correct
54 Correct 1082 ms 17388 KB Output is correct
55 Correct 1287 ms 19596 KB Output is correct
56 Correct 1075 ms 17468 KB Output is correct
57 Correct 886 ms 15532 KB Output is correct
58 Correct 821 ms 15452 KB Output is correct
59 Correct 819 ms 14564 KB Output is correct
60 Correct 814 ms 16308 KB Output is correct
61 Correct 1372 ms 20512 KB Output is correct
62 Correct 1305 ms 22100 KB Output is correct
63 Correct 2285 ms 24500 KB Output is correct
64 Correct 1532 ms 20556 KB Output is correct
65 Correct 1441 ms 19456 KB Output is correct
66 Correct 853 ms 15416 KB Output is correct
67 Correct 1183 ms 17432 KB Output is correct
68 Correct 1583 ms 19832 KB Output is correct
69 Correct 952 ms 15704 KB Output is correct
70 Correct 948 ms 16088 KB Output is correct
71 Correct 952 ms 16040 KB Output is correct
72 Correct 988 ms 16000 KB Output is correct
73 Correct 1794 ms 19060 KB Output is correct
74 Correct 813 ms 3468 KB Output is correct
75 Correct 1770 ms 20264 KB Output is correct
76 Correct 742 ms 4956 KB Output is correct
77 Correct 1153 ms 17672 KB Output is correct
78 Correct 1961 ms 20880 KB Output is correct
79 Correct 998 ms 15120 KB Output is correct
80 Correct 2600 ms 23500 KB Output is correct
81 Correct 1374 ms 19200 KB Output is correct
82 Correct 1125 ms 15968 KB Output is correct
83 Correct 2232 ms 22088 KB Output is correct
84 Correct 1592 ms 19224 KB Output is correct
85 Correct 1258 ms 11916 KB Output is correct
86 Correct 1335 ms 11860 KB Output is correct
87 Correct 1205 ms 10908 KB Output is correct
88 Correct 1224 ms 11452 KB Output is correct
89 Correct 996 ms 15008 KB Output is correct
90 Correct 990 ms 15036 KB Output is correct
91 Correct 992 ms 15220 KB Output is correct
92 Correct 932 ms 16324 KB Output is correct
93 Correct 1014 ms 7656 KB Output is correct
94 Correct 232 ms 2528 KB Output is correct
95 Correct 1116 ms 15112 KB Output is correct
96 Correct 575 ms 2100 KB Output is correct
97 Correct 1523 ms 20548 KB Output is correct
98 Correct 2272 ms 22268 KB Output is correct
99 Correct 2285 ms 22436 KB Output is correct
100 Correct 2339 ms 23312 KB Output is correct
101 Correct 998 ms 15012 KB Output is correct
102 Correct 901 ms 14652 KB Output is correct
103 Correct 1488 ms 19908 KB Output is correct
104 Correct 1282 ms 16844 KB Output is correct
105 Correct 1128 ms 11176 KB Output is correct
106 Correct 1138 ms 11092 KB Output is correct
107 Correct 1191 ms 11176 KB Output is correct
108 Correct 1183 ms 11716 KB Output is correct
109 Correct 1038 ms 15608 KB Output is correct
110 Correct 1329 ms 18016 KB Output is correct
111 Correct 2556 ms 23392 KB Output is correct
112 Correct 2431 ms 26400 KB Output is correct
113 Correct 997 ms 16224 KB Output is correct
114 Correct 1000 ms 15432 KB Output is correct
115 Correct 962 ms 15860 KB Output is correct
116 Correct 991 ms 16048 KB Output is correct
117 Correct 1445 ms 19196 KB Output is correct
118 Correct 1079 ms 16072 KB Output is correct
119 Correct 962 ms 16568 KB Output is correct
120 Correct 1250 ms 19360 KB Output is correct
121 Correct 1481 ms 18716 KB Output is correct
122 Correct 1571 ms 20068 KB Output is correct
123 Correct 1068 ms 17040 KB Output is correct
124 Correct 943 ms 15640 KB Output is correct
125 Correct 2992 ms 32456 KB Output is correct
126 Correct 3020 ms 32780 KB Output is correct
127 Correct 3123 ms 29588 KB Output is correct
128 Correct 2974 ms 30184 KB Output is correct
129 Correct 3038 ms 31656 KB Output is correct
130 Correct 2935 ms 31364 KB Output is correct
131 Correct 1823 ms 5412 KB Output is correct
132 Correct 2972 ms 21300 KB Output is correct
133 Correct 4882 ms 33864 KB Output is correct
134 Correct 1523 ms 14768 KB Output is correct
135 Execution timed out 5056 ms 40284 KB Time limit exceeded
136 Halted 0 ms 0 KB -