HDU 2242 强连通分量缩点+树形DP

题目链接

题意：

连通图希望找一条边，使得连通图变成两个连通图，求这两个连通图点权差最小值，若无法分成两个连通图输出impossible。

思路：

先将图中的强连通分量缩点，缩点以后进行树形DP，需要注意此题有重边。

C++代码：

#include<bits/stdc++.h>
using namespace std;
const int maxn = 10010;
const int maxm = 40010;
const int inf  = 0x3f3f3f3f;

int n,m,all,v[maxn],tol,head[maxn];
struct edge
{
    int to,next;
}es[maxm];

void addedge( int u , int v )
{
    es[tol].to = v;
    es[tol].next = head[u];
    head[u] = tol++;
}

int bch,ord,top,col[maxn],sum[maxn],vis[maxn],sta[maxn],dfn[maxn],low[maxn];
int S[maxn],T[maxn],len;

void tarjan( int u , int f )
{
    dfn[u] = low[u] = ord++;
    vis[u] = 1;
    sta[top++] = u;
    int flag = 0;
    for ( int i=head[u] ; i!=-1 ; i=es[i].next )
    {
        int v = es[i].to;
        if ( v==f&&flag==0 )
        {
            flag = 1;
            continue;
        }
        if ( vis[v]==0 )
        {
            tarjan ( v , u );
            low[u] = min ( low[u] , low[v] );
        }
        else if ( col[v]==-1 )
        {
            low[u] = min ( low[u] , dfn[v] );
        }
        if ( dfn[u]<low[v] )
        {
            S[len] = u;
            T[len] = v;
            len++;
        }
    }
    if ( low[u]==dfn[u] )
    {
        while ( sta[top-1]!=u )
        {
            col[sta[--top]] = bch;
            sum[bch] += v[sta[top]];
        }
        sum[bch] += v[sta[--top]];
        col[u] = bch++;
    }
}

void build()
{
    tol = 0;
    memset ( head , -1 , sizeof(head) );
    for ( int i=0 ; i<len ; i++ )
    {
        addedge( col[S[i]] , col[T[i]] );
        addedge( col[T[i]] , col[S[i]] );
    }
}

int ans,tot[maxn];

void dfs( int u , int f )
{
    tot[u] = sum[u];
    for ( int i=head[u] ; i!=-1 ; i=es[i].next )
    {
        int v = es[i].to;
        if ( v!=f )
        {
            dfs ( v , u );
            tot[u] += tot[v];
        }
    }
    ans = min( ans , abs(all-2*tot[u]) );
}

int main()
{
    while( scanf( "%d%d" , &n , &m )==2 )
    {
        all = 0;
        for ( int i=0 ; i<n ; i++ )
        {
            scanf ( "%d" , &v[i] );
            all += v[i];
        }
        tol = 0;
        memset ( head , -1 , sizeof(head) );
        for ( int i=0 ; i<m ; i++ )
        {
            int s,t;
            scanf ( "%d%d" , &s , &t );
            addedge ( s , t );
            addedge ( t , s );
        }
        bch = ord = top = len = 0;
        memset ( col , -1 , sizeof(col) );
        memset ( vis ,  0 , sizeof(vis) );
        memset ( sum ,  0 , sizeof(sum) );
        tarjan ( 0 , -1 );
        if ( bch==1 )
            printf ( "impossible\n" );
        else
        {
            build ();
            ans = inf;
            dfs ( 0 , -1 );
            printf ( "%d\n" , ans );
        }
    }
    return 0;
}