BZOJ1179: [Apio2009]Atm

显然的tarjan+拓扑排序dp…犯了个脑抽错死的真惨…

#include<queue>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
//by:MirrorGray
using namespace std;
const int N=1111111;
int mo[N],v[N],in[N],vis[N];
int dfn[N],low[N],s[N],ins[N],bel[N],top,cnt,scc;
queue <int> q;
struct node{
    int is[N],dp[N];
    int tot,head[N],ver[N],nxt[N];
    node(){
        tot=-1;
        memset(head,-1,sizeof(head));
    }
    void add(int x,int y){
        nxt[++tot]=head[x];
        head[x]=tot;
        ver[tot]=y;
    }
    void toposort(int x){
        int ans=0;
        q.push(x);dp[x]=mo[x];
        while(!q.empty()){
            int x=q.front();q.pop();
            if(is[x])ans=max(ans,dp[x]);
            for(int i=head[x];~i;i=nxt[i]){
                int y=ver[i];
                in[y]--,dp[y]=max(dp[y],dp[x]+mo[y]);
                if(!in[y])q.push(y);
            }
        }
        printf("%d\n",ans);
    }
}a,b;

void tarjan(int x){
    dfn[x]=low[x]=++cnt;
    ins[x]=true;s[++top]=x;
    for(int i=a.head[x];~i;i=a.nxt[i])
    if(!dfn[ a.ver[i] ]){
        tarjan(a.ver[i]);
        low[x]=min(low[x],low[ a.ver[i] ]);
    }
    else if(ins[ a.ver[i] ])low[x]=min(low[x],dfn[ a.ver[i] ]);
    if(dfn[x]==low[x]){
        int y;scc++;
        do{
            y=s[top--];
            ins[y]=false;
            bel[y]=scc;
            mo[scc]+=v[y];
            b.is[scc]|=a.is[y];
        }while(y!=x);
    }
}

void dfs(int x){
    vis[x]=true;
    for(int i=b.head[x];~i;i=b.nxt[i]){
        in[ b.ver[i] ]++;
        if(!vis[ b.ver[i] ])dfs(b.ver[i]);
    }
}

int main(){
    int n,m;scanf("%d%d",&n,&m);
    for(int i=1;i<=m;i++){
        int b,c;scanf("%d%d",&b,&c);
        a.add(b,c);
    }
    for(int i=1;i<=n;i++)scanf("%d",&v[i]);
    int s,p;scanf("%d%d",&s,&p);
    for(int i=1;i<=p;i++){
        int b;scanf("%d",&b);
        a.is[b]=true;
    }
    for(int i=1;i<=n;i++)if(!dfn[i])tarjan(i);
    for(int x=1;x<=n;x++)for(int i=a.head[x];~i;i=a.nxt[i])
    if(bel[x]!=bel[ a.ver[i] ])b.add(bel[x],bel[ a.ver[i] ]);
    dfs(bel[s]); 
    b.toposort(bel[s]);
    return 0;
}