题目大意:在一个图中,求所有边在三元环里的个数总和;就是图中有很多三角形,若两个三角形有重边,则算一个。
感想:考试时题目画的玄学图实在恶心,完全看不出题意,于是gg。当然,若看出来就好做了,直接枚举点(u,v),在枚举分别于u,v相连的点k的个数n,重边三角形就是n*(n-1)/2.
# include <iostream>
# include <cstdio>
# include <cmath>
# include <list>
# include <cstring>
# include <map>
# include <algorithm>
# include <queue>
using namespace std;
typedef long long ll;
int read()
{
register int f=1,i=0;char ch=getchar();
while(ch<'0'||ch>'9') {if(ch=='-') f=-1;ch=getchar();}
while(ch>='0'&&ch<='9') {i=(i<<3)+(i<<1)+ch-'0';ch=getchar();}
return f*i;
}
struct node
{
int u,v;
}E[200005];
vector<int>q[200005];
int t,n,m,x,y,cnt;
int main()
{
t=read();
while(t--)
{
n=read(),m=read();
cnt=0;
for(int i=1;i<=n;++i)
q[i].clear();
for(int i=1;i<=m;++i)
{
x=read(),y=read();
E[i].u=x;E[i].v=y;
q[x].push_back(y);
q[y].push_back(x);
}
for(int i=1;i<=n;++i)
sort(q[i].begin(),q[i].end());
ll ans=0;
for(int i=1;i<=m;++i)
{
x=E[i].u,y=E[i].v;
int sl=q[x].size(),sr=q[y].size();
int l=0,r=0,num=0;
while(l<sl&&r<sr)
{
if(q[x][l]>q[y][r]) r++;
else
{
if(q[y][r]>q[x][l]) l++;
else if(q[x][l]==q[y][r]) num++,l++,r++;
}
}
ans+=num*(num-1)/2;
}
cout<<ans<<endl;
}
}