답안 #49278 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
49278	2018-05-24T17:55:36 Z	zadrga	원 고르기 (APIO18_circle_selection)	C++14	100 / 100	1904 ms	24252 KB

circle_selection

#include <bits/stdc++.h>

using namespace std;

#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF (1LL << 55)
#define MOD (1000 * 1000 * 1000 + 7)
#define maxn 300111

typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;

struct circle{
	ll x, y, r;
	int ind;
} c[maxn], a[maxn];

bool used[maxn];
int ans[maxn], order[maxn];
int n, cur_r, next_r;

bool operator<(circle a, circle b){
	if(a.x == b.x)	
		return a.y < b.y;

	return a.x < b.x;
}

bool comp(int x, int y){
	if(a[x].r == a[y].r)
		return a[x].ind < a[y].ind;

	return a[x].r > a[y].r;
}

void rescale(){
	cur_r = next_r;
	next_r = cur_r / 2;

	for(int i = 1; i <= n; i++){
		int cur = c[i].ind;
		c[i].x = a[cur].x / cur_r;
		c[i].y = a[cur].y / cur_r;
	}

	sort(c + 1, c + 1 + n);
}

bool intersection(circle &a, circle &b){
	ll dist_center = (a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y);
	ll dist_r = (a.r + b.r) * (a.r + b.r);
	return dist_center <= dist_r;
}

void solve(int cur){
	int pos_x = a[cur].x / cur_r;
	int pos_y = a[cur].y / cur_r;

	ans[cur] = cur;
	used[cur] = 1;

	for(int cur_x = pos_x - 2; cur_x <= pos_x + 2; cur_x++){
		int it = lower_bound(c + 1, c + 1 + n, (circle) {cur_x, pos_y - 2, -1, -1}) - c;
		while(it <= n && c[it].x == cur_x && c[it].y <= pos_y + 2){
			if(!used[c[it].ind] && intersection(a[c[it].ind], a[cur])){
				ans[c[it].ind] = cur;
				used[c[it].ind] = 1;
			}
			it++;
		}
	}
}

int main(){
	scanf("%d", &n);
	for(int i = 1; i <= n; i++){
		ll x, y, r;
		scanf("%lld%lld%lld", &x, &y, &r);
		a[i] = c[i] = {x, y, r, i};
		order[i] = i;
	}
	
	sort(order + 1, order + 1 + n, comp);

	next_r = a[order[1]].r; 
	rescale();

	for(int i = 1; i <= n; i++){
		if(used[order[i]])
			continue;

		if(a[order[i]].r <= next_r)
			rescale();

		solve(order[i]);
	}

	for(int i = 1; i <= n; i++)
		printf("%d ", ans[i]);

	return 0;
}

Compilation message

circle_selection.cpp: In function 'int main()':
circle_selection.cpp:79:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
  ~~~~~^~~~~~~~~~
circle_selection.cpp:82:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld%lld%lld", &x, &y, &r);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	248 KB	Output is correct
2	Correct	2 ms	484 KB	Output is correct
3	Correct	3 ms	484 KB	Output is correct
4	Correct	3 ms	484 KB	Output is correct
5	Correct	3 ms	620 KB	Output is correct
6	Correct	2 ms	620 KB	Output is correct
7	Correct	3 ms	620 KB	Output is correct
8	Correct	2 ms	620 KB	Output is correct
9	Correct	2 ms	704 KB	Output is correct
10	Correct	2 ms	704 KB	Output is correct
11	Correct	2 ms	704 KB	Output is correct
12	Correct	2 ms	704 KB	Output is correct
13	Correct	2 ms	704 KB	Output is correct
14	Correct	3 ms	704 KB	Output is correct
15	Correct	2 ms	704 KB	Output is correct
16	Correct	4 ms	704 KB	Output is correct
17	Correct	3 ms	704 KB	Output is correct
18	Correct	0 ms	704 KB	Output is correct
19	Correct	7 ms	1020 KB	Output is correct
20	Correct	6 ms	1024 KB	Output is correct
21	Correct	8 ms	1036 KB	Output is correct
22	Correct	12 ms	1036 KB	Output is correct
23	Correct	13 ms	1052 KB	Output is correct
24	Correct	13 ms	1052 KB	Output is correct
25	Correct	13 ms	1052 KB	Output is correct
26	Correct	14 ms	1060 KB	Output is correct

