Ice_cream’s world III+最短路kruskal+水题+HDU

Ice_cream’s world III Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 759    Accepted Submission(s): 254 Problem Description ice_cream’s world becomes stronger and stronger; every road is built as undirected. The queen enjoys traveling around her world; the queen’s requirement is like II problem, beautifies the roads, by which there are some ways from every city to the capital. The project’s cost should be as less as better.   Input Every case have two integers N and M (N<=1000, M<=10000) meaning N cities and M roads, the cities numbered 0…N-1, following N lines, each line contain three integers S, T and C, meaning S connected with T have a road will cost C.   Output If Wiskey can’t satisfy the queen’s requirement, you must be output “impossible”, otherwise, print the minimum cost in this project. After every case print one blank.   Sample Input 2 1 0 1 10 4 0   Sample Output 10 impossible 解决方案：还是模板，练一下码模板。 code： #include<iostream> #include<cstdio> #include<cstring> #include<queue> #define MMAX 2003 using namespace std; struct edge { int from;///起点 int to;///终点 int dis;///路长 bool operator<(const edge &a)const { return dis>a.dis; } }; //edge store[1003]; int N,M,result; int fa[MMAX]; priority_queue<edge >Q; void store() { while(!Q.empty())Q.pop(); for(int i=0; i<M; i++) { edge temp; scanf("%d%d%d",&temp.from,&temp.to,&temp.dis); Q.push(temp); } } void init_fa() { for(int i=0; i<=N; i++) fa[i]=i; } int faset(int x) { return x!=fa[x]?fa[x]=faset(fa[x]):x; } bool judge() { int f=faset(0); for(int i=0; i<N; i++) { if(f!=faset(i)) return false; } return true; } void kruskal() { init_fa(); result=0; while(!Q.empty()) { edge temp=Q.top(); Q.pop(); int x=faset(temp.to),y=faset(temp.from); if(x!=y) { result+=temp.dis; fa[x]=y; } } } int main() { while(~scanf("%d%d",&N,&M)) { store(); kruskal(); if(judge()) printf("%d\n",result); else printf("impossible\n"); cout<<endl; } return 0; }