Submission #387618

#	Time	Username	Problem	Language	Result	Execution time	Memory
387618		milleniumEeee	Circle selection (APIO18_circle_selection)	C++17	7 / 100	3087 ms	28076 KiB

circle_selection

#include <bits/stdc++.h>
#define fastInp ios_base::sync_with_stdio(0); cin.tie(0);
#define pii pair<int, int>
#define fr first
#define sc second
#define pb push_back
#define szof(s) (int)s.size()
#define all(s) s.begin(), s.end()
#define mk make_pair
#define int long long
using namespace std;

const int MAXN = (int)3e5 + 5;

int n;

int x[MAXN];
int y[MAXN];
int rad[MAXN];

vector <int> g[MAXN];

double get_dist(int i, int j) {
	return (x[i] - x[j]) * (x[i] - x[j]) + (y[i] - y[j]) * (y[i] - y[j]);
}

bool intersect(int i, int j) {
	return (get_dist(i, j) <= (rad[i] + rad[j]) * (rad[i] + rad[j]));
}

int ans[MAXN];

signed main() {
	fastInp;
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> x[i] >> y[i] >> rad[i];
	}
	vector <int> pos;
	for (int i = 1; i <= n; i++) {
		pos.pb(i);
	}
	sort(all(pos), [&](int A, int B) {
		if (rad[A] != rad[B]) {
			return rad[A] > rad[B];
		} else {
			return A < B;
		}
	});
	memset(ans, -1, sizeof(ans));
	for (int el : pos) {
		if (ans[el] == -1) {
			ans[el] = el;
			for (int i = 1; i <= n; i++) {
				if (ans[i] == -1 && intersect(i, el)) {
					ans[i] = el;
				}
			}
		}
	}
	for (int i = 1; i <= n; i++) {
		cout << ans[i] << " ";
	}
}
/*
11
9 9 2
13 2 1
11 8 2 
3 3 2
3 12 1
12 14 1
9 8 5
2 8 2 
5 2 1
14 4 2
14 14 1
*/

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