-
Notifications
You must be signed in to change notification settings - Fork 0
/
11747.cpp
90 lines (85 loc) · 1.36 KB
/
11747.cpp
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
89
/*
11747 - Heavy Cycle Edges
*/
#include<bits/stdc++.h>
using namespace std;
#define MX 1005
struct node
{
int x,y,cost;
};
vector<pair<int,pair<int,int>>>p;
vector<int>ans;
vector<int>parent(MX);
void initialize(int n)
{
for(int i=0; i<=n; i++)
{
parent[i]=i;
}
ans.clear();
p.clear();
}
int findd(int i)
{
return (parent[i]==i)?i:findd(parent[i]);
}
int main()
{
int n,m;
while(cin>>n>>m,!(m==0 && n==0))
{
initialize(n);
for(int i=0; i<m; i++)
{
int x,y,c;
cin>>x>>y>>c;
p.push_back(make_pair(c,make_pair(x,y)));
}
sort(p.begin(),p.end());
for(int i=0; i<p.size(); i++)
{
int px = findd(p[i].second.first);
int py = findd(p[i].second.second);
if(px!=py)
{
parent[px]=py;
}
else
{
ans.push_back(p[i].first);
}
}
sort(ans.begin(),ans.end());
if(ans.size()==0){
cout<<"forest"<<endl;
}
else{
cout<<ans[0];
for(int i=1;i<ans.size();i++){
cout<<" "<<ans[i];
}cout<<endl;
}
}
return 0;
}
/*
Sample Input
3 3
0 1 1
1 2 2
2 0 3
4 5
0 1 1
1 2 2
2 3 3
3 1 4
0 2 0
3 1
0 1 1
0 0
Sample Output
3
2 4
forest
*/