oj.uz

답안 #1002867

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1002867 2024-06-19T20:55:02 Z pedroslrey Izvanzemaljci (COI21_izvanzemaljci) C++14
5 / 100
 101 ms 12628 KB 
#include <bits/stdc++.h>

using namespace std;
using lli = long long;

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

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

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

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

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

	int mx_x = 0, mn_x = 1e9, mx_y = 0, mn_y = 1e9;
	vector<int> ans; lli best = 1e18;
	for (auto [x, y]: points) {
		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());

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

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

			ans = vector<int>{mn_x, mn_y, d1, *xs.begin(), *ys.begin(), d2};
		}
	}

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

Compilation message

izvanzemaljci.cpp: In function 'int main()':
izvanzemaljci.cpp:11:13: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   11 |  for (auto &[x, y]: points)
      |             ^
izvanzemaljci.cpp:17:12: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   17 |  for (auto [x, y]: points) {
      |            ^
izvanzemaljci.cpp:32:12: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   32 |  for (auto [x, y]: points) {
      |            ^

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 432 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 93 ms 12600 KB Output is correct
8 Correct 101 ms 12624 KB Output is correct
9 Correct 92 ms 12628 KB Output is correct
10 Correct 88 ms 12628 KB Output is correct
11 Correct 92 ms 12628 KB Output is correct

Subtask #2
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 348 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 348 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 604 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 604 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -