oj.uz

Submission #787395

# Submission time Handle Problem Language Result Execution time Memory
787395 2023-07-19T06:47:07 Z 박상훈(#10032) Hamburg Steak (JOI20_hamburg) C++17
21 / 100
 3000 ms 43060 KB 
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
constexpr int INF = 1e9 + 100;

struct Rect{
	int x1, y1, x2, y2;
	Rect(){}
	Rect(int _x1, int _y1, int _x2, int _y2): x1(_x1), y1(_y1), x2(_x2), y2(_y2) {}

	void read(){
		scanf("%d %d %d %d", &x1, &y1, &x2, &y2);
	}
	bool in(int x, int y){
		return x1 <= x && x <= x2 && y1 <= y && y <= y2;
	}
};

vector<pair<int, int>> ans;

void solve(vector<Rect> V, int k){
	if (k==0){
		if (!V.empty()) return;
		for (auto &[x, y]:ans) printf("%d %d\n", x, y);
		exit(0);
	}

	int lx = INF, rx = -INF, ly = INF, ry = -INF;
	for (auto &[x1, y1, x2, y2]:V){
		lx = min(lx, x2);
		rx = max(rx, x1);
		ly = min(ly, y2);
		ry = max(ry, y1);
	}

	if (V.empty()) lx = rx = ly = ry = 1;

	vector<pair<int, int>> C = {{lx, ly}, {lx, ry}, {rx, ly}, {rx, ry}};
	if (k==4){
		vector<int> Y = {-INF};
		for (auto &[x1, y1, x2, y2]:V) if (x2 >= rx){
			Y.push_back(y1);
			Y.push_back(y2);
		}

		sort(Y.begin(), Y.end());
		Y.erase(unique(Y.begin(), Y.end()), Y.end());

		vector<int> sum(Y.size()), I(Y.size());
		for (auto &[x1, y1, x2, y2]:V) if (x2 >= rx){
			int i1 = lower_bound(Y.begin(), Y.end(), y1) - Y.begin();
			int i2 = lower_bound(Y.begin(), Y.end(), y2) - Y.begin();

			if (i2+1 < (int)sum.size()) sum[i2+1]--;
			sum[i1]++;
		}

		for (int i=1;i<(int)sum.size();i++) sum[i] += sum[i-1], I[i] = i;
		sort(I.begin()+1, I.end(), [&](int i, int j){return sum[i] > sum[j];});
		for (int i0=1;i0<(int)I.size();i0++){
			int y = Y[I[i0]];
			C.emplace_back(rx, y);
		}

		// for (auto &[x1, y1, x2, y2]:V) if (x2 >= rx){
		// 	C.emplace_back(rx, y1);
		// 	C.emplace_back(rx, y2);
		// 	// C.emplace_back(x2, y1);
		// 	// C.emplace_back(x2, y2);
		// }
	}
	for (auto &[x, y]:C){
		vector<Rect> nV;
		for (auto &R:V) if (!R.in(x, y)) nV.push_back(R);

		ans.emplace_back(x, y);
		solve(nV, k-1);
		ans.pop_back();
	}
}

int main(){
	int n, k;
	scanf("%d %d", &n, &k);
	
	vector<Rect> V(n);
	for (int i=0;i<n;i++) V[i].read();

	solve(V, k);

	printf("failed\n");
	return 0;
}

Compilation message

hamburg.cpp: In function 'int main()':
hamburg.cpp:85:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   85 |  scanf("%d %d", &n, &k);
      |  ~~~~~^~~~~~~~~~~~~~~~~
hamburg.cpp: In member function 'void Rect::read()':
hamburg.cpp:13:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |   scanf("%d %d %d %d", &x1, &y1, &x2, &y2);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
1.0 / 1.0

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

Subtask #2
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 480 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 428 KB Output is correct

Subtask #3
3.0 / 3.0

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

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 2 ms 396 KB Output is correct
12 Correct 2 ms 444 KB Output is correct
13 Correct 3 ms 596 KB Output is correct
14 Correct 191 ms 600 KB Output is correct
15 Correct 4 ms 628 KB Output is correct
16 Correct 3 ms 596 KB Output is correct
17 Correct 4 ms 596 KB Output is correct
18 Correct 3 ms 624 KB Output is correct
19 Correct 3 ms 664 KB Output is correct
20 Correct 32 ms 596 KB Output is correct
21 Correct 4 ms 636 KB Output is correct
22 Correct 3 ms 612 KB Output is correct
23 Correct 5 ms 636 KB Output is correct
24 Correct 3 ms 596 KB Output is correct
25 Correct 2 ms 596 KB Output is correct
26 Correct 3 ms 596 KB Output is correct
27 Correct 3 ms 596 KB Output is correct
28 Correct 2 ms 468 KB Output is correct
29 Correct 2 ms 468 KB Output is correct
30 Correct 2 ms 596 KB Output is correct
31 Correct 38 ms 596 KB Output is correct
32 Correct 3 ms 576 KB Output is correct
33 Correct 4 ms 596 KB Output is correct
34 Correct 23 ms 596 KB Output is correct
35 Correct 4 ms 588 KB Output is correct
36 Correct 5 ms 596 KB Output is correct
37 Correct 5 ms 656 KB Output is correct
38 Correct 6 ms 724 KB Output is correct
39 Correct 9 ms 724 KB Output is correct
40 Correct 233 ms 696 KB Output is correct
41 Correct 10 ms 688 KB Output is correct
42 Correct 5 ms 696 KB Output is correct
43 Correct 6 ms 668 KB Output is correct
44 Correct 4 ms 724 KB Output is correct
45 Correct 3 ms 596 KB Output is correct
46 Correct 4 ms 696 KB Output is correct
47 Correct 307 ms 724 KB Output is correct
48 Correct 7 ms 716 KB Output is correct
49 Correct 4 ms 684 KB Output is correct
50 Correct 47 ms 680 KB Output is correct
51 Correct 5 ms 720 KB Output is correct
52 Correct 131 ms 664 KB Output is correct
53 Correct 5 ms 680 KB Output is correct
54 Correct 6 ms 712 KB Output is correct
55 Correct 3 ms 564 KB Output is correct
56 Correct 3 ms 596 KB Output is correct
57 Correct 3 ms 508 KB Output is correct
58 Correct 3 ms 596 KB Output is correct

Subtask #5
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 76 ms 6924 KB Output is correct
6 Correct 73 ms 6932 KB Output is correct
7 Correct 73 ms 6844 KB Output is correct
8 Correct 79 ms 6904 KB Output is correct

Subtask #6
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 480 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 428 KB Output is correct
5 Correct 76 ms 9292 KB Output is correct
6 Correct 75 ms 8988 KB Output is correct
7 Correct 74 ms 9232 KB Output is correct
8 Correct 85 ms 17792 KB Output is correct

Subtask #7
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 436 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 2 ms 596 KB Output is correct
10 Correct 2 ms 596 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 1 ms 564 KB Output is correct
13 Correct 85 ms 10196 KB Output is correct
14 Correct 76 ms 10400 KB Output is correct
15 Correct 75 ms 9092 KB Output is correct
16 Correct 74 ms 9188 KB Output is correct
17 Correct 91 ms 11612 KB Output is correct
18 Correct 74 ms 9004 KB Output is correct
19 Correct 91 ms 12192 KB Output is correct
20 Correct 80 ms 15612 KB Output is correct
21 Correct 184 ms 27348 KB Output is correct
22 Correct 113 ms 18912 KB Output is correct
23 Correct 102 ms 22340 KB Output is correct
24 Correct 156 ms 24932 KB Output is correct

Subtask #8
0 / 79.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 2 ms 396 KB Output is correct
12 Correct 2 ms 444 KB Output is correct
13 Correct 3 ms 596 KB Output is correct
14 Correct 191 ms 600 KB Output is correct
15 Correct 4 ms 628 KB Output is correct
16 Correct 3 ms 596 KB Output is correct
17 Correct 4 ms 596 KB Output is correct
18 Correct 3 ms 624 KB Output is correct
19 Correct 3 ms 664 KB Output is correct
20 Correct 32 ms 596 KB Output is correct
21 Correct 4 ms 636 KB Output is correct
22 Correct 3 ms 612 KB Output is correct
23 Correct 5 ms 636 KB Output is correct
24 Correct 3 ms 596 KB Output is correct
25 Correct 2 ms 596 KB Output is correct
26 Correct 3 ms 596 KB Output is correct
27 Correct 3 ms 596 KB Output is correct
28 Correct 2 ms 468 KB Output is correct
29 Correct 2 ms 468 KB Output is correct
30 Correct 2 ms 596 KB Output is correct
31 Correct 38 ms 596 KB Output is correct
32 Correct 3 ms 576 KB Output is correct
33 Correct 4 ms 596 KB Output is correct
34 Correct 23 ms 596 KB Output is correct
35 Correct 4 ms 588 KB Output is correct
36 Correct 5 ms 596 KB Output is correct
37 Correct 5 ms 656 KB Output is correct
38 Correct 6 ms 724 KB Output is correct
39 Correct 9 ms 724 KB Output is correct
40 Correct 233 ms 696 KB Output is correct
41 Correct 10 ms 688 KB Output is correct
42 Correct 5 ms 696 KB Output is correct
43 Correct 6 ms 668 KB Output is correct
44 Correct 4 ms 724 KB Output is correct
45 Correct 3 ms 596 KB Output is correct
46 Correct 4 ms 696 KB Output is correct
47 Correct 307 ms 724 KB Output is correct
48 Correct 7 ms 716 KB Output is correct
49 Correct 4 ms 684 KB Output is correct
50 Correct 47 ms 680 KB Output is correct
51 Correct 5 ms 720 KB Output is correct
52 Correct 131 ms 664 KB Output is correct
53 Correct 5 ms 680 KB Output is correct
54 Correct 6 ms 712 KB Output is correct
55 Correct 3 ms 564 KB Output is correct
56 Correct 3 ms 596 KB Output is correct
57 Correct 3 ms 508 KB Output is correct
58 Correct 3 ms 596 KB Output is correct
59 Correct 118 ms 15400 KB Output is correct
60 Correct 195 ms 16312 KB Output is correct
61 Correct 117 ms 13616 KB Output is correct
62 Correct 209 ms 16180 KB Output is correct
63 Correct 154 ms 14988 KB Output is correct
64 Correct 194 ms 16272 KB Output is correct
65 Correct 161 ms 16088 KB Output is correct
66 Correct 187 ms 15700 KB Output is correct
67 Correct 172 ms 28520 KB Output is correct
68 Correct 172 ms 24172 KB Output is correct
69 Correct 120 ms 18160 KB Output is correct
70 Correct 167 ms 24700 KB Output is correct
71 Correct 558 ms 34432 KB Output is correct
72 Correct 673 ms 36656 KB Output is correct
73 Correct 451 ms 41192 KB Output is correct
74 Correct 368 ms 41256 KB Output is correct
75 Correct 363 ms 40832 KB Output is correct
76 Correct 311 ms 40984 KB Output is correct
77 Correct 378 ms 41960 KB Output is correct
78 Correct 706 ms 41092 KB Output is correct
79 Correct 382 ms 41308 KB Output is correct
80 Correct 347 ms 41464 KB Output is correct
81 Correct 737 ms 41144 KB Output is correct
82 Correct 315 ms 40584 KB Output is correct
83 Correct 245 ms 39244 KB Output is correct
84 Correct 213 ms 29320 KB Output is correct
85 Correct 342 ms 40292 KB Output is correct
86 Correct 230 ms 35772 KB Output is correct
87 Correct 276 ms 39936 KB Output is correct
88 Correct 255 ms 39504 KB Output is correct
89 Correct 418 ms 40532 KB Output is correct
90 Correct 2621 ms 41448 KB Output is correct
91 Correct 400 ms 43060 KB Output is correct
92 Correct 670 ms 41712 KB Output is correct
93 Execution timed out 3064 ms 42136 KB Time limit exceeded
94 Halted 0 ms 0 KB -