Heavy Transportation POJ - 1797

最新推荐文章于 2024-10-10 22:59:02 发布

霾まる

最新推荐文章于 2024-10-10 22:59:02 发布

阅读量84

点赞数

分类专栏：最小生成树文章标签：算法 c++ 数据结构

本文链接：https://blog.csdn.net/Tanya_xiaomai/article/details/125226545

版权

Kruskal算法 Dijkstra 最短路径无向图 C++

关键词由CSDN通过智能技术生成

最小生成树专栏收录该内容

11 篇文章 0 订阅

订阅专栏

题目链接: Heavy Transportation - POJ 1797 - Virtual Judge

一眼无向图鉴定为kruskal

插个眼用dijkstra的堆优化来写

ac代码:

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <queue>
#include <cmath>
#include <cstring>
#include <string>
#include <stack>
#include <deque>
#include <map>
#include <set>
using namespace std;
#define ll long long
#define endl "\n"
#define rep(i, a, b) for (ll i = (a); i <= (b); i++)
#define repr(i, a, b) for (ll i = (a); i < (b); i++)
#define rrep(i, a, b) for (ll i = (b); i >= (a); i--)
#define rrepr(i, a, b) for (ll i = (b); i > (a); i--)
#define min(a,b) (a)<(b)?(a):(b)
#define max(a,b) (a)>(b)?(a):(b)

ll cnt,n,m,t,ans,ant;
ll mmin;
const int N=2e3+100;
ll arr[N];
string str;

inline ll read()
{
    char c = getchar();int x = 0,s = 1;
    while(c < '0' || c > '9') {if(c == '-') s = -1;c = getchar();}//是符号
    while(c >= '0' && c <= '9') {x = x*10 + c -'0';c = getchar();}//是数字
    return x*s;
}

struct Edge
{
    ll u,v,w;
    bool operator< (const Edge &W)const
    {
        return w>W.w;
    }
}edges[N*N];

ll find(ll x)
{
    if(x!=arr[x]) arr[x]=find(arr[x]);
    return arr[x];
}

void kruskal()
{
    sort(edges,edges+m);
    rep(i,0,n) arr[i]=i;
    cnt=ant=0;
    repr(i,0,m)
    {
        ll u=edges[i].u,v=edges[i].v,w=edges[i].w;
        u=find(u);
        v=find(v);
        if(u!=v)
        {
            arr[u]=v;
            cnt++;
            ant+=w;
            mmin=min(mmin,w);
            // mmin=w;
        }
        if(cnt>=n-1) return;
        if(find(1)==find(n)) return;
    }
}

void solve()
{
    // n=read(),m=read();//n点m边
    scanf("%lld%lld",&n,&m);
    mmin=1e6+10;
    repr(i,0,m)
    {
        ll u,v,w;
        scanf("%lld%lld%lld",&u,&v,&w);

        edges[i].u=u;
        edges[i].v=v;
        edges[i].w=w;
    }

    kruskal();
    printf("%lld\n\n",mmin);
    return;
}

int main()
{   
    scanf("%lld",&t);
    rep(k,1,t)
    {
        printf("Scenario #%lld:\n",k);
        solve();
    }
    return 0;
}