基本思路是 枚举出 a + b的值,之后枚举 c + d ,看是否存在 a + b = -(c + d)
由于4000 * 4000 的数据很大,查询只能使用哈希表了
5S跑过去的,感觉还可以……
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<map>
#include<stack>
#include<iostream>
#include<queue>
#include<set>
#include<vector>
#include<cmath>
using namespace std;
#define MAX_SIZE 4000 + 10
#define MAXD 16000000 + 10
#define MAXHASH 10000007
int A[MAX_SIZE],B[MAX_SIZE],C[MAX_SIZE],D[MAX_SIZE];
int array1[MAXD],array2[MAXD];
int cnt;
int head[MAXHASH],next[MAXHASH];
int hash(int t){
int ans = abs(array1[t]) % MAXHASH;
return ans;
}
int hash2(int t){
int ans = abs(array2[t]) % MAXHASH;
return ans;
}
void try_to_insert(int u){
int h = hash(u);
next[u] = head[h];
head[h] = u;
}
bool check(int u){ /*检查元素*/
int h = hash2(u);
for(int i = head[h] ; i != -1 ; i = next[i]){
if(array1[i] == array2[u]) cnt ++;
}
return false;
}
int main(){
int T;
scanf("%d",&T);
while(T--){
int n,k1 = 0,k2 = 0;
scanf("%d",&n);
memset(head,-1,sizeof(head));
for(int i = 0 ; i < n ; i++){
scanf("%d%d%d%d",&A[i],&B[i],&C[i],&D[i]);
for(int j = 0 ; j < i ; j++){
array1[k1++] = A[i] + B[j];
array1[k1++] = A[j] + B[i];
array2[k2++] = -1 * (C[i] + D[j]);
array2[k2++] = -1 * (C[j] + D[i]);
}
array1[k1++] = A[i] + B[i];
array2[k2++] = -1 * (C[i] + D[i]);
}
for(int i = 0 ; i < k1 ; i++)
try_to_insert(i);
cnt = 0;
for(int i = 0 ; i < k2 ; i++){
check(i);
}
printf("%d\n",cnt);
if(T > 0) printf("\n");
}
return 0;
}