oj.uz

Submission #1050370

# Submission time Handle Problem Language Result Execution time Memory
1050370 2024-08-09T08:58:00 Z 이온조(#11104) Hamburg Steak (JOI20_hamburg) C++17
100 / 100
 779 ms 155764 KB 
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
using vi = vector<int>;
using vpi = vector<pii>;
using vvi = vector<vi>;
const vector<pii> EMP = {};
 
int f(vi &X, int x) { return lower_bound(X.begin(), X.end(), x) - X.begin() + 1; }
pii its(pii l, pii r) { return {max(l.first, r.first), min(l.second, r.second)}; }

vi X, Y; int XS, YS;
 
vvi rem(vvi &A, int x, int y) {
	vvi ret;
	for(auto& it: A) if(it[2] < x || x < it[0] || it[3] < y || y < it[1]) ret.push_back(it);
	return ret;
}
 
vvi intersect_line(vvi &A, int x, int y) {
	vvi ret;
	if(x) for(auto& it: A) if(it[0] <= x || x <= it[2]) ret.push_back(it);
	if(y) for(auto& it: A) if(it[1] <= y || y <= it[3]) ret.push_back(it);
	return ret;
}
 
vpi sol4(vvi A) {
	int mnr = XS, mxl = 1, mnu = YS, mxd = 1;
	for(auto& it: A) {
		mnr = min(mnr, it[2]);
		mxl = max(mxl, it[0]);
		mnu = min(mnu, it[3]);
		mxd = max(mxd, it[1]);
	}
	vvi B;
	for(auto& it: A) {
		int cnt = 0;
		for(auto& x: {mnr, mxl}) for(auto& y: {mnu, mxd}) if(it[0] <= x && x <= it[2] && it[1] <= y && y <= it[3]) ++cnt;
		if(cnt <= 1) B.push_back(it);
	}
	A = B;
	for(auto& it: A) if(mnr < it[0] && it[2] < mxl && mnu < it[1] && it[3] < mxd) return EMP;
 
	vvi L = intersect_line(A, mnr, 0);
	int only_L_mxd = mnu + 1, only_L_mnu = mxd - 1;
	for(auto& it: L) if(it[2] < mxl && mnu < it[1] && it[3] < mxd) {
		only_L_mxd = max(only_L_mxd, it[1]);
		only_L_mnu = min(only_L_mnu, it[3]);
	}
 
	vi D_mnr(YS + 1, mxl - 1);
	for(auto& it: L) D_mnr[it[3]] = min(D_mnr[it[3]], it[2]);
	for(int i=1; i<=YS; i++) D_mnr[i] = min(D_mnr[i-1], D_mnr[i]);
 
	vi U_mnr(YS + 2, mxl - 1);
	for(auto& it: L) U_mnr[it[1]] = min(U_mnr[it[1]], it[2]);
	for(int i=YS; i>=1; i--) U_mnr[i] = min(U_mnr[i+1], U_mnr[i]);
 
 	vvi U = intersect_line(A, 0, mxd);
	int new_mnr = mxl - 1;
	for(auto& it: U) if(mnr < it[0] && it[2] < mxl) new_mnr = min(new_mnr, it[2]);
 
	int only_D_mnr = mxl - 1;
	vvi D = intersect_line(A, 0, mnu);
	for(auto& it: D) if(mnr < it[0] && it[2] < mxl && it[3] < mxd) only_D_mnr = min(only_D_mnr, it[2]);

	vvi UD = intersect_line(D, 0, mxd);
	vi UD_mnr(XS + 2, mxl - 1);
	for(auto& it: UD) UD_mnr[it[0]] = min(UD_mnr[it[0]], it[2]);
	for(int i=XS; i>=1; i--) UD_mnr[i] = min(UD_mnr[i+1], UD_mnr[i]);
 
	vvi R = intersect_line(A, mxl, 0);
	vvi RU = intersect_line(R, 0, mxd);
	vvi RD = intersect_line(R, 0, mnu);
 
	vi RU_mxd(XS + 2, mnu + 1);
	for(auto& it: RU) if(it[1] > mnu) RU_mxd[it[0]] = max(RU_mxd[it[0]], it[1]);
	for(int i=XS; i>=1; i--) RU_mxd[i] = max(RU_mxd[i+1], RU_mxd[i]);
 
	vi RD_mnu(XS + 2, mxd - 1);
	for(auto& it: RD) if(it[3] < mxd) RD_mnu[it[0]] = min(RD_mnu[it[0]], it[3]);
	for(int i=XS; i>=1; i--) RD_mnu[i] = min(RD_mnu[i+1], RD_mnu[i]);
 
	int only_R_mxd = mnu + 1, only_R_mnu = mxd - 1;
	for(auto& it: R) if(it[1] > mnu && it[3] < mxd && mnr < it[0]) {
		only_R_mxd = max(only_R_mxd, it[1]);
		only_R_mnu = min(only_R_mnu, it[3]);
	}

	vvi LR = intersect_line(R, mnr, 0);
	vpi LRU(YS + 1, {mnu + 1, mxd - 1}), LRD(YS + 2, {mnu + 1, mxd - 1});
	for(auto& it: LR) if(it[1] > mnu && it[3] < mxd) {
		LRU[it[3]] = its(LRU[it[3]], {it[1], it[3]});
		LRD[it[1]] = its(LRD[it[1]], {it[1], it[3]});
	}
	for(int i=1; i<=YS; i++) LRU[i] = its(LRU[i-1], LRU[i]);
	for(int i=YS; i>=1; i--) LRD[i] = its(LRD[i+1], LRD[i]);
 
	for(int ly=only_L_mxd; ly<=only_L_mnu; ly++) {
		int ux = min(U_mnr[ly + 1], new_mnr);
		int dx = min({D_mnr[ly - 1], only_D_mnr, UD_mnr[ux + 1]});
		int r_mxd = max({RU_mxd[ux + 1], only_R_mxd, LRU[ly - 1].first, LRD[ly + 1].first});
		int r_mnu = min({RD_mnu[dx + 1], only_R_mnu, LRU[ly - 1].second, LRD[ly + 1].second});
		if(ux <= dx && r_mxd <= r_mnu) return {{mnr, ly}, {ux, mxd}, {dx, mnu}, {mxl, r_mxd}};
	}
 
	return EMP;
}
 
vpi sol(vvi &A, int K) {
	int mnr = XS, mxl = 1, mnu = YS, mxd = 1;
	for(auto& it: A) {
		mnr = min(mnr, it[2]);
		mxl = max(mxl, it[0]);
		mnu = min(mnu, it[3]);
		mxd = max(mxd, it[1]);
	}
	if(K == 1) {	
		if(mxl <= mnr && mxd <= mnu) return {{mxl, mxd}};
		return EMP;
	}
	if(K == 2) {
		vvi B; vpi S;
		for(auto y: {mxd, mnu}) {
			B = rem(A, mxl, y);
			S = sol(B, 1);
			if(S.size()) return {{mxl, y}, S[0]};
		}
		return EMP;
	}
	if(K == 3) {
		vvi B; vpi S;
		for(auto x: {mxl, mnr}) for(auto y: {mxd, mnu}) {
			B = rem(A, x, y);
			S = sol(B, 2);
			if(S.size()) return {{x, y}, S[0], S[1]};
		}
		return EMP;
	}
	if(K == 4) {
		vvi B; vpi S;
		for(auto x: {mxl, mnr}) for(auto y: {mxd, mnu}) {
			B = rem(A, x, y);
			S = sol(B, 3);
			if(S.size()) return {{x, y}, S[0], S[1], S[2]};
		}
		S = sol4(A);
		if(S.size()) return S;
		for(auto& it: A) it = {XS - it[2] + 1, it[1], XS - it[0] + 1, it[3]};
		S = sol4(A);
		for(auto& it: A) it = {XS - it[2] + 1, it[1], XS - it[0] + 1, it[3]};
		if(S.size()) {
			for(auto& [x, y]: S) x = XS - x + 1;
			return S;
		}
		return EMP;
	}
}

int main() {
	vvi A; 
	int N, K; scanf("%d%d", &N, &K);
	for(int i=0; i<N; i++) {
		vi H(4);
		for(int j=0; j<4; j++) scanf("%d", &H[j]);
		A.push_back(H);
		X.push_back(H[0]);
		X.push_back(H[2]);
		Y.push_back(H[1]);
		Y.push_back(H[3]);
	}
	sort(X.begin(), X.end()); X.resize(unique(X.begin(), X.end()) - X.begin()); XS = X.size();
	sort(Y.begin(), Y.end()); Y.resize(unique(Y.begin(), Y.end()) - Y.begin()); YS = Y.size();
	for(auto& it: A) {
		it[0] = f(X, it[0]);
		it[1] = f(Y, it[1]);
		it[2] = f(X, it[2]);
		it[3] = f(Y, it[3]);
	}
	vpi ans;
	for(int k=1; k<=K && ans.empty(); k++) ans = sol(A, k);
	assert(!ans.empty());
	while((int)ans.size() < K) ans.push_back({1, 1});
	for(auto& [x, y]: ans) printf("%d %d\n", X[x-1], Y[y-1]);
	return 0;
}

Compilation message

hamburg.cpp: In function 'vpi sol(vvi&, int)':
hamburg.cpp:158:1: warning: control reaches end of non-void function [-Wreturn-type]
  158 | }
      | ^
