oj.uz

Submission #77770

# Submission time Handle Problem Language Result Execution time Memory
77770 2018-09-30T09:48:34 Z autumn_eel Circle selection (APIO18_circle_selection) C++14
87 / 100
 3000 ms 118352 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;
	double 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{
	double bbox[2][2];
	node*l,*r;
	vector<Circle*>circle;
};
double area(double bbox[2][2]){
	return (bbox[1][0]-bbox[0][0])*(bbox[1][1]-bbox[0][1]);
}
void init(double bbox[2][2]){
	bbox[0][0]=bbox[0][1]=INF;
	bbox[1][0]=bbox[1][1]=-INF;
}
void mergeAABB(double bbox[2][2],double bbox2[2][2],double 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,double 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.

inline void setleaf(vector<Circle*>circle,node*n){
	n->l=n->r=NULL;
	n->circle=circle;
}
void build(vector<Circle*>&circle,node*n,int depth){
	createAABB(circle,n->bbox);
	double Min=t_tri*circle.size();
	int axis=(depth/7)%2,id=-1;
	double s=area(n->bbox);
	if(depth%7==0){
		sort(circle.begin(),circle.end(),[&](auto a,auto b){
			if(axis==0)return a->x<b->x;
			return a->y<b->y;
		});
	}
	double box[2][2];init(box);
	vector<double>s1(circle.size());
	rep(j,circle.size()){
		mergeAABB(box,circle[j]->bbox,box);
		s1[j]=area(box);
	}
	init(box);
	vector<double>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++){
		double 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;
			id=j;
		}
	}
	if(id==-1){
		setleaf(circle,n);
	}
	else{
		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,depth+1);
		build(right,n->r,depth+1);
	}
}
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);
}
inline bool intersect(Circle*c1,Circle*c2){
	return pow(c1->x-c2->x,2)+pow(c1->y-c2->y,2)<=pow(c1->r+c2->r,2);
}
inline bool intersect(double bbox1[2][2],double bbox2[2][2]){
	if(bbox1[1][0]<bbox2[0][0]||bbox2[1][0]<bbox1[0][0]||bbox1[1][1]<bbox2[0][1]||bbox2[1][1]<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(){
	auto start=chrono::system_clock::now();
	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,0);
	//~ cout<<clock()-a<<endl;
	//~ 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("");
	auto end=chrono::system_clock::now();
	double tim=chrono::duration_cast<chrono::milliseconds>(end-start).count();
	//~ fprintf(stderr,"time = %.3lf sec\n",tim/1000);
}

Compilation message

circle_selection.cpp: In function 'void build(std::vector<Circle*>&, node*, int)':
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:64:2: note: in expansion of macro 'rep'
  rep(j,circle.size()){
  ^~~
circle_selection.cpp:74:17: 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:123:3: note: in expansion of macro 'rep'
   rep(i,circle.size()){
   ^~~
circle_selection.cpp: In function 'int main()':
circle_selection.cpp:170:9: warning: unused variable 'tim' [-Wunused-variable]
  double tim=chrono::duration_cast<chrono::milliseconds>(end-start).count();
         ^~~
circle_selection.cpp:141: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:144: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 26 ms 30072 KB Output is correct
2 Correct 26 ms 30072 KB Output is correct
3 Correct 27 ms 30192 KB Output is correct
4 Correct 28 ms 30220 KB Output is correct
5 Correct 30 ms 30240 KB Output is correct
6 Correct 26 ms 30240 KB Output is correct
7 Correct 26 ms 30240 KB Output is correct
8 Correct 26 ms 30288 KB Output is correct
9 Correct 27 ms 30288 KB Output is correct
10 Correct 26 ms 30368 KB Output is correct
11 Correct 27 ms 30368 KB Output is correct
12 Correct 27 ms 30368 KB Output is correct
13 Correct 25 ms 30368 KB Output is correct
14 Correct 27 ms 30368 KB Output is correct
15 Correct 27 ms 30368 KB Output is correct
16 Correct 27 ms 30396 KB Output is correct
17 Correct 27 ms 30472 KB Output is correct
18 Correct 28 ms 30472 KB Output is correct
19 Correct 34 ms 31064 KB Output is correct
20 Correct 31 ms 31064 KB Output is correct
21 Correct 34 ms 31064 KB Output is correct
22 Correct 36 ms 31064 KB Output is correct
23 Correct 37 ms 31064 KB Output is correct
24 Correct 36 ms 31064 KB Output is correct
25 Correct 36 ms 31064 KB Output is correct
26 Correct 36 ms 31064 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 584 ms 66772 KB Output is correct
2 Correct 565 ms 66772 KB Output is correct
3 Correct 567 ms 66832 KB Output is correct
4 Correct 556 ms 66832 KB Output is correct
5 Correct 615 ms 67116 KB Output is correct
6 Correct 749 ms 68072 KB Output is correct
7 Correct 655 ms 68072 KB Output is correct
8 Correct 668 ms 68072 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 68072 KB Output is correct
2 Correct 323 ms 68072 KB Output is correct
3 Correct 1148 ms 70088 KB Output is correct
4 Correct 1205 ms 70088 KB Output is correct
5 Correct 1064 ms 70088 KB Output is correct
6 Correct 436 ms 70088 KB Output is correct
7 Correct 208 ms 70088 KB Output is correct
8 Correct 61 ms 70088 KB Output is correct
9 Correct 1137 ms 70436 KB Output is correct
10 Correct 954 ms 70436 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1087 ms 70436 KB Output is correct
2 Correct 1046 ms 70436 KB Output is correct
3 Correct 719 ms 70436 KB Output is correct
4 Correct 1083 ms 70436 KB Output is correct
5 Correct 1060 ms 70436 KB Output is correct
6 Correct 710 ms 70436 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 30072 KB Output is correct
2 Correct 26 ms 30072 KB Output is correct
3 Correct 27 ms 30192 KB Output is correct
4 Correct 28 ms 30220 KB Output is correct
5 Correct 30 ms 30240 KB Output is correct
6 Correct 26 ms 30240 KB Output is correct
7 Correct 26 ms 30240 KB Output is correct
8 Correct 26 ms 30288 KB Output is correct
9 Correct 27 ms 30288 KB Output is correct
10 Correct 26 ms 30368 KB Output is correct
11 Correct 27 ms 30368 KB Output is correct
12 Correct 27 ms 30368 KB Output is correct
13 Correct 25 ms 30368 KB Output is correct
14 Correct 27 ms 30368 KB Output is correct
15 Correct 27 ms 30368 KB Output is correct
16 Correct 27 ms 30396 KB Output is correct
17 Correct 27 ms 30472 KB Output is correct
18 Correct 28 ms 30472 KB Output is correct
19 Correct 34 ms 31064 KB Output is correct
20 Correct 31 ms 31064 KB Output is correct
21 Correct 34 ms 31064 KB Output is correct
22 Correct 36 ms 31064 KB Output is correct
23 Correct 37 ms 31064 KB Output is correct
24 Correct 36 ms 31064 KB Output is correct
25 Correct 36 ms 31064 KB Output is correct
26 Correct 36 ms 31064 KB Output is correct
27 Correct 41 ms 70436 KB Output is correct
28 Correct 41 ms 70436 KB Output is correct
29 Correct 42 ms 70436 KB Output is correct
30 Correct 48 ms 70436 KB Output is correct
31 Correct 47 ms 70436 KB Output is correct
32 Correct 47 ms 70436 KB Output is correct
33 Correct 197 ms 70436 KB Output is correct
34 Correct 181 ms 70436 KB Output is correct
35 Correct 185 ms 70436 KB Output is correct
36 Correct 333 ms 70436 KB Output is correct
37 Correct 326 ms 70436 KB Output is correct
38 Correct 348 ms 70436 KB Output is correct
39 Correct 331 ms 70436 KB Output is correct
40 Correct 309 ms 70436 KB Output is correct
41 Correct 307 ms 70436 KB Output is correct
42 Correct 209 ms 70436 KB Output is correct
43 Correct 291 ms 70436 KB Output is correct
44 Correct 283 ms 70436 KB Output is correct
45 Correct 274 ms 70436 KB Output is correct
46 Correct 291 ms 70436 KB Output is correct
47 Correct 330 ms 70436 KB Output is correct
48 Correct 282 ms 70436 KB Output is correct
49 Correct 284 ms 70436 KB Output is correct
50 Correct 280 ms 70436 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 30072 KB Output is correct
2 Correct 26 ms 30072 KB Output is correct
3 Correct 27 ms 30192 KB Output is correct
4 Correct 28 ms 30220 KB Output is correct
5 Correct 30 ms 30240 KB Output is correct
6 Correct 26 ms 30240 KB Output is correct
7 Correct 26 ms 30240 KB Output is correct
8 Correct 26 ms 30288 KB Output is correct
9 Correct 27 ms 30288 KB Output is correct
10 Correct 26 ms 30368 KB Output is correct
11 Correct 27 ms 30368 KB Output is correct
12 Correct 27 ms 30368 KB Output is correct
13 Correct 25 ms 30368 KB Output is correct
14 Correct 27 ms 30368 KB Output is correct
15 Correct 27 ms 30368 KB Output is correct
16 Correct 27 ms 30396 KB Output is correct
17 Correct 27 ms 30472 KB Output is correct
18 Correct 28 ms 30472 KB Output is correct
19 Correct 34 ms 31064 KB Output is correct
20 Correct 31 ms 31064 KB Output is correct
21 Correct 34 ms 31064 KB Output is correct
22 Correct 36 ms 31064 KB Output is correct
23 Correct 37 ms 31064 KB Output is correct
24 Correct 36 ms 31064 KB Output is correct
25 Correct 36 ms 31064 KB Output is correct
26 Correct 36 ms 31064 KB Output is correct
27 Correct 584 ms 66772 KB Output is correct
28 Correct 565 ms 66772 KB Output is correct
29 Correct 567 ms 66832 KB Output is correct
30 Correct 556 ms 66832 KB Output is correct
31 Correct 615 ms 67116 KB Output is correct
32 Correct 749 ms 68072 KB Output is correct
33 Correct 655 ms 68072 KB Output is correct
34 Correct 668 ms 68072 KB Output is correct
35 Correct 32 ms 68072 KB Output is correct
36 Correct 323 ms 68072 KB Output is correct
37 Correct 1148 ms 70088 KB Output is correct
38 Correct 1205 ms 70088 KB Output is correct
39 Correct 1064 ms 70088 KB Output is correct
40 Correct 436 ms 70088 KB Output is correct
41 Correct 208 ms 70088 KB Output is correct
42 Correct 61 ms 70088 KB Output is correct
43 Correct 1137 ms 70436 KB Output is correct
44 Correct 954 ms 70436 KB Output is correct
45 Correct 1087 ms 70436 KB Output is correct
46 Correct 1046 ms 70436 KB Output is correct
47 Correct 719 ms 70436 KB Output is correct
48 Correct 1083 ms 70436 KB Output is correct
49 Correct 1060 ms 70436 KB Output is correct
50 Correct 710 ms 70436 KB Output is correct
51 Correct 41 ms 70436 KB Output is correct
52 Correct 41 ms 70436 KB Output is correct
53 Correct 42 ms 70436 KB Output is correct
54 Correct 48 ms 70436 KB Output is correct
55 Correct 47 ms 70436 KB Output is correct
56 Correct 47 ms 70436 KB Output is correct
57 Correct 197 ms 70436 KB Output is correct
58 Correct 181 ms 70436 KB Output is correct
59 Correct 185 ms 70436 KB Output is correct
60 Correct 333 ms 70436 KB Output is correct
61 Correct 326 ms 70436 KB Output is correct
62 Correct 348 ms 70436 KB Output is correct
63 Correct 331 ms 70436 KB Output is correct
64 Correct 309 ms 70436 KB Output is correct
65 Correct 307 ms 70436 KB Output is correct
66 Correct 209 ms 70436 KB Output is correct
67 Correct 291 ms 70436 KB Output is correct
68 Correct 283 ms 70436 KB Output is correct
69 Correct 274 ms 70436 KB Output is correct
70 Correct 291 ms 70436 KB Output is correct
71 Correct 330 ms 70436 KB Output is correct
72 Correct 282 ms 70436 KB Output is correct
73 Correct 284 ms 70436 KB Output is correct
74 Correct 280 ms 70436 KB Output is correct
75 Correct 668 ms 70436 KB Output is correct
76 Correct 645 ms 70436 KB Output is correct
77 Correct 660 ms 70436 KB Output is correct
78 Correct 674 ms 70436 KB Output is correct
79 Correct 729 ms 70436 KB Output is correct
80 Correct 641 ms 70436 KB Output is correct
81 Correct 1143 ms 70436 KB Output is correct
82 Correct 1107 ms 70436 KB Output is correct
83 Correct 1143 ms 70436 KB Output is correct
84 Correct 1101 ms 70436 KB Output is correct
85 Correct 1092 ms 70436 KB Output is correct
86 Correct 1090 ms 70436 KB Output is correct
87 Correct 1147 ms 70436 KB Output is correct
88 Correct 1139 ms 108064 KB Output is correct
89 Correct 1149 ms 114468 KB Output is correct
90 Correct 1187 ms 118352 KB Output is correct
91 Correct 1192 ms 118352 KB Output is correct
92 Correct 1209 ms 118352 KB Output is correct
93 Correct 1475 ms 118352 KB Output is correct
94 Execution timed out 3048 ms 118352 KB Time limit exceeded
95 Halted 0 ms 0 KB -