POJ 1258 Agri-Net

Hello everyone , I meet you again , I'm the king of the whole stack .

Minimum spanning tree problem .

Matrix input .

It's just sad G++ obey AC.

C++ already RE.

The only problem , The most talked about 100 X 100 Matrix .

Logically, they are N lines of N space-separated integers. Physically, they are limited in length to 80 characters, so some lines continue onto others.

→_→ I don't know how you understand this sentence .

#include<cstdio>
#include<cstring>
#include<string>
#include<queue>
#include<algorithm>
#include<queue>
#include<map>
#include<stack>
#include<iostream>
#include<list>
#include<set>
#include<cmath>
#define INF 0x7fffffff
#define eps 1e-6
using namespace std;
int n;
struct lx
{
    int u,v,len;
} l[500*1001];
int fa[1001];
bool cmp(lx a,lx b)
{
    return a.len<b.len;
}
int father(int x)
{
    if(x!=fa[x])
        return fa[x]=father(fa[x]);
}
int main()
{
    while(scanf("%d",&n)!=EOF)
    {
        for(int i=0; i<=n; i++)
            fa[i]=i;
        int cot=0;
        for(int i=1; i<=n; i++)
            for(int j=1; j<=n; j++)
            {
                int len;
                scanf("%d",&len);
                if(i==j)continue;
                l[cot].u=i;
                l[cot].v=j;
                l[cot++].len=len;
            }
        sort(l,l+cot,cmp);
        int ans=0;

        for(int i=0; i<cot; i++)
        {
            int fu=father(l[i].u);
            int fv=father(l[i].v);
            if(fu==fv)continue;

            fa[fv]=fu;
            ans+=l[i].len;
        }
        printf("%d\n",ans);
    }
}

Copy

Copyright notice ： This article is the original article of the blogger , Blog , Do not reprint without permission .

Publisher ： Full stack programmer stack length , Reprint please indicate the source ：https://javaforall.cn/116986.html Link to the original text ：https://javaforall.cn