HDU3790（最短路径 当不止一条最短路径要求花费最少）

题目：http://acm.hdu.edu.cn/showproblem.php?pid=3790

 

package D0801;
//求最短路径（Dijkstra算法）
import java.io.*;

public class HDU3790 {
	static class Tail {
		int d;
		int p;
	}

	static class Tail1 {
		int d1;
		int p1;
	}

	static int n, m;
	static Tail[][] map;// 邻接矩阵（权值）‘
	static int[] pre;
	static Tail1[] dist;// 最短路径
	static int s, e;

	public static void dijkstra() {
		boolean []p = new boolean[n+1];
		for(int i = 1;i<=n;i++){
			p[i] = false;
			if(i!=s){
				dist[i].d1 = map[s][i].d;
				dist[i].p1 = map[s][i].p;
				pre[i] = s;
			}
		}
		dist[s].d1 = dist[s].p1 = 0;
		p[s]=true;
		for(int i = 1;i<=n-1;i++){
			int min = Integer.MAX_VALUE;
			int k = -1;
			for(int j = 1;j<=n;j++){
				if(!p[j]&&dist[j].d1<min){
					min = dist[j].d1;
					k = j;
				}
			}
			if(k==-1)return;
			p[k] = true;
			for(int j = 1;j<=n;j++){
				if (!p[j] && map[k][j].d != Integer.MAX_VALUE && dist[j].d1 > dist[k].d1 + map[k][j].d){
					dist[j].d1 = dist[k].d1 + map[k][j].d;
					dist[j].p1 = dist[k].p1 + map[k][j].p;
				}
				//当不止一条最短路径得时候，要判断花费最少
				else if(!p[j] && map[k][j].d != Integer.MAX_VALUE && dist[j].d1 == dist[k].d1 + map[k][j].d)
					if(dist[j].p1 > dist[k].p1 + map[k][j].p)
						dist[j].p1 = dist[k].p1 + map[k][j].p;
				pre[j] = k;
			}
		}
	}

	public static void main(String[] args) throws IOException {
		StreamTokenizer st = new StreamTokenizer(new BufferedReader(
				new InputStreamReader(System.in)));
		PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));

		while (st.nextToken() != StreamTokenizer.TT_EOF) {
			n = (int) st.nval;
			st.nextToken();
			m = (int) st.nval;
			if (n == 0 && m == 0)
				break;
			// 初始化
			pre = new int[n + 1];
			dist = new Tail1[n + 1];
			for(int i = 1;i<=n;i++)
				dist[i]= new Tail1();
			map = new Tail[n + 1][n + 1];
			for (int i = 1; i <= n; i++)
				for (int j = 1; j <= n; j++) {
					map[i][j]=new Tail();
					map[i][j].d = Integer.MAX_VALUE;
					map[i][j].p = Integer.MAX_VALUE;
				}

			while (m-- > 0) {
				st.nextToken();
				int u = (int) st.nval;
				st.nextToken();
				int v = (int) st.nval;
				st.nextToken();
				int w = (int) st.nval;
				st.nextToken();
				int p = (int) st.nval;
				if (map[u][v].d > w) {
					map[u][v].d = w;
					map[v][u].d = w;
					map[u][v].p = p;
					map[v][u].p = p;
				} else if (map[u][v].d == w && map[u][v].p > p) {
					map[u][v].p = p;
					map[v][u].p = p;
				}
			}
			st.nextToken();
			s = (int) st.nval;
			st.nextToken();
			e = (int) st.nval;
			dijkstra();
			//for(int i = 1;i<=n;i++)
			out.println(dist[e].d1+" "+dist[e].p1);
		}
		out.flush();
	}

}