HDU 2833——wukong

关注

原创最新推荐文章于 2016-12-09 01:36:30 发布 1.1k 阅读 AI 写同款· GEO 优化 ›

【HDU 2833】WuKong 【Floyd】 Problem DescriptionLiyuan wanted to rewrite the famous book “Journey to the West” (“Xi You Ji” in Chinese pinyin). In the original book, the Monkey King Sun Wukong was trapped by the Buddha for 500 yea 阅读详情

dijskra算法+搜索

首先分别求出悟空和唐僧各自的最短路径，然后记忆化搜索。

#include<cstring>
#include<cstdio>
#include<iostream>
using namespace std;
#define maxn 302
#define INF 10001
int map[maxn][maxn],dis1[maxn],dis2[maxn];
int dp[maxn][maxn];
void dij1(int s,int e,int n)
{
	bool que[maxn];
	int i,j;
	memset(que,0,sizeof(que));
	for(i=1;i<=n;i++)
		dis1[i]=INF;
	dis1[s]=0;
	int temp,k;
	for(i=1;i<=n;i++)
	{
		temp=INF;
		for(j=1;j<=n;j++)
			 if(!que[j]&&temp>dis1[j])
			 {
				 temp=dis1[j];
				 k=j;
			 }
		que[k]=1;
		for(j=1;j<=n;j++)
			if(!que[j]&&dis1[j]>dis1[k]+map[k][j])
				dis1[j]=dis1[k]+map[k][j];
	}
}
void dij2(int s,int e,int n)
{
	bool que[maxn];
	int i,j;
	memset(que,0,sizeof(que));
	for(i=1;i<=n;i++)
		dis2[i]=INF;
	dis2[s]=0;
	int temp,k;
	for(i=1;i<=n;i++)
	{
		temp=INF;
		for(j=1;j<=n;j++)
			 if(!que[j]&&temp>dis2[j])
			 {
				 temp=dis2[j];
				 k=j;
			 }
		que[k]=1;
		for(j=1;j<=n;j++)
			if(!que[j]&&dis2[j]>dis2[k]+map[k][j])
				dis2[j]=dis2[k]+map[k][j];
	}
}
int max(int a,int b)
{
	if(a>b)
		return a;
	return b;
}
int dfs(int a,int b,int n)  
{  
    if(dp[a][b]>-1)  
        return dp[a][b];  
    int i,j,v=0;  
    for(i=1;i<=n;i++)  
          if(dis1[i]+map[i][a]==dis1[a])  
                   v=max(v,dfs(i,b,n)); 
    for(j=1;j<=n;j++)  
          if(dis2[j]+map[j][b]==dis2[b])  
              v=max(v,dfs(a,j,n));  
    if(a==b)
		v++;  
    dp[a][b]=v;  
    return v;  
}  
int main()
{
	int n,m;
	int s,e,cost;
	int a,b,c,d;
	int i,j;
	while(scanf("%d%d",&n,&m)!=EOF&&n&&m)
	{
		for(i=1;i<=n;i++)
			for(j=1;j<=n;j++)
			{
				dp[i][j]=-1;
				map[i][j]=INF;
			}
		for(i=1;i<=m;i++)
		{
			scanf("%d%d%d",&s,&e,&cost);
			if(map[s][e]>cost)
				map[s][e]=map[e][s]=cost;
		}
		scanf("%d%d%d%d",&a,&b,&c,&d);
		dij1(a,b,n);
		dij2(c,d,n);
		if(a!=c)
			dp[a][c]=0;
		else
			dp[a][c]=1;
	printf("%d\n", dfs(b,d,n));
	}
	return 0;
}

收录于