Go: // Warshall–Floyd Algorithm

package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"strings"
)

var scanner = bufio.NewScanner(os.Stdin)

const INF = 0x7FFFFFFF

func main() {
	for scanner.Scan() {
		buf := strings.Split(scanner.Text(), " ")
		n, _ := strconv.Atoi(buf[0])
		m, _ := strconv.Atoi(buf[1])
		if n == 0 && m == 0 {
			break
		}
		c_matrix := make([][]int, m)
		for i := range c_matrix {
			c_matrix[i] = make([]int, m)
		}
		t_matrix := make([][]int, m)
		for i := range t_matrix {
			t_matrix[i] = make([]int, m)
		}
		for i := 0; i < n; i++ {
			scanner.Scan()
			buf_ := strings.Split(scanner.Text(), " ")
			a, _ := strconv.Atoi(buf_[0])
			b, _ := strconv.Atoi(buf_[1])
			c, _ := strconv.Atoi(buf_[2])
			t, _ := strconv.Atoi(buf_[3])
			c_matrix[a-1][b-1] = c
			t_matrix[a-1][b-1] = t
		}
		c_dist := make([][]int, m)
		c_prev := make([][]int, m)
		t_dist := make([][]int, m)
		t_prev := make([][]int, m)
		for i := 0; i < m; i++ {
			c_dist[i] = make([]int, m)
			c_prev[i] = make([]int, m)
			t_dist[i] = make([]int, m)
			t_prev[i] = make([]int, m)
		}
		for i := 0; i < m; i++ {
			for j := 0; j < m; j++ {
				if c_matrix[i][j] == 0 {
					c_dist[i][j] = INF
					c_prev[i][j] = -1
				} else {
					c_dist[i][j] = c_matrix[i][j]
					c_prev[i][j] = i
				}
				if t_matrix[i][j] == 0 {
					t_dist[i][j] = INF
					t_prev[i][j] = -1
				} else {
					t_dist[i][j] = t_matrix[i][j]
					t_prev[i][j] = i
				}
			}
			c_dist[i][i] = 0
			t_dist[i][i] = 0
		}
		for k := 0; k < m; k++ {
			for i := 0; i < m; i++ {
				for j := 0; j < m; j++ {
					c_newlen := c_dist[i][k] + c_dist[k][j]
					if c_newlen < c_dist[i][j] {
						c_dist[i][j] = c_newlen
						c_prev[i][j] = c_prev[k][j]
					}
				}
			}
		}
		for k := 0; k < m; k++ {
			for i := 0; i < m; i++ {
				for j := 0; j < m; j++ {
					t_newlen := t_dist[i][k] + t_dist[k][j]
					if t_newlen < t_dist[i][j] {
						t_dist[i][j] = t_newlen
						t_prev[i][j] = t_prev[k][j]
					}

				}
			}
		}
		scanner.Scan()
		k, _ := strconv.Atoi(scanner.Text())
		for i := 0; i < k; i++ {
			scanner.Scan()
			buf_ := strings.Split(scanner.Text(), " ")
			p, _ := strconv.Atoi(buf_[0])
			q, _ := strconv.Atoi(buf_[1])
			r, _ := strconv.Atoi(buf_[2])
			switch r {
			case 0:
				fmt.Println(c_dist[p-1][q-1])
			case 1:
				fmt.Println(t_dist[p-1][q-1])
			}
		}
	}
}

C++: #include <iostream>


const unsigned int inf = 1 << 26;

const int MAX_OF_INFOMATIONS = 300; // 路線情報の最大数

const int MAX_OF_STATIONS = 100; // 駅の最大数

const int MAX_OF_ENQUIRIES = 200; // 問い合わせの最大数


// 大工ストアならぬダイクストラ

int dijk(int m, int n, int s, int g[2][MAX_OF_STATIONS][MAX_OF_STATIONS], int ary[2][MAX_OF_STATIONS][MAX_OF_STATIONS]) {

	bool *used = new bool[n];

	unsigned int *d = new unsigned int[n];


	// std::cout << "n = " << n << " " << "s = " << s << std::endl;


	for(int i = 0; i < n; i++)
		d[i] = inf;

	d[s] = 0;

	for(int i = 0; i < n; i++)
		used[i] = false;


	while(true) {

		int u = -1;

		for(int v = 0; v < n; v++)

		if(!used[v] && (u == -1 || d[v] < d[u]))
			u = v;


			// std::cout << "u = " << u << std::endl;


		if(u == -1) break;

		used[u] = true;


		for(int v = 0; v < n; v++)
			if(d[v] > d[u] + g[m][u][v])
				d[v] = d[u] + g[m][u][v];

	}


	for(int i = 0; i < n; i++)
		ary[m][s][i] = d[i];


// for(int i = 0; i < n; i++)

// std::cout << "d[" << i << "] = " << d[i] << std::endl;


	return 0;

}


