例题8-3(uva-1152)

不需要去重

#include <iostream>
#include <istream>
#include <sstream>
#include <vector>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <numeric>
#include <chrono>
#include <ctime>
#include <cmath>
#include <cctype>
#include <string>
#include <cstdio>
#include <iomanip>#include <thread>
#include <mutex>
#include <condition_variable>
#include <functional>
#include <iterator>
using namespace std;
const int maxn = 4007;
int arr[4][maxn],n;unordered_map<int, int> mmp;int main()
{
    int t;cin >> t;while (t--) {
    mmp.clear();cin >> n;for (int i = 0; i < n; i++) {
    for (int j = 0; j < 4; j++)cin >> arr[j][i];}for (int i = 0;i<n;i++){
    for (int j = 0; j < n; j++) {
    int a = arr[0][i];int b = arr[1][j];mmp[a + b]++;}}int ret = 0;for (int i = 0; i < n; i++){
    for (int j = 0; j < n; j++) {
    int a = arr[2][i];int b = arr[3][j];if (mmp.count(-(a + b)))ret += mmp[-(a + b)];}}cout << ret << endl;if (t) cout << endl;}return 0;
}