zoj 2750 Idiomatic Phrases Game

题意：最短路径，只给出了点和这个点到其他点的距离。

思路：把图构建出来，Dijkstra解之。

代码：

#include <iostream>
#include <string>

using namespace std;

const int inf = 100000000;
const int maxn = 1005;

struct word{
	string x;
	int w;
};

int n;
int edge[maxn][maxn];
int dist[maxn];
bool vis[maxn];
word a[maxn];


bool Input(){
	cin>>n;
	if(n == 0)
		return false;
	for(int i = 0; i < n; i++){
		cin>>a[i].w;
		cin>>a[i].x;
	}
	return true;
}

void Convert(){
	for(int i = 0; i < n; i++){
		for(int j = 0; j < n; j++){
			if(i == j){
				edge[i][j] = inf;
				continue;
			}
				string ta(a[i].x,a[i].x.size()-4,4), tb(a[j].x,0,4);	
				if(ta == tb)
					edge[i][j] = a[i].w;
				else
					edge[i][j] = inf;
					
		}
	}
}

void Dijkstra(){
	for(int i = 0; i < n; i++){
		vis[i] = 0; dist[i] = edge[0][i];
	}
	vis[0] = 1;
	dist[0] = 0;
	
	for(int i = 0; i < n-1; i++){
		int min = inf;
		int v = -1;
		for(int j = 0; j < n; j++){
			if(!vis[j] && dist[j] < min){
				min = dist[j]; v = j;
			}
		}
		if(v == -1) break;
		vis[v] = 1;
		
		for(int j = 0; j < n; j++){
			if(!vis[j] && dist[v] + edge[v][j] < dist[j])
				dist[j] = dist[v] + edge[v][j];
		}
	}
}

void Solve(){
	Convert();
	Dijkstra();
	if(dist[n-1] == inf){
		cout<<-1<<"\n";
	}
	else{
		cout<<dist[n-1]<<"\n";
	}
}

int main(){
	while(Input()){
		Solve();
	}
	
	return 0;
}