oj.uz

Submission #484459

# Submission time Handle Problem Language Result Execution time Memory
484459 2021-11-03T14:17:24 Z valerikk Hamburg Steak (JOI20_hamburg) C++17
21 / 100
 3000 ms 77500 KB 
#include <bits/stdc++.h>

typedef long long ll;

using namespace std;

const int INF = 1'000'000'000;
const int N = 800005;


struct Point {
	int x, y;
};

struct Seg {
	int l, r;

	Seg() : l(1), r(N) {}

	Seg(int l, int r) : l(l), r(r) {}
};

void self_intersect(Seg &a, const Seg &b) {
	a.l = max(a.l, b.l);
	a.r = min(a.r, b.r);
}

Seg intersect(Seg a, const Seg &b) {
	self_intersect(a, b);
	return a;
}

bool inside(int x, const Seg &s) {
	return x >= s.l && x <= s.r;
}

struct Rect {
	Seg x, y;

	Rect() : x{}, y{} {}

	Rect(const Seg &x, const Seg &y) : x(x), y(y) {}
};

istream &operator>>(istream &stream, Rect &r) {
	stream >> r.x.l >> r.y.l >> r.x.r >> r.y.r;
	return stream;
}

void self_intersect(Rect &a, const Rect &b) {
	self_intersect(a.x, b.x);
	self_intersect(a.y, b.y);
}

Rect intersect(Rect a, const Rect &b) {
	self_intersect(a, b);
	return a;
}

bool inside(const Point &p, const Rect &r) {
	return inside(p.x, r.x) && inside(p.y, r.y);
}

int k;
vector<int> vals;

void adjust(int &val) {
	val = lower_bound(vals.begin(), vals.end(), val) - vals.begin();
}

void output(const vector<Point> &pts) {
	for (const auto &[x, y] : pts) {
		cout << vals[x] << " " << vals[y] << "\n";
	}
	exit(0);
}

vector<Rect> filter(vector<Rect> rects, Point p) {
	vector<Rect> res;
	for (auto r : rects) {
		if (!inside(p, r)) {
			res.push_back(r);
		}
	}
	return res;
}

