畅通工程
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 34806 Accepted Submission(s): 15429
Problem Description
省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通(但不一定有直接的公路相连,只要能间接通过公路可达即可)。经过调查评估,得到的统计表中列出了有可能建设公路的若干条道路的成本。现请你编写程序,计算出全省畅通需要的最低成本。
Input
测试输入包含若干测试用例。每个测试用例的第1行给出评估的道路条数 N、村庄数目M ( < 100 );随后的 N
行对应村庄间道路的成本,每行给出一对正整数,分别是两个村庄的编号,以及此两村庄间道路的成本(也是正整数)。为简单起见,村庄从1到M编号。当N为0时,全部输入结束,相应的结果不要输出。
行对应村庄间道路的成本,每行给出一对正整数,分别是两个村庄的编号,以及此两村庄间道路的成本(也是正整数)。为简单起见,村庄从1到M编号。当N为0时,全部输入结束,相应的结果不要输出。
Output
对每个测试用例,在1行里输出全省畅通需要的最低成本。若统计数据不足以保证畅通,则输出“?”。
Sample Input
3 31 2 11 3 22 3 41 32 3 20 100
Sample Output
3?
#include <bits/stdc++.h>
using namespace std;
const int MAXN = (int)107;
typedef long long ll;
struct edge{
int from,to;
ll cost;
}E[MAXN*MAXN];
int N,M;
int father[MAXN];
void init(){
for (int i = 1;i <= N;i ++)
father[i] = i;
}
int Find(int x){
if (x == father[x])return x;
return father[x] = Find(father[x]);
}
bool same(int x,int y){
return Find(x) == Find(y);
}
void unionSet(int x,int y){
int u = Find(x),v = Find(y);
if (u == v)return ;
father[v] = u;
return ;
}
bool cmp(edge a,edge b){
return a.cost < b.cost;
}
ll Kruskal(){
ll res = 0;
sort (E+1,E+1+M,cmp);
for (int i = 1;i <= M;i ++){
if (same(E[i].from,E[i].to))continue;
unionSet(E[i].from,E[i].to);
res += E[i].cost;
//cout << res << endl ;//Fake
}
return res;
}
int main()
{
while (scanf("%d %d",&M,&N) == 2){
if (M == 0)break;
init();
for (int i = 1;i <= M;i ++){
scanf("%d %d %lld",&E[i].from,&E[i].to,&E[i].cost);
}
ll res = Kruskal();
for (int i = 1;i <= N;i ++){
if (!same(1,i))res = -1;
}
if (res == -1)printf("?\n");
else printf("%lld\n",res);
}
}
Prim 算法 (使用优先队列的版本)
#include <bits/stdc++.h>
using namespace std;
const int MAXN = (int)105;
struct edge{
int to,cost;
edge(int to = 0,int cost = 0):to(to),cost(cost){}
bool operator < (const edge &a) const{
return a.cost < cost ;
}
};
int N,M;
vector<edge> G[MAXN];
priority_queue<edge> que;
int vis[MAXN];
int cnt;
int prim(){
int ret = 0;
for (int i = 0;i < G[1].size();i ++)
que.push(edge(G[1][i].to,G[1][i].cost));
vis[1] = 1;cnt ++;
while (!que.empty()){
edge k = que.top();
que.pop();
if (vis[k.to]) continue;
ret += k.cost;
vis[k.to] = 1;cnt ++;
if (cnt == N)break;
for (int i = 0;i < G[k.to].size();i ++){
int to = G[k.to][i].to;
if (vis[to])continue;
que.push(G[k.to][i]);
}
}
return ret;
}
void init(){
for (int i = 1;i <= N;i ++) G[i].clear();
memset(vis,0,sizeof(vis));
while (!que.empty())que.pop();
cnt = 0;
}
int main()
{
ios::sync_with_stdio(false);
while (cin >> M >> N,M){
init();
for (int i = 1;i <= M;i ++){
int x,y,w;
cin >> x >> y >> w;
G[x].push_back(edge(y,w));
G[y].push_back(edge(x,w));
}
int res = prim();
if (cnt == N) cout << res << endl;
else cout << '?' << endl;
}
}
Prim (使用for循环版)
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
struct Edge{
int to,val;
Edge(int to,int val):to(to),val(val){}
};
vector<Edge>cost[105];
int vis[105],m,n,low[105];
int prim(){
int ret=0;
memset(vis,0,sizeof(vis));
memset(low,125,sizeof(low));
vis[1]=1;
int len = cost[1].size();
for(int i = 0;i<len;i++){
int x = cost[1][i].to;
low[x] = cost[1][i].val;
}
low[1] = 0;
for(int i = 2;i <= m;i++){
int minn = int(1e9),p = 0;
for(int j = 1;j <= m;j++){
if(!vis[j] && low[j] < minn)
minn = low[j],p = j;
}
if(!p) return -1;
vis[p] = 1;ret += minn;
int len = cost[p].size();
for(int i = 0;i < len;i++){
int x = cost[p][i].to;
if(vis[x]) continue;
low[x] = min(low[x],cost[p][i].val);
}
}
return ret;
}
int main(){
while(cin >> n >> m){
if(n == 0) break;
for(int i = 1;i <= m;i ++) cost[i].clear();
int u,v,w;
for(int i = 1;i <= n;i ++){
cin >> u >> v >> w;
cost[u].push_back(Edge(v,w));
cost[v].push_back(Edge(u,w));
}
int ans = prim();
for(int i = 1;i <= m;i ++)
if(!vis[i])
ans = -1;
if(ans >= 0) cout << ans << endl;
else cout << '?' << endl;
}
return 0;
}