201509-4 高速公路 100分 156ms

点击前往试题目录：https://blog.csdn.net/best335/article/details/99550556

Tarjan算法求解强连通分量 + 前N项和公式

#include<iostream>
#include<vector>
#include<cstring>
using namespace std;
int n,m,ans;
short DFN[10001],LOW[10001],idx,v,num;
vector<short>vroot[10001],vstack;
void Tarjan(const short& u){
	DFN[u]=LOW[u]=++idx,vstack.push_back(u);
	for(short i=0,ni=vroot[u].size();i<ni;++i){
		const short& v=vroot[u][i];
		if(DFN[v]==0){
			Tarjan(v);
			if(LOW[u]>LOW[v])LOW[u]=LOW[v];
		}
		else if(DFN[v]!=-1&&LOW[u]>DFN[v]) LOW[u]=DFN[v];
	}
	if(DFN[u]==LOW[u]){
		num=0;
		while(DFN[u]!=-1)DFN[vstack.back()]=-1,vstack.pop_back(),++num;
		ans+=num*(num-1)/2;
	}
}
int main()
{
	cin>>n>>m,memset(DFN,0,sizeof(DFN)),memset(LOW,0,sizeof(LOW)),ans=0,idx=0;
	for(int i=0,a,b;i<m;++i)cin>>a>>b,vroot[a].push_back(b);
	for(short i=n;i>-1;--i)if(DFN[i]==0)Tarjan(i);
	cout<<ans<<endl;
	return 0;
}