很早就考过的题,当时根本不会,强连通分量什么的没听过,当初就没有改了(主要是上网找发现来源是apio于是吓到了233)
无意中看到了,正好复习一下
tarjan缩点,在新的图上跑一遍最长路
//19:20-19:50 555码速好慢
#include<cstdio>
#include<vector>
#include<queue>
#define RG register
#define MAXN 500005
#define C (c=getchar())
using namespace std;
inline int read() {
int a=0;
static char c;
C;
while(c<'0'||c>'9')C;
while(c>='0'&&c<='9')a=a*10+c-'0',C;
return a;
}
int n,m,s,p,ans,a[MAXN],dfn[MAXN],low[MAXN],belong[MAXN],st[MAXN],mark[MAXN];
int dep,tot,top;
int vis[MAXN],dis[MAXN];
vector<int>edge[MAXN],redge[MAXN];
inline int min(int a,int b){return a<b?a:b;}
inline int max(int a,int b){return a>b?a:b;}
void dfs(int x)
{
dfn[x]=low[x]=++dep;
mark[x]=1;st[++top]=x;
for(int i=0;i<edge[x].size();++i)
if(!dfn[edge[x][i]]){dfs(edge[x][i]);low[x]=min(low[x],low[edge[x][i]]);}
else if(mark[edge[x][i]]) low[x]=min(low[x],dfn[edge[x][i]]);
if(low[x]==dfn[x])
{
int tmp=0;
++tot;
while(tmp!=x)
{
tmp=st[top--];
mark[tmp]=0;
belong[tmp]=tot;
}
}
}
void rebuild()
{
RG int i,j;
int flag=1;
for(i=1;i<=n;++i)
{
if(flag&&i==s) s=belong[i],flag=0;
for(j=0;j<edge[i].size();++j)
if(belong[i]!=belong[edge[i][j]])
redge[belong[i]].push_back(belong[edge[i][j]]);
}
}
queue<int>Q;
void spfa()
{
RG int i;
for(i=1;i<=tot;++i) dis[i]=0;
dis[s]=a[s],vis[s]=1;
Q.push(s);
while(!Q.empty())
{
int x=Q.front();Q.pop();
for(i=0;i<redge[x].size();++i)
if(dis[x]+a[redge[x][i]]>dis[redge[x][i]])
{
dis[redge[x][i]]=dis[x]+a[redge[x][i]];
if(!vis[redge[x][i]])
{
vis[redge[x][i]]=1;
Q.push(redge[x][i]);
}
}
vis[x]=0;
}
}
int main(void)
{
n=read(),m=read();
register int i;
for(i=1;i<=m;++i)
{
int x=read(),y=read();
edge[x].push_back(y);
}
for(i=1;i<=n;++i)
if(!dfn[i]) dfs(i);
for(i=1;i<=n;++i)
{
int x=read();
a[belong[i]]+=x;
}
s=read(),p=read();
rebuild();
spfa();
for(i=1;i<=p;++i)
{
int x=read();
ans=max(ans,dis[belong[x]]);
}
printf("%d",ans);
return 0;
}
从今天开始坚持每天更新
-----------------------------------------
5.11更新
说上面那句话等于放了个屁