oj.uz

Submission #258767

# Submission time Handle Problem Language Result Execution time Memory
258767 2020-08-06T14:23:28 Z Saboon Hamburg Steak (JOI20_hamburg) C++14
15 / 100
 139 ms 4252 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 true;
	}
	if (k == 4){
		int x = inf-1;
		for (int i = 1; i <= n; i++)
			x = min(x, R[i]);
		for (int i = 1; i <= n; i++){
			bool ret = check(n, k, x, U[i]);
			if (ret == true)
				return true;
		}
	}
	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];
//		Ls.insert(L[i]), Ds.insert(D[i]), Rs.insert(R[i]), Us.insert(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

# Verdict Execution time Memory Grader output
1 Correct 2 ms 360 KB Output is correct
2 Correct 2 ms 416 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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 448 KB Output is correct
4 Correct 2 ms 384 KB Output is correct

Subtask #3
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 2 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 2 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 2 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 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct

Subtask #4
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 384 KB Integer parameter [name=x_1] equals to 0, violates the range [1, 10^9]
2 Halted 0 ms 0 KB -

Subtask #5
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 360 KB Output is correct
2 Correct 2 ms 416 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 101 ms 3420 KB Output is correct
6 Correct 119 ms 3420 KB Output is correct
7 Correct 95 ms 3448 KB Output is correct
8 Correct 103 ms 3448 KB Output is correct

Subtask #6
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 448 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 103 ms 4216 KB Output is correct
6 Correct 126 ms 4216 KB Output is correct
7 Correct 100 ms 4216 KB Output is correct
8 Correct 103 ms 4216 KB Output is correct

Subtask #7
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 2 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 2 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 2 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 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 101 ms 4216 KB Output is correct
14 Correct 135 ms 4208 KB Output is correct
15 Correct 102 ms 4216 KB Output is correct
16 Correct 115 ms 4216 KB Output is correct
17 Correct 110 ms 4216 KB Output is correct
18 Correct 101 ms 4216 KB Output is correct
19 Correct 117 ms 4180 KB Output is correct
20 Correct 106 ms 4216 KB Output is correct
21 Correct 139 ms 4216 KB Output is correct
22 Correct 122 ms 4220 KB Output is correct
23 Correct 119 ms 4252 KB Output is correct
24 Correct 120 ms 4216 KB Output is correct

Subtask #8
0 / 79.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 384 KB Integer parameter [name=x_1] equals to 0, violates the range [1, 10^9]
2 Halted 0 ms 0 KB -