Problem:
 Score : 600 points    Problem Statement Given are an integer N and arrays S , T , U , and V , each of length N .
Construct an N×N matrix a that satisfy the following conditions:   a_{i,j} is an integer.  0 \leq a_{i,j}  \lt 2^{64} .  If S_{i} = 0 , the bitwise AND of the elements in the i -th row is U_{i} .  If S_{i} = 1 , the bitwise OR of the elements in the i -th row is U_{i} .  If T_{i} = 0 , the bitwise AND of the elements in the i -th column is V_{i} .  If T_{i} = 1 , the bitwise OR of the elements in the i -th column is V_{i} .   However, there may be cases where no matrix satisfies the conditions.      Constraints  All values in input are integers.  1 \leq N \leq 500  0 \leq S_{i} \leq 1  0 \leq T_{i} \leq 1  0 \leq U_{i} \lt 2^{64}  0 \leq V_{i} \lt 2^{64}         Input Input is given from Standard Input in the following format:  N  S_{1}  S_{2}  ...  S_{N}  T_{1}  T_{2}  ...  T_{N}  U_{1}  U_{2}  ...  U_{N}  V_{1}  V_{2}  ...  V_{N}       Output If there exists a matrix that satisfies the conditions, print one such matrix in the following format:  a_{1,1}  ...  a_{1,N}  :  a_{N,1}  ...  a_{N,N}   Note that any matrix satisfying the conditions is accepted.  If no matrix satisfies the conditions, print -1 .        Sample Input 1 2
0 1
1 0
1 1
1 0      Sample Output 1 1 1
1 0  In Sample Input 1 , we need to find a matrix such that:   the bitwise AND of the elements in the 1 -st row is 1 ;  the bitwise OR of the elements in the 2 -nd row is 1 ;  the bitwise OR of the elements in the 1 -st column is 1 ;  the bitwise AND of the elements in the 2 -nd column is 0 .        Sample Input 2 2
1 1
1 0
15 15
15 11      Sample Output 2 15 11
15 11

Solution (Python):
import sys
readline = sys.stdin.readline

def check(k):
    res = [[None]*N for _ in range(N)]
    H = []
    W = []
    for i in range(N):
        if S[i] == 0 and U[i] & (1<<k):
            res[i] = [1]*N
        elif S[i] == 1 and not U[i] & (1<<k):
            res[i] = [0]*N
        else:
            H.append(i)
    for j in range(N):
        if T[j] == 0 and V[j] & (1<<k):
            for i in range(N):
                if res[i][j] == 0:
                    return -1
                res[i][j] = 1
        elif T[j] == 1 and not V[j] & (1<<k):
            for i in range(N):
                if res[i][j] == 1:
                    return -1
                res[i][j] = 0
        else:
            W.append(j)

    for st in range(4):
        if st > 1:
            for i in range(len(H)):
                for j in range(len(W)):
                    h, w = H[i], W[j]
                    res[h][w] = (i+j+st)%2
        else:
            for i in range(len(H)):
                for j in range(len(W)):
                    h, w = H[i], W[j]
                    res[h][w] = st
        flag = True
        for i in H:
            if S[i] == 0:
                cnt = 1
                for j in range(N):
                    cnt &= res[i][j]
                if  (cnt ^ (U[i]>>k)) & 1:
                    flag = False
                    break
            else:
                cnt = 0
                for j in range(N):
                    cnt |= res[i][j]
                if  (cnt ^ (U[i]>>k)) & 1:
                    flag = False
                    break
        else:
            for j in W:
                if T[j] == 0:
                    cnt = 1
                    for i in range(N):
                        cnt &= res[i][j]
                    if  (cnt ^ (V[j]>>k)) & 1:
                        flag = False
                        break
                else:
                    cnt = 0
                    for i in range(N):
                        cnt |= res[i][j]
                    if  (cnt ^ (V[j]>>k)) & 1:
                        flag = False
                        break
        if flag:
            return res
    return -1
    

N = int(readline())
S = list(map(int, readline().split()))
T = list(map(int, readline().split()))
U = list(map(int, readline().split()))
V = list(map(int, readline().split()))

ans = [[0]*N for _ in range(N)]

for k in range(64):
    res = check(k)
    if res == -1:
        ans = -1
        break
    for i in range(N):
        for j in range(N):
            ans[i][j] |= res[i][j]<<k
if ans == -1:
    print(-1)
else:
    print('\n'.join([' '.join(map(str, a)) for a in ans]))