loj #10096 luogu P3627 [APIO2009]抢掠计划

analysis

缩点后，问题转化为在图中求一个起点为S，终点为某个酒吧的链使得这个链最长，于是联想到spfa，故缩点后跑一遍spfa就可以了

code

#include<bits/stdc++.h>
using namespace std;
#define loop(i,start,end) for(register int i=start;i<=end;++i)
#define anti_loop(i,start,end) for(register int i=start;i>=end;--i)
#define clean(arry,num) memset(arry,num,sizeof(arry))
#define max(a,b) ((a>b)?a:b)
#define min(a,b) ((a<b)?a:b)
#define ll long long
template<typename T>void read(T &x){
    x=0;char r=getchar();T neg=1;
    while(r>'9'||r<'0'){if(r=='-')neg=-1;r=getchar();}
    while(r>='0'&&r<='9'){x=(x<<1)+(x<<3)+r-'0';r=getchar();}
    x*=neg;
}
const int maxn=500000+10;
struct node{int _v;int nxt;}edge[maxn];
int head[maxn];
struct e{int _s;int _e;}line[maxn];
int n,m,cnt=0,S,P;
bool _cafe[maxn];
int _val[maxn];
inline void addl(int u,int v){
    edge[cnt]._v=v;
    edge[cnt].nxt=head[u];
    head[u]=cnt++;
}
int dfn[maxn],low[maxn],belong[maxn],num=0,col=0;
int sta[maxn],top=0,val[maxn];
bool cafe[maxn];
void tarjan(int u){
    dfn[u]=low[u]=++num;sta[++top]=u;
    for(int i=head[u];i!=-1;i=edge[i].nxt){
        int v=edge[i]._v;
        if(!dfn[v]){
            tarjan(v);
            low[u]=min(low[u],low[v]);
        }else if(!belong[v])low[u]=min(low[u],dfn[v]);
    }if(dfn[u]==low[u]){
        belong[u]=++col;
        val[col]+=_val[u];
        cafe[col]=cafe[col]|_cafe[u];
        while(top>=0&&sta[top]!=u){
            belong[sta[top]]=col;
            val[col]+=_val[sta[top]];
            cafe[col]=cafe[col]|_cafe[sta[top]];
            --top;
        }
        --top;
    }
}
inline bool cmp(e a,e b){return ((a._s==b._s)?a._e<b._e:a._s<b._s);}
inline void reset(){
    loop(i,1,m){
        line[i]._s=belong[line[i]._s];
        line[i]._e=belong[line[i]._e];
    }sort(line+1,line+1+m,cmp);
}
inline void rebuild(){
    reset();clean(head,-1),cnt=0;
    loop(i,1,m){
        if(line[i]._e!=line[i]._s&&(line[i]._e!=line[i-1]._e||line[i]._s!=line[i-1]._s))
            addl(line[i]._s,line[i]._e);
    }S=belong[S];
}
deque<int>q;
int dis[maxn];
inline void spfa(){
    clean(dis,0);
    dis[S]=val[S];
    q.push_back(S);
    while(q.empty()==false){
        int u=q.front();q.pop_front();
        for(int i=head[u];i!=-1;i=edge[i].nxt){
            int v=edge[i]._v;
            if(dis[v]<dis[u]+val[v]){
                dis[v]=dis[u]+val[v];
                if(q.empty()==false&&dis[v]>dis[q.front()])
                    q.push_front(v);
                else q.push_back(v);
            }
        }
    }
}
int main(){
    #ifndef ONLINE_JUDGE
    freopen("datain.txt","r",stdin);
    #endif // ONLINE_JUDGE
    clean(head,-1);clean(_cafe,false);clean(belong,0);clean(cafe,false);clean(val,0);
    clean(_val,0);clean(dfn,0),clean(low,0);
    read(n),read(m);
    loop(i,1,m){
        read(line[i]._s),read(line[i]._e);
        addl(line[i]._s,line[i]._e);
    }
    loop(i,1,n)read(_val[i]);
    read(S);read(P);
    register int _pos;
    loop(i,1,P)read(_pos),_cafe[_pos]=true;
    loop(i,1,n)
        if(!dfn[i])tarjan(i);
    rebuild();
    spfa();int maxx=-1;
    loop(i,1,col)
        if(cafe[i])
            maxx=max(dis[i],maxx);
    printf("%d\n",maxx);
    return 0;
}