oj.uz

Submission #787404

# Submission time Handle Problem Language Result Execution time Memory
787404 2023-07-19T06:57:00 Z 박상훈(#10032) Hamburg Steak (JOI20_hamburg) C++17
21 / 100
 3000 ms 27124 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.clear();

		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<ll> 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]++;

			if (x1==rx){
				sum[i1] += 1e7;
				if (i2+1 < (int)sum.size()) sum[i2+1] -= 1e7;
			}
		}

		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++){
			if (sum[I[i0]] < (int)1e7) continue;
			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:94:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   94 |  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 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 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 1 ms 328 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 320 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 2 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 1 ms 340 KB Output is correct
2 Correct 2 ms 444 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 508 KB Output is correct
6 Correct 6 ms 516 KB Output is correct
7 Correct 76 ms 680 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 167 ms 744 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 103 ms 676 KB Output is correct
12 Correct 2 ms 508 KB Output is correct
13 Correct 284 ms 564 KB Output is correct
14 Correct 192 ms 656 KB Output is correct
15 Correct 104 ms 564 KB Output is correct
16 Correct 438 ms 648 KB Output is correct
17 Correct 2 ms 568 KB Output is correct
18 Correct 354 ms 628 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 34 ms 568 KB Output is correct
21 Correct 172 ms 672 KB Output is correct
22 Correct 2 ms 596 KB Output is correct
23 Correct 3 ms 468 KB Output is correct
24 Correct 5 ms 672 KB Output is correct
25 Correct 2 ms 468 KB Output is correct
26 Correct 81 ms 624 KB Output is correct
27 Correct 61 ms 556 KB Output is correct
28 Correct 2 ms 468 KB Output is correct
29 Correct 2 ms 468 KB Output is correct
30 Correct 41 ms 588 KB Output is correct
31 Correct 36 ms 540 KB Output is correct
32 Correct 2 ms 468 KB Output is correct
33 Correct 2 ms 468 KB Output is correct
34 Correct 29 ms 572 KB Output is correct
35 Correct 2 ms 596 KB Output is correct
36 Correct 3 ms 468 KB Output is correct
37 Correct 2 ms 596 KB Output is correct
38 Correct 2 ms 596 KB Output is correct
39 Correct 7 ms 568 KB Output is correct
40 Correct 230 ms 556 KB Output is correct
41 Correct 9 ms 596 KB Output is correct
42 Correct 3 ms 596 KB Output is correct
43 Correct 2 ms 568 KB Output is correct
44 Correct 2 ms 468 KB Output is correct
45 Correct 3 ms 656 KB Output is correct
46 Correct 2 ms 604 KB Output is correct
47 Correct 305 ms 644 KB Output is correct
48 Correct 4 ms 576 KB Output is correct
49 Correct 2 ms 564 KB Output is correct
50 Correct 41 ms 468 KB Output is correct
51 Correct 2 ms 596 KB Output is correct
52 Correct 102 ms 548 KB Output is correct
53 Correct 3 ms 468 KB Output is correct
54 Correct 3 ms 644 KB Output is correct
55 Correct 2 ms 468 KB Output is correct
56 Correct 2 ms 568 KB Output is correct
57 Correct 2 ms 504 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 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 1 ms 340 KB Output is correct
5 Correct 70 ms 6504 KB Output is correct
6 Correct 76 ms 6452 KB Output is correct
7 Correct 70 ms 6540 KB Output is correct
8 Correct 70 ms 6504 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 74 ms 9040 KB Output is correct
6 Correct 74 ms 8708 KB Output is correct
7 Correct 73 ms 8908 KB Output is correct
8 Correct 88 ms 17616 KB Output is correct

Subtask #7
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 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 320 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 2 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 74 ms 9908 KB Output is correct
14 Correct 74 ms 10128 KB Output is correct
15 Correct 78 ms 8876 KB Output is correct
16 Correct 73 ms 8864 KB Output is correct
17 Correct 76 ms 11292 KB Output is correct
18 Correct 74 ms 8840 KB Output is correct
19 Correct 79 ms 11964 KB Output is correct
20 Correct 80 ms 15380 KB Output is correct
21 Correct 183 ms 27124 KB Output is correct
22 Correct 107 ms 18600 KB Output is correct
23 Correct 97 ms 21784 KB Output is correct
24 Correct 108 ms 24524 KB Output is correct

Subtask #8
0 / 79.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 444 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 508 KB Output is correct
6 Correct 6 ms 516 KB Output is correct
7 Correct 76 ms 680 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 167 ms 744 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 103 ms 676 KB Output is correct
12 Correct 2 ms 508 KB Output is correct
13 Correct 284 ms 564 KB Output is correct
14 Correct 192 ms 656 KB Output is correct
15 Correct 104 ms 564 KB Output is correct
16 Correct 438 ms 648 KB Output is correct
17 Correct 2 ms 568 KB Output is correct
18 Correct 354 ms 628 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 34 ms 568 KB Output is correct
21 Correct 172 ms 672 KB Output is correct
22 Correct 2 ms 596 KB Output is correct
23 Correct 3 ms 468 KB Output is correct
24 Correct 5 ms 672 KB Output is correct
25 Correct 2 ms 468 KB Output is correct
26 Correct 81 ms 624 KB Output is correct
27 Correct 61 ms 556 KB Output is correct
28 Correct 2 ms 468 KB Output is correct
29 Correct 2 ms 468 KB Output is correct
30 Correct 41 ms 588 KB Output is correct
31 Correct 36 ms 540 KB Output is correct
32 Correct 2 ms 468 KB Output is correct
33 Correct 2 ms 468 KB Output is correct
34 Correct 29 ms 572 KB Output is correct
35 Correct 2 ms 596 KB Output is correct
36 Correct 3 ms 468 KB Output is correct
37 Correct 2 ms 596 KB Output is correct
38 Correct 2 ms 596 KB Output is correct
39 Correct 7 ms 568 KB Output is correct
40 Correct 230 ms 556 KB Output is correct
41 Correct 9 ms 596 KB Output is correct
42 Correct 3 ms 596 KB Output is correct
43 Correct 2 ms 568 KB Output is correct
44 Correct 2 ms 468 KB Output is correct
45 Correct 3 ms 656 KB Output is correct
46 Correct 2 ms 604 KB Output is correct
47 Correct 305 ms 644 KB Output is correct
48 Correct 4 ms 576 KB Output is correct
49 Correct 2 ms 564 KB Output is correct
50 Correct 41 ms 468 KB Output is correct
51 Correct 2 ms 596 KB Output is correct
52 Correct 102 ms 548 KB Output is correct
53 Correct 3 ms 468 KB Output is correct
54 Correct 3 ms 644 KB Output is correct
55 Correct 2 ms 468 KB Output is correct
56 Correct 2 ms 568 KB Output is correct
57 Correct 2 ms 504 KB Output is correct
58 Correct 2 ms 468 KB Output is correct
59 Correct 112 ms 16860 KB Output is correct
60 Execution timed out 3083 ms 17344 KB Time limit exceeded
61 Halted 0 ms 0 KB -