多校_WHU_How Many Times hdoj3561

     这个是比赛时候写的。她们在写Bomb时我写完了1008，然后给我说了这题的大概题意。100的数据规模，应该是n^3，但是怎么都没想到咋做。后来决定用扫描线扫，代码量估计巨大。开始写，各种纠结。她们继续调1008，我就开始跟圆做斗争。写完之后队友出个数据错了，继续调，后来终于好了，一看，还剩三分钟了。交了，畸形的代码1A。

     大概就是把圆的最大最小x值，及交点的x值作为扫描线，每条扫描线再用线段覆盖的方法求覆盖的最大值。因为端点是浮点的，所以先离散化了然后求，代码量有点大。

#include<cstdio> #include<cstring> #include<cmath> #include<algorithm> #define eps 1e-8 using namespace std; struct point{ double x,y; }; struct circle{//circle point mid; int r; }; struct N{ int id,rank; double val; }; int n; circle cir[105]; N temp[210]; double x[20300];//swapline double dist(point a,point b) { double x=a.x-b.x,y=a.y-b.y; return sqrt(x*x+y*y); } point rotate(point a,double angle,point b) { double x=b.x-a.x,y=b.y-a.y; point tmp; tmp.x = x*cos(angle) - y*sin(angle) + a.x; tmp.y = x*sin(angle) + y*cos(angle) + a.y; return tmp; } bool circlecross(circle a,circle b) { double mydis=dist(a.mid,b.mid); if(fabs(mydis)<eps) return false; if(mydis<=a.r+b.r+eps&&mydis>=max(a.r,b.r)-min(a.r,b.r)-eps) return true; else return false; } //在相交判定的基础上，求出两圆交点。 void CirCross(circle a,circle b,point &mya,point &myb) { if(a.r<b.r) swap(a,b); double dis=dist(a.mid,b.mid); double angle=acos((a.r*a.r+dis*dis-b.r*b.r)/(2.0*a.r*dis)); double dx=(b.mid.x-a.mid.x)/dis,dy=(b.mid.y-a.mid.y)/dis; point myp; myp.x=a.mid.x+dx*a.r; myp.y=a.mid.y+dy*a.r; mya= rotate(a.mid,angle,myp); myb= rotate(a.mid,-angle,myp); } bool linecirclecross(double x,circle a) { if ((x>a.mid.x-a.r&&x<a.mid.x+a.r)||fabs(x-a.mid.x-a.r)<eps||fabs(x-a.mid.x+a.r)<eps) return true; return false; } bool cmp(N a,N b) { return a.val<b.val; } bool cmp2(N a,N b) { if (abs(a.id)==abs(b.id)) return a.id<b.id; return abs(a.id)<abs(b.id); } int slove(int id) { int i,j,cnt=1; double tmp,tmpx; point seg[105]; int cover[210],ft[105][2]; for (i=0;i<n;i++) if (linecirclecross(x[id],cir[i])){ tmpx=cir[i].mid.x-x[id]; tmp=sqrt(cir[i].r*cir[i].r-tmpx*tmpx); seg[cnt].x=-tmp+cir[i].mid.y; seg[cnt].y=tmp+cir[i].mid.y; temp[2*cnt].id=-cnt; temp[2*cnt].val=seg[cnt].x; temp[2*cnt-1].id=cnt; temp[2*cnt-1].val=seg[cnt].y; cnt++; } cnt--; sort(temp+1,temp+2*cnt+1,cmp); temp[1].rank=1; int xx=2; for (i=2;i<=2*cnt;i++){ if (fabs(temp[i].val-temp[i-1].val)>eps) temp[i].rank=xx++; else temp[i].rank=temp[i-1].rank; } sort(temp+1,temp+2*cnt+1,cmp2); memset(cover,0,sizeof(cover)); for (i=1;i<=cnt;i++) for (j=temp[2*i-1].rank;j<=temp[2*i].rank;j++) cover[j]++; int ans=0; for (i=1;i<xx;i++) if (cover[i]>ans) ans=cover[i]; return ans; } int main() { int i,j,cnt,tmpcnt;//the number of swapline while (scanf("%d",&n)!=EOF){ memset(cir,0,sizeof(cir)); memset(x,0,sizeof(x)); cnt=0; for (i=0;i<n;i++){ scanf("%lf%lf%d",&cir[i].mid.x,&cir[i].mid.y,&cir[i].r); x[cnt++]=cir[i].mid.x-cir[i].r; x[cnt++]=cir[i].mid.x+cir[i].r; } point a,b; for (i=0;i<n;i++) for (j=i+1;j<n;j++) if (circlecross(cir[i],cir[j])){ CirCross(cir[i],cir[j],a,b); x[cnt++]=a.x; x[cnt++]=b.x; } sort(x,x+cnt); tmpcnt=1; for (i=1;i<cnt;i++)//扫描线去重 if (fabs(x[i]-x[i-1])>eps) x[tmpcnt++]=x[i]; cnt=tmpcnt;//swapline ok int ans=0,sum; for (i=0;i<cnt;i++){ sum=slove(i); if (sum>ans) ans=sum; } printf("%d/n",ans); } return 0; }

     下面是根据解题报告的思路写的。计算出两个圆的交点，看交点被多少个圆覆盖取最大，但是等大的圆或者包含的圆要特殊处理，开始没想到，WA了一次。

