P2210 Haywire

题目

题目

思路

先随便分在2个组，接下来模拟退火计算。
code：

#include<cctype>
#include<cerrno>
#include<cfloat>
#include<ciso646>
#include<climits>
#include<clocale>
#include<cmath>
#include<csetjmp>
#include<csignal>
#include<cstdarg>
#include<cstddef>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<cassert>
#include<cwchar>
#include<cwctype>
#include<algorithm>
#include<bitset>
#include<complex>
#include<deque>
#include<exception>
#include<fstream>
#include<functional>
#include<iomanip>
#include<ios>
#include<iosfwd>
#include<iostream>
#include<istream>
#include<iterator>
#include<limits>
#include<list>
#include<locale>
#include<map>
#include<memory>
#include<new>
#include<numeric>
#include<ostream>
#include<queue>
#include<set>
#include<sstream>
#include<stack>
#include<stdexcept>
#include<streambuf>
#include<string>
#include<typeinfo>
#include<utility>
#include<valarray>
#include<vector>
using namespace std;
long long n,a[20],b[20][3];
double delta=0.9976,ans;
inline long long read()
{
    long long s=0;
	int z=1;
	char c=getchar();
    if (c=='-') z=-1;
    while ((c<'0'||c>'9')&&c!='-') c=getchar();
    if (c=='-') z=-1,c=getchar();
    while (c>='0'&&c<='9') s=(s<<1)+(s<<3)+(c^48),c=getchar();
    return z*s;
}
inline double Fread()
{
    char c=getchar();
	int flag=1;
	double s=0;
    while ((!(c>='0'&&c<='9'))&&c!='-') c=getchar();
    if (c=='-') flag=-1,c=getchar();
    while (c>='0'&&c<='9') s=s*10+(c^48),c=getchar();
    if (c=='.')
	{
		c=getchar();
		for (int x=10;c>='0'&&c<='9';x=(x<<3)+(x<<1)) s+=(double)(c^48)*1.0/x,c=getchar();
	}
    return s*flag;
}
double jl(double x,double y,double x2,double y2)
{
	return sqrt((x-x2)*(x-x2)+(y-y2)*(y-y2));
}
int kyx()
{
	int QuantAsk=0;
	for (int i=1;i<=n;i++)
	{
		QuantAsk+=abs(a[i]-a[b[i][1]])+abs(a[i]-a[b[i][0]])+abs(a[i]-a[b[i][2]]);
	}
	return QuantAsk/2;
}
void SA()
{
	int wj2,lyw2;
	for (double time=35000;time>1e-18;time*=delta)
	{
		wj2=rand()%n+1,lyw2=rand()%n+1;
		swap(a[wj2],a[lyw2]);
		double u=kyx(),del=u-ans;
		if (del<0) ans=u;
		else if (exp(-del/time)*RAND_MAX>rand()) swap(a[wj2],a[lyw2]);
	}
	return;
}
int main()
{
	srand(20141026);
	n=read();
	ans=1e9;
	for (int i=1;i<=n;i++) a[i]=i,b[i][0]=read(),b[i][1]=read(),b[i][2]=read();
	while ((double)clock()/CLOCKS_PER_SEC<=0.8)
	{
		SA();
	}
	cout<<ans<<'\n';
	return 0;
}