Codefoeces round #697 div3 c Ball in Berland

大意

思路

#include<bits/stdc++.h>
using namespace std;  
int numa,numb,k;
int a[200010],b[200010];
int maxx=0;

int main()
{
  int t;
  scanf("%d",&t);
  while(t--)
  {
    map<int ,int>man,women;
    scanf("%d%d%d",&numa,&numb,&k);
    for(int i=1;i<=k;i++)
    {
      a[i]=0;
      b[i]=0;
      man[i]=0;
      women[i]=0;
    }
    for(int i=1;i<=k;i++)
    {
      scanf("%d",&a[i]);
      man[a[i]]++;
    }
    for(int i=1;i<=k;i++)
    {
      scanf("%d",&b[i]);
      women[b[i]]++;
    }
    long long ans=0;
    for(int i=1;i<=k;i++)
    {
      ans+=k-man[a[i]]-women[b[i]]+1;
    }
    printf("%lld\n",ans/2);
  }
}