无向图中三元环的个数

#include <bits/stdc++.h>
#define LL long long
using namespace std;
const int bas = 1e5+1;
const int maxn = 1e5+5;
vector<int> G[maxn];
int n, m;
//unordered_set<LL> _hash;
set<LL> _hash;
int deg[maxn], vis[maxn];
int bel[maxn];
void init()
{
    for(int i = 1; i <= n; ++i)
    {
        deg[i] = bel[i] = vis[i] = 0;
        G[i].clear();
    }
}
void work()
{
    int x = sqrt(1.0*m);
    LL ans = 0;
    for(int a = 1; a <= n; ++a)
    {
        vis[a] = 1;
        //扫一遍与a相连的所有点，为下面提供O(1)判两点是否存在连边 
        for(int i = 0; i < G[a].size(); ++i)
        bel[G[a][i]] = a;
        for(int i = 0; i < G[a].size(); ++i)
        {
            int b = G[a][i];
            if(vis[b])
                continue;
            if(deg[b] <= x) 
            {
                //如果b度数<=sqrt(m)，则枚举b的所有边 
                for(int j = 0; j < G[b].size(); ++j)
                {
                    int c = G[b][j];
                    //printf("ccc %d %d %d\n",c,bel[c],a);
                    if(bel[c] == a)
                    {
                        ++ans;
                     } 
                }
            }
            else
            {
                //如果b度数>sqrt(m)，则枚举a的所有边 
                for(int j = 0; j < G[a].size(); ++j)
                {
                    int c = G[a][j];
                    if(_hash.find(1ll*b*bas+c) != _hash.end())
                    {
                        ++ans;
                    }

                }
            }
        }
    }
    //统计后每个三元环的每条边都会被统计一次，所以 应该/3 
    printf("%lld\n", ans/3);
}
int main()
{
    int t, u, v;
    while(~scanf("%d %d", &n, &m))
    {
        init(); _hash.clear();
        for(int i = 1; i <= m; ++i)
        {
            scanf("%d %d", &u, &v);
            ++deg[u], ++deg[v];
            G[u].push_back(v);
            G[v].push_back(u);
            _hash.insert(1ll*u*bas+v);
            _hash.insert(1ll*v*bas+u);
        }
        work();
    }   
    return 0;
}