oj.uz

답안 #106507

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
106507 2019-04-19T01:51:53 Z bert30702 원 고르기 (APIO18_circle_selection) C++17
7 / 100
 3000 ms 21224 KB 
#include <bits/stdc++.h>
#define pii pair<int, int>
#define F first
#define S second
#define X real()
#define Y imag()
using namespace std;
typedef complex<long double> C;
const int MX = 3e5 + 100;
const double EPS = 1e-5;
struct circle { C p; int r, i; } v[MX];
int ans[MX];
bool touch(int a, int b) {
	return !ans[b] and abs(v[b].p - v[a].p) <= v[a].r + v[b].r;
}
main () {
	srand(time(0));
	int n; cin >> n;
	for(int i = 1; i <= n; i ++) {
		int x, y, r; cin >> x >> y >> r;
		v[i] = {{x, y}, r, i};
	}
	double ang = rand() * 0.0001;
	for(int i = 1; i <= n; i ++) v[i].p *= C{cos(ang), sin(ang)};
	sort(v + 1, v + 1 + n, [](circle a, circle b) { return a.p.X < b.p.X; });
	priority_queue<pair<int, pii> > pq;
	for(int i = 1; i <= n; i ++) pq.push({v[i].r, {-v[i].i, -i}});
	while(pq.size()) {
		int p = -pq.top().S.S; pq.pop();
		if(ans[v[p].i]) continue;
		for(int i = max(1, p - 5000); i <= min(n, p + 5000); i ++) {
			if(!ans[v[i].i] and abs(v[p].p - v[i].p) - EPS <= v[p].r + v[i].r) ans[v[i].i] = v[p].i;
		}
	}
	for(int i = 1; i <= n; i ++) cout << ans[i] << ' ';
}

Compilation message

circle_selection.cpp:16:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main () {
       ^
circle_selection.cpp: In function 'int main()':
circle_selection.cpp:21:23: warning: narrowing conversion of 'x' from 'int' to 'long double' inside { } [-Wnarrowing]
   v[i] = {{x, y}, r, i};
                       ^
circle_selection.cpp:21:23: warning: narrowing conversion of 'y' from 'int' to 'long double' inside { } [-Wnarrowing]

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 14464 KB Output is correct
2 Correct 15 ms 14336 KB Output is correct
3 Correct 14 ms 14464 KB Output is correct
4 Correct 15 ms 14464 KB Output is correct
5 Correct 14 ms 14464 KB Output is correct
6 Correct 14 ms 14464 KB Output is correct
7 Correct 14 ms 14436 KB Output is correct
8 Correct 17 ms 14464 KB Output is correct
9 Correct 16 ms 14464 KB Output is correct
10 Correct 14 ms 14380 KB Output is correct
11 Correct 14 ms 14464 KB Output is correct
12 Correct 15 ms 14464 KB Output is correct
13 Correct 14 ms 14464 KB Output is correct
14 Correct 14 ms 14464 KB Output is correct
15 Correct 14 ms 14464 KB Output is correct
16 Correct 18 ms 14464 KB Output is correct
17 Correct 16 ms 14464 KB Output is correct
18 Correct 16 ms 14464 KB Output is correct
19 Correct 22 ms 14592 KB Output is correct
20 Correct 22 ms 14592 KB Output is correct
21 Correct 27 ms 14648 KB Output is correct
22 Correct 690 ms 14644 KB Output is correct
23 Correct 626 ms 14712 KB Output is correct
24 Correct 739 ms 14680 KB Output is correct
25 Correct 713 ms 14588 KB Output is correct
26 Correct 756 ms 14584 KB Output is correct

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 596 ms 21224 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

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

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3013 ms 20748 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 14464 KB Output is correct
2 Correct 15 ms 14336 KB Output is correct
3 Correct 14 ms 14464 KB Output is correct
4 Correct 15 ms 14464 KB Output is correct
5 Correct 14 ms 14464 KB Output is correct
6 Correct 14 ms 14464 KB Output is correct
7 Correct 14 ms 14436 KB Output is correct
8 Correct 17 ms 14464 KB Output is correct
9 Correct 16 ms 14464 KB Output is correct
10 Correct 14 ms 14380 KB Output is correct
11 Correct 14 ms 14464 KB Output is correct
12 Correct 15 ms 14464 KB Output is correct
13 Correct 14 ms 14464 KB Output is correct
14 Correct 14 ms 14464 KB Output is correct
15 Correct 14 ms 14464 KB Output is correct
16 Correct 18 ms 14464 KB Output is correct
17 Correct 16 ms 14464 KB Output is correct
18 Correct 16 ms 14464 KB Output is correct
19 Correct 22 ms 14592 KB Output is correct
20 Correct 22 ms 14592 KB Output is correct
21 Correct 27 ms 14648 KB Output is correct
22 Correct 690 ms 14644 KB Output is correct
23 Correct 626 ms 14712 KB Output is correct
24 Correct 739 ms 14680 KB Output is correct
25 Correct 713 ms 14588 KB Output is correct
26 Correct 756 ms 14584 KB Output is correct
27 Incorrect 34 ms 14776 KB Output isn't correct
28 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 14464 KB Output is correct
2 Correct 15 ms 14336 KB Output is correct
3 Correct 14 ms 14464 KB Output is correct
4 Correct 15 ms 14464 KB Output is correct
5 Correct 14 ms 14464 KB Output is correct
6 Correct 14 ms 14464 KB Output is correct
7 Correct 14 ms 14436 KB Output is correct
8 Correct 17 ms 14464 KB Output is correct
9 Correct 16 ms 14464 KB Output is correct
10 Correct 14 ms 14380 KB Output is correct
11 Correct 14 ms 14464 KB Output is correct
12 Correct 15 ms 14464 KB Output is correct
13 Correct 14 ms 14464 KB Output is correct
14 Correct 14 ms 14464 KB Output is correct
15 Correct 14 ms 14464 KB Output is correct
16 Correct 18 ms 14464 KB Output is correct
17 Correct 16 ms 14464 KB Output is correct
18 Correct 16 ms 14464 KB Output is correct
19 Correct 22 ms 14592 KB Output is correct
20 Correct 22 ms 14592 KB Output is correct
21 Correct 27 ms 14648 KB Output is correct
22 Correct 690 ms 14644 KB Output is correct
23 Correct 626 ms 14712 KB Output is correct
24 Correct 739 ms 14680 KB Output is correct
25 Correct 713 ms 14588 KB Output is correct
26 Correct 756 ms 14584 KB Output is correct
27 Incorrect 596 ms 21224 KB Output isn't correct
28 Halted 0 ms 0 KB -