2012 MultiUniversity Training Contest 4 D Trouble

hash

# include <stdio.h>
# include <string.h>

# define N 205
# define M 100007

typedef long long int LL;

int n;
LL a[6][N];
int head[M], next[N*N+N];

int hash(LL x)
{
                return ((x%M)+M)%M;
}

void init_hash_table(void)
{
                memset(head, -1, sizeof(head));
}

void insert_hash_table(LL num, int i)
{
                int hkey = hash(num);
                /*
                int u = head[hkey];
                while (~u)
                {
                                if (a[u/n][4]+a[u%n][5]==num) return ;
                                u = next[u];
                }*/
                next[i] = head[hkey];
                head[hkey] = i;
}

int lookup_hash_table(LL num)
{
                int hkey = hash(num);
                int u = head[hkey];
                while (~u)
                {
                                if (a[4][u/n]+a[5][u%n] == num) return 1;
                                u = next[u];
                }
                return 0;
}

int solve(void)
{
                int i, j, k, nn = 0;
                init_hash_table();
                for (i = 0; i < n; ++i)
                for (j = 0; j < n; ++j)
                {
                                insert_hash_table(a[4][i]+a[5][j], i*n+j) ;
                }
                for (i = 0; i < n; ++i)
                for (j = 0; j < n; ++j)
                for (k = 0; k < n; ++k)
                {
                                if (lookup_hash_table(-a[1][i]-a[2][j]-a[3][k]))
                                                return 1;
                }
                return 0;
}

int main()
{
                freopen("in.txt", "r", stdin);

                int T, i, j, k;

                scanf("%d", &T);
                for (i = 1; i <= T; ++i)
                {
                                scanf("%d", &n);
                                for (j = 1; j <= 5; ++j)
                                for (k = 0; k < n; ++k)
                                                scanf("%I64d", &a[j][k]);
                                if (solve())
                                                puts("Yes");
                                else
                                                puts("No");
                }

                return 0;
}