ZOJ 2750 Idiomatic Phrases Game(邻接表+dijkstra)

把每个idiom看成两个节点,中间连一条边只为该idiom的值,

两个能连边的idiom连边,权值设为0,

然后各种最短路算法就可以了.

这里判断尾部是否等于头部时候,用枚举的话会超时,最好用map来记录相同头部

#include <iostream>
#include <cstdio>
#include <string>
#include <memory.h>
#include <vector>
#include <map>
#include <queue>
using namespace std;
const int maxn=2050;
struct Edge{
	int v,w,next;
}edges[20000];

struct node{
	int i,v;
	node(int ii=0,int vv=0):i(ii),v(vv){}
	bool operator<(const node rhs)const{
		return v>rhs.v;
	}
};
int head[maxn],dis[maxn],val[maxn/2],n;
bool vis[maxn];
string idiom[maxn/2];
char str[maxn];
map<string,vector<int> >heads;
int dijkstra(){
	memset(dis,0X7F,sizeof(dis));
	memset(vis,0,sizeof(vis));
	dis[0]=0;
	priority_queue<node>q;
	q.push(node(0,0));
	while (q.size())
	{
		node t=q.top();
		q.pop();
		if(t.i==n-1)return dis[n-1];
		else if(vis[t.i])continue;//最短值已经确定
		vis[t.i]=1;
		for (int ne=head[t.i];ne!=-1;ne=edges[ne].next)
		{
			int v=edges[ne].v,w=edges[ne].w;
			if(dis[v]>dis[t.i]+w&&!vis[v]){
				dis[v]=dis[t.i]+w;
				q.push(node(v,dis[v]));
			}
		}
	}
	return -1;
}
int main(){
	while(scanf("%d",&n)&&n){
		int eIdx=0;
		heads.clear();
		for (int i=0;i<n*2;++i)
		{
			head[i]=-1;
		}
		for (int i=0;i<n;++i)
		{
			scanf("%d %s",&val[i],str);
			idiom[i]=str;
			edges[eIdx].v=n+i;
			edges[eIdx].w=val[i];//一个idiom分成两个节点
			edges[eIdx].next=head[i];
			head[i]=eIdx++;
			heads[string(idiom[i].begin(),idiom[i].begin()+4)].push_back(i);
		}
		for (int i=0;i<n;++i)
		{
			string tail(idiom[i].end()-4,idiom[i].end());
			vector<int>::iterator it=heads[tail].begin();
			for (;it!=heads[tail].end();++it)
			{
				edges[eIdx].v=*it;
				edges[eIdx].w=0;//权值设为0
				edges[eIdx].next=head[n+i];
				head[n+i]=eIdx++;
			}
		}
		printf("%d\n",dijkstra());
	}
	return 0;
}