oj.uz

답안 #453693

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
453693 2021-08-04T15:25:37 Z arminatarod 원 고르기 (APIO18_circle_selection) C++17
7 / 100
 3000 ms 714892 KB 
#include <bits/stdc++.h>

using namespace std;

constexpr int MAXN = 200005;

constexpr int MAXINT = 1073741823;

vector<int> neighbors[MAXN];

struct circles {
	long long int x, y, radius;
} circle[MAXN];

int sorted[MAXN], answer[MAXN];

bitset<MAXN> deleted;

bool comparison(int x, int y) {
	return (circle[x].radius == circle[y].radius? x < y : circle[x].radius > circle[y].radius);
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	long long int n, distance_2, radius_2;
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> circle[i].x >> circle[i].y >> circle[i].radius;
		sorted[i] = i;
	}
	for (int i = 0; i < n; i++)
		for (int j = i + 1; j < n; j++) {
			distance_2 = (circle[i].x - circle[j].x) * (circle[i].x - circle[j].x) + (circle[i].y - circle[j].y) * (circle[i].y - circle[j].y);
			radius_2 = (circle[i].radius + circle[j].radius) * (circle[i].radius + circle[j].radius);
			if (radius_2 >= distance_2) {
				neighbors[i].push_back(j);
				neighbors[j].push_back(i);
			}
		}
	sort(sorted, sorted + n, comparison);
	for (int i = 0; i < n; i++)
		if (!deleted[sorted[i]]) {
			answer[sorted[i]] = sorted[i];
			deleted[sorted[i]] = true;
			for (int j : neighbors[sorted[i]]) {
				if (deleted[j])
					continue;
				answer[j] = sorted[i];
				deleted[j] = true;
			}
		}
	for (int i = 0; i < n; i++)
		cout << answer[i] + 1 << ' ';
	return 0;
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 3 ms 5068 KB Output is correct
7 Correct 4 ms 5068 KB Output is correct
8 Correct 4 ms 5068 KB Output is correct
9 Correct 3 ms 5068 KB Output is correct
10 Correct 3 ms 5068 KB Output is correct
11 Correct 3 ms 4940 KB Output is correct
12 Correct 3 ms 4940 KB Output is correct
13 Correct 3 ms 4940 KB Output is correct
14 Correct 3 ms 5020 KB Output is correct
15 Correct 3 ms 5024 KB Output is correct
16 Correct 13 ms 9292 KB Output is correct
17 Correct 14 ms 9160 KB Output is correct
18 Correct 13 ms 9388 KB Output is correct
19 Correct 292 ms 139664 KB Output is correct
20 Correct 272 ms 139264 KB Output is correct
21 Correct 270 ms 88368 KB Output is correct
22 Correct 50 ms 5292 KB Output is correct
23 Correct 51 ms 5276 KB Output is correct
24 Correct 50 ms 5300 KB Output is correct
25 Correct 51 ms 5276 KB Output is correct
26 Correct 50 ms 5316 KB Output is correct

Subtask #2
0 / 12.0

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

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Execution timed out 3063 ms 10528 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

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

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 3 ms 5068 KB Output is correct
7 Correct 4 ms 5068 KB Output is correct
8 Correct 4 ms 5068 KB Output is correct
9 Correct 3 ms 5068 KB Output is correct
10 Correct 3 ms 5068 KB Output is correct
11 Correct 3 ms 4940 KB Output is correct
12 Correct 3 ms 4940 KB Output is correct
13 Correct 3 ms 4940 KB Output is correct
14 Correct 3 ms 5020 KB Output is correct
15 Correct 3 ms 5024 KB Output is correct
16 Correct 13 ms 9292 KB Output is correct
17 Correct 14 ms 9160 KB Output is correct
18 Correct 13 ms 9388 KB Output is correct
19 Correct 292 ms 139664 KB Output is correct
20 Correct 272 ms 139264 KB Output is correct
21 Correct 270 ms 88368 KB Output is correct
22 Correct 50 ms 5292 KB Output is correct
23 Correct 51 ms 5276 KB Output is correct
24 Correct 50 ms 5300 KB Output is correct
25 Correct 51 ms 5276 KB Output is correct
26 Correct 50 ms 5316 KB Output is correct
27 Correct 1139 ms 387204 KB Output is correct
28 Correct 1210 ms 481844 KB Output is correct
29 Correct 1184 ms 462928 KB Output is correct
30 Correct 187 ms 5572 KB Output is correct
31 Correct 186 ms 5544 KB Output is correct
32 Correct 201 ms 5552 KB Output is correct
33 Execution timed out 3119 ms 714892 KB Time limit exceeded
34 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 3 ms 5068 KB Output is correct
7 Correct 4 ms 5068 KB Output is correct
8 Correct 4 ms 5068 KB Output is correct
9 Correct 3 ms 5068 KB Output is correct
10 Correct 3 ms 5068 KB Output is correct
11 Correct 3 ms 4940 KB Output is correct
12 Correct 3 ms 4940 KB Output is correct
13 Correct 3 ms 4940 KB Output is correct
14 Correct 3 ms 5020 KB Output is correct
15 Correct 3 ms 5024 KB Output is correct
16 Correct 13 ms 9292 KB Output is correct
17 Correct 14 ms 9160 KB Output is correct
18 Correct 13 ms 9388 KB Output is correct
19 Correct 292 ms 139664 KB Output is correct
20 Correct 272 ms 139264 KB Output is correct
21 Correct 270 ms 88368 KB Output is correct
22 Correct 50 ms 5292 KB Output is correct
23 Correct 51 ms 5276 KB Output is correct
24 Correct 50 ms 5300 KB Output is correct
25 Correct 51 ms 5276 KB Output is correct
26 Correct 50 ms 5316 KB Output is correct
27 Runtime error 111 ms 21060 KB Execution killed with signal 11
28 Halted 0 ms 0 KB -