1598D - Training Session(思维，组合数学)

AC代码：

#include <bits/stdc++.h>
#define int long long
using namespace std; 
const int N = 1e6+5;
int n;
int a[N],b[N];
void solve(){
	cin>>n;
	
	map<int,int>ma,mb;
	for(int i=0;i<n;i++){
		cin>>a[i]>>b[i];
		ma[a[i]]++,mb[b[i]]++;
	}
	
	int res=n*(n-1)*(n-2)/6;
	
	for(int i=0;i<n;i++)res-=(ma[a[i]]-1)*(mb[b[i]]-1);
	
	cout<<res<<endl;
}

main(){
	int T;
	cin>>T;
	while(T--)solve();
}