UVa1152 4 Values Whose Sum is Zer

 

#include <iostream>
//#include <windows.h>
#include<bits/stdc++.h>
#define _for(i,a,b) for( int i=(a);i<(b);++i)
using namespace std;
int readint(){
int x; scanf("%d",&x); return x;
}

const int maxn = 4000 + 5;
int n,c,A[maxn],B[maxn],C[maxn],D[maxn],sums[maxn*maxn];

int main(){
#ifdef LOCAL
//freopen("C:\\Users\\hsxny\\Desktop\\shuru.txt","r",stdin);
#endif
   int T;
    T = readint();
    while(T--)
    {
        n = readint();
        _for(i,0,n)
        {
            scanf("%d%d%d%d",&A[i],&B[i],&C[i],&D[i]);
        }
        c = 0;
        _for(i,0,n)
            _for(j,0,n)
            {
                sums[c++] = A[i]+B[j];
            }
            sort(sums,sums+c);
            long long cnt = 0;
            _for(i,0,n)
                _for(j,0,n)
                {
                    cnt+=upper_bound(sums,sums+c,-C[i]-D[j])-lower_bound(sums,sums+c,-C[i]-D[j]);//这个是亮点,即在排好序的数组中有多少个待查的数
                }
            printf("%lld\n",cnt);
            if(T) cout<<endl;
    }
return 0;
}