oj.uz

Submission #787417

# Submission time Handle Problem Language Result Execution time Memory
787417 2023-07-19T07:14:37 Z 박상훈(#10032) Hamburg Steak (JOI20_hamburg) C++17
21 / 100
 3000 ms 63340 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> X = {-INF}, Y = {-INF};
		for (auto &[x1, y1, x2, y2]:V){
			X.push_back(x1);
			X.push_back(x2);
			Y.push_back(y1);
			Y.push_back(y2);
		}

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

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

			int j1 = lower_bound(Y.begin(), Y.end(), y1) - Y.begin();
			int j2 = lower_bound(Y.begin(), Y.end(), y2) - Y.begin();
			nV.emplace_back(j1, i1, j2, i2);
		}

		vector<int> sum(Y.size());
		vector<array<int, 3>> FUCK;

		for (auto &[x1, y1, x2, y2]:nV) if (X[x2] >= rx){
			if (y2+1 < (int)sum.size()) sum[y2+1]--;
			sum[y1]++;
		}
		for (int i=1;i<(int)sum.size();i++){
			sum[i] += sum[i-1];
			FUCK.push_back({sum[i], rx, Y[i]});
		}

		sum.clear();
		sum.resize(Y.size());
		for (auto &[x1, y1, x2, y2]:nV) if (X[x1] <= lx){
			if (y2+1 < (int)sum.size()) sum[y2+1]--;
			sum[y1]++;
		}
		for (int i=1;i<(int)sum.size();i++){
			sum[i] += sum[i-1];
			FUCK.push_back({sum[i], lx, Y[i]});
		}

		sum.clear();
		sum.resize(X.size());
		for (auto &[x1, y1, x2, y2]:nV) if (Y[y2] >= ry){
			if (x2+1 < (int)sum.size()) sum[x2+1]--;
			sum[x1]++;
		}
		for (int i=1;i<(int)sum.size();i++){
			sum[i] += sum[i-1];
			FUCK.push_back({sum[i], X[i], ry});
		}

		sum.clear();
		sum.resize(X.size());
		for (auto &[x1, y1, x2, y2]:nV) if (Y[y1] <= ly){
			if (x2+1 < (int)sum.size()) sum[x2+1]--;
			sum[x1]++;
		}
		for (int i=1;i<(int)sum.size();i++){
			sum[i] += sum[i-1];
			FUCK.push_back({sum[i], X[i], ly});
		}

		sort(FUCK.begin(), FUCK.end(), greater<array<int, 3>>());
		for (auto &[_, x, y]:FUCK) C.emplace_back(x, y);

		// 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:151:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  151 |  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 2 ms 340 KB Output is correct
3 Correct 2 ms 296 KB Output is correct
4 Correct 2 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 468 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 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 2 ms 340 KB Output is correct
6 Correct 2 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 2 ms 448 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 4 ms 800 KB Output is correct
2 Correct 3 ms 800 KB Output is correct
3 Correct 5 ms 800 KB Output is correct
4 Correct 4 ms 800 KB Output is correct
5 Correct 4 ms 908 KB Output is correct
6 Correct 3 ms 796 KB Output is correct
7 Correct 5 ms 800 KB Output is correct
8 Correct 4 ms 800 KB Output is correct
9 Correct 4 ms 800 KB Output is correct
10 Correct 4 ms 800 KB Output is correct
11 Correct 4 ms 800 KB Output is correct
12 Correct 5 ms 800 KB Output is correct
13 Correct 5 ms 800 KB Output is correct
14 Correct 16 ms 792 KB Output is correct
15 Correct 5 ms 800 KB Output is correct
16 Correct 4 ms 800 KB Output is correct
17 Correct 44 ms 800 KB Output is correct
18 Correct 5 ms 800 KB Output is correct
19 Correct 5 ms 800 KB Output is correct
20 Correct 107 ms 784 KB Output is correct
21 Correct 6 ms 800 KB Output is correct
22 Correct 5 ms 800 KB Output is correct
23 Correct 1811 ms 800 KB Output is correct
24 Correct 5 ms 800 KB Output is correct
25 Correct 4 ms 800 KB Output is correct
26 Correct 4 ms 800 KB Output is correct
27 Correct 4 ms 800 KB Output is correct
28 Correct 4 ms 800 KB Output is correct
29 Correct 4 ms 800 KB Output is correct
30 Correct 4 ms 876 KB Output is correct
31 Correct 769 ms 800 KB Output is correct
32 Correct 148 ms 800 KB Output is correct
33 Correct 689 ms 784 KB Output is correct
34 Correct 109 ms 800 KB Output is correct
35 Correct 320 ms 784 KB Output is correct
36 Correct 440 ms 800 KB Output is correct
37 Correct 255 ms 796 KB Output is correct
38 Correct 806 ms 800 KB Output is correct
39 Correct 139 ms 800 KB Output is correct
40 Correct 861 ms 896 KB Output is correct
41 Correct 598 ms 800 KB Output is correct
42 Correct 187 ms 800 KB Output is correct
43 Correct 783 ms 800 KB Output is correct
44 Correct 79 ms 800 KB Output is correct
45 Correct 4 ms 800 KB Output is correct
46 Correct 463 ms 800 KB Output is correct
47 Correct 1915 ms 800 KB Output is correct
48 Correct 355 ms 800 KB Output is correct
49 Correct 37 ms 800 KB Output is correct
50 Correct 125 ms 800 KB Output is correct
51 Correct 1039 ms 800 KB Output is correct
52 Correct 68 ms 800 KB Output is correct
53 Correct 173 ms 800 KB Output is correct
54 Correct 157 ms 820 KB Output is correct
55 Correct 5 ms 800 KB Output is correct
56 Correct 5 ms 800 KB Output is correct
57 Correct 5 ms 800 KB Output is correct
58 Correct 5 ms 800 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 2 ms 340 KB Output is correct
3 Correct 2 ms 296 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 73 ms 6600 KB Output is correct
6 Correct 74 ms 6448 KB Output is correct
7 Correct 76 ms 6532 KB Output is correct
8 Correct 73 ms 6500 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 468 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 76 ms 9020 KB Output is correct
6 Correct 75 ms 8684 KB Output is correct
7 Correct 73 ms 8892 KB Output is correct
8 Correct 92 ms 17640 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 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 2 ms 340 KB Output is correct
6 Correct 2 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 2 ms 448 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 92 ms 9960 KB Output is correct
14 Correct 75 ms 10124 KB Output is correct
15 Correct 73 ms 8768 KB Output is correct
16 Correct 77 ms 9072 KB Output is correct
17 Correct 76 ms 11320 KB Output is correct
18 Correct 74 ms 8760 KB Output is correct
19 Correct 76 ms 11800 KB Output is correct
20 Correct 81 ms 15348 KB Output is correct
21 Correct 199 ms 27064 KB Output is correct
22 Correct 110 ms 18632 KB Output is correct
23 Correct 98 ms 21820 KB Output is correct
24 Correct 112 ms 24600 KB Output is correct

