poj1379Run Away【模拟退火】

Language: Default Run Away Time Limit: 3000MS   Memory Limit: 65536K Total Submissions: 7677   Accepted: 2335 Description One of the traps we will encounter in the Pyramid is located in the Large Room. A lot of small holes are drilled into the floor. They look completely harmless at the first sight. But when activated, they start to throw out very hot java, uh ... pardon, lava. Unfortunately, all known paths to the Center Room (where the Sarcophagus is) contain a trigger that activates the trap. The ACM were not able to avoid that. But they have carefully monitored the positions of all the holes. So it is important to find the place in the Large Room that has the maximal distance from all the holes. This place is the safest in the entire room and the archaeologist has to hide there. Input The input consists of T test cases. The number of them (T) is given on the first line of the input file. Each test case begins with a line containing three integers X, Y, M separated by space. The numbers satisfy conditions: 1 <= X,Y <=10000, 1 <= M <= 1000. The numbers X and Yindicate the dimensions of the Large Room which has a rectangular shape. The number M stands for the number of holes. Then exactly M lines follow, each containing two integer numbers Ui and Vi (0 <= Ui <= X, 0 <= Vi <= Y) indicating the coordinates of one hole. There may be several holes at the same position. Output Print exactly one line for each test case. The line should contain the sentence "The safest point is (P, Q)." where P and Qare the coordinates of the point in the room that has the maximum distance from the nearest hole, rounded to the nearest number with exactly one digit after the decimal point (0.05 rounds up to 0.1). Sample Input 3 1000 50 1 10 10 100 100 4 10 10 10 90 90 10 90 90 3000 3000 4 1200 85 63 2500 2700 2650 2990 100 Sample Output The safest point is (1000.0, 50.0). The safest point is (50.0, 50.0). The safest point is (1433.0, 1669.8).

题意：在给定的区域内确定一个点使其到所给点所有点的最小距离最大

解题思路：模拟退火；

#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<ctime>
#include<algorithm>
#include<cstring>
#define eps 1e-3
#define PI acos(-1.0)
#define inf 0x3f3f3f3f
using namespace std;
const int NUM=30;
double MAX(double a,double b){
	return a>b?a:b;
}
double MIN(double a,double b){
	return a<b?a:b;
}
double dist(double x1,double y1,double x2,double y2){
	return sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1));
}
struct point{
	double x,y;
}A[1010],B[1010];
double d[1010];
int main()
{
	int t,X,Y,M,i,j,k,ans;
	srand((unsigned)time(NULL));
	scanf("%d",&t);
	while(t--){
		scanf("%d%d%d",&X,&Y,&M);
		for(i=0;i<M;++i){
			scanf("%lf%lf",&A[i].x,&A[i].y);
		}
		for(i=0;i<NUM;++i){//随机选取NUM个可能点 
			B[i].x=double(rand()%1000+1)/1000.0*X;
			B[i].y=double(rand()%1000+1)/1000.0*Y;
			d[i]=inf;
			for(j=0;j<M;++j){//确定选取的点与陷阱相距的最短距离 
				d[i]=MIN(d[i],dist(B[i].x,B[i].y,A[j].x,A[j].y));
			}
		}
		double dmax=double(MAX(X*1.0,Y*1.0))/sqrt(1.0*M);//取相距最大距离； 
		while(dmax>eps){
			for(i=0;i<NUM;++i){
				double xx=B[i].x,yy=B[i].y;
				for(j=0;j<NUM;++j){
					double angle=double(rand()%1000+1)/1000.0*2.0*PI;
					double mx=dmax*cos(angle);//以dmax为半径向外扩展随机寻找NUM个新点 
					double my=dmax*sin(angle);
					double newx=xx+mx,newy=yy+my;
					if(newx<eps||newx>X||newy<eps||newy>Y)continue;
					double temp=inf;
					for(k=0;k<M;++k){
						temp=MIN(temp,dist(newx,newy,A[k].x,A[k].y));
					} 
					if(temp>d[i]){//当该新点最小距离大则更新 
						d[i]=temp;B[i].x=newx;B[i].y=newy;
					}
				}
			}
			dmax*=0.8;//降温退火 
		}
		double dmin=-1;
		for(i=0;i<NUM;++i){
			if(d[i]>dmin){
				ans=i;dmin=d[i];
			}
		}
		printf("The safest point is (%.1lf, %.1lf).\n",B[ans].x,B[ans].y);
	}
	return 0;
}