제출 #1111665

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1111665		Onur_Ilgaz	원 고르기 (APIO18_circle_selection)	C++17	7 / 100	3084 ms	30448 KiB

circle_selection

#include <bits/stdc++.h>
#define fast cin.tie(0)->sync_with_stdio(0);
#define int long long
#define inf ((int)1e18)
using namespace std;

void brute(int n, vector <array<int, 4>> arr) {
	sort(arr.begin() + 1, arr.end(), [](array<int, 4> a, array<int, 4> b) {
		return a[0] == b[0] ? (a[3] < b[3]) : a[0] > b[0];
	});
	vector <int> p(n + 1);
	auto inside = [&](int x1, int y1, int x2, int y2, int have) {
		return (x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2) <= have * have;
	};
	for(int i = 1; i <= n; i++) {
		auto [r, x, y, ans_ind] = arr[i];
		if(p[ans_ind]) continue;
		p[ans_ind] = ans_ind;
		for(int j = 1; j <= n; j++) {
			auto [tr, tx, ty, tans_ind] = arr[j];
			if(p[tans_ind] or !inside(x, y, tx, ty, r + tr)) continue;
			p[tans_ind] = ans_ind;
		}
	}
	for(int i = 1; i <= n; i++) {
		cout << p[i] << ' ';
	}
}

int32_t main(){
	fast
	int n;
	cin >> n;
	vector <array<int, 4> > arr(n + 1);
	for(int i = 1; i <= n; i++) {
		cin >> arr[i][1] >> arr[i][2] >> arr[i][0];
		arr[i][3] = i;
	}
	brute(n, arr);
}

• Subtask 1: 7 / 7
• Subtask 2: 0 / 12
• Subtask 3: 0 / 15
• Subtask 4: 0 / 23
• Subtask 5: 0 / 30
• Subtask 6: 0 / 13