Subtask #2
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	339 ms	24096 KB	Output is correct
2	Correct	331 ms	24236 KB	Output is correct
3	Correct	319 ms	24236 KB	Output is correct
4	Correct	370 ms	24236 KB	Output is correct
5	Correct	741 ms	24236 KB	Output is correct
6	Correct	841 ms	24236 KB	Output is correct
7	Correct	795 ms	24236 KB	Output is correct
8	Correct	749 ms	24236 KB	Output is correct

Subtask #3
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	24236 KB	Output is correct
2	Correct	371 ms	24236 KB	Output is correct
3	Correct	1642 ms	24236 KB	Output is correct
4	Correct	1786 ms	24236 KB	Output is correct
5	Correct	1704 ms	24236 KB	Output is correct
6	Correct	385 ms	24236 KB	Output is correct
7	Correct	200 ms	24236 KB	Output is correct
8	Correct	31 ms	24236 KB	Output is correct
9	Correct	1826 ms	24236 KB	Output is correct
10	Correct	1095 ms	24236 KB	Output is correct

Subtask #4
23.0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	696 ms	24236 KB	Output is correct
2	Correct	546 ms	24236 KB	Output is correct
3	Correct	295 ms	24236 KB	Output is correct
4	Correct	540 ms	24252 KB	Output is correct
5	Correct	564 ms	24252 KB	Output is correct
6	Correct	307 ms	24252 KB	Output is correct

Subtask #5
30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	248 KB	Output is correct
2	Correct	2 ms	484 KB	Output is correct
3	Correct	3 ms	484 KB	Output is correct
4	Correct	3 ms	484 KB	Output is correct
5	Correct	3 ms	620 KB	Output is correct
6	Correct	2 ms	620 KB	Output is correct
7	Correct	3 ms	620 KB	Output is correct
8	Correct	2 ms	620 KB	Output is correct
9	Correct	2 ms	704 KB	Output is correct
10	Correct	2 ms	704 KB	Output is correct
11	Correct	2 ms	704 KB	Output is correct
12	Correct	2 ms	704 KB	Output is correct
13	Correct	2 ms	704 KB	Output is correct
14	Correct	3 ms	704 KB	Output is correct
15	Correct	2 ms	704 KB	Output is correct
16	Correct	4 ms	704 KB	Output is correct
17	Correct	3 ms	704 KB	Output is correct
18	Correct	0 ms	704 KB	Output is correct
19	Correct	7 ms	1020 KB	Output is correct
20	Correct	6 ms	1024 KB	Output is correct
21	Correct	8 ms	1036 KB	Output is correct
22	Correct	12 ms	1036 KB	Output is correct
23	Correct	13 ms	1052 KB	Output is correct
24	Correct	13 ms	1052 KB	Output is correct
25	Correct	13 ms	1052 KB	Output is correct
26	Correct	14 ms	1060 KB	Output is correct
27	Correct	18 ms	24252 KB	Output is correct
28	Correct	10 ms	24252 KB	Output is correct
29	Correct	13 ms	24252 KB	Output is correct
30	Correct	37 ms	24252 KB	Output is correct
31	Correct	24 ms	24252 KB	Output is correct
32	Correct	23 ms	24252 KB	Output is correct
33	Correct	89 ms	24252 KB	Output is correct
34	Correct	89 ms	24252 KB	Output is correct
35	Correct	276 ms	24252 KB	Output is correct
36	Correct	419 ms	24252 KB	Output is correct
37	Correct	421 ms	24252 KB	Output is correct
38	Correct	483 ms	24252 KB	Output is correct
39	Correct	553 ms	24252 KB	Output is correct
40	Correct	456 ms	24252 KB	Output is correct
41	Correct	462 ms	24252 KB	Output is correct
42	Correct	166 ms	24252 KB	Output is correct
43	Correct	232 ms	24252 KB	Output is correct
44	Correct	162 ms	24252 KB	Output is correct
45	Correct	170 ms	24252 KB	Output is correct
46	Correct	161 ms	24252 KB	Output is correct
47	Correct	164 ms	24252 KB	Output is correct
48	Correct	161 ms	24252 KB	Output is correct
49	Correct	178 ms	24252 KB	Output is correct
50	Correct	164 ms	24252 KB	Output is correct

