我发现貌似有四个不同的畅通工程,我感觉只是细节问题,大同小异。
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.math.BigDecimal;
import java.util.Arrays;
class Main {
static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
static int N = 110, M = N * (N - 1), n, m, res, cnt;
static boolean flag;
static int p[];
static Pair pair[];
public static void init() {
p = new int[N];
pair = new Pair[N];
for (int i = 0; i < N; i++) p[i] = i;
res = 0;
cnt = 0;
flag = false;
}
public static void main(String[] args) throws IOException {
while (!flag) {
String s[] = br.readLine().split(" ");
m = Integer.parseInt(s[0]);
n = Integer.parseInt(s[1]);
if (m * n == 0) break;
init();
int k = 0;
for (int i = 0; i < m; i++) {
s = br.readLine().split(" ");
int a = Integer.parseInt(s[0]);
if (a == 0) {
flag = true;
break;
}
int b = Integer.parseInt(s[1]);
int w = Integer.parseInt(s[2]);
pair[k++] = new Pair(a, b, w);
}
Arrays.sort(pair, 0, k);
for (int i = 0; i < k; i++) {
int a = pair[i].a;
int b = pair[i].b;
int w = pair[i].w;
a = find(a);
b = find(b);
if (a != b) {
p[a] = b;
res += w;
cnt++;
}
}
if (cnt < n - 1) System.out.println("?");
else System.out.println(res);
}
}
public static int find(int x) {
if (p[x] != x) p[x] = find(p[x]);
return p[x];
}
}
class Pair implements Comparable<Pair> {
int a, b, w;
public Pair(int a, int b, int w) {
this.a = a;
this.b = b;
this.w = w;
}
@Override
public int compareTo(Pair pair) {
return this.w - pair.w;
}
}