[组合] BZOJ 2916 [Poi1997]Monochromatic Triangles

转化为求 总三角形-同色三角形

不同色三角形 一定有且只有2个点的邻边颜色不同

#include<cstdio>
#include<cstdlib>
#include<algorithm>
using namespace std;
typedef long long ll;

inline char nc(){
	static char buf[100000],*p1=buf,*p2=buf;
	if (p1==p2) { p2=(p1=buf)+fread(buf,1,100000,stdin); if (p1==p2) return EOF; }
	return *p1++;
}

inline void read(int &x){
	char c=nc(),b=1;
	for (;!(c>='0' && c<='9');c=nc()) if (c=='-') b=-1;
	for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()); x*=b;
}

int n,m,a[1001]; ll ans,sum;

int main(){
	int u,v;
	freopen("t.in","r",stdin);
	freopen("t.out","w",stdout);
	read(n); read(m); ans=(ll)n*(n-1)*(n-2)/6;
	for (int i=1;i<=m;i++)
		read(u),read(v),a[u]++,a[v]++;
	for (int i=1;i<=n;i++)
		sum+=a[i]*(n-a[i]-1);
	printf("%lld\n",ans-sum/2);
	return 0;
}