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 40 41
|
#include <iostream> #include <cstring> #include <cmath> #include <algorithm> #include <vector> #include <list> #include <string> #include <queue> #include <set> #include <map> #define mst(a,b) memset(a,b,sizeof(a)) #define INF 0x3f3f3f3f using namespace std; typedef long long ll; typedef unsigned long long ull; const int maxn=1e5+5; ll col[maxn]; int () { ll t; scanf("%lld",&t); while(t--) { map<ll,ll> rows; rows.erase(rows.begin(),rows.end()); ll n; scanf("%lld",&n); for(ll i=1;i<=n;i++){ ll row; scanf("%lld",&row); rows[row]++; scanf("%lld",&col[i]); } ll sum=0; for(ll i=1;i<=n;i++) sum+=rows[col[i]]; printf("%lldn",sum); } return 0; }
|
近期评论