poj_2420_A Star not a Tree?

#include<iostream>    
#include<sstream>    
#include<string>    
#include<vector>    
#include<list>    
#include<set>    
#include<map>  
#include<stack>    
#include<queue>    
#include<algorithm>    
#include<numeric>    
#include<cmath>  
#include<cstdio>  
#include<cstdlib>  
#include<cstring>
#include<ctime>
#pragma warning(disable:4996) 
#pragma warning(disable:4996) 
#define EPS 1e-8
#define INF 2000000000
#define PI acos(-1.0)
const int N = 30;
const int M = 30;
using namespace std;
class Point 
{
public:
	double x, y;
};
double dist(const Point &p1,const Point &p2)
{
	return sqrt((p1.x - p2.x)*(p1.x - p2.x) + (p1.y - p2.y)*(p1.y - p2.y));
}
double getDist(const Point&p,const vector<Point>&point)
{
	double ans = 0;
	for (size_t i = 0; i != point.size(); i++)
	{
		ans += dist(p, point[i]);
	}
	return ans;
}
int main() 
{
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	int n; cin >> n;
	vector<Point>point(n);
	double max_x=-2000000000.0, min_x=2000000000.0, max_y = -2000000000.0, min_y = 2000000000.0;
	for (int i = 0; i < n; i++)
	{
		cin >> point[i].x >> point[i].y;
		max_x = max(max_x, point[i].x);
		min_x = min(min_x, point[i].x);
		max_y = max(max_y, point[i].y);
		min_y = min(min_y, point[i].y);
	}
	vector<Point>random(N);
	vector<double>distance(N);
	for (int i = 0; i < N; i++)
	{
		random[i].x = (double)(rand() % 1000) / 1000.0*(max_x - min_x);
		random[i].y= (double)(rand() % 1000) / 1000.0*(max_y - min_y);
		distance[i] = getDist(random[i], point);
	}
	double delta = max(max_x - min_x, max_y - min_y) / sqrt(1.0*n);
	double rate = 0.85;
	while (delta > 1e-3)
	{
		for (int i = 0; i < N; i++)
		{
			for (int j = 0; j < M; j++)
			{
				Point p;
				double theta = (double)(rand() % 1000) / 1000.0*2.0*PI;
				p.x = random[i].x + cos(theta)*delta;
				p.y = random[i].y + sin(theta)*delta;
				double dist = getDist(p, point);
				if (dist < distance[i])
				{
					distance[i] = dist;
					random[i] = p;
				}
			}
		}
		delta *= rate;
	}
	double ans = 2000000000.0;
	for (int i = 0; i < N; i++)
	{
		ans = min(ans, distance[i]);
	}
	printf("%.0lf\n", ans);
	return 0;
}