BZOJP3959 宝藏

随机化贪心------>模拟退火

挖坑

代码

//By AcerMo
#include<cmath>
#include<ctime>
#include<queue>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int M=15;
int n,m;
int dep[M],vis[M],map[M][M];
struct heap
{
	int fr,to;
	bool friend operator < (heap a,heap b)
	{
		return dep[a.fr]*map[a.fr][a.to]>dep[b.fr]*map[b.fr][b.to];
	}
}add,now,use[1050];
priority_queue<heap>q;
inline int read()
{
	int x=0;char ch=getchar();
	while (ch>'9'||ch<'0') ch=getchar();
	while (ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
	return x;
}
inline int SA(int st)
{
	fill(dep,dep+n+1,0);
	fill(vis,vis+n+1,0);
	memset(use,0,sizeof(use));
	while (q.size()) q.pop();
	int tp=0,ans=0;
	vis[st]=dep[st]=1;
	for (int i=1;i<=n;i++)
	if (map[st][i]<map[0][0])
	add.fr=st,add.to=i,q.push(add);
	for (int i=1;i<n;i++)
	{
		now=q.top();q.pop();
		while (q.size()&&(vis[now.to]||rand()%n<1))
		{
			if (!vis[now.to]) use[++tp]=now;
			now=q.top();q.pop();
		}//随机一个可行点 
		vis[now.to]=1;dep[now.to]=dep[now.fr]+1;
		while (tp) q.push(use[tp--]);
		for (int k=1;k<=n;k++)
		if (!vis[k]&&map[now.to][k]<map[0][0])
		add.fr=now.to,add.to=k,q.push(add);
		ans+=map[now.fr][now.to]*dep[now.fr];
	}
	return ans;
}
inline void slove()
{
	int ans=2e9;
	for (int i=1;i<=251;i++)
	for (int k=1;k<=n;k++)
	ans=min(ans,SA(k));//枚举起点 
	return (void)(cout<<ans);
}
signed main()
{
	srand(20020917);
	n=read();m=read();int x,y,z;
	memset(map,0x3f,sizeof(map));
	for (int i=1;i<=m;i++) 
	{
		x=read(),y=read(),z=read(),
		map[x][y]=map[y][x]=min(map[x][y],z);
	}	
	slove();
	return 0;
}