hamburg.cpp: In function 'int main()':
hamburg.cpp:162:17: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  162 |  int N, K; scanf("%d%d", &N, &K);
      |            ~~~~~^~~~~~~~~~~~~~~~
hamburg.cpp:165:31: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  165 |   for(int j=0; j<4; j++) scanf("%d", &H[j]);
      |                          ~~~~~^~~~~~~~~~~~~

Subtask #1
1.0 / 1.0

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

Subtask #2
1.0 / 1.0

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

Subtask #3
3.0 / 3.0

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

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 604 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 2 ms 600 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 2 ms 860 KB Output is correct
8 Correct 4 ms 1156 KB Output is correct
9 Correct 3 ms 788 KB Output is correct
10 Correct 3 ms 792 KB Output is correct
11 Correct 4 ms 884 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Correct 2 ms 604 KB Output is correct
14 Correct 5 ms 1080 KB Output is correct
15 Correct 2 ms 728 KB Output is correct
16 Correct 3 ms 604 KB Output is correct
17 Correct 5 ms 1356 KB Output is correct
18 Correct 2 ms 604 KB Output is correct
19 Correct 2 ms 860 KB Output is correct
20 Correct 6 ms 1584 KB Output is correct
21 Correct 3 ms 860 KB Output is correct
22 Correct 3 ms 776 KB Output is correct
23 Correct 5 ms 1632 KB Output is correct
24 Correct 3 ms 860 KB Output is correct
25 Correct 4 ms 848 KB Output is correct
26 Correct 4 ms 860 KB Output is correct
27 Correct 3 ms 860 KB Output is correct
28 Correct 4 ms 856 KB Output is correct
29 Correct 3 ms 868 KB Output is correct
30 Correct 5 ms 836 KB Output is correct
31 Correct 5 ms 1284 KB Output is correct
32 Correct 5 ms 1220 KB Output is correct
33 Correct 4 ms 1288 KB Output is correct
34 Correct 4 ms 1260 KB Output is correct
35 Correct 6 ms 1612 KB Output is correct
36 Correct 4 ms 1244 KB Output is correct
37 Correct 7 ms 1636 KB Output is correct
38 Correct 11 ms 1776 KB Output is correct
39 Correct 5 ms 1336 KB Output is correct
40 Correct 6 ms 1272 KB Output is correct
41 Correct 5 ms 1360 KB Output is correct
42 Correct 5 ms 1496 KB Output is correct
43 Correct 5 ms 1492 KB Output is correct
44 Correct 5 ms 1448 KB Output is correct
45 Correct 3 ms 860 KB Output is correct
46 Correct 6 ms 1648 KB Output is correct
47 Correct 6 ms 1752 KB Output is correct
48 Correct 7 ms 1616 KB Output is correct
49 Correct 5 ms 1488 KB Output is correct
50 Correct 5 ms 1556 KB Output is correct
51 Correct 6 ms 1532 KB Output is correct
52 Correct 5 ms 1284 KB Output is correct
53 Correct 5 ms 1400 KB Output is correct
54 Correct 7 ms 1792 KB Output is correct
55 Correct 4 ms 1360 KB Output is correct
56 Correct 4 ms 1340 KB Output is correct
57 Correct 5 ms 1548 KB Output is correct
58 Correct 5 ms 1364 KB Output is correct

