oj.uz

답안 #258782

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
258782 2020-08-06T14:39:51 Z Saboon 함박 스테이크 (JOI20_hamburg) C++14
15 / 100
 152 ms 4348 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int maxn = 2e5 + 10;
const int inf = 1e9 + 1;

multiset<int> Ls, Ds, Rs, Us;
int L[maxn], R[maxn], D[maxn], U[maxn];
int mark[maxn];
pair<int,int> ans[5];

bool check(int,int,int,int);

bool solve(int n, int k){
	if (k == 1){
		bool cor = 1;
		int x = inf-1, y = inf-1;
		for (int i = 1; i <= n; i++)
			if (!mark[i])
				x = min(x, R[i]), y = min(y, U[i]);
		for (int i = 1; i <= n; i++)
			if (!mark[i])
				cor &= (L[i] <= x and x <= R[i] and D[i] <= y and y <= U[i]);
		if (cor)
			ans[k] = {x,y};
		return cor;
	}
	if (k == 2){
		int x = inf-1, y1 = inf-1, y2 = 1;
		for (int i = 1; i <= n; i++)
			if (!mark[i])
				x = min(x, R[i]), y1 = min(y1, U[i]), y2 = max(y2, D[i]);
		bool ret = check(n, k, x, y1);
		if (ret == true)
			return true;
		ret = check(n, k, x, y2);
		return ret;
	}
	if (k == 3){
		int x1 = inf-1, x2 = 1, y1 = inf-1, y2 = 1;
		for (int i = 1; i <= n; i++)
			if (!mark[i])
				x1 = min(x1, R[i]), x2 = max(x2, L[i]), y1 = min(y1, U[i]), y2 = max(y2, D[i]);
		bool ret = check(n, k, x1, y1);
		if (ret == true)
			return true;
		ret = check(n, k, x1, y2);
		if (ret == true)
			return true;
		ret = check(n, k, x2, y1);
		if (ret == true)
			return true;
		ret = check(n, k, x2, y2);
		return ret;
	}
	if (k == 4){
		int x = inf-1;
		for (int i = 1; i <= n; i++)
			x = min(x, R[i]);
		vector<pair<int,int>> seg;
		for (int i = 1; i <= n; i++)
			if (L[i] <= x)
				seg.push_back({D[i],i});
		sort(seg.rbegin(), seg.rend());
		int minl = inf;
		for (auto it : seg){
			int idx = it.second;
			if (U[idx] < minl){
				bool ret = check(n, k, x, U[idx]);
				if (ret)
					return true;
				minl = U[idx];
			}
		}
		int cnt = 0;
		for (int i = 1; i <= n; i++)
			if (L[i] <= x)
				seg[cnt++] = {U[i],i};
		sort(seg.begin(), seg.end());
		int maxr = 0;
		for (auto it : seg){
			int idx = it.second;
			if (maxr < D[idx]){
				bool ret = check(n, k, x, D[idx]);
				if (ret)
					return true;
				maxr = D[idx];
			}
		}
	}
	return false;
}

bool check(int n, int k, int x, int y){
	for (int i = 1; i <= n; i++)
		if (!mark[i] and L[i] <= x and x <= R[i] and D[i] <= y and y <= U[i])
			mark[i] = k;
	ans[k] = {x,y};
	bool ret = solve(n, k-1);
	if (ret == true)
		return true;
	for (int i = 1; i <= n; i++)
		if (mark[i] == k)
			mark[i] = 0;
	return false;
}

int main(){
	ios_base::sync_with_stdio(false);
	int n, k;
	cin >> n >> k;
	for (int i = 1; i <= n; i++)
		cin >> L[i] >> D[i] >> R[i] >> U[i];
	bool solved = solve(n, k);
	assert(solved);
	for (int i = 1; i <= k; i++)
		cout << ans[i].first << " " << ans[i].second << endl;
}

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct

Subtask #2
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 448 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct

Subtask #3
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct

Subtask #4
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 10 ms 384 KB Output is correct
8 Correct 8 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 9 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 9 ms 384 KB Output is correct
14 Correct 7 ms 384 KB Output is correct
15 Correct 6 ms 384 KB Output is correct
16 Correct 9 ms 384 KB Output is correct
17 Correct 7 ms 384 KB Output is correct
18 Correct 6 ms 384 KB Output is correct
19 Correct 6 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 11 ms 384 KB Output is correct
22 Correct 7 ms 384 KB Output is correct
23 Correct 7 ms 384 KB Output is correct
24 Correct 14 ms 384 KB Output is correct
25 Correct 4 ms 384 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 4 ms 384 KB Output is correct
28 Correct 17 ms 488 KB Output is correct
29 Correct 16 ms 384 KB Output is correct
30 Correct 3 ms 384 KB Output is correct
31 Correct 5 ms 384 KB Output is correct
32 Correct 6 ms 384 KB Output is correct
33 Correct 11 ms 384 KB Output is correct
34 Correct 8 ms 384 KB Output is correct
35 Correct 6 ms 384 KB Output is correct
36 Correct 6 ms 384 KB Output is correct
37 Runtime error 23 ms 632 KB Execution killed with signal 11 (could be triggered by violating memory limits)
38 Halted 0 ms 0 KB -

Subtask #5
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 92 ms 3448 KB Output is correct
6 Correct 98 ms 3452 KB Output is correct
7 Correct 95 ms 3448 KB Output is correct
8 Correct 107 ms 3424 KB Output is correct

Subtask #6
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 448 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 99 ms 4216 KB Output is correct
6 Correct 103 ms 4240 KB Output is correct
7 Correct 125 ms 4216 KB Output is correct
8 Correct 102 ms 4216 KB Output is correct

Subtask #7
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 115 ms 4216 KB Output is correct
14 Correct 110 ms 4216 KB Output is correct
15 Correct 129 ms 4344 KB Output is correct
16 Correct 149 ms 4216 KB Output is correct
17 Correct 123 ms 4192 KB Output is correct
18 Correct 120 ms 4252 KB Output is correct
19 Correct 126 ms 4228 KB Output is correct
20 Correct 116 ms 4216 KB Output is correct
21 Correct 152 ms 4348 KB Output is correct
22 Correct 126 ms 4196 KB Output is correct
23 Correct 120 ms 4180 KB Output is correct
24 Correct 115 ms 4308 KB Output is correct

Subtask #8
0 / 79.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 10 ms 384 KB Output is correct
8 Correct 8 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 9 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 9 ms 384 KB Output is correct
14 Correct 7 ms 384 KB Output is correct
15 Correct 6 ms 384 KB Output is correct
16 Correct 9 ms 384 KB Output is correct
17 Correct 7 ms 384 KB Output is correct
18 Correct 6 ms 384 KB Output is correct
19 Correct 6 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 11 ms 384 KB Output is correct
22 Correct 7 ms 384 KB Output is correct
23 Correct 7 ms 384 KB Output is correct
24 Correct 14 ms 384 KB Output is correct
25 Correct 4 ms 384 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 4 ms 384 KB Output is correct
28 Correct 17 ms 488 KB Output is correct
29 Correct 16 ms 384 KB Output is correct
30 Correct 3 ms 384 KB Output is correct
31 Correct 5 ms 384 KB Output is correct
32 Correct 6 ms 384 KB Output is correct
33 Correct 11 ms 384 KB Output is correct
34 Correct 8 ms 384 KB Output is correct
35 Correct 6 ms 384 KB Output is correct
36 Correct 6 ms 384 KB Output is correct
37 Runtime error 23 ms 632 KB Execution killed with signal 11 (could be triggered by violating memory limits)
38 Halted 0 ms 0 KB -