bzoj上300题辣!!!~\(≧▽≦)/~啦啦啦上图纪念!!!
本来bzoj2618打算第299个做的,然后日常翻题解的时候发现popoqqq居然是第300题做的bzoj2618!!为了和大爷同步我就先水另外一题,然后也在第300题A可bzoj2618!!和大爷的300题一样是不是有什么含义(难道是一个flag?)
多个凸多边形求交集,实际上就是若干条直线求半平面交。裸题。
AC代码如下:
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#define N 1005
using namespace std;
struct point{ double x,y; }p[N]; int n,m,cnt;
struct line{ point p,v; double k; }l[N],q[N];
point operator -(point u,point v){
u.x-=v.x; u.y-=v.y; return u;
}
double crs(point u,point v){ return u.x*v.y-u.y*v.x; }
point itr(line x,line y){
double t=crs(y.v,x.p-y.p)/crs(x.v,y.v);
x.p.x+=t*x.v.x; x.p.y+=t*x.v.y; return x.p;
}
bool ok(line x,line y,line t){
return crs(t.v,itr(x,y)-t.p)<0;
}
bool cmp(line x,line y){
return x.k<y.k || x.k==y.k && crs(x.v,y.p-x.p)<0;
}
int main(){
scanf("%d",&m); int i,j;
for (i=1; i<=m; i++){
scanf("%d",&cnt);
for (j=1; j<=cnt; j++) scanf("%lf%lf",&p[j].x,&p[j].y);
for (j=1; j<=cnt; j++){
l[++n].p=p[j]; l[n].v=p[j%cnt+1]-p[j];
l[n].k=atan2(l[n].v.y,l[n].v.x);
}
}
sort(l+1,l+n+1,cmp); cnt=1;
for (i=2; i<=n; i++)
if (l[i].k!=l[cnt].k) l[++cnt]=l[i];
int head=1,tail=2; q[1]=l[1]; q[2]=l[2];
for (i=3; i<=cnt; i++){
while (head<tail && ok(q[tail-1],q[tail],l[i])) tail--;
while (head<tail && ok(q[head+1],q[head],l[i])) head++;
q[++tail]=l[i];
}
while (head<tail && ok(q[tail-1],q[tail],q[head])) tail--;
while (head<tail && ok(q[head+1],q[head],q[tail])) head++;
n=0;
for (i=head; i<tail; i++) p[++n]=itr(q[i],q[i+1]);
p[++n]=itr(q[head],q[tail]);
double ans=0; p[n+1]=p[1];
for (i=1; i<=n; i++) ans+=crs(p[i],p[i+1]);
printf("%.3f\n",ans/2);
return 0;
}
by lych
2016.3.3