1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
|
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<stack>
#include<map>
#include<set>
#include<vector>
#include<queue>
#include<string>
#include<cmath>
using namespace std;
#define ll long long
#define rep(i,n) for(int i =0; i < n; ++i)
#define CLR(x) memset(x,0,sizeof x)
#define MEM(a,b) memset(a,b,sizeof a)
#define pr(x) cout << #x << " = " << x << " ";
#define prln(x) cout << #x << " = " << x << endl;
const int maxn = 2e6+100;
const int INF = 0x3f3f3f3f;
struct Edge{
int u, v, c;
Edge(){}
Edge(int _u, int _v, int _c){
u = _u;
v = _v;
c = _c;
}
bool operator < (const Edge& rhs)const{
return c < rhs.c;
}
}edge[maxn];
int edgenum;
bool vis[maxn];
int p[maxn], rank[maxn];
int t, n, m;
int find(int x){
return p[x] = (x==p[x]?x:find(p[x]));
}
void init(){
for(int i = 0; i <= n; ++i) p[i] = i, rank[i] = 1, vis[i] = false;
}
bool unite(int x, int y){
x = find(x), y = find(y);
if(x==y) return true;
if(rank[x] > rank[y]) p[y] = x;
else {
p[x] = y;
if(rank[x] == rank[y]) rank[y]++;
}
return false;
}
int main(){
#ifdef LOCAL
freopen("/home/zeroxf/桌面/in.txt","r",stdin);
#endif
scanf("%d", &t);
while(t--){
scanf("%d%d", &n, &m);
init();
int ans = INF, u, v, c;
edgenum = 0;
for(int i = 0; i < m; ++i){
scanf("%d%d%d", &u, &v, &c);
edge[edgenum++] = Edge(u,v,c);
}
sort(edge, edge + edgenum);
for(int i = 0; i < m; ++i){
int u = edge[i].u, v = edge[i].v;
if(unite(u,v)) {
ans = edge[i].c;
break;
}
}
if(ans == INF) printf("No solution!\n");
else printf("%d\n",ans);
}
return 0;
}
|