[Kruskal] ZOJ 1586

Submitted failed

题意

每个人有一个路由器，第二行给出的n的数，代表第i个人购买一个路由器需要的权。 下面给出n×n的方阵mp，mp[i][j]代表第i和第j个人之间建立连接需要花费的权。每一天线路都要买一个路由器

思路

把两点之间的权 = 两个路由器 + 线路钱的总和就行了

#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>

using namespace std;

const int N = 110;
const int M = 20010;

struct Edge {
    int u, v, dis;
    Edge () {}
    Edge ( int u, int v, int d )
        : u ( u )
        , v ( v )
        , dis ( d ) {}

    bool operator< ( const Edge &rhs ) const { return dis < rhs.dis; }
};

struct Kruskal {
    int n, m;
    Edge edges[ M ];
    int fa[ N ];
    int findset ( int x ) { return fa[ x ] == -1 ? x : fa[ x ] = findset ( fa[ x ] ); }

    void init ( int _n ) {
        n = _n;
        m = 0;
        memset ( fa, -1, sizeof ( fa ) );
    }

    void AddEdge ( int u, int v, int d ) { edges[ m++ ] = Edge ( u, v, d ); }

    int kruskal () {
        int sum = 0;
        int cnt = 0;
        sort ( edges, edges + m );

        for ( int i = 0; i < m; ++i ) {
            int u = edges[ i ].u, v = edges[ i ].v;
            if ( findset ( u ) != findset ( v ) ) {
                fa[ findset ( u ) ] = findset ( v );
                sum += edges[ i ].dis;

                if ( ++cnt >= n - 1 )
                    return sum;
            }
        }
        return -1;
    }
} KK;

int main () {
    int t;
    scanf ( "%d", &t );
    while ( t-- ) {
        int n;
        scanf ( "%d", &n );
        KK.init ( n );

        int adapt[ N ];
        for ( int i = 0; i < n; ++i )
            scanf ( "%d", &adapt[ i ] );

        for ( int i = 0; i < n; ++i )
            for ( int j = 0; j < n; ++j ) {
                int x;
                scanf ( "%d", &x );
                x = x + adapt[ i ] + adapt[ j ];
                if ( i < j )
                    KK.AddEdge ( i, j, x );
            }

        int sol = KK.kruskal ();
        printf ( "%d\n", sol );
    }

    return 0;
}