点对

https://ac.nowcoder.com/acm/contest/558/F

思路：（1）直接枚举转折点跟新g[i][j]的联通性

（2）tarjan;求出联通分量，每个分量相互到达就可以直接计算数量

#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstdio>
#include<map>
#include<stack>
#include<string>
#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x) memset(x,0,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-16
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
ll gcd(ll a,ll b){while(b^=a^=b^=a%=b);return a;}
const int maxn=2e5+9;
const int mod=1e9+7;

inline ll read()
{
    ll f=1,x=0;
    char ss=getchar();
    while(ss<'0'||ss>'9')
    {
        if(ss=='-')f=-1;ss=getchar();
    }
    while(ss>='0'&&ss<='9')
    {
        x=x*10+ss-'0';ss=getchar();
    }    return f*x;
}


struct Edge
{
    int to,nex;
}edge[maxn];
int head[maxn],tot;

int Index,top;
int Low[maxn],DFN[maxn],Stack[maxn],Belong[maxn];//Belong 的值1~scc
int scc;
bool Instack[maxn];
int num[maxn];//强连通分量包含的点的个数

void addedge(int u,int v)
{
    edge[tot].to=v;
    edge[tot].nex=head[u];
    head[u]=tot++;
}

void Tarjan(int u)
{
    int v;
    Low[u]=DFN[u]=++Index;
    Stack[top++]=u;
    Instack[u]=true;
    for(int i=head[u];i!=-1;i=edge[i].nex)
    {
        v=edge[i].to;
        if(!DFN[v])
        {
            Tarjan(v);
            if(Low[u]>Low[v]) Low[u]=Low[v];
        }
        else if(Instack[v]&&Low[u]>DFN[v]) Low[u]=Low[v];
    }
    if(Low[u]==DFN[u])
    {
        scc++;
        do
        {
            v=Stack[--top];
            Instack[v]=false;
            Belong[v]=scc;
            num[scc]++;
        }
        while(v!=u);
    }
}
void solve(int n)
{
    mem(DFN);
    mem(Instack);
    mem(num);
    Index=scc=top=0;
    for(int i=1;i<=n;i++)
        if(!DFN[i])
            Tarjan(i);
}
void init()
{
    tot=0;
    for(int i=0;i<=maxn;i++) head[i]=-1;
}
int n,m;
int main()
{
    //FAST_IO;
    //freopen("input.txt","r",stdin);
    init();
    cin>>n>>m;
    while(m--)
    {
        int u,v;
        cin>>u>>v;
        addedge(u,v);
    }
    solve(n);
    ll ans=0;
    //cout<<scc<<endl;
    for(int i=1;i<=scc;i++)
    {
        if(num[i]>1)
            ans=ans+num[i]*(num[i]-1)/2;
    }
    cout<<ans<<endl;
    return 0;
}