void solve(const vector<Rect> &rects, const vector<Point> &pts) {
	if ((int)pts.size() == k) {
		if (rects.empty()) {
			output(pts);
		}

		return;
	}

	Rect intersection;
	for (const auto &rect : rects) {
		self_intersect(intersection, rect);
	}

	for (int x : {intersection.x.l, intersection.x.r}) {
		for (int y : {intersection.y.l, intersection.y.r}) {
			Point p = {x, y};
			
			auto npts = pts;
			npts.push_back(p);
			
			vector<Rect> nrects;
			for (const auto &rect : rects) {
				if (!inside(p, rect)) {
					nrects.push_back(rect);
				}
			}

			solve(nrects, npts);
		}
	}
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n;
	cin >> n >> k;
	vector<Rect> rects(n);
	for (auto &r : rects) {
		cin >> r;
	}

	vals.push_back(0);
	vals.push_back(INF + 1);
	for (const auto &r : rects) {
		vals.push_back(r.x.l);
		vals.push_back(r.x.r);
		vals.push_back(r.y.l);
		vals.push_back(r.y.r);
	}
	sort(vals.begin(), vals.end());
	vals.erase(unique(vals.begin(), vals.end()), vals.end());
	while (vals.size() <= N) {
		vals.back() = INF;
		vals.push_back(INF + 1);
	}

	for (auto &r : rects) {
		adjust(r.x.l);
		adjust(r.y.l);
		adjust(r.x.r);
		adjust(r.y.r);
	}

	solve(rects, vector<Point>{});

	Rect intersection;
	for (const auto &r : rects) {
		self_intersect(intersection, r);
	}

	int dy = intersection.y.r, uy = intersection.y.l;
	int lx = intersection.x.r, rx = intersection.x.l;

	Seg base_sd = {lx + 1, rx - 1}, base_su = {lx + 1, rx - 1};
	Seg base_sl = {dy + 1, uy - 1}, base_sr = {dy + 1, uy - 1};

	vector<Seg> pref_dl(N + 1);
	vector<Seg> suff_dr(N + 1);
	vector<Seg> pref_du(N + 1);
	vector<Seg> suff_du(N + 1);
	vector<Seg> pref_lr(N + 1);
	vector<Seg> suff_lr(N + 1);
	vector<Seg> suff_lu(N + 1);
	vector<Seg> suff_ru(N + 1);

	for (const auto &r : rects) {
		int fd = inside(dy, r.y);
		int fu = inside(uy, r.y);
		int fl = inside(lx, r.x);
		int fr = inside(rx, r.x);
		
		if (fd + fu + fl + fr > 2) {
			continue;
		}

		if (fd + fu + fl + fr == 0) {
			assert(0);
		}

		if (fd + fu + fl + fr == 1) {
			if (fd) {
				self_intersect(base_sd, r.x);
			} else if (fu) {
				self_intersect(base_su, r.x);
			} else if (fl) {
				self_intersect(base_sl, r.y);
			} else {
				self_intersect(base_sr, r.y);
			}
		} else {
			if (fd && fu) {
				self_intersect(pref_du[r.x.r], r.x);
				self_intersect(suff_du[r.x.l], r.x);
			} else if (fd && fl) {
				self_intersect(pref_dl[r.x.r], r.y);
			} else if (fd && fr) {
				self_intersect(suff_dr[r.x.l], r.y);
			} else if (fl && fr) {
				self_intersect(pref_lr[r.y.r], r.y);
				self_intersect(suff_lr[r.y.l], r.y);
			} else if (fu && fl) {
				self_intersect(suff_lu[r.y.r], r.x);
			} else {
				self_intersect(suff_ru[r.y.r], r.x);
			}
		}
	}

	for (int i = 0; i < N; ++i) {
		self_intersect(pref_lr[i + 1], pref_lr[i]);
		self_intersect(pref_dl[i + 1], pref_dl[i]);
		self_intersect(pref_du[i + 1], pref_du[i]);
	}
	for (int i = N; i > 0; --i) {
		self_intersect(suff_dr[i - 1], suff_dr[i]);
		self_intersect(suff_du[i - 1], suff_du[i]);
		self_intersect(suff_lu[i - 1], suff_lu[i]);
		self_intersect(suff_ru[i - 1], suff_ru[i]);
		self_intersect(suff_lr[i - 1], suff_lr[i]);
	}

	for (int dx = base_sd.l; dx <= base_sd.r; ++dx) {
		solve(filter(rects, Point{dx, dy}), vector<Point>{Point{dx, dy}});

		Seg su = base_su, sl = base_sl, sr = base_sr;

		self_intersect(sl, pref_dl[dx - 1]);
		self_intersect(sr, suff_dr[dx + 1]);
		self_intersect(su, pref_du[dx - 1]);
		self_intersect(su, suff_du[dx + 1]);

		int ly = intersect(sl, pref_lr[N]).r;

		if (!inside(ly, sl)) {
			continue;
		}

		self_intersect(sr, pref_lr[ly - 1]);
		self_intersect(sr, suff_lr[ly + 1]);

		if (sr.l > sr.r) {
			continue;
		}

		int ry = sr.r;

		self_intersect(su, suff_lu[ly + 1]);
		self_intersect(su, suff_ru[ry + 1]);

		if (su.l > su.r) {
			continue;
		}

		int ux = su.l;

		output(vector<Point>{Point{dx, dy}, Point{lx, ly}, Point{rx, ry}, Point{ux, uy}});
	}

	for (int dx = base_sd.l; dx <= base_sd.r; ++dx) {
		Seg su = base_su, sl = base_sl, sr = base_sr;
			
		self_intersect(sl, pref_dl[dx - 1]);
		self_intersect(sr, suff_dr[dx + 1]);
		self_intersect(su, pref_du[dx - 1]);
		self_intersect(su, suff_du[dx + 1]);

		int ry = intersect(sr, pref_lr[N]).r;
		
		if (!inside(ry, sr)) {
			continue;
		}

		self_intersect(sl, pref_lr[ry - 1]);
		self_intersect(sl, suff_lr[ry + 1]);

		if (sl.l > sl.r) {
			continue;
		}

		int ly = sl.r;

		self_intersect(su, suff_lu[ly + 1]);
		self_intersect(su, suff_ru[ry + 1]);

		if (su.l > su.r) {
			continue;
		}

		int ux = su.l;
		
		output(vector<Point>{Point{dx, dy}, Point{lx, ly}, Point{rx, ry}, Point{ux, uy}});
	}


	return 0;
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4544 KB Output is correct
2 Correct 5 ms 4544 KB Output is correct
3 Correct 6 ms 4544 KB Output is correct
4 Correct 6 ms 4544 KB Output is correct

Subtask #2
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4520 KB Output is correct
2 Correct 5 ms 4544 KB Output is correct
3 Correct 5 ms 4544 KB Output is correct
4 Correct 8 ms 4544 KB Output is correct

Subtask #3
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4544 KB Output is correct
2 Correct 6 ms 4584 KB Output is correct
3 Correct 5 ms 4484 KB Output is correct
4 Correct 8 ms 4468 KB Output is correct
5 Correct 6 ms 4552 KB Output is correct
6 Correct 6 ms 4544 KB Output is correct
7 Correct 6 ms 4544 KB Output is correct
8 Correct 6 ms 4552 KB Output is correct
9 Correct 6 ms 4544 KB Output is correct
10 Correct 6 ms 4544 KB Output is correct
11 Correct 7 ms 4544 KB Output is correct
12 Correct 6 ms 4544 KB Output is correct

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4544 KB Output is correct
2 Correct 6 ms 4544 KB Output is correct
3 Correct 7 ms 4560 KB Output is correct
4 Correct 6 ms 4544 KB Output is correct
5 Correct 6 ms 4544 KB Output is correct
6 Correct 6 ms 4544 KB Output is correct
7 Correct 8 ms 4548 KB Output is correct
8 Correct 8 ms 4544 KB Output is correct
9 Correct 7 ms 4592 KB Output is correct
10 Correct 7 ms 4544 KB Output is correct
11 Correct 9 ms 4544 KB Output is correct
12 Correct 6 ms 4544 KB Output is correct
13 Correct 6 ms 4544 KB Output is correct
14 Correct 41 ms 53800 KB Output is correct
15 Correct 6 ms 4672 KB Output is correct
16 Correct 6 ms 4604 KB Output is correct
17 Correct 305 ms 53852 KB Output is correct
18 Correct 7 ms 4672 KB Output is correct
19 Correct 9 ms 4672 KB Output is correct
20 Correct 41 ms 53820 KB Output is correct
21 Correct 6 ms 4672 KB Output is correct
22 Correct 7 ms 4640 KB Output is correct
23 Correct 265 ms 53848 KB Output is correct
24 Correct 7 ms 4672 KB Output is correct
25 Correct 8 ms 4672 KB Output is correct
26 Correct 9 ms 4672 KB Output is correct
27 Correct 8 ms 4672 KB Output is correct
28 Correct 10 ms 4664 KB Output is correct
29 Correct 9 ms 4660 KB Output is correct
30 Correct 7 ms 4672 KB Output is correct
31 Correct 60 ms 53840 KB Output is correct
32 Correct 43 ms 53948 KB Output is correct
33 Correct 48 ms 53820 KB Output is correct
34 Correct 49 ms 53816 KB Output is correct
35 Correct 47 ms 53836 KB Output is correct
36 Correct 39 ms 53848 KB Output is correct
37 Correct 43 ms 53788 KB Output is correct
38 Correct 43 ms 53868 KB Output is correct
39 Correct 181 ms 53844 KB Output is correct
40 Correct 41 ms 53776 KB Output is correct
41 Correct 41 ms 53864 KB Output is correct
42 Correct 48 ms 53820 KB Output is correct
43 Correct 41 ms 53756 KB Output is correct
44 Correct 41 ms 53856 KB Output is correct
45 Correct 8 ms 4664 KB Output is correct
46 Correct 47 ms 53852 KB Output is correct
47 Correct 44 ms 53812 KB Output is correct
48 Correct 60 ms 53796 KB Output is correct
49 Correct 89 ms 53816 KB Output is correct
50 Correct 43 ms 53812 KB Output is correct
51 Correct 41 ms 53804 KB Output is correct
52 Correct 45 ms 53796 KB Output is correct
53 Correct 42 ms 53848 KB Output is correct
54 Correct 55 ms 53852 KB Output is correct
55 Correct 41 ms 53680 KB Output is correct
56 Correct 41 ms 53700 KB Output is correct
57 Correct 40 ms 53748 KB Output is correct
58 Correct 39 ms 53748 KB Output is correct

Subtask #5
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4544 KB Output is correct
2 Correct 5 ms 4544 KB Output is correct
3 Correct 6 ms 4544 KB Output is correct
4 Correct 6 ms 4544 KB Output is correct
5 Correct 257 ms 7652 KB Output is correct
6 Correct 269 ms 7652 KB Output is correct
7 Correct 259 ms 7612 KB Output is correct
8 Correct 283 ms 7668 KB Output is correct

Subtask #6
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4520 KB Output is correct
2 Correct 5 ms 4544 KB Output is correct
3 Correct 5 ms 4544 KB Output is correct
4 Correct 8 ms 4544 KB Output is correct
5 Correct 259 ms 10088 KB Output is correct
6 Correct 266 ms 13108 KB Output is correct
7 Correct 256 ms 9948 KB Output is correct
8 Correct 320 ms 15120 KB Output is correct

Subtask #7
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4544 KB Output is correct
2 Correct 6 ms 4584 KB Output is correct
3 Correct 5 ms 4484 KB Output is correct
4 Correct 8 ms 4468 KB Output is correct
5 Correct 6 ms 4552 KB Output is correct
6 Correct 6 ms 4544 KB Output is correct
7 Correct 6 ms 4544 KB Output is correct
8 Correct 6 ms 4552 KB Output is correct
9 Correct 6 ms 4544 KB Output is correct
10 Correct 6 ms 4544 KB Output is correct
11 Correct 7 ms 4544 KB Output is correct
12 Correct 6 ms 4544 KB Output is correct
13 Correct 286 ms 10920 KB Output is correct
14 Correct 263 ms 10344 KB Output is correct
15 Correct 272 ms 11372 KB Output is correct
16 Correct 275 ms 9572 KB Output is correct
17 Correct 271 ms 10456 KB Output is correct
18 Correct 259 ms 8500 KB Output is correct
19 Correct 269 ms 12780 KB Output is correct
20 Correct 359 ms 18068 KB Output is correct
21 Correct 265 ms 12644 KB Output is correct
22 Correct 290 ms 17912 KB Output is correct
23 Correct 349 ms 17636 KB Output is correct
24 Correct 296 ms 17316 KB Output is correct

Subtask #8
0 / 79.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4544 KB Output is correct
2 Correct 6 ms 4544 KB Output is correct
3 Correct 7 ms 4560 KB Output is correct
4 Correct 6 ms 4544 KB Output is correct
5 Correct 6 ms 4544 KB Output is correct
6 Correct 6 ms 4544 KB Output is correct
7 Correct 8 ms 4548 KB Output is correct
8 Correct 8 ms 4544 KB Output is correct
9 Correct 7 ms 4592 KB Output is correct
10 Correct 7 ms 4544 KB Output is correct
11 Correct 9 ms 4544 KB Output is correct
12 Correct 6 ms 4544 KB Output is correct
13 Correct 6 ms 4544 KB Output is correct
14 Correct 41 ms 53800 KB Output is correct
15 Correct 6 ms 4672 KB Output is correct
16 Correct 6 ms 4604 KB Output is correct
17 Correct 305 ms 53852 KB Output is correct
18 Correct 7 ms 4672 KB Output is correct
19 Correct 9 ms 4672 KB Output is correct
20 Correct 41 ms 53820 KB Output is correct
21 Correct 6 ms 4672 KB Output is correct
22 Correct 7 ms 4640 KB Output is correct
23 Correct 265 ms 53848 KB Output is correct
24 Correct 7 ms 4672 KB Output is correct
25 Correct 8 ms 4672 KB Output is correct
26 Correct 9 ms 4672 KB Output is correct
27 Correct 8 ms 4672 KB Output is correct
28 Correct 10 ms 4664 KB Output is correct
29 Correct 9 ms 4660 KB Output is correct
30 Correct 7 ms 4672 KB Output is correct
31 Correct 60 ms 53840 KB Output is correct
32 Correct 43 ms 53948 KB Output is correct
33 Correct 48 ms 53820 KB Output is correct
34 Correct 49 ms 53816 KB Output is correct
35 Correct 47 ms 53836 KB Output is correct
36 Correct 39 ms 53848 KB Output is correct
37 Correct 43 ms 53788 KB Output is correct
38 Correct 43 ms 53868 KB Output is correct
39 Correct 181 ms 53844 KB Output is correct
40 Correct 41 ms 53776 KB Output is correct
41 Correct 41 ms 53864 KB Output is correct
42 Correct 48 ms 53820 KB Output is correct
43 Correct 41 ms 53756 KB Output is correct
44 Correct 41 ms 53856 KB Output is correct
45 Correct 8 ms 4664 KB Output is correct
46 Correct 47 ms 53852 KB Output is correct
47 Correct 44 ms 53812 KB Output is correct
48 Correct 60 ms 53796 KB Output is correct
49 Correct 89 ms 53816 KB Output is correct
50 Correct 43 ms 53812 KB Output is correct
51 Correct 41 ms 53804 KB Output is correct
52 Correct 45 ms 53796 KB Output is correct
53 Correct 42 ms 53848 KB Output is correct
54 Correct 55 ms 53852 KB Output is correct
55 Correct 41 ms 53680 KB Output is correct
56 Correct 41 ms 53700 KB Output is correct
57 Correct 40 ms 53748 KB Output is correct
58 Correct 39 ms 53748 KB Output is correct
59 Correct 273 ms 20404 KB Output is correct
60 Correct 275 ms 20404 KB Output is correct
61 Correct 260 ms 20400 KB Output is correct
62 Correct 283 ms 19892 KB Output is correct
63 Correct 265 ms 19548 KB Output is correct
64 Correct 255 ms 15844 KB Output is correct
65 Correct 270 ms 20468 KB Output is correct
66 Correct 451 ms 29096 KB Output is correct
67 Correct 310 ms 25228 KB Output is correct
68 Correct 577 ms 30084 KB Output is correct
69 Correct 676 ms 30452 KB Output is correct
70 Correct 500 ms 29960 KB Output is correct
71 Correct 264 ms 21112 KB Output is correct
72 Correct 748 ms 77500 KB Output is correct
73 Correct 276 ms 23516 KB Output is correct
74 Correct 380 ms 29436 KB Output is correct
75 Execution timed out 3088 ms 77216 KB Time limit exceeded
76 Halted 0 ms 0 KB -