oj.uz

Submission #1050425

# Submission time Handle Problem Language Result Execution time Memory
1050425 2024-08-09T09:23:04 Z ksun69(#11101) Hamburg Steak (JOI20_hamburg) C++17
15 / 100
 652 ms 82012 KB 
#include <bits/stdc++.h>
using namespace std;

namespace std {

template<class Fun>
class y_combinator_result {
	Fun fun_;
public:
	template<class T>
	explicit y_combinator_result(T &&fun): fun_(std::forward<T>(fun)) {}

	template<class ...Args>
	decltype(auto) operator()(Args &&...args) {
		return fun_(std::ref(*this), std::forward<Args>(args)...);
	}
};

template<class Fun>
decltype(auto) y_combinator(Fun &&fun) {
	return y_combinator_result<std::decay_t<Fun>>(std::forward<Fun>(fun));
}

} // namespace std

int main(){
	ios_base::sync_with_stdio(false), cin.tie(nullptr);
	int N, K;
	cin >> N >> K;
	vector<vector<int> > S(N, vector<int>(4));
	for(int i = 0; i < N; i++){
		for(int j = 0; j < 4; j++){
			cin >> S[i][j];
		}
	}
	vector<int> x_values, y_values;
	for(int i = 0; i < N; i++){
		x_values.push_back(S[i][0]);
		x_values.push_back(S[i][2]);
		y_values.push_back(S[i][1]);
		y_values.push_back(S[i][3]);
	}
	sort(x_values.begin(), x_values.end());
	sort(y_values.begin(), y_values.end());
	x_values.erase(unique(x_values.begin(), x_values.end()), x_values.end());
	y_values.erase(unique(y_values.begin(), y_values.end()), y_values.end());

	auto get_compress_x = [&](int x){
		return int(lower_bound(x_values.begin(), x_values.end(), x) - x_values.begin());
	};
	auto get_compress_y = [&](int y){
		return int(lower_bound(y_values.begin(), y_values.end(), y) - y_values.begin());
	};

	for(int i = 0; i < N; i++){
		S[i][0] = get_compress_x(S[i][0]);
		S[i][1] = get_compress_y(S[i][1]);
		S[i][2] = get_compress_x(S[i][2]);
		S[i][3] = get_compress_y(S[i][3]);
	}

	// L D R U
	vector<pair<int,int> > bad = {{-1, -1}};
	auto sol = y_combinator([&](auto self, vector<vector<int>> s, int k) -> vector<pair<int,int> > {
		if(s.size() == 0) return vector<pair<int,int> >(k, {0, 0});
		if(k == 0) return bad;
		vector<int> bounds {int(-1e9), int(-1e9), int(1e9), int(1e9)};
		for(int i = 0; i < (int)s.size(); i++){
			bounds[0] = max(bounds[0], s[i][0]);
			bounds[1] = max(bounds[1], s[i][1]);
			bounds[2] = min(bounds[2], s[i][2]);
			bounds[3] = min(bounds[3], s[i][3]);
		}
		for(int x : {bounds[0], bounds[2]}){
			for(int y : {bounds[1], bounds[3]}){
				vector<vector<int> > nxt;
				for(int i = 0; i < (int)s.size(); i++){
					if(!(s[i][0] <= x && s[i][2] >= x && s[i][1] <= y && s[i][3] >= y)) nxt.push_back(s[i]);
				}
				auto res = self(nxt, k-1);
				if(res != bad) {
					res.push_back({x, y});
					return res;
				}
			}
		}
		return bad;
	})(S, K);
	if(sol != bad){
		for(int i = 0; i < K; i++){
			cout << x_values[sol[i].first] << ' ' << y_values[sol[i].second] << '\n';
		}
		exit(0);
	}
	assert(K == 4);

	vector<int> bounds {int(-1e9), int(-1e9), int(1e9), int(1e9)};
	for(int i = 0; i < N; i++){
		bounds[0] = max(bounds[0], S[i][0]);
		bounds[1] = max(bounds[1], S[i][1]);
		bounds[2] = min(bounds[2], S[i][2]);
		bounds[3] = min(bounds[3], S[i][3]);
	}
	swap(bounds[0], bounds[2]);
	swap(bounds[1], bounds[3]);
	assert(bounds[0] < bounds[2] && bounds[1] < bounds[3]);
	for(int i = 0; i < N; i++){
		S[i][0] = max(S[i][0], bounds[0]);
		S[i][1] = max(S[i][1], bounds[1]);
		S[i][2] = min(S[i][2], bounds[2]);
		S[i][3] = min(S[i][3], bounds[3]);
	}
	vector<vector<vector<int> > > constraints(16);
	for(int i = 0; i < N; i++){
		int mask = 0;
		for(int j = 0; j < 4; j++){
			if(S[i][j] == bounds[j]) mask |= (1 << j);
		}
		constraints[mask].push_back(S[i]);
	}
	assert(constraints[0].empty());
	vector<pair<int,int> > sides(4);
	for(int b = 0; b < 4; b++){
		assert(!constraints[1 << b].empty());
		pair<int,int> lr = {int(-1e9), int(1e9)};
		for(auto v : constraints[1 << b]){
			lr.first = max(lr.first, v[(b & 1) ^ 1]);
			lr.second = min(lr.second, v[(b & 1) ^ 3]);
		}
		sides[b] = lr;
	}

	auto remove_containing_rectangles = [&](vector<vector<int> > &rectangles){
		sort(rectangles.begin(), rectangles.end(), [&](vector<int> a, vector<int> b){
			return pair<int,int>(a[2] - a[0], a[3] - a[1]) < pair<int,int>(b[2] - b[0], b[3] - b[1]);
		});
		vector<vector<int> > stk;
		for(auto v : rectangles){
			if(!stk.empty() && stk.back()[0] >= v[0] && stk.back()[1] >= v[1] && stk.back()[2] <= v[2] && stk.back()[3] <= v[3]){
				continue;
			}
			stk.push_back(v);
		}
		rectangles = stk;
	};
	for(int msk = 0; msk < (1 << 4); msk++){
		remove_containing_rectangles(constraints[msk]);
	}
	vector<pair<int,int> > x_constraints, y_constraints;
	for(vector<int> c : constraints[(1 << 1) ^ (1 << 3)]){
		x_constraints.push_back({c[0], c[2]});
	}
	for(vector<int> c : constraints[(1 << 2) ^ (1 << 0)]){
		y_constraints.push_back({c[1], c[3]});
	}

	auto generate_map = [&](vector<pair<int,int> > constraints, int L, pair<int,int> l_bounds, pair<int,int> r_bounds) -> vector<pair<int,int> > {
		vector<vector<pair<int,int> > > ins(L);
		vector<vector<pair<int,int> > > rem(L);
		multiset<int> lb;
		multiset<int> ub;
		lb.insert(r_bounds.first);
		ub.insert(r_bounds.second);
		for(auto [l, r] : constraints){
			rem[l].push_back({l, r});
			ins[r].push_back({l, r});
			lb.insert(l);
			ub.insert(r);
		}
		vector<pair<int,int> > res(L);
		for(int i = 0; i < L; i++){
			for(auto [l, r] : rem[i]){
				ub.erase(ub.find(r));
				lb.erase(lb.find(l));
			}
			{
				int l = *lb.rbegin();
				int r = *ub.begin();
				if(l <= r && i >= l_bounds.first && i <= l_bounds.second){
					res[i] = {l, r};
				} else {
					res[i] = {-1, -1};
				}
			}
			for(auto [l, r] : ins[i]){
				ub.insert(r);
				lb.insert(l);
			}
		}
		for(auto [l, r] : constraints){
			lb.erase(lb.find(l));
			ub.erase(ub.find(r));
		}
		return res;
	};

	int X = x_values.size();
	int Y = y_values.size();
	vector<pair<int,int> > x_map = generate_map(x_constraints, X, sides[1], sides[3]);
	vector<pair<int,int> > y_map = generate_map(y_constraints, Y, sides[0], sides[2]);
	vector<pair<int,int> > y_map_flip = generate_map(y_constraints, Y, sides[2], sides[0]);
	int max_y_min = -1;
	for(int i = 0; i < Y; i++){
		if(y_map[i].first != -1){
			max_y_min = max(max_y_min, min(i, y_map[i].first));
		}
		if(y_map_flip[i].first != -1){
			max_y_min = max(max_y_min, min(i, y_map_flip[i].first));
		}
	}
	vector<int> y0_x3_max(Y);
	int c3 = 0;
	for(int y = 0; y < Y; y++){
		while(c3 < constraints[(1 << 0) ^ (1 << 3)].size() && constraints[(1 << 0) ^ (1 << 3)][c3][1] <= y){
			c3++;
		}
		y0_x3_max[y] = (c3 == constraints[(1 << 0) ^ (1 << 3)].size() ? bounds[2] : constraints[(1 << 0) ^ (1 << 3)][c3][2]);
	}
	vector<int> y2_x3_min(Y);
	c3 = 0;
	for(int y = 0; y < Y; y++){
		while(c3 < constraints[(1 << 2) ^ (1 << 3)].size() && constraints[(1 << 2) ^ (1 << 3)][c3][1] <= y){
			c3++;
		}
		y2_x3_min[y] = (c3 == constraints[(1 << 2) ^ (1 << 3)].size() ? bounds[0] : constraints[(1 << 2) ^ (1 << 3)][c3][0]);
	}

	int c0 = 0;
	int c2 = (int)constraints[(1 << 2) ^ (1 << 1)].size();
	vector<pair<int,int> > ans;
	for(int x = 0; x < X; x++){
		while(c0 < constraints[(1 << 0) ^ (1 << 1)].size() && constraints[(1 << 0) ^ (1 << 1)][c0][2] < x){
			c0++;
		}
		int y0max = (c0 == 0 ? bounds[3] : constraints[(1 << 0) ^ (1 << 1)][c0-1][3]);
		while(c2 > 0 && constraints[(1 << 2) ^ (1 << 1)][c2-1][0] <= x){
			c2--;
		}
		int y2max = (c2 == 0 ? bounds[3] : constraints[(1 << 2) ^ (1 << 1)][c2-1][3]);
		vector<pair<int,int> > y_pairs;
		{
			int y0 = min(y0max, max_y_min);
			if(y0 != -1){
				int y2 = min(y2max, y_map[y0].second);
				if(y_map[y0].first != -1 && y2 >= y0 && y2 >= y_map[y0].first) y_pairs.push_back({y0, y2});
			}
		}
		{
			int y2 = min(y2max, max_y_min);
			int y0 = min(y0max, y_map_flip[y2].second);
			if(y_map_flip[y2].first != -1 && y0 >= y2 && y0 >= y_map_flip[y2].first) y_pairs.push_back({y0, y2});
		}
		for(auto [y0, y2] : y_pairs){
			int xl = x_map[x].first;
			int xr = x_map[x].second;
			if(xl == -1) continue;
			assert(y0 >= sides[0].first && y0 <= sides[0].second);
			xl = max(xl, y2_x3_min[y2]);
			xr = min(xr, y0_x3_max[y0]);
			if(xl <= xr){
				ans = {{x, bounds[1]}, {xl, bounds[3]}, {bounds[0], y0}, {bounds[2], y2}};
			}
		}
	}
	if(ans.empty()){
		assert(false);
	}
	for(int m1 = 0; m1 < 16; m1++){
		for(auto cons : constraints[m1]){
			bool found = false;
			for(auto [x, y] : ans){
				if(cons[0] <= x && x <= cons[2] && cons[1] <= y && y <= cons[3]){
					found = true;
				}
			}
			if(!found) {
				cerr << m1 << ' ' << cons[0] << ' ' << cons[1] << ' ' << cons[2] << ' ' << cons[3] << '\n';
				assert(false);
			}
		}
	}
	for(auto cons : S){
		bool found = false;
		for(auto [x, y] : ans){
			if(cons[0] <= x && x <= cons[2] && cons[1] <= y && y <= cons[3]){
				found = true;
			}
		}
		if(!found) {
			cerr << cons[0] << ' ' << cons[1] << ' ' << cons[2] << ' ' << cons[3] << '\n';
			cerr << "bad ? " << '\n';
			assert(false);
		}
	}
	for(auto [x, y] : ans){
		cout << x_values[x] << ' ' << y_values[y] << '\n';
	}
}

Compilation message

hamburg.cpp: In function 'int main()':
hamburg.cpp:214:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  214 |   while(c3 < constraints[(1 << 0) ^ (1 << 3)].size() && constraints[(1 << 0) ^ (1 << 3)][c3][1] <= y){
      |         ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hamburg.cpp:217:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  217 |   y0_x3_max[y] = (c3 == constraints[(1 << 0) ^ (1 << 3)].size() ? bounds[2] : constraints[(1 << 0) ^ (1 << 3)][c3][2]);
      |                   ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hamburg.cpp:222:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  222 |   while(c3 < constraints[(1 << 2) ^ (1 << 3)].size() && constraints[(1 << 2) ^ (1 << 3)][c3][1] <= y){
      |         ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hamburg.cpp:225:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  225 |   y2_x3_min[y] = (c3 == constraints[(1 << 2) ^ (1 << 3)].size() ? bounds[0] : constraints[(1 << 2) ^ (1 << 3)][c3][0]);
      |                   ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hamburg.cpp:232:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  232 |   while(c0 < constraints[(1 << 0) ^ (1 << 1)].size() && constraints[(1 << 0) ^ (1 << 1)][c0][2] < x){
      |         ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 604 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 600 KB Output is correct

Subtask #2
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 2 ms 872 KB Output is correct
3 Correct 2 ms 600 KB Output is correct
4 Correct 2 ms 860 KB Output is correct

Subtask #3
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 856 KB Output is correct
2 Correct 2 ms 600 KB Output is correct
3 Correct 2 ms 1112 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 2 ms 860 KB Output is correct
7 Correct 1 ms 860 KB Output is correct
8 Correct 5 ms 1116 KB Output is correct
9 Correct 2 ms 860 KB Output is correct
10 Correct 4 ms 1116 KB Output is correct
11 Correct 3 ms 860 KB Output is correct
12 Correct 2 ms 860 KB Output is correct

Subtask #4
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 604 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 860 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 860 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 2 ms 860 KB Output is correct
8 Correct 14 ms 1372 KB Output is correct
9 Correct 3 ms 860 KB Output is correct
10 Correct 11 ms 1324 KB Output is correct
11 Correct 14 ms 1372 KB Output is correct
12 Correct 4 ms 1116 KB Output is correct
13 Correct 1 ms 860 KB Output is correct
14 Correct 16 ms 1352 KB Output is correct
15 Correct 2 ms 860 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 16 ms 1360 KB Output is correct
18 Correct 6 ms 1116 KB Output is correct
19 Correct 3 ms 1116 KB Output is correct
20 Correct 24 ms 1364 KB Output is correct
21 Correct 2 ms 1116 KB Output is correct
22 Correct 6 ms 1400 KB Output is correct
23 Correct 25 ms 1420 KB Output is correct
24 Correct 9 ms 1372 KB Output is correct
25 Correct 11 ms 1328 KB Output is correct
26 Correct 12 ms 1372 KB Output is correct
27 Correct 9 ms 1404 KB Output is correct
28 Correct 8 ms 1372 KB Output is correct
29 Correct 9 ms 1324 KB Output is correct
30 Correct 7 ms 1328 KB Output is correct
31 Correct 15 ms 1312 KB Output is correct
32 Correct 12 ms 1116 KB Output is correct
33 Correct 15 ms 1144 KB Output is correct
34 Correct 15 ms 1264 KB Output is correct
35 Correct 28 ms 1372 KB Output is correct
36 Correct 15 ms 1112 KB Output is correct
37 Correct 30 ms 1372 KB Output is correct
38 Correct 35 ms 1516 KB Output is correct
39 Correct 19 ms 1360 KB Output is correct
40 Correct 15 ms 1252 KB Output is correct
41 Correct 18 ms 1364 KB Output is correct
42 Correct 23 ms 1400 KB Output is correct
43 Correct 21 ms 1368 KB Output is correct
44 Correct 23 ms 1424 KB Output is correct
45 Correct 12 ms 1368 KB Output is correct
46 Correct 25 ms 1368 KB Output is correct
47 Correct 21 ms 1364 KB Output is correct
48 Correct 29 ms 1440 KB Output is correct
49 Correct 25 ms 1372 KB Output is correct
50 Correct 17 ms 1372 KB Output is correct
51 Correct 28 ms 1368 KB Output is correct
52 Correct 14 ms 1176 KB Output is correct
53 Correct 21 ms 1400 KB Output is correct
54 Correct 28 ms 1428 KB Output is correct
55 Runtime error 10 ms 2136 KB Execution killed with signal 6
56 Halted 0 ms 0 KB -

Subtask #5
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 604 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 196 ms 25268 KB Output is correct
6 Correct 194 ms 25444 KB Output is correct
7 Correct 203 ms 25444 KB Output is correct
8 Correct 196 ms 25260 KB Output is correct

Subtask #6
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 2 ms 872 KB Output is correct
3 Correct 2 ms 600 KB Output is correct
4 Correct 2 ms 860 KB Output is correct
5 Correct 199 ms 36188 KB Output is correct
6 Correct 222 ms 50092 KB Output is correct
7 Correct 200 ms 34976 KB Output is correct
8 Correct 242 ms 58444 KB Output is correct

Subtask #7
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 856 KB Output is correct
2 Correct 2 ms 600 KB Output is correct
3 Correct 2 ms 1112 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 2 ms 860 KB Output is correct
7 Correct 1 ms 860 KB Output is correct
8 Correct 5 ms 1116 KB Output is correct
9 Correct 2 ms 860 KB Output is correct
10 Correct 4 ms 1116 KB Output is correct
11 Correct 3 ms 860 KB Output is correct
12 Correct 2 ms 860 KB Output is correct
13 Correct 208 ms 42164 KB Output is correct
14 Correct 205 ms 41828 KB Output is correct
15 Correct 219 ms 44384 KB Output is correct
16 Correct 201 ms 35428 KB Output is correct
17 Correct 204 ms 39780 KB Output is correct
18 Correct 196 ms 33360 KB Output is correct
19 Correct 204 ms 42828 KB Output is correct
20 Correct 652 ms 82012 KB Output is correct
21 Correct 224 ms 51864 KB Output is correct
22 Correct 315 ms 82008 KB Output is correct
23 Correct 461 ms 80604 KB Output is correct
24 Correct 344 ms 75412 KB Output is correct

Subtask #8
0 / 79.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 604 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 860 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 860 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 2 ms 860 KB Output is correct
8 Correct 14 ms 1372 KB Output is correct
9 Correct 3 ms 860 KB Output is correct
10 Correct 11 ms 1324 KB Output is correct
11 Correct 14 ms 1372 KB Output is correct
12 Correct 4 ms 1116 KB Output is correct
13 Correct 1 ms 860 KB Output is correct
14 Correct 16 ms 1352 KB Output is correct
15 Correct 2 ms 860 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 16 ms 1360 KB Output is correct
18 Correct 6 ms 1116 KB Output is correct
19 Correct 3 ms 1116 KB Output is correct
20 Correct 24 ms 1364 KB Output is correct
21 Correct 2 ms 1116 KB Output is correct
22 Correct 6 ms 1400 KB Output is correct
23 Correct 25 ms 1420 KB Output is correct
24 Correct 9 ms 1372 KB Output is correct
25 Correct 11 ms 1328 KB Output is correct
26 Correct 12 ms 1372 KB Output is correct
27 Correct 9 ms 1404 KB Output is correct
28 Correct 8 ms 1372 KB Output is correct
29 Correct 9 ms 1324 KB Output is correct
30 Correct 7 ms 1328 KB Output is correct
31 Correct 15 ms 1312 KB Output is correct
32 Correct 12 ms 1116 KB Output is correct
33 Correct 15 ms 1144 KB Output is correct
34 Correct 15 ms 1264 KB Output is correct
35 Correct 28 ms 1372 KB Output is correct
36 Correct 15 ms 1112 KB Output is correct
37 Correct 30 ms 1372 KB Output is correct
38 Correct 35 ms 1516 KB Output is correct
39 Correct 19 ms 1360 KB Output is correct
40 Correct 15 ms 1252 KB Output is correct
41 Correct 18 ms 1364 KB Output is correct
42 Correct 23 ms 1400 KB Output is correct
43 Correct 21 ms 1368 KB Output is correct
44 Correct 23 ms 1424 KB Output is correct
45 Correct 12 ms 1368 KB Output is correct
46 Correct 25 ms 1368 KB Output is correct
47 Correct 21 ms 1364 KB Output is correct
48 Correct 29 ms 1440 KB Output is correct
49 Correct 25 ms 1372 KB Output is correct
50 Correct 17 ms 1372 KB Output is correct
51 Correct 28 ms 1368 KB Output is correct
52 Correct 14 ms 1176 KB Output is correct
53 Correct 21 ms 1400 KB Output is correct
54 Correct 28 ms 1428 KB Output is correct
55 Runtime error 10 ms 2136 KB Execution killed with signal 6
56 Halted 0 ms 0 KB -