bzoj4316: 小C的独立集

链接

点击跳转

题解

这题就类似于骑士那个题

在$tarjan$的过程中进行单独把环拿出来$dp$就行

代码

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define iinf 0x3f3f3f3f
#define linf (1ll<<60)
#define eps 1e-8
#define maxn 1000010
#define maxe 1000010
#define cl(x) memset(x,0,sizeof(x))
#define rep(i,a,b) for(i=a;i<=b;i++)
#define drep(i,a,b) for(i=a;i>=b;i--)
#define em(x) emplace(x)
#define emb(x) push_back(x)
#define emf(x) emplace_front(x)
#define fi first
#define se second
#define de(x) cerr<<#x<<" = "<<x<<endl
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll read(ll x=0)
{
    ll c, f(1);
    for(c=getchar();!isdigit(c);c=getchar())if(c=='-')f=-f;
    for(;isdigit(c);c=getchar())x=x*10+c-0x30;
    return f*x;
}
struct Graph
{
    int etot, head[maxn], to[maxe], next[maxe], w[maxe];
    void clear(int N)
    {
        for(int i=1;i<=N;i++)head[i]=0;
        etot=0;
    }
    void adde(int a, int b, int c=0){to[++etot]=b;w[etot]=c;next[etot]=head[a];head[a]=etot;}
    #define forp(_,__) for(ll p=__.head[_];p;p=__.next[p])
}G;
ll n, m, w[maxn], dp[maxn][2], f[maxn][2];
pll DP(vector<int>& v)
{
    ll i; pll ret;
    f[0][0]=dp[v[0]][0], f[0][1]=-linf;
    rep(i,1,v.size()-1)
    {
        f[i][0] = dp[v[i]][0] + max(f[i-1][0],f[i-1][1]);
        f[i][1] = dp[v[i]][1] + f[i-1][0];
    }
    ret.fi = max(f[v.size()-1][0],f[v.size()-1][1]);
    f[0][0]=-linf, f[0][1]=dp[v[0]][1];
    rep(i,1,v.size()-1)
    {
        f[i][0] = dp[v[i]][0] + max(f[i-1][0],f[i-1][1]);
        f[i][1] = dp[v[i]][1] + f[i-1][0];
    }
    ret.se = f[v.size()-1][0];
    return ret;
}
ll ans;
struct Cactus
{
    int dfn[maxn], low[maxn], iscut[maxn], tim, tot, s[maxn];
    vector<int> bcc[maxn];
    void dfs(Graph &G, int u, int fa)
    {
        dp[u][1]=1;
        int ch=0;
        s[++*s]=u;
        dfn[u]=low[u]=++tim;
        forp(u,G)
        {
            ll v=G.to[p];
            if(!dfn[v])
            {
                ch++;
                dfs(G,v,u);
                low[u]=min(low[u],low[v]);
                if(low[v]==dfn[u])
                {
                    iscut[u]=true;
                    tot++;
                    while(s[*s]!=v)
                    {
                        bcc[tot].emb(s[*s]);
                        --*s;
                    }
                    bcc[tot].emb(v); --*s;
                    bcc[tot].emb(u);
                    reverse(bcc[tot].begin(),bcc[tot].end());
                    pll pr=DP(bcc[tot]);
                    dp[u][0]=pr.fi, dp[u][1]=pr.se;
                }
            }
            else low[u]=min(low[u],dfn[v]);
        }
        if(fa==-1 and ch==1)iscut[u]=0;
    }
    void run(Graph &G, int N)
    {
        int i;
        for(i=1;i<=N;i++)iscut[i]=dfn[i]=low[i]=0;
        *s=tim=tot=0;
        for(i=1;i<=N;i++)if(!dfn[i])dfs(G,i,-1), ans+=max(dp[i][0],dp[i][1]);
    }
}cactus;
int main()
{
    ll n, m, u, v, i;
    n=read(), m=read();
    rep(i,1,m)
    {
        u=read(), v=read();
        G.adde(u,v), G.adde(v,u);
    }
    cactus.run(G,n);
    printf("%lld",ans);
    return 0;
}