【记忆化搜索+图论】HDU-2833-WuKong

具体题解

题目

#include<iostream>
using namespace std;
template<class T> T Max(T x,T y){return x>y?x:y;}
template<class T> T Min(T x,T y){return x<y?x:y;}
#define N 305
#define inf 999999999
int n,dis1[N],dis2[N],dp[N][N],map[N][N];
void dijk(int u,int d[])
{
	int i,v,mins,mark[N];
	for(i=1;i<=n;i++)d[i]=map[u][i];
	d[u]=0;
	memset(mark,0,sizeof(mark));
	mark[u]=1;
	while(1)
	{
		mins=inf;
		for(i=1;i<=n;i++)
			if(!mark[i]&&d[i]<mins)
			{
				mins=d[i];
				v=i;
			}
		if(mins==inf)break;
		mark[v]=1;
		for(i=1;i<=n;i++)
			if(!mark[i]&&d[v]+map[v][i]<d[i])
				d[i]=d[v]+map[v][i];
	}
}
int dfs(int x,int y)
{
	int i,j,v;
	if(dp[x][y]!=-1)return dp[x][y];
	v=0;
	if(x==y)
	{
		v++;
		for(i=1;i<=n;i++)
		{
			if(dis1[i]+map[i][x]!=dis1[x])continue;
			for(j=1;j<=n;j++)
			{
				if(dis2[j]+map[j][y]!=dis2[y])continue;
				v=Max(v,dfs(i,j)+1);
			}
		}
	}
	for(i=1;i<=n;i++)
	{
		if(dis1[i]+map[i][x]!=dis1[x])continue;
		v=Max(v,dfs(i,y));
	}
	for(i=1;i<=n;i++)
	{
		if(dis2[i]+map[i][y]!=dis2[y])continue;
		v=Max(v,dfs(x,i));
	}
	return dp[x][y]=v;
}
int main()
{
	//freopen("a.txt","r",stdin);
	int i,j,m,x,y,z,s1,s2,e1,e2;
	while(scanf("%d%d",&n,&m)&&n+m)
	{
		for(i=1;i<=n;i++)
			for(j=1;j<=n;j++)
				map[i][j]=inf;
		for(i=0;i<m;i++)
		{
			scanf("%d%d%d",&x,&y,&z);
			if(map[x][y]>z)map[x][y]=map[y][x]=z;
		}
		scanf("%d%d%d%d",&s1,&e1,&s2,&e2);
		dijk(s1,dis1);
		dijk(s2,dis2);
		memset(dp,-1,sizeof(dp));
		dp[s1][s2]=0;
		if(s1==s2)dp[s1][s2]=1;
		printf("%d\n",dfs(e1,e2));
	}
	return 0;
}