답안 #49276 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
49276	2018-05-24T17:51:57 Z	zadrga	원 고르기 (APIO18_circle_selection)	C++14	100 / 100	1837 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	3 ms	376 KB	Output is correct
2	Correct	3 ms	376 KB	Output is correct
3	Correct	3 ms	392 KB	Output is correct
4	Correct	3 ms	440 KB	Output is correct
5	Correct	2 ms	444 KB	Output is correct
6	Correct	2 ms	516 KB	Output is correct
7	Correct	3 ms	516 KB	Output is correct
8	Correct	3 ms	516 KB	Output is correct
9	Correct	3 ms	516 KB	Output is correct
10	Correct	3 ms	516 KB	Output is correct
11	Correct	3 ms	644 KB	Output is correct
12	Correct	3 ms	644 KB	Output is correct
13	Correct	2 ms	644 KB	Output is correct
14	Correct	2 ms	644 KB	Output is correct
15	Correct	2 ms	644 KB	Output is correct
16	Correct	4 ms	804 KB	Output is correct
17	Correct	3 ms	804 KB	Output is correct
18	Correct	3 ms	804 KB	Output is correct
19	Correct	7 ms	976 KB	Output is correct
20	Correct	7 ms	1004 KB	Output is correct
21	Correct	8 ms	1020 KB	Output is correct
22	Correct	18 ms	1020 KB	Output is correct
23	Correct	13 ms	1020 KB	Output is correct
24	Correct	14 ms	1036 KB	Output is correct
25	Correct	12 ms	1040 KB	Output is correct
26	Correct	12 ms	1052 KB	Output is correct

Subtask #2
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	342 ms	24124 KB	Output is correct
2	Correct	455 ms	24172 KB	Output is correct
3	Correct	425 ms	24172 KB	Output is correct
4	Correct	382 ms	24172 KB	Output is correct
5	Correct	636 ms	24172 KB	Output is correct
6	Correct	987 ms	24252 KB	Output is correct
7	Correct	771 ms	24252 KB	Output is correct
8	Correct	704 ms	24252 KB	Output is correct

Subtask #3
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	24252 KB	Output is correct
2	Correct	439 ms	24252 KB	Output is correct
3	Correct	1597 ms	24252 KB	Output is correct
4	Correct	1782 ms	24252 KB	Output is correct
5	Correct	1837 ms	24252 KB	Output is correct
6	Correct	471 ms	24252 KB	Output is correct
7	Correct	207 ms	24252 KB	Output is correct
8	Correct	45 ms	24252 KB	Output is correct
9	Correct	1835 ms	24252 KB	Output is correct
10	Correct	1084 ms	24252 KB	Output is correct

Subtask #4
23.0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	620 ms	24252 KB	Output is correct
2	Correct	567 ms	24252 KB	Output is correct
3	Correct	351 ms	24252 KB	Output is correct
4	Correct	504 ms	24252 KB	Output is correct
5	Correct	532 ms	24252 KB	Output is correct
6	Correct	266 ms	24252 KB	Output is correct

