无归岛【仙人掌图 最大权独立集】

题目链接 BZOJ 1487

---

  在解决这个问题之前，我们可以先了解一下这个问题：仙人掌图的最大独立集。稍有些许差别，不带权值。

  好了，回到这个问题上来，那么此题的题意讲的那么繁杂，到底讲的是个什么玩意儿呢？

  有N个点，M条边的无向图，每个点都有各自的权值，问最大权独立集。

  好了，这样一来这个问题就简单了，圆方树上跑树形DP即可，将原来的“1”变成现在的权值，就是用最大独立集的样式来写即可。

#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <limits>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
//#include <unordered_map>
//#include <unordered_set>
#define lowbit(x) ( x&(-x) )
#define pi 3.141592653589793
#define e 2.718281828459045
#define INF 0x3f3f3f3f3f3f3f3f
#define eps 1e-8
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
#define MP(a, b) make_pair(a, b)
#define MAX_3(a, b, c) max(a, max(b, c))
#define Rabc(x) x > 0 ? x : -x
using namespace std;
typedef unsigned long long ull;
typedef unsigned int uit;
typedef long long ll;
const int maxN = 2e5 + 7, maxM = 4e5 + 7;
int N, M, a[maxN];
struct Graph
{
    int head[maxN], cnt;
    struct Eddge
    {
        int nex, to;
        Eddge(int a=-1, int b=0):nex(a), to(b) {}
    } edge[maxM];
    inline void addEddge(int u, int v) { edge[cnt] = Eddge(head[u], v); head[u] = cnt++; }
    inline void _add(int u, int v) { addEddge(u, v); addEddge(v, u); }
    inline void clear() { cnt = 0; for(int i=1; i<=N; i++) head[i] = -1; }
} Old, Now;
int dfn[maxN], low[maxN], tot, Stap[maxN], Stop, Bcnt;
bool instack[maxN] = {false};
int dp[maxN][2] = {0}, sum[maxN][2][2] = {0};
vector<int> B_po[maxN];
inline void work(int u, int v)
{
    Bcnt++; B_po[Bcnt].clear(); Now.head[N + Bcnt] = -1;
    int p;
    do
    {
        p = Stap[Stop--]; instack[p] = false;
        Now._add(N + Bcnt, p);
        B_po[Bcnt].push_back(p);
    } while(p ^ v);
    Now._add(u, N + Bcnt);
}
void Tarjan(int u, int fa)
{
    dfn[u] = low[u] = ++tot;
    Stap[++Stop] = u;
    instack[u] = true;
    for(int i=Old.head[u], v; ~i; i=Old.edge[i].nex)
    {
        v = Old.edge[i].to;
        if(v == fa) continue;
        if(!dfn[v])
        {
            Tarjan(v, u);
            if(low[v] > dfn[u])
            {
                instack[Stap[Stop--]] = false;
                Now._add(u, v);
            }
            else if(low[v] == dfn[u])
            {
                work(u, v);
            }
            low[u] = min(low[u], low[v]);
        }
        else if(instack[v])
        {
            low[u] = min(low[u], dfn[v]);
        }
    }
}
void dfs(int u, int fa)
{
    if(u > N)
    {
        for(int i=Now.head[u], v; ~i; i=Now.edge[i].nex)
        {
            v = Now.edge[i].to;
            if(v == fa) continue;
            dfs(v, u);
        }
        int Bid = u - N, len = (int)B_po[Bid].size();
        sum[0][0][0] = dp[B_po[Bid][0]][0]; sum[0][0][1] = sum[0][1][0] = 0; sum[0][1][1] = dp[B_po[Bid][0]][1];
        for(int i=1; i<len; i++)
        {
            sum[i][0][0] = max(sum[i - 1][0][1], sum[i - 1][0][0]) + dp[B_po[Bid][i]][0];
            sum[i][0][1] = sum[i - 1][0][0] + dp[B_po[Bid][i]][1];
            sum[i][1][0] = max(sum[i - 1][1][1], sum[i - 1][1][0]) + dp[B_po[Bid][i]][0];
            sum[i][1][1] = sum[i - 1][1][0] + dp[B_po[Bid][i]][1];
        }
        dp[u][0] = sum[len - 1][0][0];
        dp[u][1] = MAX_3(sum[len - 1][0][1], sum[len - 1][1][0], sum[len - 1][1][1]);
    }
    else
    {
        for(int i=Now.head[u], v; ~i; i=Now.edge[i].nex)
        {
            v = Now.edge[i].to;
            if(v == fa) continue;
            dfs(v, u);
            dp[u][0] += max(dp[v][1], dp[v][0]);
            dp[u][1] += dp[v][0];
        }
        dp[u][1] += a[u];
    }
}
inline void init()
{
    tot = Stop = Bcnt = 0;
    Old.clear(); Now.clear();
}
int main()
{
    scanf("%d%d", &N, &M);
    init();
    for(int i=1, u, v; i<=M; i++)
    {
        scanf("%d%d", &u, &v);
        Old._add(u, v);
    }
    for(int i=1; i<=N; i++) scanf("%d", &a[i]);
    int ans = 0;
    for(int i=1; i<=N; i++)
    {
        if(!dfn[i])
        {
            Tarjan(i, 0);
            dfs(i, 0);
            ans += max(dp[i][0], dp[i][1]);
        }
    }
    printf("%d\n", ans);
    return 0;
}