hdu 4334 Trouble

最新推荐文章于 2019-10-18 12:27:36 发布

GadyPu

最新推荐文章于 2019-10-18 12:27:36 发布

阅读量274

点赞数

分类专栏：哈希

本文链接：https://blog.csdn.net/u012077152/article/details/48297507

版权

哈希专栏收录该内容

9 篇文章 0 订阅

订阅专栏

原题链接：http://acm.hdu.edu.cn/showproblem.php?pid=4334
简单哈希。。

#include<algorithm>
#include<iostream>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<vector>
#include<map>
using std::abs;
using std::min;
using std::find;
using std::pair;
using std::vector;
using std::multimap;
#define pb(e) push_back(e)
#define sz(c) (int)(c).size()
#define mp(a, b) make_pair(a, b)
#define all(c) (c).begin(), (c).end()
#define iter(c) __typeof((c).begin())
#define cls(arr, val) memset(arr, val, sizeof(arr))
#define cpresent(c, e) (find(all(c), (e)) != (c).end())
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define tr(c, i) for(iter(c) i = (c).begin(); i != (c).end(); ++i)
const int N = 1000007;
const int INF = 0x3f3f3f3f;
typedef long long ll;
struct Hash_Set {
    ll num[N << 1];
    int tot, head[N], next[N];
    inline void init() {
        tot = 0, cls(head, -1);
    }
    inline void insert(ll val) {
        ll u = abs(val) % N;
        num[tot] = val, next[tot] = head[u], head[u] = tot++;
    }
    inline bool find(ll val) {
        ll u = abs(val) % N;
        for(int i = head[u]; ~i; i = next[i]) {
            if(num[i] == val) return true;
        }
        return false;
    }

}hash;
ll A[5][210];
int main() {
#ifdef LOCAL
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w+", stdout);
#endif
    ll val;
    int t, n;
    scanf("%d", &t);
    while(t--) {
        hash.init();
        scanf("%d", &n);
        rep(i, 5) {
            rep(j, n) scanf("%lld", &A[i][j]);
        }
        rep(i, n) {
            rep(j, n) {
                val = A[0][i] + A[1][j];
                hash.insert(val);
            }
        }
        bool f = false;
        rep(i, n) {
            rep(j, n) {
                rep(k, n) {
                    val = A[2][i] + A[3][j] + A[4][k];
                    val = -val;
                    if(hash.find(val)) { f = true; break; }
                }
                if(f) break;
            }
            if(f) break;
        }
        puts(f ? "Yes" : "No");
    }
    return 0;
}