cf#697c

cf#697c

题目：

C. Ball in Berland

time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
At the school where Vasya is studying, preparations are underway for the graduation ceremony. One of the planned performances is a ball, which will be attended by pairs of boys and girls.

Each class must present two couples to the ball. In Vasya’s class, a boys and b girls wish to participate. But not all boys and not all girls are ready to dance in pairs.

Formally, you know k possible one-boy-one-girl pairs. You need to choose two of these pairs so that no person is in more than one pair.

For example, if a=3, b=4, k=4 and the couples (1,2), (1,3), (2,2), (3,4) are ready to dance together (in each pair, the boy’s number comes first, then the girl’s number), then the following combinations of two pairs are possible (not all possible options are listed below):

(1,3) and (2,2);
(3,4) and (1,3);
But the following combinations are not possible:

(1,3) and (1,2) — the first boy enters two pairs;
(1,2) and (2,2) — the second girl enters two pairs;
Find the number of ways to select two pairs that match the condition above. Two ways are considered different if they consist of different pairs.

Input
The first line contains one integer t (1≤t≤104) — the number of test cases. Then t test cases follow.

The first line of each test case contains three integers a, b and k (1≤a,b,k≤2⋅105) — the number of boys and girls in the class and the number of couples ready to dance together.

The second line of each test case contains k integers a1,a2,…ak. (1≤ai≤a), where ai is the number of the boy in the pair with the number i.

The third line of each test case contains k integers b1,b2,…bk. (1≤bi≤b), where bi is the number of the girl in the pair with the number i.

It is guaranteed that the sums of a, b, and k over all test cases do not exceed 2⋅105.

It is guaranteed that each pair is specified at most once in one test case.

Output
For each test case, on a separate line print one integer — the number of ways to choose two pairs that match the condition above.

Example
inputCopy
3
3 4 4
1 1 2 3
2 3 2 4
1 1 1
1
1
2 2 4
1 1 2 2
1 2 1 2
outputCopy
4
0
2

刚开始写了枚举，然后tle了，刚刚去看大佬kritipandey的解答，真是得到了很大的启发惹。
我写的：

#include<iostream>
#include<cmath>
#include<cstring>
#include<algorithm>
typedef long long ll ;
using namespace std;
ll sum;
struct s{
	int a,b;
}p[200005];
bool cmp2(s x,s y){
	return x.b<y.b;
}
bool cmp1(s x,s y){
	if(x.a==y.a)return cmp2(x,y);
	return x.a<y.a;
}
void sol(ll k){
	for(int i = 0;i < k; i++){
		for(int j = i; j < k;j++){
			if(p[i].a!=p[j].a&&p[i].b!=p[j].b)
				sum++;
		}
	}
}
int main(){
	ios::sync_with_stdio(false);
	int n;cin>> n;
	ll a,b,k;
	while(n--){
		cin>>a>>b>>k;
		for(int i = 0; i<k;i++){
			cin>>p[i].a;
		}
		for(int i = 0; i<k;i++){
			cin>>p[i].b;
		}
		sort(p,p+k,cmp1);
		sol(k);
		cout<<sum<<endl;
		sum=0;
	}
}

然后呢，我们发现，总的组合个数就是k*(k-1)，考虑条件每次重复都会导致次数下降好多次，那好多次是多少次呢？
出现第二次那么第一次出现的就无法和它匹配了，第n次出现前n-1次就不能和它匹配，那么只要把重复的给减掉就好了。
kritipandey的解法：

#include<bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
  int t;cin>>t;
  while(t--){
    int a,b,k,ans;cin>>a>>b>>k;
    ans=k*(k-1)/2;
    vector<int>A(a),B(b);
    for(int i=0;i<k;i++){
      int x;cin>>x;
      ans-=(A[--x]++);
    }
    for(int i=0;i<k;i++){
      int x;cin>>x;
      ans-=(B[--x]++);
    }
    cout<<ans<<endl;
  }
}