Submission #1002907

#	Time	Username	Problem	Language	Result	Execution time	Memory
1002907		pedroslrey	Izvanzemaljci (COI21_izvanzemaljci)	C++14	5 / 100	102 ms	11860 KiB

izvanzemaljci

#include <bits/stdc++.h>

using namespace std;
using lli = long long;

pair<vector<int>, lli> calc(vector<pair<int, int>> points) {
	map<int, vector<pair<int, int>>> batch;
	for (auto [x, y]: points)
		batch[x].emplace_back(x, y);

	multiset<int> xs, ys;
	for (auto [x, y]: points) {
		xs.insert(x);
		ys.insert(y);
	}

	int mx_x = 0, mn_x = 1e9, mx_y = 0, mn_y = 1e9;
	vector<int> ans; lli best = 1e18;
	for (auto [k, abas]: batch) {
		for (auto [x, y]: abas) {
			assert(xs.find(x) != xs.end());
			assert(ys.find(y) != ys.end());

			if (xs.empty()) break;
			mx_x = max(mx_x, x); mn_x = min(mn_x, x);
			mx_y = max(mx_y, y); mn_y = min(mn_y, y);
			xs.erase(xs.find(x)); ys.erase(ys.find(y));
		}
		if (xs.empty()) break;

		int d1 = max(mx_x - mn_x, mx_y - mn_y);
		int d2 = max(*xs.rbegin() - *xs.begin(), *ys.rbegin() - *ys.begin());
		d1 = max(d1, 1);
		d2 = max(d2, 1);

		lli cost1 = 1LL*d1*d1;
		lli cost2 = 1LL*d2*d2;

		if (cost1 + cost2 < best) {
			best = cost1 + cost2;

			if (mn_x + d1 > k) 
				if (k - d1 >= 0) ans = vector<int>{k - d1, mn_y, d1, *xs.begin(), *ys.begin(), d2};
			else ans = vector<int>{mn_x, mn_y, d1, *xs.begin(), *ys.begin(), d2};
		}
	}

	return {ans, best};
}

int main() {
	int n, k;
	cin >> n >> k;

	vector<pair<int, int>> points(n);
	for (auto &[x, y]: points)
		cin >> x >> y;

	if (k == 1) {
		multiset<int> xs, ys;
		for (auto [x, y]: points) {
			xs.insert(x);
			ys.insert(y);
		}

		int d2 = max(*xs.rbegin() - *xs.begin(), *ys.rbegin() - *ys.begin());
		d2 = max(d2, 1);

		cout << *xs.begin() << " " << *ys.begin() << " " << d2 << "\n";
		return 0;
	}

	if (n == 1) {
		cout << points[0].first << " " << points[0].second << " 1\n";
		cout << points[0].first + 2 << " " << points[0].second + 2 << " 1\n";
		return 0;
	}

	auto [ans1, best1] = calc(points);
	for (auto &[x, y]: points) swap(x, y);
	auto [ans2, best2] = calc(points);	

	if (best2 < best1) {
		swap(ans2, ans1);
		swap(ans1[0], ans1[1]);
		swap(ans1[3], ans1[4]);
	}

	for (int i = 0; i < 6; ++i)
		cout << ans1[i] << (i == 2 ? "\n" : " ");
	cout << "\n";
}

Compilation message (stderr)

izvanzemaljci.cpp: In function 'std::pair<std::vector<int>, long long int> calc(std::vector<std::pair<int, int> >)':
izvanzemaljci.cpp:8:12: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
    8 |  for (auto [x, y]: points)
      |            ^
izvanzemaljci.cpp:12:12: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   12 |  for (auto [x, y]: points) {
      |            ^
izvanzemaljci.cpp:19:12: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   19 |  for (auto [k, abas]: batch) {
      |            ^
izvanzemaljci.cpp:20:13: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   20 |   for (auto [x, y]: abas) {
      |             ^
izvanzemaljci.cpp:42:7: warning: suggest explicit braces to avoid ambiguous 'else' [-Wdangling-else]
   42 |    if (mn_x + d1 > k)
      |       ^
izvanzemaljci.cpp: In function 'int main()':
izvanzemaljci.cpp:56:13: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   56 |  for (auto &[x, y]: points)
      |             ^
izvanzemaljci.cpp:61:13: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   61 |   for (auto [x, y]: points) {
      |             ^
izvanzemaljci.cpp:79:7: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   79 |  auto [ans1, best1] = calc(points);
      |       ^
izvanzemaljci.cpp:80:13: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   80 |  for (auto &[x, y]: points) swap(x, y);
      |             ^
izvanzemaljci.cpp:81:7: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   81 |  auto [ans2, best2] = calc(points);
      |       ^

• Subtask 1: 5 / 5
• Subtask 2: 0 / 21
• Subtask 3: 0 / 12
• Subtask 4: 0 / 30
• Subtask 5: 0 / 32