oj.uz

Submission #218027

# Submission time Handle Problem Language Result Execution time Memory
218027 2020-03-31T12:45:05 Z mieszko11b Hamburg Steak (JOI20_hamburg) C++14
21 / 100
 3000 ms 17980 KB 
#include <bits/stdc++.h>

using namespace std;

using ii = pair<int, int>;

#define X first
#define Y second

const int inf = int(1e9);

struct rect {
	int l, r, d, u;
	
	rect() {
	}
	
	rect(int l, int r, int d, int u) {
		this->l = l;
		this->r = r;
		this->d = d;
		this->u = u;
	}
};

bool rects_intersect(rect &a, rect &b) {
	return max(a.l, b.l) <= min(a.r, b.r) && max(a.d, b.d) <= min(a.u, b.u);
}

void normalise(vector<ii> &V, int dx, int dy) {
	if(dx == 1)
		sort(V.begin(), V.end());
	else
		sort(V.begin(), V.end(), greater<ii>());
		
	vector<ii> res;
	for(auto r : V) {
		while(!res.empty() && res.back().Y * dy >= r.Y * dy)
			res.pop_back();
		if(res.empty() || res.back().X * dx < r.X * dx)
			res.push_back(r);
	}
	V = res;
}

void add_candidates(vector<int> &cand, vector<ii> &P) {
	for(auto p : P)
		cand.push_back(p.X);
}

vector<ii> solve_one_side(vector<rect> &V) {
	int L = 0, R = inf, D = 0, U = inf;
	for(auto r : V) {
		L = max(L, r.l);
		R = min(R, r.r);
		D = max(D, r.d);
		U = min(U, r.u);
	}
	
	if(L > R)
		swap(L, R);
	if(D > U)
		swap(D, U);
		
	//~ cout << L << " " << R << " " << D << " "<< U << endl;
		
	vector<ii> LU, LD, RU, RD, DU, LR;
	int minU = L, maxU = R, minD = L, maxD = R, minL = D, maxL = U, minR = D, maxR = U;
	
	rect rL(L, L, D, U), rR(R, R, D, U), rD(L, R, D, D), rU(L, R, U, U);
	
	for(auto r : V) {
		int mask = 0;
		if(rects_intersect(rL, r)) mask |= 1;
		if(rects_intersect(rR, r)) mask |= 2;
		if(rects_intersect(rD, r)) mask |= 4;
		if(rects_intersect(rU, r)) mask |= 8;
		
		if(__builtin_popcount(mask) >= 3)
			continue;
		
		if(mask == 1) {
			minL = max(minL, r.d);
			maxL = min(maxL, r.u);
		} else if(mask == 2) {
			minR = max(minR, r.d);
			maxR = min(maxR, r.u);
		} else if(mask == 4) {
			minD = max(minD, r.l);
			maxD = min(maxD, r.r);
		} else if(mask == 8) {
			minU = max(minU, r.l);
			maxU = min(maxU, r.r);
		} else if(mask == 3) {
			LR.emplace_back(r.d, r.u);
		} else if(mask == 12) {
			DU.emplace_back(r.l, r.r);
		} else if(mask == 9) {
			LU.emplace_back(r.d, r.r);
		} else if(mask == 5) {
			LD.emplace_back(r.u, r.r);
		} else if(mask == 10) {
			RU.emplace_back(r.d, r.l);
		} else if(mask == 6) {
			RD.emplace_back(r.u, r.l);
		} else
			exit(5);
	}
	
	normalise(LR, 1, 1);
	normalise(DU, 1, 1);
	normalise(LU, 1, 1);
	normalise(LD, -1, 1);
	normalise(RU, 1, -1);
	normalise(RD, -1, -1);
	
	vector<int> candL;
	
	add_candidates(candL, LR);
	add_candidates(candL, LU);
	add_candidates(candL, LD);
	candL.push_back(minL);
	
	sort(candL.begin(), candL.end());
	candL.resize(distance(candL.begin(), unique(candL.begin(), candL.end())));
	
	int lstLR = -1, lstLD = LD.size() - 1, lstLU = -1, lstDU = DU.size() - 1;
	
	for(int ly : candL) {
		//~ cout << "ly=" << ly << endl;
		if(ly < minL || ly > maxL)
			continue;
			
		while(lstLR + 1 < LR.size() && LR[lstLR + 1].X <= ly && ly <= LR[lstLR + 1].Y)
			lstLR++;
		while(lstLD >= 0 && LD[lstLD].X < ly)
			lstLD--;
		while(lstLU + 1 < LU.size() && LU[lstLU + 1].X <= ly)
			lstLU++;
			
		int d1 = minD;
		int d2 = min({maxD, lstLD + 1 < LD.size() ? LD[lstLD + 1].Y : inf, DU.size() ? DU[0].Y : inf});
		
		if(d1 > d2)
			continue;
			
		int dx = d2; //maleje!
		//~ cout << "dx=" << dx << endl;
		
		while(lstDU >= 0 && DU[lstDU].X > dx)
			lstDU--;
			
		int u1 = max({minU, lstDU + 1 < DU.size() ? DU.back().X : 0});
		int u2 = min({maxU, lstDU + 1 < DU.size() ? DU[lstDU + 1].Y : inf, lstLU + 1 < LU.size() ? LU[lstLU + 1].Y : inf});
		
		if(u1 > u2)
			continue;
			
		int ux = u2; // oj chyba losowo :-/
		
		//~ cout << "ux=" << ux << endl;
		
		//~ cout << ly << " " << dx << " " << ux << endl;
		
		//~ cout << minR << " " << maxR << endl;
		
		//~ for(auto p : RU)
			//~ cout << "p" << p.X << " " << p.Y << endl;
		
		int r1 = minR;
		int r2 = maxR;
		for(auto r : LR)
			if(r.Y < ly || r.X > ly)
				r1 = max(r1, r.X), r2 = min(r2, r.Y);
		for(auto r : RD)	
			if(r.Y > dx)
				r2 = min(r2, r.X);
		for(auto r : RU)
			if(r.Y > ux)
				r1 = max(r1, r.X);
				
		//~ cout << r1 << " " << r2 << endl;
				
		if(r1 > r2)
			continue;
			
		int ry = r2; // uff
		//~ cout << "cyk" << endl;
		return {{L, ly}, {dx, D}, {R, ry}, {ux, U}};
	}
	
	return {};
}

