oj.uz

Submission #77749

# Submission time Handle Problem Language Result Execution time Memory
77749 2018-09-30T07:22:55 Z autumn_eel Circle selection (APIO18_circle_selection) C++14
87 / 100
 3000 ms 63720 KB 
#include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
#define INF 1e10
using namespace std;

int ans[400000];
struct Circle{
	double x,y,r;
	int id;
	float bbox[2][2];
	Circle(){}
	Circle(double x,double y,double r,int id):x(x),y(y),r(r),id(id){
		bbox[0][0]=x-r;bbox[0][1]=y-r;
		bbox[1][0]=x+r;bbox[1][1]=y+r;
	}
};
struct node{
	float bbox[2][2];
	node*l,*r;
	vector<Circle*>circle;
};
float area(float bbox[2][2]){
	return (bbox[1][0]-bbox[0][0])*(bbox[1][1]-bbox[0][1]);
}
void init(float bbox[2][2]){
	bbox[0][0]=bbox[0][1]=INF;
	bbox[1][0]=bbox[1][1]=-INF;
}
void mergeAABB(float bbox[2][2],float bbox2[2][2],float result[2][2]){
	rep(i,2){
		result[0][i]=min(bbox[0][i],bbox2[0][i]);
		result[1][i]=max(bbox[1][i],bbox2[1][i]);
	}
}
void createAABB(vector<Circle*>&circle,float result[2][2]){
	init(result);
	for(auto&c:circle){
		mergeAABB(result,c->bbox,result);
	}
}
node bvh[400000];
int pointer=0;

#define t_tri 1.
#define t_aabb 1.

void setleaf(vector<Circle*>circle,node*n){
	n->l=n->r=NULL;
	n->circle=circle;
}
void build(vector<Circle*>&circle,node*n){
	createAABB(circle,n->bbox);
	float Min=t_tri*circle.size();
	int axis=-1,id=-1;
	float s=area(n->bbox);
	rep(i,2){
		sort(circle.begin(),circle.end(),[&](auto a,auto b){
			if(i==0)return a->x<b->x;
			return a->y<b->y;
		});
		float box[2][2];init(box);
		vector<float>s1(circle.size());
		rep(j,circle.size()){
			mergeAABB(box,circle[j]->bbox,box);
			s1[j]=area(box);
		}
		init(box);
		vector<float>s2(circle.size());
		for(int j=circle.size()-1;j>=0;j--){
			mergeAABB(box,circle[j]->bbox,box);
			s2[j]=area(box);
		}
		for(int j=0;j+1<circle.size();j++){
			float cost=2*t_aabb+(s1[j]/s)*(j+1)*t_tri+(s2[j+1]/s)*(circle.size()-j-1)*t_tri;
			if(Min>cost){
				Min=cost;
				axis=i;id=j;
			}
		}
	}
	if(axis==-1){
		setleaf(circle,n);
	}
	else{
		sort(circle.begin(),circle.end(),[&](auto a,auto b){
			if(axis==0)return a->x<b->x;
			return a->y<b->y;
		});
		n->l=&bvh[pointer++];
		n->r=&bvh[pointer++];
		vector<Circle*>left(circle.begin(),circle.begin()+id+1);
		vector<Circle*>right(circle.begin()+id+1,circle.end());
		build(left,n->l);
		build(right,n->r);
	}
}
void dfs_bvh(node*n,int depth){
	if(depth==3){
		cout<<"(minx,miny),(maxx,maxy) = "<<"("<<n->bbox[0][0]<<","<<n->bbox[0][1]<<")"<<","<<"("<<n->bbox[1][0]<<","<<n->bbox[1][1]<<")"<<endl;
	}
	if(n->l)dfs_bvh(n->l,depth+1);
	if(n->r)dfs_bvh(n->r,depth+1);
}
bool intersect(Circle*c1,Circle*c2){
	return pow(c1->x-(double)c2->x,2)+pow(c1->y-(double)c2->y,2)<=pow(c1->r+(double)c2->r,2);
}
inline bool intersect(float bbox1[2][2],float bbox2[2][2]){
	if(bbox1[1][0]+10<bbox2[0][0]||bbox2[1][0]+10<bbox1[0][0]||bbox1[1][1]+10<bbox2[0][1]||bbox2[1][1]+10<bbox1[0][1])return false;
	return true;
}
node*intersect(node*n,Circle*c){
	if(!intersect(c->bbox,n->bbox))return n;
	if(n->l){
		auto l=intersect(n->l,c);
		auto r=intersect(n->r,c);
		if(l==NULL&&r==NULL)return NULL;
		if(l==NULL)return r;
		if(r==NULL)return l;
		n->l=l;n->r=r;
		init(n->bbox);
		mergeAABB(l->bbox,r->bbox,n->bbox);
		return n;
	}
	else{
		auto&circle=n->circle;
		vector<Circle*>res;
		rep(i,circle.size()){
			if(intersect(circle[i],c)){
				ans[circle[i]->id]=c->id;
			}
			else{
				res.push_back(circle[i]);
			}
		}
		if(res.empty())return NULL;
		circle=res;
		createAABB(circle,n->bbox);
		return n;
	}
}

