oj.uz

답안 #106504

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
106504 2019-04-19T01:43:54 Z bert30702 원 고르기 (APIO18_circle_selection) C++17
0 / 100
 3000 ms 21336 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 - 200); i <= min(n, p + 200); 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
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 14464 KB Output is correct
2 Correct 13 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 14 ms 14464 KB Output is correct
6 Correct 13 ms 14464 KB Output is correct
7 Correct 14 ms 14464 KB Output is correct
8 Correct 16 ms 14464 KB Output is correct
9 Correct 15 ms 14472 KB Output is correct
10 Correct 14 ms 14464 KB Output is correct
11 Correct 15 ms 14364 KB Output is correct
12 Correct 17 ms 14464 KB Output is correct
13 Correct 15 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 Incorrect 15 ms 14464 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 621 ms 21336 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 Correct 1672 ms 16680 KB Output is correct
3 Execution timed out 3042 ms 20720 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

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

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 14464 KB Output is correct
2 Correct 13 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 14 ms 14464 KB Output is correct
6 Correct 13 ms 14464 KB Output is correct
7 Correct 14 ms 14464 KB Output is correct
8 Correct 16 ms 14464 KB Output is correct
9 Correct 15 ms 14472 KB Output is correct
10 Correct 14 ms 14464 KB Output is correct
11 Correct 15 ms 14364 KB Output is correct
12 Correct 17 ms 14464 KB Output is correct
13 Correct 15 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 Incorrect 15 ms 14464 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 14464 KB Output is correct
2 Correct 13 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 14 ms 14464 KB Output is correct
6 Correct 13 ms 14464 KB Output is correct
7 Correct 14 ms 14464 KB Output is correct
8 Correct 16 ms 14464 KB Output is correct
9 Correct 15 ms 14472 KB Output is correct
10 Correct 14 ms 14464 KB Output is correct
11 Correct 15 ms 14364 KB Output is correct
12 Correct 17 ms 14464 KB Output is correct
13 Correct 15 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 Incorrect 15 ms 14464 KB Output isn't correct
17 Halted 0 ms 0 KB -