Subtask #5
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 2 ms 344 KB Output is correct
4 Correct 2 ms 344 KB Output is correct
5 Correct 202 ms 15860 KB Output is correct
6 Correct 219 ms 15604 KB Output is correct
7 Correct 207 ms 15660 KB Output is correct
8 Correct 204 ms 15120 KB Output is correct

Subtask #6
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 225 ms 20936 KB Output is correct
6 Correct 211 ms 24820 KB Output is correct
7 Correct 207 ms 19952 KB Output is correct
8 Correct 210 ms 30308 KB Output is correct

Subtask #7
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 604 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 2 ms 580 KB Output is correct
7 Correct 2 ms 604 KB Output is correct
8 Correct 3 ms 604 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Correct 218 ms 27632 KB Output is correct
14 Correct 218 ms 28400 KB Output is correct
15 Correct 222 ms 27896 KB Output is correct
16 Correct 211 ms 23300 KB Output is correct
17 Correct 230 ms 27848 KB Output is correct
18 Correct 214 ms 20984 KB Output is correct
19 Correct 229 ms 35252 KB Output is correct
20 Correct 282 ms 41996 KB Output is correct
21 Correct 226 ms 36592 KB Output is correct
22 Correct 245 ms 43300 KB Output is correct
23 Correct 251 ms 40268 KB Output is correct
24 Correct 247 ms 37376 KB Output is correct

