洛谷P1989 无向图三元环计数

分析：

洛谷题解

代码：

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;//三年竞赛一场空，不开long long见祖宗 
//typedef __int128 lll;
#define print(i) cout << "debug: " << i << endl
#define close() ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define mem(a, b) memset(a, b, sizeof(a))
#define x first
#define y second
typedef pair<int, int> par;
const ll mod = 1e9 + 7;
const int maxn = 1e6 + 10;
const int inf = 0x3f3f3f3f;
par a[maxn];
int d[maxn];
vector<int> g[maxn];
int vis[maxn];

int main()
{
    int n, m; cin >> n >> m;
    for(int i = 1; i <= m; i++)
        cin >> a[i].x >> a[i].y, d[a[i].x]++, d[a[i].y]++;
    for(int i = 1; i <= m; i++)
    {
        int x = a[i].x, y = a[i].y;
        if(d[x] > d[y] || d[x] == d[y] && x > y) swap(x, y);
        g[x].push_back(y);
    }
    int ans = 0;
    for(int i = 1; i <= n; i++)
    {
        for(int j : g[i]) vis[j] = i;
        for(int j : g[i])
            for(int k : g[j])
                if(vis[k] == i)
                    ans++;
    }
    cout << ans << endl;
}