oj.uz

Submission #787401

# Submission time Handle Problem Language Result Execution time Memory
787401 2023-07-19T06:55:11 Z 박상훈(#10032) Hamburg Steak (JOI20_hamburg) C++17
15 / 100
 193 ms 28180 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 (x2==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 1 ms 368 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 1 ms 312 KB Output is correct
4 Correct 2 ms 412 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 468 KB Output is correct
4 Correct 2 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 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 1 ms 444 KB Output is correct
6 Correct 1 ms 380 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 596 KB Output is correct
12 Correct 2 ms 640 KB Output is correct

Subtask #4
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 352 KB Expected integer, but "failed" found
2 Halted 0 ms 0 KB -

Subtask #5
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 368 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 1 ms 312 KB Output is correct
4 Correct 2 ms 412 KB Output is correct
5 Correct 78 ms 8132 KB Output is correct
6 Correct 79 ms 8088 KB Output is correct
7 Correct 77 ms 8072 KB Output is correct
8 Correct 76 ms 8100 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 468 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 77 ms 10288 KB Output is correct
6 Correct 82 ms 9972 KB Output is correct
7 Correct 86 ms 10244 KB Output is correct
8 Correct 86 ms 18864 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 468 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 1 ms 444 KB Output is correct
6 Correct 1 ms 380 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 596 KB Output is correct
12 Correct 2 ms 640 KB Output is correct
13 Correct 81 ms 11272 KB Output is correct
14 Correct 83 ms 11468 KB Output is correct
15 Correct 96 ms 10148 KB Output is correct
16 Correct 74 ms 10176 KB Output is correct
17 Correct 88 ms 12596 KB Output is correct
18 Correct 78 ms 10020 KB Output is correct
19 Correct 78 ms 13028 KB Output is correct
20 Correct 85 ms 16572 KB Output is correct
21 Correct 193 ms 28180 KB Output is correct
22 Correct 112 ms 19808 KB Output is correct
23 Correct 110 ms 22976 KB Output is correct
24 Correct 115 ms 25732 KB Output is correct

Subtask #8
0 / 79.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 352 KB Expected integer, but "failed" found
2 Halted 0 ms 0 KB -