bool check(vector<rect> &V, vector<ii> &P) {
	for(auto r : V) {
		bool ok = false;
		for(auto p : P)
			if(r.l <= p.X && p.X <= r.r && r.d <= p.Y && p.Y <= r.u)
				ok = true;
		if(!ok)
			return false;
	}
	return true;
}

vector<ii> solve(vector<rect> &V, int k) {
	int L = 0, R = inf, D = 0, U = inf;
	for(auto r : V) {
		L = max(L, r.l);
		R = min(R, r.r);
		D = max(D, r.d);
		U = min(U, r.u);
	}
	
	//~ cout << L << " " << R << " " << D << " " << U << endl;
	
	if(k == 1) {
		if(L <= R && D <= U)
			return {{L, D}};
		else 
			return {};
	}
	
	vector<ii> corners({{L, D}, {L, U}, {R, D}, {R, U}});
	for(auto c : corners) {
		vector<rect> V2;
		for(auto r : V)
			if(r.r < c.X || r.l > c.X || r.u < c.Y || r.d > c.Y)
				V2.push_back(r);
		vector<ii> r = solve(V2, k - 1);
		if(r.size()) {
			r.push_back(c);
			return r;
		}
	}
	
	if(k <= 3)
		return {};
	
	vector<ii> r = solve_one_side(V);
	if(r.empty()) {
		for(auto &r : V) {
			r.u = inf-r.u;
			r.d = inf-r.d;
			swap(r.d, r.u);
		}
		r = solve_one_side(V); 
		for(auto &rr : r) {
			rr.Y = inf - rr.Y;
		}
		for(auto &r : V) {
			r.u = inf-r.u;
			r.d = inf-r.d;
			swap(r.d, r.u);
		}
	}

	return r;
}

