Submission #727711

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
727711	2023-04-21T06:43:51 Z	SanguineChameleon	Circle selection (APIO18_circle_selection)	C++17	7 / 100	126 ms	1056 KB

circle_selection

#include <bits/stdc++.h>
using namespace std;

void just_do_it();

int main() {
	#ifdef KAMIRULEZ
		freopen("kamirulez.inp", "r", stdin);
		freopen("kamirulez.out", "w", stdout);
	#endif
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	just_do_it();
	return 0;
}

struct circle {
	long long x, y, r;
};

const int maxn = 5e3 + 20;
circle C[maxn];
int res[maxn];

bool intersect(circle C1, circle C2) {
	return (C1.r + C2.r) * (C1.r + C2.r) >= (C1.x - C2.x) * (C1.x - C2.x) + (C1.y - C2.y) * (C1.y - C2.y);
};

void just_do_it() {
	int n;
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> C[i].x >> C[i].y >> C[i].r;
	}
	while (true) {
		int best = -1;
		for (int i = 1; i <= n; i++) {
			if (!res[i]) {
				if (best == -1 || C[best].r < C[i].r) {
					best = i;
				}
			}
		}
		if (best == -1) {
			break;
		}
		for (int i = 1; i <= n; i++) {
			if (!res[i] && intersect(C[i], C[best])) {
				res[i] = best;
			}
		}
	}
	for (int i = 1; i <= n; i++) {
		cout << res[i] << " ";
	}
}

Subtask #1

7.0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	328 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	328 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	328 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	328 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	3 ms	596 KB	Output is correct
20	Correct	2 ms	592 KB	Output is correct
21	Correct	3 ms	580 KB	Output is correct
22	Correct	122 ms	572 KB	Output is correct
23	Correct	123 ms	572 KB	Output is correct
24	Correct	125 ms	576 KB	Output is correct
25	Correct	126 ms	576 KB	Output is correct
26	Correct	126 ms	568 KB	Output is correct

Subtask #2

0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	3 ms	980 KB	Execution killed with signal 11
2	Halted	0 ms	0 KB	-

Subtask #3

0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Runtime error	2 ms	972 KB	Execution killed with signal 11
3	Halted	0 ms	0 KB	-

Subtask #4

0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	3 ms	1056 KB	Execution killed with signal 11
2	Halted	0 ms	0 KB	-

Subtask #5

0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	328 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	328 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	328 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	328 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	3 ms	596 KB	Output is correct
20	Correct	2 ms	592 KB	Output is correct
21	Correct	3 ms	580 KB	Output is correct
22	Correct	122 ms	572 KB	Output is correct
23	Correct	123 ms	572 KB	Output is correct
24	Correct	125 ms	576 KB	Output is correct
25	Correct	126 ms	576 KB	Output is correct
26	Correct	126 ms	568 KB	Output is correct
27	Runtime error	3 ms	980 KB	Execution killed with signal 11
28	Halted	0 ms	0 KB	-

Subtask #6

0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	328 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	328 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	328 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	328 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	3 ms	596 KB	Output is correct
20	Correct	2 ms	592 KB	Output is correct
21	Correct	3 ms	580 KB	Output is correct
22	Correct	122 ms	572 KB	Output is correct
23	Correct	123 ms	572 KB	Output is correct
24	Correct	125 ms	576 KB	Output is correct
25	Correct	126 ms	576 KB	Output is correct
26	Correct	126 ms	568 KB	Output is correct
27	Runtime error	3 ms	980 KB	Execution killed with signal 11
28	Halted	0 ms	0 KB	-