CF757F Team Rocket Rises Again

题目

题目

思路

我们先用dij（板子见here）
求最短路，然后对可能出现在最短路上的边跑支配树（板子见（here））
然后就可以了
记得开long long(3年OI一场空，不开long long见祖宗)
code：

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<queue>
using namespace std;
//When I wrote this code,God and I unterstood what was I doing 
inline long long read()
{
    long long ret,c,f=1;
    while (((c=getchar())> '9'||c< '0')&&c!='-');
    if (c=='-') f=-1,ret=0;
    else ret=c-'0';
    while ((c=getchar())>='0'&&c<='9') ret=ret*10+c-'0';
    return ret*f;
}
struct fP{
	long long to[600010],nxt[600010],w[600010];
	long long head[300005],tot;
	void reset()
	{
		memset(head,0,sizeof(head));
		tot=0;
		return;
	}
	void add(long long x,long long y,long long z)
	{
		to[++tot]=y;
		w[tot]=z;
		nxt[tot]=head[x];
		head[x]=tot;
		return;
	}
} wj,jw,kyx;
bool book[300005];
long long n,m,id[300005],b[300005],dfn[300005],dep[300005],fa[300005],f[300005],semi[300005],idom[300005],st[20][300005],lyw[300005],bq[300005],ans[300005],x,y,z,tot;
void Tarjan(long long x)
{
	dfn[x]=++tot;
	lyw[tot]=x;
	for (long long i=wj.head[x];i;i=wj.nxt[i])
	{
		if (!dfn[wj.to[i]])
		{
			fa[wj.to[i]]=x;
			Tarjan(wj.to[i]);
		}
	}
	return;
}
long long find(long long x)
{
	if (x==f[x]) return x;
	long long y=find(f[x]);
	if (dfn[semi[bq[f[x]]]]<dfn[semi[bq[x]]]) bq[x]=bq[f[x]];
	return f[x]=y;
}
void dfs(long long x,long long fat)
{
	ans[x]=1;
	for (long long i=kyx.head[x];i;i=kyx.nxt[i])
	{
		if (ans[kyx.to[i]]) continue;
		dfs(kyx.to[i],x);
		ans[x]+=ans[kyx.to[i]];
	}
	return;
}
struct f2{
	long long x,y;
} pp;
bool operator <(const f2 &a,const f2 &b)
{
	return a.x>b.x;
}
priority_queue<f2> c;
void dij(long long r)
{
	for (long long i=1;i<=n;i++) b[i]=1e18;
	b[r]=0;
	pp.y=r;
	c.push(pp);
	while (c.size())
	{
		long long w=c.top().y;
		c.pop();
		if (book[w]) continue;
		book[w]=1;
		for (long long i=kyx.head[w];i;i=kyx.nxt[i])
		{
			if (b[kyx.to[i]]>b[w]+kyx.w[i])
			{
				b[kyx.to[i]]=b[w]+kyx.w[i];
				pp.x=b[kyx.to[i]];
				pp.y=kyx.to[i];
				c.push(pp);
			}
		}
	}
	for (long long w=1;w<=n;w++)
	{
		for (long long i=kyx.head[w];i;i=kyx.nxt[i])
		{
			if (b[kyx.to[i]]==b[w]+kyx.w[i])
			{
				wj.add(w,kyx.to[i],0);
				jw.add(kyx.to[i],w,0);
			}
		}
	}
	kyx.reset();
	return;
}
int main()
{
	long long r;
	n=read(),m=read(),r=read();
	for (long long i=1;i<=m;i++)
	{
		x=read(),y=read(),z=read();
		kyx.add(x,y,z);
		kyx.add(y,x,z);
	}
	dij(r);
	Tarjan(r);
	for (long long i=1;i<=n;i++) bq[i]=f[i]=semi[i]=i;
	for (long long i=tot;i>=2;i--)
	{
		for (long long j=jw.head[lyw[i]];j;j=jw.nxt[j])
		{
			if (dfn[jw.to[j]]==0) continue;
			find(jw.to[j]);
			if (dfn[semi[bq[jw.to[j]]]]<dfn[semi[lyw[i]]]) semi[lyw[i]]=semi[bq[jw.to[j]]];
		}
		f[lyw[i]]=fa[lyw[i]];
		kyx.add(semi[lyw[i]],lyw[i],0);
		for (long long j=kyx.head[fa[lyw[i]]];j;j=kyx.nxt[j])
		{
			find(kyx.to[j]);
			if (semi[bq[kyx.to[j]]]==fa[lyw[i]]) idom[kyx.to[j]]=fa[lyw[i]];
			else idom[kyx.to[j]]=bq[kyx.to[j]];
		}
		kyx.head[fa[lyw[i]]]=0;
	}
	for (long long i=2;i<=tot;i++)
	{
		if (idom[lyw[i]]!=semi[lyw[i]]) idom[lyw[i]]=idom[idom[lyw[i]]];
	}
	long long mx=0;
	for (long long i=tot;i>=2;i--)
	{
		ans[lyw[i]]++;
		ans[idom[lyw[i]]]+=ans[lyw[i]];
		if (ans[idom[lyw[i]]]>mx&&idom[lyw[i]]!=r) mx=ans[idom[lyw[i]]];
		if (ans[lyw[i]]>mx&&lyw[i]!=r) mx=ans[lyw[i]];
	}
	cout<<mx;
	return 0;
}
//Now,only God know