int main() {
	int n, k;
	scanf("%d%d", &n, &k);
	
	vector<rect> R(n);
	for(int i = 0 ; i < n ; i++)
		scanf("%d%d%d%d", &R[i].l, &R[i].d, &R[i].r, &R[i].u);
		
	vector<ii> res = solve(R, k);
	//~ assert(res.size() == k);
	for(auto p : res)
		printf("%d %d\n", p.X, p.Y);
		
	return 0;
}

Compilation message

hamburg.cpp: In function 'std::vector<std::pair<int, int> > solve_one_side(std::vector<rect>&)':
hamburg.cpp:134:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  134 |   while(lstLR + 1 < LR.size() && LR[lstLR + 1].X <= ly && ly <= LR[lstLR + 1].Y)
      |         ~~~~~~~~~~^~~~~~~~~~~
hamburg.cpp:138:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  138 |   while(lstLU + 1 < LU.size() && LU[lstLU + 1].X <= ly)
      |         ~~~~~~~~~~^~~~~~~~~~~
hamburg.cpp:142:33: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  142 |   int d2 = min({maxD, lstLD + 1 < LD.size() ? LD[lstLD + 1].Y : inf, DU.size() ? DU[0].Y : inf});
      |                       ~~~~~~~~~~^~~~~~~~~~~
hamburg.cpp:153:33: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  153 |   int u1 = max({minU, lstDU + 1 < DU.size() ? DU.back().X : 0});
      |                       ~~~~~~~~~~^~~~~~~~~~~
hamburg.cpp:154:33: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  154 |   int u2 = min({maxU, lstDU + 1 < DU.size() ? DU[lstDU + 1].Y : inf, lstLU + 1 < LU.size() ? LU[lstLU + 1].Y : inf});
      |                       ~~~~~~~~~~^~~~~~~~~~~
hamburg.cpp:154:80: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  154 |   int u2 = min({maxU, lstDU + 1 < DU.size() ? DU[lstDU + 1].Y : inf, lstLU + 1 < LU.size() ? LU[lstLU + 1].Y : inf});
      |                                                                      ~~~~~~~~~~^~~~~~~~~~~
hamburg.cpp: In function 'int main()':
hamburg.cpp:264:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  264 |  scanf("%d%d", &n, &k);
      |  ~~~~~^~~~~~~~~~~~~~~~
hamburg.cpp:268:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  268 |   scanf("%d%d%d%d", &R[i].l, &R[i].d, &R[i].r, &R[i].u);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
1.0 / 1.0

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

Subtask #2
1.0 / 1.0

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

