LightOj 1002 - Country Roads

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <deque>
#include <queue>
#include <cctype>
#include <map>
#include <set>
#include <bitset>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdlib>
#include <ctime>
#include <cassert>
#include <limits>
#include <fstream>

using namespace std;

#define mem(A, X) memset(A, X, sizeof A)
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define vi vector<int>
#define all(x) x.begin(), x.end()
#define foreach(e,x) for(__typeof(x.begin()) e=x.begin();e!=x.end();++e)
#define sz(x) (int)((x).size())
#define sl(a) strlen(a)
#define rep(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#define Rep(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define min3(a,b,c) min(a,min(b,c))
#define max3(a,b,c) max(a,max(b,c))
#define dbg(a) cout << a << endl;
#define fi first
#define se second
//typedef long long int64;
//int gcd(const int64 &a, const int64 &b) {return b == 0 ? a : gcd(b, a % b);}
//int64 int64pow(int64 a, int64 b){ if (b == 0) return 1; int64 t = int64pow(a, b / 2); if (b % 2) return t * t * a; return t * t; }
const int inf = 1 << 30;
const double eps = 1e-8;
const double pi = acos(-1.0);
const int MAX_N = 505;

int T, n, m, cas = 0, t, u, v, w;
bool vist[MAX_N];


int MinDist(vi &rs)
{
	int Min_Val = inf, id = -1;
	rep(i, 0, n) {
		if (!vist[i] && rs[i] < Min_Val) {
			Min_Val = rs[i];
			id = i;
		}
	}
	return id;
}


vi FindPath(vector<vector<int> > &graph)
{
	vi rs(sz(graph), inf);
	mem(vist, 0);
	rs[t] = 0;

	rep(i, 0, n) {
		int id = MinDist(rs);
		if (id == -1)
			break;
		vist[id] = 1;

		rep(j, 0, n) {
			if (!vist[j] && graph[id][j] != -1) {
				int tmp = max(rs[id], graph[id][j]);
				rs[j] = min(rs[j], tmp);
			}
		}
	}
	return rs;
}

void solve()
{
	vector<vector<int> > graph(MAX_N, vector<int>(MAX_N, -1));
	rep(i, 0, m) {
		scanf("%d%d%d", &u, &v, &w);
		if (graph[u][v] == -1)
			graph[u][v] = graph[v][u] = w;
		else
			graph[u][v] = graph[v][u] = min(graph[u][v], w);
	}
	scanf("%d", &t);
	vi rs = FindPath(graph);
	cout << "Case " << ++cas << ":" << endl;
	rep(i, 0, n) {
		if (rs[i] == inf)
			cout << "Impossible" << endl;
		else
			cout << rs[i] << endl;
	}
}


int main()
{
	cin >> T;
	while (cin >> n >> m) {
		solve();
	}
	return 0;
}