oj.uz

Submission #787415

# Submission time Handle Problem Language Result Execution time Memory
787415 2023-07-19T07:06:14 Z 박상훈(#10032) Hamburg Steak (JOI20_hamburg) C++17
21 / 100
 3000 ms 27216 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){
		C.erase(C.begin());
		C.erase(C.begin());

		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);
		// }
	}

	// int cnt = 0;
	for (auto &[x, y]:C){
		// ++cnt;
		// assert(cnt < 100);

		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:93:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   93 |  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 340 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 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct

Subtask #3
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 2 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 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 2 ms 584 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 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 312 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 2 ms 596 KB Output is correct
8 Correct 2 ms 596 KB Output is correct
9 Correct 2 ms 596 KB Output is correct
10 Correct 4 ms 576 KB Output is correct
11 Correct 117 ms 612 KB Output is correct
12 Correct 3 ms 468 KB Output is correct
13 Correct 2 ms 596 KB Output is correct
14 Correct 198 ms 596 KB Output is correct
15 Correct 2 ms 596 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 3 ms 596 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 2 ms 592 KB Output is correct
20 Correct 34 ms 596 KB Output is correct
21 Correct 3 ms 596 KB Output is correct
22 Correct 3 ms 484 KB Output is correct
23 Correct 4 ms 632 KB Output is correct
24 Correct 2 ms 468 KB Output is correct
25 Correct 3 ms 584 KB Output is correct
26 Correct 84 ms 636 KB Output is correct
27 Correct 62 ms 596 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 3 ms 596 KB Output is correct
30 Correct 2 ms 468 KB Output is correct
31 Correct 44 ms 596 KB Output is correct
32 Correct 3 ms 576 KB Output is correct
33 Correct 3 ms 596 KB Output is correct
34 Correct 27 ms 596 KB Output is correct
35 Correct 3 ms 608 KB Output is correct
36 Correct 3 ms 596 KB Output is correct
37 Correct 3 ms 596 KB Output is correct
38 Correct 4 ms 632 KB Output is correct
39 Correct 7 ms 596 KB Output is correct
40 Correct 233 ms 596 KB Output is correct
41 Correct 9 ms 596 KB Output is correct
42 Correct 4 ms 596 KB Output is correct
43 Correct 3 ms 596 KB Output is correct
44 Correct 3 ms 596 KB Output is correct
45 Correct 5 ms 636 KB Output is correct
46 Correct 3 ms 596 KB Output is correct
47 Correct 304 ms 596 KB Output is correct
48 Correct 5 ms 596 KB Output is correct
49 Correct 3 ms 604 KB Output is correct
50 Correct 53 ms 584 KB Output is correct
51 Correct 3 ms 632 KB Output is correct
52 Correct 154 ms 596 KB Output is correct
53 Correct 3 ms 596 KB Output is correct
54 Correct 3 ms 640 KB Output is correct
55 Correct 2 ms 468 KB Output is correct
56 Correct 2 ms 468 KB Output is correct
57 Correct 2 ms 468 KB Output is correct
58 Correct 2 ms 468 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 340 KB Output is correct
5 Correct 81 ms 6448 KB Output is correct
6 Correct 75 ms 6604 KB Output is correct
7 Correct 70 ms 6504 KB Output is correct
8 Correct 70 ms 6556 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 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 72 ms 9012 KB Output is correct
6 Correct 74 ms 8740 KB Output is correct
7 Correct 80 ms 8932 KB Output is correct
8 Correct 83 ms 17592 KB Output is correct

Subtask #7
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 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 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 2 ms 584 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 78 ms 9920 KB Output is correct
14 Correct 84 ms 10172 KB Output is correct
15 Correct 71 ms 8828 KB Output is correct
16 Correct 79 ms 8928 KB Output is correct
17 Correct 73 ms 11412 KB Output is correct
18 Correct 73 ms 8800 KB Output is correct
19 Correct 79 ms 11808 KB Output is correct
20 Correct 79 ms 15264 KB Output is correct
21 Correct 212 ms 27048 KB Output is correct
22 Correct 108 ms 18592 KB Output is correct
23 Correct 99 ms 21808 KB Output is correct
24 Correct 110 ms 24536 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 312 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 2 ms 596 KB Output is correct
8 Correct 2 ms 596 KB Output is correct
9 Correct 2 ms 596 KB Output is correct
10 Correct 4 ms 576 KB Output is correct
11 Correct 117 ms 612 KB Output is correct
12 Correct 3 ms 468 KB Output is correct
13 Correct 2 ms 596 KB Output is correct
14 Correct 198 ms 596 KB Output is correct
15 Correct 2 ms 596 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 3 ms 596 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 2 ms 592 KB Output is correct
20 Correct 34 ms 596 KB Output is correct
21 Correct 3 ms 596 KB Output is correct
22 Correct 3 ms 484 KB Output is correct
23 Correct 4 ms 632 KB Output is correct
24 Correct 2 ms 468 KB Output is correct
25 Correct 3 ms 584 KB Output is correct
26 Correct 84 ms 636 KB Output is correct
27 Correct 62 ms 596 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 3 ms 596 KB Output is correct
30 Correct 2 ms 468 KB Output is correct
31 Correct 44 ms 596 KB Output is correct
32 Correct 3 ms 576 KB Output is correct
33 Correct 3 ms 596 KB Output is correct
34 Correct 27 ms 596 KB Output is correct
35 Correct 3 ms 608 KB Output is correct
36 Correct 3 ms 596 KB Output is correct
37 Correct 3 ms 596 KB Output is correct
38 Correct 4 ms 632 KB Output is correct
39 Correct 7 ms 596 KB Output is correct
40 Correct 233 ms 596 KB Output is correct
41 Correct 9 ms 596 KB Output is correct
42 Correct 4 ms 596 KB Output is correct
43 Correct 3 ms 596 KB Output is correct
44 Correct 3 ms 596 KB Output is correct
45 Correct 5 ms 636 KB Output is correct
46 Correct 3 ms 596 KB Output is correct
47 Correct 304 ms 596 KB Output is correct
48 Correct 5 ms 596 KB Output is correct
49 Correct 3 ms 604 KB Output is correct
50 Correct 53 ms 584 KB Output is correct
51 Correct 3 ms 632 KB Output is correct
52 Correct 154 ms 596 KB Output is correct
53 Correct 3 ms 596 KB Output is correct
54 Correct 3 ms 640 KB Output is correct
55 Correct 2 ms 468 KB Output is correct
56 Correct 2 ms 468 KB Output is correct
57 Correct 2 ms 468 KB Output is correct
58 Correct 2 ms 468 KB Output is correct
59 Correct 126 ms 16276 KB Output is correct
60 Correct 187 ms 15484 KB Output is correct
61 Correct 112 ms 12708 KB Output is correct
62 Correct 199 ms 15488 KB Output is correct
63 Correct 149 ms 11784 KB Output is correct
64 Correct 188 ms 15484 KB Output is correct
65 Correct 236 ms 25044 KB Output is correct
66 Execution timed out 3076 ms 27216 KB Time limit exceeded
67 Halted 0 ms 0 KB -