📦 ved015 / Codeforces-solution

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39#include<iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<string>
using namespace std;
typedef long long ll;

int main(){
    int t;
    cin >> t;
    while(t--){
        int a,b,k;
        cin >> a >> b >> k;
        map<int,int> m1,m2;
        for(int i = 0; i < k; i++){
            int a;
            cin >> a;
            m1[a]++;
        }
        for(int i = 0; i < k; i++){
            int a;
            cin >> a;
            m2[a]++;
        }
        ll ans = ((ll)k*(k-1))/2;
        for(auto it : m1){
            int val = it.second;
            ans -= ((ll)val*(val-1))/2;
        }
        for(auto it : m2){
            int val = it.second;
            ans -= ((ll)val*(val-1))/2;
        }
        cout << ans << endl;
    }
    return 0;
}