Subtask #5
30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	376 KB	Output is correct
2	Correct	3 ms	376 KB	Output is correct
3	Correct	3 ms	392 KB	Output is correct
4	Correct	3 ms	440 KB	Output is correct
5	Correct	2 ms	444 KB	Output is correct
6	Correct	2 ms	516 KB	Output is correct
7	Correct	3 ms	516 KB	Output is correct
8	Correct	3 ms	516 KB	Output is correct
9	Correct	3 ms	516 KB	Output is correct
10	Correct	3 ms	516 KB	Output is correct
11	Correct	3 ms	644 KB	Output is correct
12	Correct	3 ms	644 KB	Output is correct
13	Correct	2 ms	644 KB	Output is correct
14	Correct	2 ms	644 KB	Output is correct
15	Correct	2 ms	644 KB	Output is correct
16	Correct	4 ms	804 KB	Output is correct
17	Correct	3 ms	804 KB	Output is correct
18	Correct	3 ms	804 KB	Output is correct
19	Correct	7 ms	976 KB	Output is correct
20	Correct	7 ms	1004 KB	Output is correct
21	Correct	8 ms	1020 KB	Output is correct
22	Correct	18 ms	1020 KB	Output is correct
23	Correct	13 ms	1020 KB	Output is correct
24	Correct	14 ms	1036 KB	Output is correct
25	Correct	12 ms	1040 KB	Output is correct
26	Correct	12 ms	1052 KB	Output is correct
27	Correct	16 ms	24252 KB	Output is correct
28	Correct	11 ms	24252 KB	Output is correct
29	Correct	13 ms	24252 KB	Output is correct
30	Correct	25 ms	24252 KB	Output is correct
31	Correct	23 ms	24252 KB	Output is correct
32	Correct	26 ms	24252 KB	Output is correct
33	Correct	96 ms	24252 KB	Output is correct
34	Correct	98 ms	24252 KB	Output is correct
35	Correct	377 ms	24252 KB	Output is correct
36	Correct	445 ms	24252 KB	Output is correct
37	Correct	458 ms	24252 KB	Output is correct
38	Correct	326 ms	24252 KB	Output is correct
39	Correct	410 ms	24252 KB	Output is correct
40	Correct	523 ms	24252 KB	Output is correct
41	Correct	527 ms	24252 KB	Output is correct
42	Correct	123 ms	24252 KB	Output is correct
43	Correct	170 ms	24252 KB	Output is correct
44	Correct	167 ms	24252 KB	Output is correct
45	Correct	196 ms	24252 KB	Output is correct
46	Correct	186 ms	24252 KB	Output is correct
47	Correct	158 ms	24252 KB	Output is correct
48	Correct	172 ms	24252 KB	Output is correct
49	Correct	173 ms	24252 KB	Output is correct
50	Correct	166 ms	24252 KB	Output is correct

