oj.uz

Submission #49277

# Submission time Handle Problem Language Result Execution time Memory
49277 2018-05-24T17:54:14 Z zadrga Circle selection (APIO18_circle_selection) C++14
87 / 100
 3000 ms 24256 KB 
#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(c + 1, c + 1 + n);
	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

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 484 KB Output is correct
3 Correct 2 ms 484 KB Output is correct
4 Correct 3 ms 484 KB Output is correct
5 Correct 2 ms 508 KB Output is correct
6 Correct 3 ms 508 KB Output is correct
7 Correct 3 ms 524 KB Output is correct
8 Correct 2 ms 524 KB Output is correct
9 Correct 3 ms 524 KB Output is correct
10 Correct 3 ms 524 KB Output is correct
11 Correct 2 ms 584 KB Output is correct
12 Correct 2 ms 620 KB Output is correct
13 Correct 3 ms 624 KB Output is correct
14 Correct 2 ms 624 KB Output is correct
15 Correct 2 ms 624 KB Output is correct
16 Correct 4 ms 624 KB Output is correct
17 Correct 3 ms 624 KB Output is correct
18 Correct 3 ms 624 KB Output is correct
19 Correct 8 ms 1004 KB Output is correct
20 Correct 7 ms 1004 KB Output is correct
21 Correct 10 ms 1020 KB Output is correct
22 Correct 14 ms 1036 KB Output is correct
23 Correct 19 ms 1036 KB Output is correct
24 Correct 14 ms 1036 KB Output is correct
25 Correct 13 ms 1036 KB Output is correct
26 Correct 13 ms 1036 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 366 ms 24072 KB Output is correct
2 Correct 490 ms 24256 KB Output is correct
3 Correct 381 ms 24256 KB Output is correct
4 Correct 451 ms 24256 KB Output is correct
5 Correct 707 ms 24256 KB Output is correct
6 Correct 892 ms 24256 KB Output is correct
7 Correct 825 ms 24256 KB Output is correct
8 Correct 792 ms 24256 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 24256 KB Output is correct
2 Correct 499 ms 24256 KB Output is correct
3 Correct 1840 ms 24256 KB Output is correct
4 Correct 1624 ms 24256 KB Output is correct
5 Correct 1962 ms 24256 KB Output is correct
6 Correct 494 ms 24256 KB Output is correct
7 Correct 229 ms 24256 KB Output is correct
8 Correct 29 ms 24256 KB Output is correct
9 Correct 2040 ms 24256 KB Output is correct
10 Correct 1249 ms 24256 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 714 ms 24256 KB Output is correct
2 Correct 617 ms 24256 KB Output is correct
3 Correct 388 ms 24256 KB Output is correct
4 Correct 602 ms 24256 KB Output is correct
5 Correct 546 ms 24256 KB Output is correct
6 Correct 388 ms 24256 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 484 KB Output is correct
3 Correct 2 ms 484 KB Output is correct
4 Correct 3 ms 484 KB Output is correct
5 Correct 2 ms 508 KB Output is correct
6 Correct 3 ms 508 KB Output is correct
7 Correct 3 ms 524 KB Output is correct
8 Correct 2 ms 524 KB Output is correct
9 Correct 3 ms 524 KB Output is correct
10 Correct 3 ms 524 KB Output is correct
11 Correct 2 ms 584 KB Output is correct
12 Correct 2 ms 620 KB Output is correct
13 Correct 3 ms 624 KB Output is correct
14 Correct 2 ms 624 KB Output is correct
15 Correct 2 ms 624 KB Output is correct
16 Correct 4 ms 624 KB Output is correct
17 Correct 3 ms 624 KB Output is correct
18 Correct 3 ms 624 KB Output is correct
19 Correct 8 ms 1004 KB Output is correct
20 Correct 7 ms 1004 KB Output is correct
21 Correct 10 ms 1020 KB Output is correct
22 Correct 14 ms 1036 KB Output is correct
23 Correct 19 ms 1036 KB Output is correct
24 Correct 14 ms 1036 KB Output is correct
25 Correct 13 ms 1036 KB Output is correct
26 Correct 13 ms 1036 KB Output is correct
27 Correct 17 ms 24256 KB Output is correct
28 Correct 11 ms 24256 KB Output is correct
29 Correct 11 ms 24256 KB Output is correct
30 Correct 25 ms 24256 KB Output is correct
31 Correct 23 ms 24256 KB Output is correct
32 Correct 25 ms 24256 KB Output is correct
33 Correct 105 ms 24256 KB Output is correct
34 Correct 127 ms 24256 KB Output is correct
35 Correct 377 ms 24256 KB Output is correct
36 Correct 457 ms 24256 KB Output is correct
37 Correct 488 ms 24256 KB Output is correct
38 Correct 545 ms 24256 KB Output is correct
39 Correct 935 ms 24256 KB Output is correct
40 Correct 778 ms 24256 KB Output is correct
41 Correct 441 ms 24256 KB Output is correct
42 Correct 131 ms 24256 KB Output is correct
43 Correct 177 ms 24256 KB Output is correct
44 Correct 176 ms 24256 KB Output is correct
45 Correct 151 ms 24256 KB Output is correct
46 Correct 171 ms 24256 KB Output is correct
47 Correct 150 ms 24256 KB Output is correct
48 Correct 156 ms 24256 KB Output is correct
49 Correct 174 ms 24256 KB Output is correct
50 Correct 177 ms 24256 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 484 KB Output is correct
3 Correct 2 ms 484 KB Output is correct
4 Correct 3 ms 484 KB Output is correct
5 Correct 2 ms 508 KB Output is correct
6 Correct 3 ms 508 KB Output is correct
7 Correct 3 ms 524 KB Output is correct
8 Correct 2 ms 524 KB Output is correct
9 Correct 3 ms 524 KB Output is correct
10 Correct 3 ms 524 KB Output is correct
11 Correct 2 ms 584 KB Output is correct
12 Correct 2 ms 620 KB Output is correct
13 Correct 3 ms 624 KB Output is correct
14 Correct 2 ms 624 KB Output is correct
15 Correct 2 ms 624 KB Output is correct
16 Correct 4 ms 624 KB Output is correct
17 Correct 3 ms 624 KB Output is correct
18 Correct 3 ms 624 KB Output is correct
19 Correct 8 ms 1004 KB Output is correct
20 Correct 7 ms 1004 KB Output is correct
21 Correct 10 ms 1020 KB Output is correct
22 Correct 14 ms 1036 KB Output is correct
23 Correct 19 ms 1036 KB Output is correct
24 Correct 14 ms 1036 KB Output is correct
25 Correct 13 ms 1036 KB Output is correct
26 Correct 13 ms 1036 KB Output is correct
27 Correct 366 ms 24072 KB Output is correct
28 Correct 490 ms 24256 KB Output is correct
29 Correct 381 ms 24256 KB Output is correct
30 Correct 451 ms 24256 KB Output is correct
31 Correct 707 ms 24256 KB Output is correct
32 Correct 892 ms 24256 KB Output is correct
33 Correct 825 ms 24256 KB Output is correct
34 Correct 792 ms 24256 KB Output is correct
35 Correct 2 ms 24256 KB Output is correct
36 Correct 499 ms 24256 KB Output is correct
37 Correct 1840 ms 24256 KB Output is correct
38 Correct 1624 ms 24256 KB Output is correct
39 Correct 1962 ms 24256 KB Output is correct
40 Correct 494 ms 24256 KB Output is correct
41 Correct 229 ms 24256 KB Output is correct
42 Correct 29 ms 24256 KB Output is correct
43 Correct 2040 ms 24256 KB Output is correct
44 Correct 1249 ms 24256 KB Output is correct
45 Correct 714 ms 24256 KB Output is correct
46 Correct 617 ms 24256 KB Output is correct
47 Correct 388 ms 24256 KB Output is correct
48 Correct 602 ms 24256 KB Output is correct
49 Correct 546 ms 24256 KB Output is correct
50 Correct 388 ms 24256 KB Output is correct
51 Correct 17 ms 24256 KB Output is correct
52 Correct 11 ms 24256 KB Output is correct
53 Correct 11 ms 24256 KB Output is correct
54 Correct 25 ms 24256 KB Output is correct
55 Correct 23 ms 24256 KB Output is correct
56 Correct 25 ms 24256 KB Output is correct
57 Correct 105 ms 24256 KB Output is correct
58 Correct 127 ms 24256 KB Output is correct
59 Correct 377 ms 24256 KB Output is correct
60 Correct 457 ms 24256 KB Output is correct
61 Correct 488 ms 24256 KB Output is correct
62 Correct 545 ms 24256 KB Output is correct
63 Correct 935 ms 24256 KB Output is correct
64 Correct 778 ms 24256 KB Output is correct
65 Correct 441 ms 24256 KB Output is correct
66 Correct 131 ms 24256 KB Output is correct
67 Correct 177 ms 24256 KB Output is correct
68 Correct 176 ms 24256 KB Output is correct
69 Correct 151 ms 24256 KB Output is correct
70 Correct 171 ms 24256 KB Output is correct
71 Correct 150 ms 24256 KB Output is correct
72 Correct 156 ms 24256 KB Output is correct
73 Correct 174 ms 24256 KB Output is correct
74 Correct 177 ms 24256 KB Output is correct
75 Correct 1455 ms 24256 KB Output is correct
76 Correct 462 ms 24256 KB Output is correct
77 Correct 361 ms 24256 KB Output is correct
78 Correct 350 ms 24256 KB Output is correct
79 Correct 1489 ms 24256 KB Output is correct
80 Correct 379 ms 24256 KB Output is correct
81 Correct 1600 ms 24256 KB Output is correct
82 Correct 1543 ms 24256 KB Output is correct
83 Correct 1575 ms 24256 KB Output is correct
84 Correct 1517 ms 24256 KB Output is correct
85 Correct 1717 ms 24256 KB Output is correct
86 Correct 1472 ms 24256 KB Output is correct
87 Correct 1770 ms 24256 KB Output is correct
88 Correct 2370 ms 24256 KB Output is correct
89 Correct 2778 ms 24256 KB Output is correct
90 Execution timed out 3018 ms 24256 KB Time limit exceeded
91 Halted 0 ms 0 KB -