1. 程式人生 > >2017 CCPC 秦皇島站 M題題解 ZOJ 3993 Safest Buildings

2017 CCPC 秦皇島站 M題題解 ZOJ 3993 Safest Buildings

#include<cstdio>
#include<iostream>
#include<cmath>
using namespace std;
const double eps=1e-8;
struct Point
{
    double x,y,dis;
}a[10000];
int ans[10000];
int main ()
{
    int t,n,R,r,ansr;
    scanf("%d",&t);
    while(t--)
    {
       scanf("%d %d %d",&n,&R,&r);
       if
(R>=2*r) ansr=R-2*r; else ansr=2*r-R; int sum=0,flag=0; double minn=1e7+7; for(int i=0;i<n;i++) { scanf("%lf %lf",&a[i].x,&a[i].y); a[i].dis=sqrt(a[i].x*a[i].x+a[i].y*a[i].y); if(a[i].dis<=minn) minn=a[i].dis; if
(a[i].dis<=ansr) {flag=1;ans[sum++]=i+1;} } if(flag) { printf("%d\n",sum); for(int i=0;i<sum;i++) printf(i==sum-1?"%d\n":"%d ",ans[i]); } else { sum=0; for(int i=0;i<n;i++) if(abs(a[i].dis-minn)<=eps) ans[sum++]=i+1
; printf("%d\n",sum); for(int i=0;i<sum;i++) printf(i==sum-1?"%d\n":"%d ",ans[i]); } } }