int main() {

	int a[MAX_OF_INFOMATIONS] = {}, // 駅番号aの配列

	b[MAX_OF_INFOMATIONS] = {}, // 駅番号bの配列

	cost[MAX_OF_INFOMATIONS] = {}, // aからbまでの運賃

	time[MAX_OF_INFOMATIONS] = {}, // aからbまでの移動時間

	p[MAX_OF_ENQUIRIES] = {}, // 始点a

	q[MAX_OF_ENQUIRIES] = {}, // 終点b

	r[MAX_OF_ENQUIRIES] = {}, // 知りたい情報の種類

	d[2][MAX_OF_STATIONS][MAX_OF_STATIONS] = {},

	g[2][MAX_OF_STATIONS][MAX_OF_STATIONS] = {};

	int info, // 路線情報数

	station, // 駅の数

	enquiry; // 問い合わせ数


	while(true) {

		std::cin >> info;

		std::cin >> station;


		// 初期化処理

		for(int i = 0; i < 2; i++) {

			for(int j = 0; j < station; j++) {

				for(int k = 0; k < station; k++) {

					g[i][j][k] = inf;

					d[i][j][k] = inf;

				}

			}

		}


		// inputが0 0だったら終了

		if(!info && !station) break;


		for(int i = 0; i < info; i++) {

			std::cin >> a[i];

			std::cin >> b[i];

			std::cin >> cost[i];

			std::cin >> time[i];

		}


			// a - 1, b - 1をする(駅番号が1からmまでである)

		for(int i = 0; i < info; i++) {

			a[i]--;

			b[i]--;

		}


			// 時間と運賃を配列に入れる

		for(int i = 0; i < info; i++) {

			g[0][a[i]][b[i]] = time[i];

			g[1][a[i]][b[i]] = cost[i];

			g[0][b[i]][a[i]] = time[i];

			g[1][b[i]][a[i]] = cost[i];


		}


		// 大工ストアじゃなくてダイクストラに入れる

		for(int i = 0; i < station; i++) {

//			dijk(0, station, i, g, d);

//			dijk(1, station, i, g, d);

		}


		std::cin >> enquiry;


		// 問い合わせ

		for(int i = 0; i < enquiry; i++) {

			std::cin >> p[i];

			std::cin >> q[i];

			std::cin >> r[i];

		}


		// 数合わせ.

		for(int i = 0; i < enquiry; i++) {

			p[i]--;

			q[i]--;

		}


// 表示

		for(int i = 0; i < enquiry; i++)

			std::cout << d[0][p[i]][q[i]] << std::endl;

//		std::cout << !0 << std::endl;

	}


	return 0;

}

C++: #include<cstdio>
#include<cstring>
#include<algorithm>
#include<functional>
#include<iostream>
#include<queue>
#define rep(i,a,b) for(i=a;i<b;i++)
#define F1 first.first
#define F2 first.second
#define F3 second
#define INF 2100000000
#define long long int int
using namespace std;
typedef pair<pair<int,int>,int> P1;
typedef pair<int,int> P2;
int main(void)
{
	priority_queue<P2,vector<P2>,greater<P2> > que;
	int i,j,k,n,m,x,s,e;
	int a,b,cos,tim,st,en,way;
	int leng[1001],kami[1002];
	P1 glid1[6000],glid2[6000];
	P2 tori;
	while(1) {
		cin>>n>>m;
		if(n==0&&m==0) break;
		rep(i,0,n) {
			cin>>a>>b>>cos>>tim;
			glid1[i*2].F1=a,glid1[i*2].F2=b,glid1[i*2].F3=cos;
			glid2[i*2].F1=a,glid2[i*2].F2=b,glid2[i*2].F3=tim;
			glid1[i*2+1].F1=b,glid1[i*2+1].F2=a,glid1[i*2+1].F3=cos;
			glid2[i*2+1].F1=b,glid2[i*2+1].F2=a,glid2[i*2+1].F3=tim;
		}
		sort(glid1,glid1+m*2);sort(glid2,glid2+m*2);
		kami[1]=0;
		rep(i,1,m*2) {
			if(glid1[i].F1!=glid1[i-1].F1) {
				x=glid1[i].F1;
				kami[x]=i;
			}
		}
		kami[n+1]=m*2;
		
		cin>>k;
		rep(i,0,k) {
			cin>>st>>en>>way;
			for(j=1;j<=n;j++) leng[j]=INF;
			while(!que.empty()) que.pop();
			que.push(P2(0,st));
			while(!que.empty()) {
				tori=que.top(),que.pop();
				a=tori.first,b=tori.second;
				if(a<leng[b]) {
					leng[b]=a;
					if(b==en) break;
					s=kami[b],e=kami[b+1];
					if(way==0)rep(j,s,e) que.push(P2(a+glid1[j].F3,glid1[j].F2));
					else rep(j,s,e) que.push(P2(a+glid2[j].F3,glid2[j].F2));
				}
			}
			cout<<leng[en]<<endl;
		}
	}
	return 0;
}