Circle c[400000];
int main(){
	int n;scanf("%d",&n);
	vector<Circle*>circle;
	rep(i,n){
		int x,y,r;scanf("%d%d%d",&x,&y,&r);
		c[i]=Circle(x,y,r,i);
	}
	sort(c,c+n,[](auto a,auto b){
		if(a.r==b.r)return a.id<b.id;
		return a.r>b.r;
	});
	rep(i,n){
		circle.push_back(&c[i]);
	}
	node*root=&bvh[pointer++];
	build(circle,root);
	//~ dfs_bvh(root,0);
	memset(ans,-1,sizeof(ans));
	rep(i,n){
		if(ans[c[i].id]!=-1)continue;
		root=intersect(root,&c[i]);
		if(root==NULL)break;
	}
	rep(i,n){
		if(i)printf(" ");
		printf("%d",ans[i]+1);
	}
	puts("");
}

Compilation message

circle_selection.cpp: In function 'void build(std::vector<Circle*>&, node*)':
circle_selection.cpp:2:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define rep(i,n)for(int i=0;i<(n);i++)
                              ^
circle_selection.cpp:63:3: note: in expansion of macro 'rep'
   rep(j,circle.size()){
   ^~~
circle_selection.cpp:73:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int j=0;j+1<circle.size();j++){
               ~~~^~~~~~~~~~~~~~
circle_selection.cpp: In function 'node* intersect(node*, Circle*)':
circle_selection.cpp:2:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define rep(i,n)for(int i=0;i<(n);i++)
                              ^
circle_selection.cpp:127:3: note: in expansion of macro 'rep'
   rep(i,circle.size()){
   ^~~
circle_selection.cpp: In function 'int main()':
circle_selection.cpp:144:13: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  int n;scanf("%d",&n);
        ~~~~~^~~~~~~~~
circle_selection.cpp:147:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   int x,y,r;scanf("%d%d%d",&x,&y,&r);
             ~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 23800 KB Output is correct
2 Correct 21 ms 23932 KB Output is correct
3 Correct 21 ms 23932 KB Output is correct
4 Correct 23 ms 23932 KB Output is correct
5 Correct 22 ms 23932 KB Output is correct
6 Correct 21 ms 23932 KB Output is correct
7 Correct 21 ms 23988 KB Output is correct
8 Correct 23 ms 23988 KB Output is correct
9 Correct 22 ms 23988 KB Output is correct
10 Correct 22 ms 23988 KB Output is correct
11 Correct 21 ms 23988 KB Output is correct
12 Correct 21 ms 23988 KB Output is correct
13 Correct 21 ms 23988 KB Output is correct
14 Correct 21 ms 24116 KB Output is correct
15 Correct 21 ms 24116 KB Output is correct
16 Correct 23 ms 24172 KB Output is correct
17 Correct 23 ms 24172 KB Output is correct
18 Correct 23 ms 24172 KB Output is correct
19 Correct 36 ms 24416 KB Output is correct
20 Correct 37 ms 24532 KB Output is correct
21 Correct 35 ms 24532 KB Output is correct
22 Correct 40 ms 24560 KB Output is correct
23 Correct 40 ms 24560 KB Output is correct
24 Correct 39 ms 24576 KB Output is correct
25 Correct 40 ms 24576 KB Output is correct
26 Correct 40 ms 24576 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1547 ms 50324 KB Output is correct
2 Correct 1485 ms 50324 KB Output is correct
3 Correct 1533 ms 50324 KB Output is correct
4 Correct 1608 ms 50324 KB Output is correct
5 Correct 1450 ms 50324 KB Output is correct
6 Correct 1571 ms 51208 KB Output is correct
7 Correct 1395 ms 51208 KB Output is correct
8 Correct 1448 ms 51208 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 51208 KB Output is correct
2 Correct 643 ms 51208 KB Output is correct
3 Correct 2567 ms 53064 KB Output is correct
4 Correct 2549 ms 53064 KB Output is correct
5 Correct 2326 ms 53064 KB Output is correct
6 Correct 982 ms 53064 KB Output is correct
7 Correct 481 ms 53064 KB Output is correct
8 Correct 96 ms 53064 KB Output is correct
9 Correct 2546 ms 53064 KB Output is correct
10 Correct 2292 ms 53064 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2424 ms 53064 KB Output is correct
2 Correct 2473 ms 53064 KB Output is correct
3 Correct 2143 ms 53064 KB Output is correct
4 Correct 2477 ms 53140 KB Output is correct
5 Correct 2522 ms 53140 KB Output is correct
6 Correct 2143 ms 53140 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 23800 KB Output is correct
2 Correct 21 ms 23932 KB Output is correct
3 Correct 21 ms 23932 KB Output is correct
4 Correct 23 ms 23932 KB Output is correct
5 Correct 22 ms 23932 KB Output is correct
6 Correct 21 ms 23932 KB Output is correct
7 Correct 21 ms 23988 KB Output is correct
8 Correct 23 ms 23988 KB Output is correct
9 Correct 22 ms 23988 KB Output is correct
10 Correct 22 ms 23988 KB Output is correct
11 Correct 21 ms 23988 KB Output is correct
12 Correct 21 ms 23988 KB Output is correct
13 Correct 21 ms 23988 KB Output is correct
14 Correct 21 ms 24116 KB Output is correct
15 Correct 21 ms 24116 KB Output is correct
16 Correct 23 ms 24172 KB Output is correct
17 Correct 23 ms 24172 KB Output is correct
18 Correct 23 ms 24172 KB Output is correct
19 Correct 36 ms 24416 KB Output is correct
20 Correct 37 ms 24532 KB Output is correct
21 Correct 35 ms 24532 KB Output is correct
22 Correct 40 ms 24560 KB Output is correct
23 Correct 40 ms 24560 KB Output is correct
24 Correct 39 ms 24576 KB Output is correct
25 Correct 40 ms 24576 KB Output is correct
26 Correct 40 ms 24576 KB Output is correct
27 Correct 55 ms 53140 KB Output is correct
28 Correct 57 ms 53140 KB Output is correct
29 Correct 54 ms 53140 KB Output is correct
30 Correct 64 ms 53140 KB Output is correct
31 Correct 67 ms 53140 KB Output is correct
32 Correct 65 ms 53140 KB Output is correct
33 Correct 542 ms 53140 KB Output is correct
34 Correct 506 ms 53140 KB Output is correct
35 Correct 513 ms 53140 KB Output is correct
36 Correct 661 ms 53140 KB Output is correct
37 Correct 671 ms 53140 KB Output is correct
38 Correct 655 ms 53140 KB Output is correct
39 Correct 1043 ms 53140 KB Output is correct
40 Correct 1027 ms 53140 KB Output is correct
41 Correct 898 ms 53140 KB Output is correct
42 Correct 481 ms 53140 KB Output is correct
43 Correct 430 ms 53140 KB Output is correct
44 Correct 414 ms 53140 KB Output is correct
45 Correct 418 ms 53140 KB Output is correct
46 Correct 412 ms 53140 KB Output is correct
47 Correct 427 ms 53140 KB Output is correct
48 Correct 418 ms 53140 KB Output is correct
49 Correct 451 ms 53140 KB Output is correct
50 Correct 424 ms 53140 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 23800 KB Output is correct
2 Correct 21 ms 23932 KB Output is correct
3 Correct 21 ms 23932 KB Output is correct
4 Correct 23 ms 23932 KB Output is correct
5 Correct 22 ms 23932 KB Output is correct
6 Correct 21 ms 23932 KB Output is correct
7 Correct 21 ms 23988 KB Output is correct
8 Correct 23 ms 23988 KB Output is correct
9 Correct 22 ms 23988 KB Output is correct
10 Correct 22 ms 23988 KB Output is correct
11 Correct 21 ms 23988 KB Output is correct
12 Correct 21 ms 23988 KB Output is correct
13 Correct 21 ms 23988 KB Output is correct
14 Correct 21 ms 24116 KB Output is correct
15 Correct 21 ms 24116 KB Output is correct
16 Correct 23 ms 24172 KB Output is correct
17 Correct 23 ms 24172 KB Output is correct
18 Correct 23 ms 24172 KB Output is correct
19 Correct 36 ms 24416 KB Output is correct
20 Correct 37 ms 24532 KB Output is correct
21 Correct 35 ms 24532 KB Output is correct
22 Correct 40 ms 24560 KB Output is correct
23 Correct 40 ms 24560 KB Output is correct
24 Correct 39 ms 24576 KB Output is correct
25 Correct 40 ms 24576 KB Output is correct
26 Correct 40 ms 24576 KB Output is correct
27 Correct 1547 ms 50324 KB Output is correct
28 Correct 1485 ms 50324 KB Output is correct
29 Correct 1533 ms 50324 KB Output is correct
30 Correct 1608 ms 50324 KB Output is correct
31 Correct 1450 ms 50324 KB Output is correct
32 Correct 1571 ms 51208 KB Output is correct
33 Correct 1395 ms 51208 KB Output is correct
34 Correct 1448 ms 51208 KB Output is correct
35 Correct 21 ms 51208 KB Output is correct
36 Correct 643 ms 51208 KB Output is correct
37 Correct 2567 ms 53064 KB Output is correct
38 Correct 2549 ms 53064 KB Output is correct
39 Correct 2326 ms 53064 KB Output is correct
40 Correct 982 ms 53064 KB Output is correct
41 Correct 481 ms 53064 KB Output is correct
42 Correct 96 ms 53064 KB Output is correct
43 Correct 2546 ms 53064 KB Output is correct
44 Correct 2292 ms 53064 KB Output is correct
45 Correct 2424 ms 53064 KB Output is correct
46 Correct 2473 ms 53064 KB Output is correct
47 Correct 2143 ms 53064 KB Output is correct
48 Correct 2477 ms 53140 KB Output is correct
49 Correct 2522 ms 53140 KB Output is correct
50 Correct 2143 ms 53140 KB Output is correct
51 Correct 55 ms 53140 KB Output is correct
52 Correct 57 ms 53140 KB Output is correct
53 Correct 54 ms 53140 KB Output is correct
54 Correct 64 ms 53140 KB Output is correct
55 Correct 67 ms 53140 KB Output is correct
56 Correct 65 ms 53140 KB Output is correct
57 Correct 542 ms 53140 KB Output is correct
58 Correct 506 ms 53140 KB Output is correct
59 Correct 513 ms 53140 KB Output is correct
60 Correct 661 ms 53140 KB Output is correct
61 Correct 671 ms 53140 KB Output is correct
62 Correct 655 ms 53140 KB Output is correct
63 Correct 1043 ms 53140 KB Output is correct
64 Correct 1027 ms 53140 KB Output is correct
65 Correct 898 ms 53140 KB Output is correct
66 Correct 481 ms 53140 KB Output is correct
67 Correct 430 ms 53140 KB Output is correct
68 Correct 414 ms 53140 KB Output is correct
69 Correct 418 ms 53140 KB Output is correct
70 Correct 412 ms 53140 KB Output is correct
71 Correct 427 ms 53140 KB Output is correct
72 Correct 418 ms 53140 KB Output is correct
73 Correct 451 ms 53140 KB Output is correct
74 Correct 424 ms 53140 KB Output is correct
75 Correct 2181 ms 53140 KB Output is correct
76 Correct 2102 ms 53140 KB Output is correct
77 Correct 2129 ms 53140 KB Output is correct
78 Correct 2115 ms 53140 KB Output is correct
79 Correct 2060 ms 53140 KB Output is correct
80 Correct 2112 ms 53140 KB Output is correct
81 Correct 2623 ms 53140 KB Output is correct
82 Correct 2655 ms 53140 KB Output is correct
83 Correct 2649 ms 53140 KB Output is correct
84 Correct 2564 ms 53140 KB Output is correct
85 Correct 2525 ms 53140 KB Output is correct
86 Correct 2584 ms 53140 KB Output is correct
87 Correct 2554 ms 53140 KB Output is correct
88 Execution timed out 3031 ms 63720 KB Time limit exceeded
89 Halted 0 ms 0 KB -