Subtask #8
79.0 / 79.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 604 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 2 ms 600 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 2 ms 860 KB Output is correct
8 Correct 4 ms 1156 KB Output is correct
9 Correct 3 ms 788 KB Output is correct
10 Correct 3 ms 792 KB Output is correct
11 Correct 4 ms 884 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Correct 2 ms 604 KB Output is correct
14 Correct 5 ms 1080 KB Output is correct
15 Correct 2 ms 728 KB Output is correct
16 Correct 3 ms 604 KB Output is correct
17 Correct 5 ms 1356 KB Output is correct
18 Correct 2 ms 604 KB Output is correct
19 Correct 2 ms 860 KB Output is correct
20 Correct 6 ms 1584 KB Output is correct
21 Correct 3 ms 860 KB Output is correct
22 Correct 3 ms 776 KB Output is correct
23 Correct 5 ms 1632 KB Output is correct
24 Correct 3 ms 860 KB Output is correct
25 Correct 4 ms 848 KB Output is correct
26 Correct 4 ms 860 KB Output is correct
27 Correct 3 ms 860 KB Output is correct
28 Correct 4 ms 856 KB Output is correct
29 Correct 3 ms 868 KB Output is correct
30 Correct 5 ms 836 KB Output is correct
31 Correct 5 ms 1284 KB Output is correct
32 Correct 5 ms 1220 KB Output is correct
33 Correct 4 ms 1288 KB Output is correct
34 Correct 4 ms 1260 KB Output is correct
35 Correct 6 ms 1612 KB Output is correct
36 Correct 4 ms 1244 KB Output is correct
37 Correct 7 ms 1636 KB Output is correct
38 Correct 11 ms 1776 KB Output is correct
39 Correct 5 ms 1336 KB Output is correct
40 Correct 6 ms 1272 KB Output is correct
41 Correct 5 ms 1360 KB Output is correct
42 Correct 5 ms 1496 KB Output is correct
43 Correct 5 ms 1492 KB Output is correct
44 Correct 5 ms 1448 KB Output is correct
45 Correct 3 ms 860 KB Output is correct
46 Correct 6 ms 1648 KB Output is correct
47 Correct 6 ms 1752 KB Output is correct
48 Correct 7 ms 1616 KB Output is correct
49 Correct 5 ms 1488 KB Output is correct
50 Correct 5 ms 1556 KB Output is correct
51 Correct 6 ms 1532 KB Output is correct
52 Correct 5 ms 1284 KB Output is correct
53 Correct 5 ms 1400 KB Output is correct
54 Correct 7 ms 1792 KB Output is correct
55 Correct 4 ms 1360 KB Output is correct
56 Correct 4 ms 1340 KB Output is correct
57 Correct 5 ms 1548 KB Output is correct
58 Correct 5 ms 1364 KB Output is correct
59 Correct 261 ms 37672 KB Output is correct
60 Correct 263 ms 28820 KB Output is correct
61 Correct 245 ms 35520 KB Output is correct
62 Correct 300 ms 27256 KB Output is correct
63 Correct 253 ms 36224 KB Output is correct
64 Correct 242 ms 21240 KB Output is correct
65 Correct 292 ms 40940 KB Output is correct
66 Correct 431 ms 43328 KB Output is correct
67 Correct 331 ms 49768 KB Output is correct
68 Correct 488 ms 57272 KB Output is correct
69 Correct 556 ms 62336 KB Output is correct
70 Correct 453 ms 50476 KB Output is correct
71 Correct 320 ms 47040 KB Output is correct
72 Correct 704 ms 139792 KB Output is correct
73 Correct 329 ms 43796 KB Output is correct
74 Correct 380 ms 55044 KB Output is correct
75 Correct 458 ms 92720 KB Output is correct
76 Correct 389 ms 53288 KB Output is correct
77 Correct 305 ms 45072 KB Output is correct
78 Correct 730 ms 146716 KB Output is correct
79 Correct 295 ms 43024 KB Output is correct
80 Correct 319 ms 42596 KB Output is correct
81 Correct 630 ms 140316 KB Output is correct
82 Correct 340 ms 52660 KB Output is correct
83 Correct 396 ms 49164 KB Output is correct
84 Correct 409 ms 54248 KB Output is correct
85 Correct 475 ms 65540 KB Output is correct
86 Correct 333 ms 40544 KB Output is correct
87 Correct 498 ms 61260 KB Output is correct
88 Correct 397 ms 60596 KB Output is correct
89 Correct 475 ms 105440 KB Output is correct
90 Correct 717 ms 145984 KB Output is correct
91 Correct 549 ms 102680 KB Output is correct
92 Correct 737 ms 155764 KB Output is correct
93 Correct 577 ms 139548 KB Output is correct
94 Correct 687 ms 132420 KB Output is correct
95 Correct 688 ms 144744 KB Output is correct
96 Correct 617 ms 125964 KB Output is correct
97 Correct 579 ms 138312 KB Output is correct
98 Correct 637 ms 131824 KB Output is correct
99 Correct 504 ms 102440 KB Output is correct
100 Correct 779 ms 144728 KB Output is correct
101 Correct 668 ms 142584 KB Output is correct
102 Correct 469 ms 88044 KB Output is correct
103 Correct 710 ms 151088 KB Output is correct
104 Correct 545 ms 94196 KB Output is correct
105 Correct 668 ms 151244 KB Output is correct
106 Correct 695 ms 144308 KB Output is correct
107 Correct 624 ms 131292 KB Output is correct
108 Correct 693 ms 148364 KB Output is correct
109 Correct 671 ms 147140 KB Output is correct
110 Correct 659 ms 140436 KB Output is correct
111 Correct 550 ms 130732 KB Output is correct
112 Correct 716 ms 148792 KB Output is correct
113 Correct 480 ms 110804 KB Output is correct
114 Correct 490 ms 111216 KB Output is correct
115 Correct 493 ms 110936 KB Output is correct
116 Correct 508 ms 112108 KB Output is correct
117 Correct 540 ms 141436 KB Output is correct
118 Correct 550 ms 142128 KB Output is correct
119 Correct 588 ms 142996 KB Output is correct
120 Correct 588 ms 142756 KB Output is correct
121 Correct 554 ms 143684 KB Output is correct
122 Correct 558 ms 144496 KB Output is correct
123 Correct 556 ms 141136 KB Output is correct
124 Correct 591 ms 143000 KB Output is correct
125 Correct 603 ms 142396 KB Output is correct
126 Correct 599 ms 141684 KB Output is correct