【凸包+模拟退火】 HDOJ 2440 Watch out the Animal

先求个凸包，然后模拟退火一下即可。。。精度和时间要求都很低。。。

#include <iostream>  
#include <queue>  
#include <stack>  
#include <map>  
#include <set>  
#include <bitset>  
#include <cstdio>  
#include <algorithm>  
#include <cstring>  
#include <climits>  
#include <cstdlib>
#include <cmath>
#include <time.h>
#define maxn 105
#define maxm 40005
#define eps 1e-10
#define mod 1000000007
#define INF 999999999
#define lowbit(x) (x&(-x))
#define mp mark_pair
#define ls o<<1
#define rs o<<1 | 1
#define lson o<<1, L, mid  
#define rson o<<1 | 1, mid+1, R  
typedef long long LL;
//typedef int LL;
using namespace std;
LL qpow(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base;base=base*base;b/=2;}return res;}
LL powmod(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base%mod;base=base*base%mod;b/=2;}return res;}
void scanf(int &__x){__x=0;char __ch=getchar();while(__ch==' '||__ch=='\n')__ch=getchar();while(__ch>='0'&&__ch<='9')__x=__x*10+__ch-'0',__ch = getchar();}
LL gcd(LL _a, LL _b){if(!_b) return _a;else return gcd(_b, _a%_b);}
// head

struct Point
{
	double x, y;
	Point(double x = 0, double y = 0) : x(x), y(y) { }
	bool operator < (const Point &a) const {  
        return a.x < x || (a.x == x && a.y < y);  
    }  
};
typedef Point Vector;

Vector operator + (Vector A, Vector B)   
{  
    return Vector(A.x + B.x, A.y + B.y);  
}  
Vector operator - (Vector A, Vector B)  
{  
    return Vector(A.x - B.x, A.y - B.y);  
}  
Vector operator * (Vector A, double p)  
{  
    return Vector(A.x * p, A.y * p);  
}  
Vector operator / (Vector A, double p)  
{  
    return Vector(A.x / p, A.y / p);  
}  
int dcmp(double x)  
{  
    if(fabs(x) < eps) return 0;  
    else return x < 0 ? -1 : 1;  
}  
double Dot(Vector A, Vector B)  
{  
    return A.x * B.x + A.y * B.y;  
}  
double Length(Vector A)  
{  
    return sqrt(Dot(A, A));  
}  
double Angle(Vector A, Vector B)  
{  
    return acos(Dot(A, B) / Length(A) / Length(B));  
}  
double Cross(Vector A, Vector B)  
{  
    return A.x * B.y - A.y * B.x;  
} 
int ConvexHull(Point *p, int n, Point *ch)  
{  
    sort(p, p+n);  
    int m = 0;  
    for(int i = 0; i < n; i++) {  
        while(m > 1 && Cross(ch[m-1] - ch[m-2], p[i] - ch[m-2]) <= 0) m--;  
        ch[m++] = p[i];  
    }  
    int k = m;  
    for(int i = n-2; i >= 0; i--) {  
        while(m > k && Cross(ch[m-1] - ch[m-2], p[i] - ch[m-2]) <= 0) m--;  
        ch[m++] = p[i];  
    }  
    if(n > 1) m--;  
    return m;  
}

int dir[8][2] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}, {1, 1}, {1, -1}, {-1, 1}, {-1, -1}};
struct Point p[maxn], poly[maxn];
int m, n;
void read(void)
{
	scanf("%d", &m);
	for(int i = 0; i < m; i++) scanf("%lf%lf", &p[i].x, &p[i].y);
	n = ConvexHull(p, m, poly);
}
double calculate(double x, double y)
{
	double ans = 0;
	for(int i = 0; i < n; i++) {
		double t1 = x - poly[i].x;
		double t2 = y - poly[i].y;
		double t = t1 * t1 + t2 * t2;
		t = sqrt(t);
		ans += t;
	}
	return ans;
}
void work(void)
{
	double step = 10000.0, next = 0.9;
	double x, y, xx, yy, dis;
	x = poly[0].x, y = poly[0].y;
	dis = calculate(x, y);
	while(step > eps) {
		for(int i = 0; i < 8; i++) {
			xx = x + step * dir[i][0];
			yy = y + step * dir[i][1];
			double t = calculate(xx, yy);
			if(dis > t) dis = t, x = xx, y = yy;
		}
		step *= next;
	}
	printf("%.0f\n", dis);
}
int main(void)
{
	int _;
	while(scanf("%d", &_)!=EOF) {
		while(_--) {
			read();
			work();
			if(_) printf("\n");
		}
	}
	return 0;
}