oj.uz

답안 #787414

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
787414 2023-07-19T07:03:57 Z 박상훈(#10032) 함박 스테이크 (JOI20_hamburg) C++17
15 / 100
 173 ms 27184 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);
		// }
	}

	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:90:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   90 |  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

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 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 308 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 2 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
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 448 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 1 ms 340 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 340 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 4 ms 512 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 4 ms 596 KB Output is correct
14 Runtime error 36 ms 892 KB Execution killed with signal 6
15 Halted 0 ms 0 KB -

Subtask #5
1.0 / 1.0

# 결과 실행 시간 메모리 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 66 ms 6548 KB Output is correct
6 Correct 67 ms 6528 KB Output is correct
7 Correct 66 ms 6436 KB Output is correct
8 Correct 67 ms 6476 KB Output is correct

Subtask #6
3.0 / 3.0

# 결과 실행 시간 메모리 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 67 ms 9092 KB Output is correct
6 Correct 73 ms 8752 KB Output is correct
7 Correct 66 ms 8952 KB Output is correct
8 Correct 79 ms 17640 KB Output is correct

Subtask #7
6.0 / 6.0

# 결과 실행 시간 메모리 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 308 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 2 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 69 ms 9944 KB Output is correct
14 Correct 72 ms 10140 KB Output is correct
15 Correct 68 ms 8800 KB Output is correct
16 Correct 69 ms 8924 KB Output is correct
17 Correct 78 ms 11300 KB Output is correct
18 Correct 67 ms 8740 KB Output is correct
19 Correct 70 ms 11816 KB Output is correct
20 Correct 74 ms 15296 KB Output is correct
21 Correct 173 ms 27184 KB Output is correct
22 Correct 110 ms 18564 KB Output is correct
23 Correct 99 ms 21820 KB Output is correct
24 Correct 113 ms 24524 KB Output is correct

Subtask #8
0 / 79.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 448 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 1 ms 340 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 340 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 4 ms 512 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 4 ms 596 KB Output is correct
14 Runtime error 36 ms 892 KB Execution killed with signal 6
15 Halted 0 ms 0 KB -