Subtask #3
3.0 / 3.0

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

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 4 ms 512 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 3 ms 512 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 512 KB Output is correct
14 Correct 3 ms 512 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 4 ms 512 KB Output is correct
18 Correct 4 ms 384 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 5 ms 512 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 2 ms 512 KB Output is correct
23 Correct 4 ms 512 KB Output is correct
24 Correct 3 ms 512 KB Output is correct
25 Correct 4 ms 512 KB Output is correct
26 Correct 3 ms 512 KB Output is correct
27 Correct 3 ms 512 KB Output is correct
28 Correct 3 ms 616 KB Output is correct
29 Correct 3 ms 384 KB Output is correct
30 Correct 2 ms 512 KB Output is correct
31 Correct 3 ms 512 KB Output is correct
32 Correct 4 ms 384 KB Output is correct
33 Correct 3 ms 512 KB Output is correct
34 Correct 3 ms 512 KB Output is correct
35 Correct 4 ms 512 KB Output is correct
36 Correct 5 ms 512 KB Output is correct
37 Correct 4 ms 512 KB Output is correct
38 Correct 5 ms 512 KB Output is correct
39 Correct 4 ms 512 KB Output is correct
40 Correct 5 ms 512 KB Output is correct
41 Correct 4 ms 512 KB Output is correct
42 Correct 5 ms 512 KB Output is correct
43 Correct 4 ms 512 KB Output is correct
44 Correct 5 ms 512 KB Output is correct
45 Correct 3 ms 512 KB Output is correct
46 Correct 4 ms 512 KB Output is correct
47 Correct 4 ms 512 KB Output is correct
48 Correct 4 ms 512 KB Output is correct
49 Correct 4 ms 512 KB Output is correct
50 Correct 3 ms 512 KB Output is correct
51 Correct 4 ms 512 KB Output is correct
52 Correct 4 ms 512 KB Output is correct
53 Correct 4 ms 544 KB Output is correct
54 Correct 4 ms 512 KB Output is correct
55 Correct 3 ms 384 KB Output is correct
56 Correct 4 ms 384 KB Output is correct
57 Correct 3 ms 384 KB Output is correct
58 Correct 4 ms 384 KB Output is correct

Subtask #5
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 141 ms 3476 KB Output is correct
6 Correct 155 ms 3448 KB Output is correct
7 Correct 137 ms 3448 KB Output is correct
8 Correct 141 ms 3404 KB Output is correct

Subtask #6
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 143 ms 5656 KB Output is correct
6 Correct 155 ms 5676 KB Output is correct
7 Correct 142 ms 5668 KB Output is correct
8 Correct 153 ms 7708 KB Output is correct

Subtask #7
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 146 ms 6888 KB Output is correct
14 Correct 149 ms 6236 KB Output is correct
15 Correct 157 ms 7188 KB Output is correct
16 Correct 149 ms 5576 KB Output is correct
17 Correct 168 ms 5736 KB Output is correct
18 Correct 145 ms 4844 KB Output is correct
19 Correct 154 ms 7668 KB Output is correct
20 Correct 213 ms 12344 KB Output is correct
21 Correct 191 ms 7756 KB Output is correct
22 Correct 177 ms 12132 KB Output is correct
23 Correct 198 ms 12132 KB Output is correct
24 Correct 167 ms 11848 KB Output is correct