Subtask #8
0 / 79.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 800 KB Output is correct
2 Correct 3 ms 800 KB Output is correct
3 Correct 5 ms 800 KB Output is correct
4 Correct 4 ms 800 KB Output is correct
5 Correct 4 ms 908 KB Output is correct
6 Correct 3 ms 796 KB Output is correct
7 Correct 5 ms 800 KB Output is correct
8 Correct 4 ms 800 KB Output is correct
9 Correct 4 ms 800 KB Output is correct
10 Correct 4 ms 800 KB Output is correct
11 Correct 4 ms 800 KB Output is correct
12 Correct 5 ms 800 KB Output is correct
13 Correct 5 ms 800 KB Output is correct
14 Correct 16 ms 792 KB Output is correct
15 Correct 5 ms 800 KB Output is correct
16 Correct 4 ms 800 KB Output is correct
17 Correct 44 ms 800 KB Output is correct
18 Correct 5 ms 800 KB Output is correct
19 Correct 5 ms 800 KB Output is correct
20 Correct 107 ms 784 KB Output is correct
21 Correct 6 ms 800 KB Output is correct
22 Correct 5 ms 800 KB Output is correct
23 Correct 1811 ms 800 KB Output is correct
24 Correct 5 ms 800 KB Output is correct
25 Correct 4 ms 800 KB Output is correct
26 Correct 4 ms 800 KB Output is correct
27 Correct 4 ms 800 KB Output is correct
28 Correct 4 ms 800 KB Output is correct
29 Correct 4 ms 800 KB Output is correct
30 Correct 4 ms 876 KB Output is correct
31 Correct 769 ms 800 KB Output is correct
32 Correct 148 ms 800 KB Output is correct
33 Correct 689 ms 784 KB Output is correct
34 Correct 109 ms 800 KB Output is correct
35 Correct 320 ms 784 KB Output is correct
36 Correct 440 ms 800 KB Output is correct
37 Correct 255 ms 796 KB Output is correct
38 Correct 806 ms 800 KB Output is correct
39 Correct 139 ms 800 KB Output is correct
40 Correct 861 ms 896 KB Output is correct
41 Correct 598 ms 800 KB Output is correct
42 Correct 187 ms 800 KB Output is correct
43 Correct 783 ms 800 KB Output is correct
44 Correct 79 ms 800 KB Output is correct
45 Correct 4 ms 800 KB Output is correct
46 Correct 463 ms 800 KB Output is correct
47 Correct 1915 ms 800 KB Output is correct
48 Correct 355 ms 800 KB Output is correct
49 Correct 37 ms 800 KB Output is correct
50 Correct 125 ms 800 KB Output is correct
51 Correct 1039 ms 800 KB Output is correct
52 Correct 68 ms 800 KB Output is correct
53 Correct 173 ms 800 KB Output is correct
54 Correct 157 ms 820 KB Output is correct
55 Correct 5 ms 800 KB Output is correct
56 Correct 5 ms 800 KB Output is correct
57 Correct 5 ms 800 KB Output is correct
58 Correct 5 ms 800 KB Output is correct
59 Correct 421 ms 62044 KB Output is correct
60 Correct 405 ms 62708 KB Output is correct
61 Correct 437 ms 62124 KB Output is correct
62 Correct 409 ms 62636 KB Output is correct
63 Correct 437 ms 62580 KB Output is correct
64 Correct 405 ms 62604 KB Output is correct
65 Correct 420 ms 62612 KB Output is correct
66 Correct 414 ms 63220 KB Output is correct
67 Correct 452 ms 62608 KB Output is correct
68 Correct 438 ms 63340 KB Output is correct
69 Correct 414 ms 63044 KB Output is correct
70 Correct 427 ms 62744 KB Output is correct
71 Correct 716 ms 63260 KB Output is correct
72 Execution timed out 3047 ms 62628 KB Time limit exceeded
73 Halted 0 ms 0 KB -