题意:
给你一个有向图,求从a到b,且b到a这样的点对数量。
题解:
tarjan
代码如下:
#include<bits/stdc++.h>
using namespace std;
const int maxn=1e4+5,maxm=1e5+5;
typedef long long ll;
ll ans;
int n,m,DFN[maxn],LOW[maxn],stk[maxn],index,cnt,head[maxn],tot;
struct newt{
int to,next;
}edge[maxm];
bool vis[maxn];
void addEdge(int from,int to){
edge[++cnt]=(newt){to,head[from]};head[from]=cnt;
}
void tarjan(int now){
int i,next,tmp;
DFN[now]=LOW[now]=++tot;
stk[++index]=now;
vis[now]=true;
for (i=head[now];i!=-1;i=edge[i].next){
next=edge[i].to;
if(!DFN[next]){
tarjan(next);
LOW[now]=min(LOW[now],LOW[next]);
}
else if(vis[next]){
LOW[now]=min(LOW[now],DFN[next]);
}
}
if(LOW[now]==DFN[now]){
tmp=0;
do{
vis[stk[index]]=0;
index--;tmp++;
}while(now!=stk[index+1]);
if(tmp>=2)ans+=1ll*tmp*(tmp-1)/2;
}
}
int main(){
int i,a,b;
while(scanf("%d%d",&n,&m)!=EOF){
memset(head,-1,sizeof(head));
cnt=0;tot=0;index=0;ans=0;
memset(DFN,0,sizeof(DFN));
while(m--){
scanf("%d%d",&a,&b);
addEdge(a,b);
}
for (i=1;i<=n;i++)if(!DFN[i])tarjan(i);
printf("%lld\n",ans);
}
return 0;
}