#include<cstdio> #include<cstring> #include<algorithm> #include<cmath> #define eps 1e-8 using namespace std; struct P{ double x,y; }; struct C{ P mid; double r; }; int n; C cir[105]; double Dis(P a,P b) { return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y)); } bool CirCro(C a,C b) { double rdis=Dis(a.mid,b.mid); double r1=max(a.r,b.r),r2=min(a.r,b.r); if ((rdis>r1-r2&&rdis<r1+r2)||fabs(r1+r2-rdis)<eps||fabs(r1-r2-rdis)<eps) return true; return false; } P Rotate(P a,double theta,P b) { P tmp; double x=b.x-a.x,y=b.y-a.y; tmp.x=a.x+x*cos(theta)-y*sin(theta); tmp.y=a.y+x*sin(theta)+y*cos(theta); return tmp; } bool CirCroPoi(C a,C b,P &p1,P &p2) { double r1=max(a.r,b.r),r2=min(a.r,b.r),dis=Dis(a.mid,b.mid); double theta=acos((dis*dis+r1*r1-r2*r2)/(2*dis*r1)); double dx=(b.mid.x-a.mid.x)/dis,dy=(b.mid.y-a.mid.y)/dis; P tmp; tmp.x=a.mid.x+dx*a.r; tmp.y=a.mid.y+dy*a.r; p1=Rotate(a.mid,theta,tmp); p2=Rotate(a.mid,-theta,tmp); } bool PoiInCir(C c,P p) { double dis=Dis(p,c.mid); if ((dis<c.r)||fabs(dis-c.r)<eps) return true; return false; } bool CirInCir(C a,C b) { double r1=max(a.r,b.r),r2=min(a.r,b.r),dis=Dis(a.mid,b.mid); if ((dis<r1-r2)||(fabs(a.mid.x-b.mid.x)<eps&&fabs(a.mid.y-b.mid.y)<eps)) return true; return false; } int main() { int i,j,k,tmp1,tmp2,ans; P point1,point2; while (scanf("%d",&n)!=EOF){ for (i=0;i<n;i++) scanf("%lf%lf%lf",&cir[i].mid.x,&cir[i].mid.y,&cir[i].r); if (n==1) ans=1; else ans=0; for (i=0;i<n;i++) for (j=i+1;j<n;j++){ if (CirInCir(cir[i],cir[j]))//one circle is in another circle point1=cir[i].mid,point2=cir[j].mid; else if (CirCro(cir[i],cir[j])){//the two circle cross each other CirCroPoi(cir[i],cir[j],point1,point2); tmp1=tmp2=0; for (k=0;k<n;k++){ if (PoiInCir(cir[k],point1)) tmp1++; if (PoiInCir(cir[k],point2)) tmp2++; } if (tmp1>ans) ans=tmp1; if (tmp2>ans) ans=tmp2; } printf("%d/n",ans); } return 0; }