#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<iostream>
#include<math.h>
#define inf 0x3f3f3f;
#define Pi 3.141592
#define end 0.000001
using namespace std;
double fd(int x0,int y0,int x,int y)
{
if(x0 > x && y0 > y) return Pi + atan( 1.0 * (y - y0)/(x - x0) );
if(x0 > x && y0 < y) return Pi + atan( 1.0 * (y - y0)/(x - x0) );
if(x0 < x && y0 < y) return atan( 1.0 * (y - y0)/(x - x0) );
if(x0 < x && y0 > y) return 2 * Pi + atan( 1.0 * (y - y0)/(x - x0) );
if(x - x0 == 0 && y - y0 > 0)return Pi * 0.5;
if(x0 - x == 0 && y0 - y > 0)return Pi*1.5;
if(x > x0 && y0 == y)return 0;
if(x < x0 && y0 == y)return Pi;
}
int comp(const void *a,const void *b){
return *(double *)a>*(double *)b?1:-1;
}
int main()
{
bool vis[100];
int test,n,x0,y0,x[100],y[100],ans,res;
double f,ds[100];
test = 0;
while(scanf( "%d%d%d%lf",&n,&x0,&y0,&f)&&(n != 0 || x0 != 0 || y0 != 0 || f != 0))
{
test ++;
for(int i = 0 ; i < n ; i++ )
{
scanf("%d%d",&x[i],&y[i]);
ds[i] = fd(x0,y0,x[i],y[i]);
}
qsort(ds,n,sizeof(ds[0]),comp);
f=f / 180 * Pi;
res=inf;
for(int i = 0; i < n ; i++)
{
ans = 0;
memset(vis,0,sizeof(vis));
ds[0] = ds[0] + 2 * Pi;
qsort(ds,n,sizeof(ds[0]),comp);
for(int j = 0 ; j < n ; j++)
{
if(vis[j] == 1)continue;
else ans += 1;
for(int k = 0 ; k < n ; k++)
{
if(ds[j] + f > ds[k])
vis[k] = 1;
}
}
if(ans < res)res = ans ;
}
printf("Case %d: %d\n",test,res);
}
#include<stdlib.h>
#include<string.h>
#include<iostream>
#include<math.h>
#define inf 0x3f3f3f;
#define Pi 3.141592
#define end 0.000001
using namespace std;
double fd(int x0,int y0,int x,int y)
{
if(x0 > x && y0 > y) return Pi + atan( 1.0 * (y - y0)/(x - x0) );
if(x0 > x && y0 < y) return Pi + atan( 1.0 * (y - y0)/(x - x0) );
if(x0 < x && y0 < y) return atan( 1.0 * (y - y0)/(x - x0) );
if(x0 < x && y0 > y) return 2 * Pi + atan( 1.0 * (y - y0)/(x - x0) );
if(x - x0 == 0 && y - y0 > 0)return Pi * 0.5;
if(x0 - x == 0 && y0 - y > 0)return Pi*1.5;
if(x > x0 && y0 == y)return 0;
if(x < x0 && y0 == y)return Pi;
}
int comp(const void *a,const void *b){
return *(double *)a>*(double *)b?1:-1;
}
int main()
{
bool vis[100];
int test,n,x0,y0,x[100],y[100],ans,res;
double f,ds[100];
test = 0;
while(scanf( "%d%d%d%lf",&n,&x0,&y0,&f)&&(n != 0 || x0 != 0 || y0 != 0 || f != 0))
{
test ++;
for(int i = 0 ; i < n ; i++ )
{
scanf("%d%d",&x[i],&y[i]);
ds[i] = fd(x0,y0,x[i],y[i]);
}
qsort(ds,n,sizeof(ds[0]),comp);
f=f / 180 * Pi;
res=inf;
for(int i = 0; i < n ; i++)
{
ans = 0;
memset(vis,0,sizeof(vis));
ds[0] = ds[0] + 2 * Pi;
qsort(ds,n,sizeof(ds[0]),comp);
for(int j = 0 ; j < n ; j++)
{
if(vis[j] == 1)continue;
else ans += 1;
for(int k = 0 ; k < n ; k++)
{
if(ds[j] + f > ds[k])
vis[k] = 1;
}
}
if(ans < res)res = ans ;
}
printf("Case %d: %d\n",test,res);
}
}
笔记,爆搜,对于每个点,作为起点,扫描f的范围,最开始的时候写的是ds[i-1]=ds[i-1]+2*Pi;一直过不了,后来才发现,每次都进行快排以后,最小的还是ds[0];
同时,这里学习快排的用法,还有对于FD函数(自己构造那个),最开始情况没有讨论完全。
下一篇转载快排的介绍