Subtask #6
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	376 KB	Output is correct
2	Correct	3 ms	376 KB	Output is correct
3	Correct	3 ms	392 KB	Output is correct
4	Correct	3 ms	440 KB	Output is correct
5	Correct	2 ms	444 KB	Output is correct
6	Correct	2 ms	516 KB	Output is correct
7	Correct	3 ms	516 KB	Output is correct
8	Correct	3 ms	516 KB	Output is correct
9	Correct	3 ms	516 KB	Output is correct
10	Correct	3 ms	516 KB	Output is correct
11	Correct	3 ms	644 KB	Output is correct
12	Correct	3 ms	644 KB	Output is correct
13	Correct	2 ms	644 KB	Output is correct
14	Correct	2 ms	644 KB	Output is correct
15	Correct	2 ms	644 KB	Output is correct
16	Correct	4 ms	804 KB	Output is correct
17	Correct	3 ms	804 KB	Output is correct
18	Correct	3 ms	804 KB	Output is correct
19	Correct	7 ms	976 KB	Output is correct
20	Correct	7 ms	1004 KB	Output is correct
21	Correct	8 ms	1020 KB	Output is correct
22	Correct	18 ms	1020 KB	Output is correct
23	Correct	13 ms	1020 KB	Output is correct
24	Correct	14 ms	1036 KB	Output is correct
25	Correct	12 ms	1040 KB	Output is correct
26	Correct	12 ms	1052 KB	Output is correct
27	Correct	342 ms	24124 KB	Output is correct
28	Correct	455 ms	24172 KB	Output is correct
29	Correct	425 ms	24172 KB	Output is correct
30	Correct	382 ms	24172 KB	Output is correct
31	Correct	636 ms	24172 KB	Output is correct
32	Correct	987 ms	24252 KB	Output is correct
33	Correct	771 ms	24252 KB	Output is correct
34	Correct	704 ms	24252 KB	Output is correct
35	Correct	2 ms	24252 KB	Output is correct
36	Correct	439 ms	24252 KB	Output is correct
37	Correct	1597 ms	24252 KB	Output is correct
38	Correct	1782 ms	24252 KB	Output is correct
39	Correct	1837 ms	24252 KB	Output is correct
40	Correct	471 ms	24252 KB	Output is correct
41	Correct	207 ms	24252 KB	Output is correct
42	Correct	45 ms	24252 KB	Output is correct
43	Correct	1835 ms	24252 KB	Output is correct
44	Correct	1084 ms	24252 KB	Output is correct
45	Correct	620 ms	24252 KB	Output is correct
46	Correct	567 ms	24252 KB	Output is correct
47	Correct	351 ms	24252 KB	Output is correct
48	Correct	504 ms	24252 KB	Output is correct
49	Correct	532 ms	24252 KB	Output is correct
50	Correct	266 ms	24252 KB	Output is correct
51	Correct	16 ms	24252 KB	Output is correct
52	Correct	11 ms	24252 KB	Output is correct
53	Correct	13 ms	24252 KB	Output is correct
54	Correct	25 ms	24252 KB	Output is correct
55	Correct	23 ms	24252 KB	Output is correct
56	Correct	26 ms	24252 KB	Output is correct
57	Correct	96 ms	24252 KB	Output is correct
58	Correct	98 ms	24252 KB	Output is correct
59	Correct	377 ms	24252 KB	Output is correct
60	Correct	445 ms	24252 KB	Output is correct
61	Correct	458 ms	24252 KB	Output is correct
62	Correct	326 ms	24252 KB	Output is correct
63	Correct	410 ms	24252 KB	Output is correct
64	Correct	523 ms	24252 KB	Output is correct
65	Correct	527 ms	24252 KB	Output is correct
66	Correct	123 ms	24252 KB	Output is correct
67	Correct	170 ms	24252 KB	Output is correct
68	Correct	167 ms	24252 KB	Output is correct
69	Correct	196 ms	24252 KB	Output is correct
70	Correct	186 ms	24252 KB	Output is correct
71	Correct	158 ms	24252 KB	Output is correct
72	Correct	172 ms	24252 KB	Output is correct
73	Correct	173 ms	24252 KB	Output is correct
74	Correct	166 ms	24252 KB	Output is correct
75	Correct	1222 ms	24252 KB	Output is correct
76	Correct	454 ms	24252 KB	Output is correct
77	Correct	303 ms	24252 KB	Output is correct
78	Correct	314 ms	24252 KB	Output is correct
79	Correct	1296 ms	24252 KB	Output is correct
80	Correct	404 ms	24252 KB	Output is correct
81	Correct	1695 ms	24252 KB	Output is correct
82	Correct	1817 ms	24252 KB	Output is correct
83	Correct	1688 ms	24252 KB	Output is correct
84	Correct	1670 ms	24252 KB	Output is correct
85	Correct	1756 ms	24252 KB	Output is correct
86	Correct	1502 ms	24252 KB	Output is correct
87	Correct	1479 ms	24252 KB	Output is correct
88	Correct	1687 ms	24252 KB	Output is correct
89	Correct	1695 ms	24252 KB	Output is correct
90	Correct	1656 ms	24252 KB	Output is correct
91	Correct	1736 ms	24252 KB	Output is correct
92	Correct	1656 ms	24252 KB	Output is correct
93	Correct	830 ms	24252 KB	Output is correct
94	Correct	1006 ms	24252 KB	Output is correct
95	Correct	808 ms	24252 KB	Output is correct
96	Correct	881 ms	24252 KB	Output is correct
97	Correct	1014 ms	24252 KB	Output is correct
98	Correct	807 ms	24252 KB	Output is correct
99	Correct	863 ms	24252 KB	Output is correct
100	Correct	772 ms	24252 KB	Output is correct
101	Correct	935 ms	24252 KB	Output is correct
102	Correct	1089 ms	24252 KB	Output is correct
103	Correct	1257 ms	24252 KB	Output is correct
104	Correct	1010 ms	24252 KB	Output is correct
105	Correct	400 ms	24252 KB	Output is correct
106	Correct	464 ms	24252 KB	Output is correct
107	Correct	613 ms	24252 KB	Output is correct
108	Correct	534 ms	24252 KB	Output is correct
109	Correct	548 ms	24252 KB	Output is correct
110	Correct	524 ms	24252 KB	Output is correct
111	Correct	529 ms	24252 KB	Output is correct
112	Correct	541 ms	24252 KB	Output is correct
113	Correct	582 ms	24252 KB	Output is correct
114	Correct	560 ms	24252 KB	Output is correct
115	Correct	501 ms	24252 KB	Output is correct
116	Correct	585 ms	24252 KB	Output is correct

답안 #49276

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