Subtask #8
0 / 79.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 4 ms 512 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 3 ms 512 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 512 KB Output is correct
14 Correct 3 ms 512 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 4 ms 512 KB Output is correct
18 Correct 4 ms 384 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 5 ms 512 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 2 ms 512 KB Output is correct
23 Correct 4 ms 512 KB Output is correct
24 Correct 3 ms 512 KB Output is correct
25 Correct 4 ms 512 KB Output is correct
26 Correct 3 ms 512 KB Output is correct
27 Correct 3 ms 512 KB Output is correct
28 Correct 3 ms 616 KB Output is correct
29 Correct 3 ms 384 KB Output is correct
30 Correct 2 ms 512 KB Output is correct
31 Correct 3 ms 512 KB Output is correct
32 Correct 4 ms 384 KB Output is correct
33 Correct 3 ms 512 KB Output is correct
34 Correct 3 ms 512 KB Output is correct
35 Correct 4 ms 512 KB Output is correct
36 Correct 5 ms 512 KB Output is correct
37 Correct 4 ms 512 KB Output is correct
38 Correct 5 ms 512 KB Output is correct
39 Correct 4 ms 512 KB Output is correct
40 Correct 5 ms 512 KB Output is correct
41 Correct 4 ms 512 KB Output is correct
42 Correct 5 ms 512 KB Output is correct
43 Correct 4 ms 512 KB Output is correct
44 Correct 5 ms 512 KB Output is correct
45 Correct 3 ms 512 KB Output is correct
46 Correct 4 ms 512 KB Output is correct
47 Correct 4 ms 512 KB Output is correct
48 Correct 4 ms 512 KB Output is correct
49 Correct 4 ms 512 KB Output is correct
50 Correct 3 ms 512 KB Output is correct
51 Correct 4 ms 512 KB Output is correct
52 Correct 4 ms 512 KB Output is correct
53 Correct 4 ms 544 KB Output is correct
54 Correct 4 ms 512 KB Output is correct
55 Correct 3 ms 384 KB Output is correct
56 Correct 4 ms 384 KB Output is correct
57 Correct 3 ms 384 KB Output is correct
58 Correct 4 ms 384 KB Output is correct
59 Correct 151 ms 7784 KB Output is correct
60 Correct 148 ms 8432 KB Output is correct
61 Correct 146 ms 7656 KB Output is correct
62 Correct 146 ms 7784 KB Output is correct
63 Correct 150 ms 7668 KB Output is correct
64 Correct 148 ms 4592 KB Output is correct
65 Correct 153 ms 8292 KB Output is correct
66 Correct 306 ms 14156 KB Output is correct
67 Correct 184 ms 10624 KB Output is correct
68 Correct 376 ms 16920 KB Output is correct
69 Correct 423 ms 17212 KB Output is correct
70 Correct 324 ms 16752 KB Output is correct
71 Correct 153 ms 9828 KB Output is correct
72 Correct 405 ms 17148 KB Output is correct
73 Correct 176 ms 10036 KB Output is correct
74 Correct 218 ms 15884 KB Output is correct
75 Correct 292 ms 15896 KB Output is correct
76 Correct 243 ms 15528 KB Output is correct
77 Correct 148 ms 8292 KB Output is correct
78 Correct 499 ms 17344 KB Output is correct
79 Correct 160 ms 10212 KB Output is correct
80 Correct 221 ms 10996 KB Output is correct
81 Correct 419 ms 16764 KB Output is correct
82 Correct 221 ms 14752 KB Output is correct
83 Correct 254 ms 15796 KB Output is correct
84 Correct 278 ms 15592 KB Output is correct
85 Correct 339 ms 17676 KB Output is correct
86 Correct 206 ms 10740 KB Output is correct
87 Correct 371 ms 17636 KB Output is correct
88 Correct 267 ms 16308 KB Output is correct
89 Correct 364 ms 16600 KB Output is correct
90 Correct 448 ms 17156 KB Output is correct
91 Correct 357 ms 16104 KB Output is correct
92 Correct 481 ms 17980 KB Output is correct
93 Correct 385 ms 17432 KB Output is correct
94 Correct 425 ms 17004 KB Output is correct
95 Correct 412 ms 17408 KB Output is correct
96 Correct 376 ms 16636 KB Output is correct
97 Correct 406 ms 17272 KB Output is correct
98 Correct 349 ms 16680 KB Output is correct
99 Correct 348 ms 17308 KB Output is correct
100 Correct 434 ms 17240 KB Output is correct
101 Correct 426 ms 17300 KB Output is correct
102 Correct 289 ms 11396 KB Output is correct
103 Correct 519 ms 17208 KB Output is correct
104 Correct 293 ms 14272 KB Output is correct
105 Correct 557 ms 17524 KB Output is correct
106 Correct 452 ms 17380 KB Output is correct
107 Correct 407 ms 16556 KB Output is correct
108 Correct 450 ms 17392 KB Output is correct
109 Correct 486 ms 17168 KB Output is correct
110 Correct 389 ms 17540 KB Output is correct
111 Correct 375 ms 16324 KB Output is correct
112 Correct 453 ms 17748 KB Output is correct
113 Correct 307 ms 13384 KB Output is correct
114 Correct 328 ms 13340 KB Output is correct
115 Correct 401 ms 13384 KB Output is correct
116 Correct 331 ms 13356 KB Output is correct
117 Execution timed out 3077 ms 16440 KB Time limit exceeded
118 Halted 0 ms 0 KB -