oj.uz

Submission #356694

# Submission time Handle Problem Language Result Execution time Memory
356694 2021-01-23T14:15:15 Z CaroLinda Circle selection (APIO18_circle_selection) C++14
87 / 100
 3000 ms 59860 KB 
/*
Proof of complexity: https://en.wikipedia.org/wiki/Circle_packing_in_a_square
*/
 
#include <bits/stdc++.h>
 
#define ll long long
#define sz(x) (int)(x.size() )
#define all(x) x.begin(),x.end()
 
const int MAXN = 3e5+10 ;
 
using namespace std ;
 
struct Circle
{
	ll x , y , r ;
	int id ;
 
	Circle(ll x = 0 , ll y = 0 , ll r = 0 , int id =0 ) : x(x), y(y) , r(r) , id(id){}
 
} circle[MAXN] ;
 
int N ;
int ans[MAXN] ;
ll G ;
vector<ll> p ;
set< pair<ll, int> > s[MAXN] ;
 
bool test(int x, int y )
{
	ll dx =p[ circle[x].x ] - p[ circle[y].x] ;
	ll dy = circle[x].y - circle[y].y ;
	ll r = circle[x].r + circle[y].r ;
	return dx*dx + dy*dy <= r*r ;
}
 
int main()
{
 
	scanf("%d", &N ) ;
	for(int i = 0 ; i < N ; i++ )
	{
		scanf("%lld %lld %lld", &circle[i].x, &circle[i].y, &circle[i].r ) ;
		circle[i].id = i ;
		p.push_back(circle[i].x) ;
	} 
 
	vector<int> vec(N) ; iota(all(vec) , 0 ) ;
	sort(all(vec), [&](int i, int j )
	{
		if( circle[i].r != circle[j].r ) return circle[i].r > circle[j].r ;
		return i < j ;
	} ) ; 
 
	sort(all(p) ) ;
	p.erase(unique(all(p)),p.end() ) ;	
 
	for(int i = 0 ; i < N ; i++ )
	{
		circle[i].x = lower_bound(all(p), circle[i].x ) - p.begin() ;
		s[circle[i].x].insert( make_pair(circle[i].y, i) ) ;		
		ans[i] = -1 ;
	}

	G = circle[vec[0]].r ;
 
	for(int e : vec )
	{
		if(ans[e] != -1 ) continue ;	

		G =  circle[e].r ;

		ll lo = circle[e].y - G - G ;
		ll hi = circle[e].y + G + G ;
 
		vector<int> toErase ;
 
		int l = lower_bound(all(p), p[circle[e].x] - G - G ) - p.begin() ;
		int r = upper_bound(all(p), p[circle[e].x] + G + G ) - p.begin() - 1 ;


		for(int i = l ; i <= r ; i++ )
		{
			auto it = s[i].lower_bound( make_pair(lo, -1 ) ) ;
 
			while( it != s[i].end() && it->first <= hi )
			{
				if( test(it->second, e) ) 
				{
					toErase.push_back(it->second) ;
					ans[it->second] = e ;
				}
				it++ ;
			}
		}
 
		for(auto ee : toErase )
			s[ circle[ee].x ].erase( s[circle[ee].x].find(make_pair(circle[ee].y, ee ) ) ) ;
 
	}
 
	for(int i = 0 ; i < N ; i++ ) printf("%d ", ans[i]+1 ) ;
	printf("\n") ; 
 
}