Subtask #6
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	248 KB	Output is correct
2	Correct	2 ms	484 KB	Output is correct
3	Correct	3 ms	484 KB	Output is correct
4	Correct	3 ms	484 KB	Output is correct
5	Correct	3 ms	620 KB	Output is correct
6	Correct	2 ms	620 KB	Output is correct
7	Correct	3 ms	620 KB	Output is correct
8	Correct	2 ms	620 KB	Output is correct
9	Correct	2 ms	704 KB	Output is correct
10	Correct	2 ms	704 KB	Output is correct
11	Correct	2 ms	704 KB	Output is correct
12	Correct	2 ms	704 KB	Output is correct
13	Correct	2 ms	704 KB	Output is correct
14	Correct	3 ms	704 KB	Output is correct
15	Correct	2 ms	704 KB	Output is correct
16	Correct	4 ms	704 KB	Output is correct
17	Correct	3 ms	704 KB	Output is correct
18	Correct	0 ms	704 KB	Output is correct
19	Correct	7 ms	1020 KB	Output is correct
20	Correct	6 ms	1024 KB	Output is correct
21	Correct	8 ms	1036 KB	Output is correct
22	Correct	12 ms	1036 KB	Output is correct
23	Correct	13 ms	1052 KB	Output is correct
24	Correct	13 ms	1052 KB	Output is correct
25	Correct	13 ms	1052 KB	Output is correct
26	Correct	14 ms	1060 KB	Output is correct
27	Correct	339 ms	24096 KB	Output is correct
28	Correct	331 ms	24236 KB	Output is correct
29	Correct	319 ms	24236 KB	Output is correct
30	Correct	370 ms	24236 KB	Output is correct
31	Correct	741 ms	24236 KB	Output is correct
32	Correct	841 ms	24236 KB	Output is correct
33	Correct	795 ms	24236 KB	Output is correct
34	Correct	749 ms	24236 KB	Output is correct
35	Correct	3 ms	24236 KB	Output is correct
36	Correct	371 ms	24236 KB	Output is correct
37	Correct	1642 ms	24236 KB	Output is correct
38	Correct	1786 ms	24236 KB	Output is correct
39	Correct	1704 ms	24236 KB	Output is correct
40	Correct	385 ms	24236 KB	Output is correct
41	Correct	200 ms	24236 KB	Output is correct
42	Correct	31 ms	24236 KB	Output is correct
43	Correct	1826 ms	24236 KB	Output is correct
44	Correct	1095 ms	24236 KB	Output is correct
45	Correct	696 ms	24236 KB	Output is correct
46	Correct	546 ms	24236 KB	Output is correct
47	Correct	295 ms	24236 KB	Output is correct
48	Correct	540 ms	24252 KB	Output is correct
49	Correct	564 ms	24252 KB	Output is correct
50	Correct	307 ms	24252 KB	Output is correct
51	Correct	18 ms	24252 KB	Output is correct
52	Correct	10 ms	24252 KB	Output is correct
53	Correct	13 ms	24252 KB	Output is correct
54	Correct	37 ms	24252 KB	Output is correct
55	Correct	24 ms	24252 KB	Output is correct
56	Correct	23 ms	24252 KB	Output is correct
57	Correct	89 ms	24252 KB	Output is correct
58	Correct	89 ms	24252 KB	Output is correct
59	Correct	276 ms	24252 KB	Output is correct
60	Correct	419 ms	24252 KB	Output is correct
61	Correct	421 ms	24252 KB	Output is correct
62	Correct	483 ms	24252 KB	Output is correct
63	Correct	553 ms	24252 KB	Output is correct
64	Correct	456 ms	24252 KB	Output is correct
65	Correct	462 ms	24252 KB	Output is correct
66	Correct	166 ms	24252 KB	Output is correct
67	Correct	232 ms	24252 KB	Output is correct
68	Correct	162 ms	24252 KB	Output is correct
69	Correct	170 ms	24252 KB	Output is correct
70	Correct	161 ms	24252 KB	Output is correct
71	Correct	164 ms	24252 KB	Output is correct
72	Correct	161 ms	24252 KB	Output is correct
73	Correct	178 ms	24252 KB	Output is correct
74	Correct	164 ms	24252 KB	Output is correct
75	Correct	1209 ms	24252 KB	Output is correct
76	Correct	478 ms	24252 KB	Output is correct
77	Correct	323 ms	24252 KB	Output is correct
78	Correct	327 ms	24252 KB	Output is correct
79	Correct	1469 ms	24252 KB	Output is correct
80	Correct	346 ms	24252 KB	Output is correct
81	Correct	1676 ms	24252 KB	Output is correct
82	Correct	1761 ms	24252 KB	Output is correct
83	Correct	1395 ms	24252 KB	Output is correct
84	Correct	1642 ms	24252 KB	Output is correct
85	Correct	1600 ms	24252 KB	Output is correct
86	Correct	1827 ms	24252 KB	Output is correct
87	Correct	1810 ms	24252 KB	Output is correct
88	Correct	1764 ms	24252 KB	Output is correct
89	Correct	1689 ms	24252 KB	Output is correct
90	Correct	1560 ms	24252 KB	Output is correct
91	Correct	1405 ms	24252 KB	Output is correct
92	Correct	1904 ms	24252 KB	Output is correct
93	Correct	779 ms	24252 KB	Output is correct
94	Correct	869 ms	24252 KB	Output is correct
95	Correct	860 ms	24252 KB	Output is correct
96	Correct	849 ms	24252 KB	Output is correct
97	Correct	960 ms	24252 KB	Output is correct
98	Correct	812 ms	24252 KB	Output is correct
99	Correct	1036 ms	24252 KB	Output is correct
100	Correct	727 ms	24252 KB	Output is correct
101	Correct	1006 ms	24252 KB	Output is correct
102	Correct	1091 ms	24252 KB	Output is correct
103	Correct	1422 ms	24252 KB	Output is correct
104	Correct	1027 ms	24252 KB	Output is correct
105	Correct	419 ms	24252 KB	Output is correct
106	Correct	515 ms	24252 KB	Output is correct
107	Correct	550 ms	24252 KB	Output is correct
108	Correct	584 ms	24252 KB	Output is correct
109	Correct	586 ms	24252 KB	Output is correct
110	Correct	531 ms	24252 KB	Output is correct
111	Correct	544 ms	24252 KB	Output is correct
112	Correct	552 ms	24252 KB	Output is correct
113	Correct	583 ms	24252 KB	Output is correct
114	Correct	530 ms	24252 KB	Output is correct
115	Correct	586 ms	24252 KB	Output is correct
116	Correct	533 ms	24252 KB	Output is correct

답안 #49278

Compilation message

Subtask #1 7.0 / 7.0

Subtask #2 12.0 / 12.0

Subtask #3 15.0 / 15.0

Subtask #4 23.0 / 23.0

Subtask #5 30.0 / 30.0

Subtask #6 13.0 / 13.0

Subtask #1
7.0 / 7.0

Subtask #2
12.0 / 12.0

Subtask #3
15.0 / 15.0

Subtask #4
23.0 / 23.0

Subtask #5
30.0 / 30.0

Subtask #6
13.0 / 13.0