oj.uz

답안 #106496

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
106496 2019-04-19T01:18:15 Z bert30702 원 고르기 (APIO18_circle_selection) C++17
0 / 100
 3000 ms 20064 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;
struct circle { C p; int r, i; } v[MX];
int ans[MX];
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};
	}
	int 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<pii> pq;
	for(int i = 1; i <= n; i ++) pq.push({v[i].r, -i});
	while(pq.size()) {
		pii p = pq.top(); pq.pop();
		p.S = -p.S;
		if(ans[v[p.S].i]) continue;
		for(int i = max(1, p.S - 1000); i <= min(n, p.S + 1000); i ++) {
			if(!ans[v[i].i] and abs(v[p.S].p - v[i].p) <= v[p.S].r + v[i].r) ans[v[i].i] = v[p.S].i;
		}
	}
	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
*/

Compilation message

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

Subtask #1
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 14452 KB Output is correct
2 Correct 14 ms 14464 KB Output is correct
3 Correct 14 ms 14464 KB Output is correct
4 Correct 14 ms 14464 KB Output is correct
5 Correct 13 ms 14464 KB Output is correct
6 Correct 16 ms 14464 KB Output is correct
7 Correct 15 ms 14464 KB Output is correct
8 Correct 14 ms 14464 KB Output is correct
9 Correct 17 ms 14436 KB Output is correct
10 Correct 14 ms 14464 KB Output is correct
11 Correct 15 ms 14464 KB Output is correct
12 Correct 14 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 16 ms 14464 KB Output is correct
16 Correct 16 ms 14464 KB Output is correct
17 Correct 16 ms 14508 KB Output is correct
18 Correct 20 ms 14456 KB Output is correct
19 Incorrect 23 ms 14720 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

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

Subtask #3
0 / 15.0

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

Subtask #4
0 / 23.0

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

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 14452 KB Output is correct
2 Correct 14 ms 14464 KB Output is correct
3 Correct 14 ms 14464 KB Output is correct
4 Correct 14 ms 14464 KB Output is correct
5 Correct 13 ms 14464 KB Output is correct
6 Correct 16 ms 14464 KB Output is correct
7 Correct 15 ms 14464 KB Output is correct
8 Correct 14 ms 14464 KB Output is correct
9 Correct 17 ms 14436 KB Output is correct
10 Correct 14 ms 14464 KB Output is correct
11 Correct 15 ms 14464 KB Output is correct
12 Correct 14 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 16 ms 14464 KB Output is correct
16 Correct 16 ms 14464 KB Output is correct
17 Correct 16 ms 14508 KB Output is correct
18 Correct 20 ms 14456 KB Output is correct
19 Incorrect 23 ms 14720 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 14452 KB Output is correct
2 Correct 14 ms 14464 KB Output is correct
3 Correct 14 ms 14464 KB Output is correct
4 Correct 14 ms 14464 KB Output is correct
5 Correct 13 ms 14464 KB Output is correct
6 Correct 16 ms 14464 KB Output is correct
7 Correct 15 ms 14464 KB Output is correct
8 Correct 14 ms 14464 KB Output is correct
9 Correct 17 ms 14436 KB Output is correct
10 Correct 14 ms 14464 KB Output is correct
11 Correct 15 ms 14464 KB Output is correct
12 Correct 14 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 16 ms 14464 KB Output is correct
16 Correct 16 ms 14464 KB Output is correct
17 Correct 16 ms 14508 KB Output is correct
18 Correct 20 ms 14456 KB Output is correct
19 Incorrect 23 ms 14720 KB Output isn't correct
20 Halted 0 ms 0 KB -