Compilation message

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

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23788 KB Output is correct
2 Correct 15 ms 23788 KB Output is correct
3 Correct 15 ms 23956 KB Output is correct
4 Correct 15 ms 23788 KB Output is correct
5 Correct 15 ms 23788 KB Output is correct
6 Correct 16 ms 23788 KB Output is correct
7 Correct 15 ms 23788 KB Output is correct
8 Correct 16 ms 23788 KB Output is correct
9 Correct 16 ms 23788 KB Output is correct
10 Correct 15 ms 23788 KB Output is correct
11 Correct 15 ms 23788 KB Output is correct
12 Correct 17 ms 23788 KB Output is correct
13 Correct 16 ms 23788 KB Output is correct
14 Correct 15 ms 23788 KB Output is correct
15 Correct 17 ms 23788 KB Output is correct
16 Correct 19 ms 23952 KB Output is correct
17 Correct 18 ms 23916 KB Output is correct
18 Correct 18 ms 23916 KB Output is correct
19 Correct 19 ms 24428 KB Output is correct
20 Correct 24 ms 24428 KB Output is correct
21 Correct 20 ms 24428 KB Output is correct
22 Correct 21 ms 24428 KB Output is correct
23 Correct 22 ms 24428 KB Output is correct
24 Correct 21 ms 24428 KB Output is correct
25 Correct 20 ms 24428 KB Output is correct
26 Correct 21 ms 24428 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 544 ms 57300 KB Output is correct
2 Correct 584 ms 57696 KB Output is correct
3 Correct 547 ms 56080 KB Output is correct
4 Correct 550 ms 57428 KB Output is correct
5 Correct 517 ms 53992 KB Output is correct
6 Correct 545 ms 53972 KB Output is correct
7 Correct 480 ms 54044 KB Output is correct
8 Correct 484 ms 53972 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23788 KB Output is correct
2 Correct 293 ms 35168 KB Output is correct
3 Correct 1006 ms 57432 KB Output is correct
4 Correct 985 ms 57560 KB Output is correct
5 Correct 1351 ms 56688 KB Output is correct
6 Correct 480 ms 41396 KB Output is correct
7 Correct 171 ms 32992 KB Output is correct
8 Correct 39 ms 25704 KB Output is correct
9 Correct 1130 ms 57408 KB Output is correct
10 Correct 2101 ms 57812 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 645 ms 57196 KB Output is correct
2 Correct 475 ms 56460 KB Output is correct
3 Correct 1285 ms 57388 KB Output is correct
4 Correct 492 ms 56712 KB Output is correct
5 Correct 466 ms 56916 KB Output is correct
6 Correct 1196 ms 57172 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23788 KB Output is correct
2 Correct 15 ms 23788 KB Output is correct
3 Correct 15 ms 23956 KB Output is correct
4 Correct 15 ms 23788 KB Output is correct
5 Correct 15 ms 23788 KB Output is correct
6 Correct 16 ms 23788 KB Output is correct
7 Correct 15 ms 23788 KB Output is correct
8 Correct 16 ms 23788 KB Output is correct
9 Correct 16 ms 23788 KB Output is correct
10 Correct 15 ms 23788 KB Output is correct
11 Correct 15 ms 23788 KB Output is correct
12 Correct 17 ms 23788 KB Output is correct
13 Correct 16 ms 23788 KB Output is correct
14 Correct 15 ms 23788 KB Output is correct
15 Correct 17 ms 23788 KB Output is correct
16 Correct 19 ms 23952 KB Output is correct
17 Correct 18 ms 23916 KB Output is correct
18 Correct 18 ms 23916 KB Output is correct
19 Correct 19 ms 24428 KB Output is correct
20 Correct 24 ms 24428 KB Output is correct
21 Correct 20 ms 24428 KB Output is correct
22 Correct 21 ms 24428 KB Output is correct
23 Correct 22 ms 24428 KB Output is correct
24 Correct 21 ms 24428 KB Output is correct
25 Correct 20 ms 24428 KB Output is correct
26 Correct 21 ms 24428 KB Output is correct
27 Correct 27 ms 25068 KB Output is correct
28 Correct 24 ms 25052 KB Output is correct
29 Correct 26 ms 24940 KB Output is correct
30 Correct 29 ms 24940 KB Output is correct
31 Correct 27 ms 24940 KB Output is correct
32 Correct 27 ms 24940 KB Output is correct
33 Correct 158 ms 35680 KB Output is correct
34 Correct 163 ms 35808 KB Output is correct
35 Correct 164 ms 35680 KB Output is correct
36 Correct 211 ms 34784 KB Output is correct
37 Correct 209 ms 34912 KB Output is correct
38 Correct 215 ms 34912 KB Output is correct
39 Correct 1054 ms 33376 KB Output is correct
40 Correct 1069 ms 33248 KB Output is correct
41 Correct 1121 ms 33376 KB Output is correct
42 Correct 178 ms 33760 KB Output is correct
43 Correct 152 ms 34784 KB Output is correct
44 Correct 152 ms 34784 KB Output is correct
45 Correct 155 ms 34784 KB Output is correct
46 Correct 149 ms 34784 KB Output is correct
47 Correct 153 ms 34864 KB Output is correct
48 Correct 151 ms 34912 KB Output is correct
49 Correct 152 ms 34932 KB Output is correct
50 Correct 153 ms 35064 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23788 KB Output is correct
2 Correct 15 ms 23788 KB Output is correct
3 Correct 15 ms 23956 KB Output is correct
4 Correct 15 ms 23788 KB Output is correct
5 Correct 15 ms 23788 KB Output is correct
6 Correct 16 ms 23788 KB Output is correct
7 Correct 15 ms 23788 KB Output is correct
8 Correct 16 ms 23788 KB Output is correct
9 Correct 16 ms 23788 KB Output is correct
10 Correct 15 ms 23788 KB Output is correct
11 Correct 15 ms 23788 KB Output is correct
12 Correct 17 ms 23788 KB Output is correct
13 Correct 16 ms 23788 KB Output is correct
14 Correct 15 ms 23788 KB Output is correct
15 Correct 17 ms 23788 KB Output is correct
16 Correct 19 ms 23952 KB Output is correct
17 Correct 18 ms 23916 KB Output is correct
18 Correct 18 ms 23916 KB Output is correct
19 Correct 19 ms 24428 KB Output is correct
20 Correct 24 ms 24428 KB Output is correct
21 Correct 20 ms 24428 KB Output is correct
22 Correct 21 ms 24428 KB Output is correct
23 Correct 22 ms 24428 KB Output is correct
24 Correct 21 ms 24428 KB Output is correct
25 Correct 20 ms 24428 KB Output is correct
26 Correct 21 ms 24428 KB Output is correct
27 Correct 544 ms 57300 KB Output is correct
28 Correct 584 ms 57696 KB Output is correct
29 Correct 547 ms 56080 KB Output is correct
30 Correct 550 ms 57428 KB Output is correct
31 Correct 517 ms 53992 KB Output is correct
32 Correct 545 ms 53972 KB Output is correct
33 Correct 480 ms 54044 KB Output is correct
34 Correct 484 ms 53972 KB Output is correct
35 Correct 15 ms 23788 KB Output is correct
36 Correct 293 ms 35168 KB Output is correct
37 Correct 1006 ms 57432 KB Output is correct
38 Correct 985 ms 57560 KB Output is correct
39 Correct 1351 ms 56688 KB Output is correct
40 Correct 480 ms 41396 KB Output is correct
41 Correct 171 ms 32992 KB Output is correct
42 Correct 39 ms 25704 KB Output is correct
43 Correct 1130 ms 57408 KB Output is correct
44 Correct 2101 ms 57812 KB Output is correct
45 Correct 645 ms 57196 KB Output is correct
46 Correct 475 ms 56460 KB Output is correct
47 Correct 1285 ms 57388 KB Output is correct
48 Correct 492 ms 56712 KB Output is correct
49 Correct 466 ms 56916 KB Output is correct
50 Correct 1196 ms 57172 KB Output is correct
51 Correct 27 ms 25068 KB Output is correct
52 Correct 24 ms 25052 KB Output is correct
53 Correct 26 ms 24940 KB Output is correct
54 Correct 29 ms 24940 KB Output is correct
55 Correct 27 ms 24940 KB Output is correct
56 Correct 27 ms 24940 KB Output is correct
57 Correct 158 ms 35680 KB Output is correct
58 Correct 163 ms 35808 KB Output is correct
59 Correct 164 ms 35680 KB Output is correct
60 Correct 211 ms 34784 KB Output is correct
61 Correct 209 ms 34912 KB Output is correct
62 Correct 215 ms 34912 KB Output is correct
63 Correct 1054 ms 33376 KB Output is correct
64 Correct 1069 ms 33248 KB Output is correct
65 Correct 1121 ms 33376 KB Output is correct
66 Correct 178 ms 33760 KB Output is correct
67 Correct 152 ms 34784 KB Output is correct
68 Correct 152 ms 34784 KB Output is correct
69 Correct 155 ms 34784 KB Output is correct
70 Correct 149 ms 34784 KB Output is correct
71 Correct 153 ms 34864 KB Output is correct
72 Correct 151 ms 34912 KB Output is correct
73 Correct 152 ms 34932 KB Output is correct
74 Correct 153 ms 35064 KB Output is correct
75 Correct 545 ms 59732 KB Output is correct
76 Correct 539 ms 59860 KB Output is correct
77 Correct 525 ms 59476 KB Output is correct
78 Correct 522 ms 59732 KB Output is correct
79 Correct 727 ms 58176 KB Output is correct
80 Correct 533 ms 59732 KB Output is correct
81 Correct 892 ms 57548 KB Output is correct
82 Correct 796 ms 57300 KB Output is correct
83 Correct 805 ms 57132 KB Output is correct
84 Correct 1223 ms 57760 KB Output is correct
85 Correct 838 ms 57300 KB Output is correct
86 Correct 788 ms 57300 KB Output is correct
87 Execution timed out 3076 ms 55380 KB Time limit exceeded
88 Halted 0 ms 0 KB -