Submission #258790

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
258790	2020-08-06T14:47:13 Z	Saboon	Hamburg Steak (JOI20_hamburg)	C++14	15 / 100	151 ms	4300 KB

hamburg

#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
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];
int rot = 0;

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];
			}
		}
		if (rot < 4){
			for (int i = 1; i <= n; i++){
				int l = L[i], r = R[i], u = U[i], d = D[i];
				U[i] = inf - l, D[i] = inf - r, L[i] = d, R[i] = u; 
			}
			rot ++;
			return solve(n,k);
		}
		shuffle(seg.begin(), seg.end(), rng);
		for (auto it : seg){
			bool ret = check(n, k, x, it.first);
			if (ret)
				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];
	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	1 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

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

Subtask #4
0 / 6.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 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	4 ms	384 KB	Output is correct
5	Correct	4 ms	384 KB	Output is correct
6	Correct	2 ms	384 KB	Output is correct
7	Correct	10 ms	384 KB	Output is correct
8	Correct	10 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	11 ms	384 KB	Output is correct
12	Correct	4 ms	384 KB	Output is correct
13	Correct	10 ms	384 KB	Output is correct
14	Correct	7 ms	384 KB	Output is correct
15	Correct	7 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	7 ms	384 KB	Output is correct
19	Correct	6 ms	384 KB	Output is correct
20	Correct	4 ms	384 KB	Output is correct
21	Correct	11 ms	384 KB	Output is correct
22	Correct	8 ms	512 KB	Output is correct
23	Correct	9 ms	384 KB	Output is correct
24	Correct	15 ms	488 KB	Output is correct
25	Correct	5 ms	384 KB	Output is correct
26	Correct	4 ms	384 KB	Output is correct
27	Correct	4 ms	384 KB	Output is correct
28	Correct	15 ms	384 KB	Output is correct
29	Correct	16 ms	384 KB	Output is correct
30	Correct	2 ms	384 KB	Output is correct
31	Correct	5 ms	384 KB	Output is correct
32	Correct	5 ms	384 KB	Output is correct
33	Correct	9 ms	384 KB	Output is correct
34	Correct	8 ms	384 KB	Output is correct
35	Correct	5 ms	384 KB	Output is correct
36	Correct	6 ms	384 KB	Output is correct
37	Incorrect	28 ms	384 KB	Output isn't correct
38	Halted	0 ms	0 KB	-

Subtask #5
1.0 / 1.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 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	93 ms	3448 KB	Output is correct
7	Correct	108 ms	3444 KB	Output is correct
8	Correct	93 ms	3436 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	3 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	102 ms	4224 KB	Output is correct
6	Correct	104 ms	4216 KB	Output is correct
7	Correct	111 ms	4216 KB	Output is correct
8	Correct	151 ms	4216 KB	Output is correct

Subtask #7
6.0 / 6.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	384 KB	Output is correct
2	Correct	3 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	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	3 ms	384 KB	Output is correct
13	Correct	120 ms	4192 KB	Output is correct
14	Correct	104 ms	4216 KB	Output is correct
15	Correct	141 ms	4216 KB	Output is correct
16	Correct	101 ms	4244 KB	Output is correct
17	Correct	105 ms	4272 KB	Output is correct
18	Correct	106 ms	4216 KB	Output is correct
19	Correct	100 ms	4288 KB	Output is correct
20	Correct	116 ms	4232 KB	Output is correct
21	Correct	143 ms	4216 KB	Output is correct
22	Correct	134 ms	4216 KB	Output is correct
23	Correct	110 ms	4300 KB	Output is correct
24	Correct	115 ms	4184 KB	Output is correct

Subtask #8
0 / 79.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 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	4 ms	384 KB	Output is correct
5	Correct	4 ms	384 KB	Output is correct
6	Correct	2 ms	384 KB	Output is correct
7	Correct	10 ms	384 KB	Output is correct
8	Correct	10 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	11 ms	384 KB	Output is correct
12	Correct	4 ms	384 KB	Output is correct
13	Correct	10 ms	384 KB	Output is correct
14	Correct	7 ms	384 KB	Output is correct
15	Correct	7 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	7 ms	384 KB	Output is correct
19	Correct	6 ms	384 KB	Output is correct
20	Correct	4 ms	384 KB	Output is correct
21	Correct	11 ms	384 KB	Output is correct
22	Correct	8 ms	512 KB	Output is correct
23	Correct	9 ms	384 KB	Output is correct
24	Correct	15 ms	488 KB	Output is correct
25	Correct	5 ms	384 KB	Output is correct
26	Correct	4 ms	384 KB	Output is correct
27	Correct	4 ms	384 KB	Output is correct
28	Correct	15 ms	384 KB	Output is correct
29	Correct	16 ms	384 KB	Output is correct
30	Correct	2 ms	384 KB	Output is correct
31	Correct	5 ms	384 KB	Output is correct
32	Correct	5 ms	384 KB	Output is correct
33	Correct	9 ms	384 KB	Output is correct
34	Correct	8 ms	384 KB	Output is correct
35	Correct	5 ms	384 KB	Output is correct
36	Correct	6 ms	384 KB	Output is correct
37	Incorrect	28 ms	384 KB	Output isn't correct
38	Halted	0 ms	0 KB	-

Submission #258790

Compilation message