[hdu4694]Important Sisters

来自FallDream的博客，未经允许，请勿转载，谢谢。

---

给定一张图，求每个点到第n个点必须经过的点的编号之和。n<=50000

一道支配树裸题

然后统计答案的时候可以正着推，ans[i]=ans[idom[i]]+i

#include<iostream>
#include<cstdio>
#include<cstring>
#define MN 50000
#define ll long long
using namespace std;
inline int read()
{
    int x =  , f = ; char ch = getchar();
    while(ch < '' || ch > ''){ if(ch == '-') f = -;  ch = getchar();}
    while(ch >= '' && ch <= ''){x = x *  + ch - '';ch = getchar();}
    return x * f;
}
ll val[MN+];
int n,m,cnt,tot=,mark[MN+],dn,head[MN+],Fa[MN+],fa[MN+],top[MN+],back[MN+],Best[MN+],dfn[MN+],id[MN+],s[MN+],d[MN+];
struct edge{int to,next;}e[MN*];
inline void ins(int*H,int f,int t){e[++cnt]=(edge){t,H[f]};H[f]=cnt;}

void Pre(int x)
{
    id[dfn[x]=++dn]=x;
    for(int    i=head[x];i;i=e[i].next)
        if(!dfn[e[i].to]) Fa[e[i].to]=x,Pre(e[i].to);
}
inline bool P(int x,int y){return dfn[x]>dfn[y];}
inline int Up(int x)
{
    if(fa[x]==x) return x;
    int y=Up(fa[x]);
    if(P(s[Best[x]],s[Best[fa[x]]])) Best[x]=Best[fa[x]];
    return fa[x]=y;
}

inline void Tarjan()
{
    for(int i=dn;i>;--i)
    {
        int u=id[i];
        for(int j=back[u];j;j=e[j].next)
            if(dfn[e[j].to])
                Up(e[j].to),P(s[u],s[Best[e[j].to]])?s[u]=s[Best[e[j].to]]:;
        ins(top,s[u],u);fa[u]=Fa[u];u=Fa[u];
        for(int j=top[u];j;j=e[j].next)
        {
            Up(e[j].to);
            if(s[Best[e[j].to]]==s[u]) d[e[j].to]=u;
            else d[e[j].to]=Best[e[j].to];
        }
    }
    for(int i=;i<=dn;++i) if(d[id[i]]!=s[id[i]]) d[id[i]]=d[d[id[i]]];
}

int main()
{
    while(scanf("%d%d",&n,&m)!=EOF)
    {
        cnt=dn=;++tot;
        memset(head,,sizeof(int)*(n+));
        memset(back,,sizeof(int)*(n+));
        memset(top,,sizeof(int)*(n+));
        memset(val,,sizeof(ll)*(n+));
        memset(dfn,,sizeof(int)*(n+));
        memset(d,,sizeof(int)*(n+));
        for(int i=;i<=m;++i)
        {
            int u=read(),v=read();
            ins(head,u,v);
            ins(back,v,u);
        }
        for(int i=;i<=n;++i) Best[i]=s[i]=fa[i]=i;
        Pre(n);Tarjan();
        for(int i=;i<=dn;++i) val[id[i]]=val[d[id[i]]]+id[i];
        for(int i=;i<=n;++i) printf("%I64d%c",dfn[i]?val[i]:,i==n?'\n':' ');
    }
    return ;
}