HDU 1879 继续畅通工程

来源：互联网发布：医疗优化站不收录编辑：程序博客网时间：2024/06/05 16:45

最小生成树原题中文就不写了题意了如果边已建把权值设成0就好剩下就是套板子了没什么可说的

#include <iostream>#include <cstring>#include <string>#include <cstdio>#include <cmath>#include <algorithm>#include <vector>#include <queue>#include <map>#include<set>#include<stack>#define bug puts("bugbugbug");using namespace std;typedef long long ll;const int maxm=10005;int f[105];int n,m;struct node{    int x, y, v;    bool operator<(const node &b)const{        if(this->v!=b.v)    return (this->v<b.v);    if(this->x!=b.x)    return (this->x<b.x);    return (this->y<b.y);    }} e[maxm];int find(int x){ return f[x]= f[x]==x?x:find(f[x]); }int Kruscal(){    sort(e, e + m);    int cnt = n, ans = 0;    for(int i = 1; i <= n; i++) f[i] = i;    for (int i = 0; i < m; i++)    {        int x = find(e[i].x);        int y = find(e[i].y);        if (x != y)        {            f[x] = y;            cnt--;            ans += e[i].v;            if (cnt == 1) break;        }    }    return ans;}int main(){    while(~scanf("%d",&n)&&n)    {        m=n*(n-1)/2;        for(int i=0;i<m;i++)        {            int a;             scanf("%d%d%d%d",&e[i].x,&e[i].y,&e[i].v,&a);            if(a)e[i].v=0;        }         printf("%d\n",Kruscal());    }}

0 0