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 in Java (OpenJDK 11.0.6) (judge verdict: Runtime Error)


import java.math.BigInteger;
import java.util.*;

public class Main {
    private static final Scanner sc = new Scanner(System.in);
    private static final int M = 64;
    private static final int OR1 = 0;
    private static final int AND0 = 1;
    private static final int AND1 = 2;
    private static final int OR0 = 3;

    private int[] S;
    private int[] T;
    private long[][] U;
    private long[][] V;
    private int[][][] mat;
    private long[][][] ans;
    private int N;
    private int[][] rowType;
    private int[][] colType;
    private int[] sumR;
    private int[] sumC;

    private void read(int[] v, int N) {
        for (int i = 0; i < N; i++) {
            v[i] = sc.nextInt();
        }
    }

    private void read(BigInteger[] v, int N) {
        for (int i = 0; i < N; i++) {
            v[i] = new BigInteger(sc.next());
        }
    }

    private boolean bit(long[] v, int k) {
        if (k < 32) {
            return (v[1] & (1L << k)) > 0;
        } else {
            k -= 32;
            return (v[0] & (1L << k)) > 0;
        }
    }

    private boolean isAND1(int v1, long[] v2, int k) {
        return v1 == 0 && bit(v2, k);
    }

    private boolean isOR1(int v1, long[] v2, int k) {
        return v1 == 1 && bit(v2, k);
    }

    private boolean isAND0(int v1, long[] v2, int k) {
        return v1 == 0 && !bit(v2, k);
    }

    private void fail() {
        System.out.println("-1");
        System.exit(0);
    }

    private void fill(int k) {
        // AND1 row
        for (int r = 0; r < N; r++) {
            if (rowType[k][r] == AND1) {
                for (int c = 0; c < N; c++) {
                    mat[r][c][0] = 1;
                    ++sumR[r];
                    ++sumC[c];
                }
            }
        }

        // AND1 col
        for (int c = 0; c < N; c++) {
            if (colType[k][c] == AND1) {
                for (int r = 0; r < N; r++) {
                    mat[k][r][c] = 1;
                    ++sumR[r];
                    ++sumC[c];
                }
            }
        }

        for (int r = 0; r < N; r++) {
            for (int c = 0; c < N; c++) {
                // OR1 OR1
                if (rowType[k][r] == OR1 && colType[k][c] == OR1) {
                    mat[k][r][c] = 1;
                    ++sumR[r];
                    ++sumC[c];
                } else // AND0 OR1
                if (rowType[k][r] == AND0 && colType[k][c] == OR1) {
                    if (mat[k][r][c] == 0 && sumC[c] == 0) {
                        if (sumR[r] < N - 1) {
                            mat[k][r][c] = 1;
                            ++sumR[r];
                            ++sumC[c];
                        } else {
                            fail();
                        }
                    }
                } else // OR1 AND0
                if (rowType[k][r] == OR1 && colType[k][c] == AND0) {
                    if (mat[k][r][c] == 0 && sumR[r] == 0 ) {
                        if (sumC[c] < N - 1) {
                            mat[k][r][c] = 1;
                            ++sumR[r];
                            ++sumC[c];
                        } else {
                            fail();
                        }
                    }
                }
            }
        }
    }

    private boolean check() {
        for (int r = 0; r < N; r++) {
            long[] tmp = new long[2];
            tmp[0] = ans[r][0][0];
            tmp[1] = ans[r][0][1];
            for (int c = 1; c < N; c++) {
                if (S[r] == 0) {
                    tmp[0] &= ans[r][c][0];
                    tmp[1] &= ans[r][c][1];
                } else {
                    tmp[0] |= ans[r][c][0];
                    tmp[1] |= ans[r][c][1];
                }
            }

            if (tmp[0] != U[r][0] || tmp[1] != U[r][1]) {
                return false;
            }
        }

        for (int c = 0; c < N; c++) {
            long[] tmp = new long[2];
            tmp[0] = ans[0][c][0];
            tmp[1] = ans[0][c][1];
            for (int r = 1; r < N; r++) {
                if (T[c] == 0) {
                    tmp[0] &= ans[r][c][0];
                    tmp[1] &= ans[r][c][1];
                } else {
                    tmp[0] |= ans[r][c][0];
                    tmp[1] |= ans[r][c][1];
                }
            }

            if (tmp[0] != V[c][0] || tmp[1] != V[c][1]) {
                return false;
            }
        }
        return true;
    }

    private void solve() {
        N = sc.nextInt();
        S = new int[N]; T = new int[N];
        BigInteger[] IU = new BigInteger[N];
        BigInteger[] IV = new BigInteger[N];
        read(S, N); read(T, N); read(IU, N); read(IV, N);
        mat = new int[M][N][N];

        U = new long[N][2];
        V = new long[N][2];
        for (int i = 0; i < N; ++i) {
            for (int k = M - 1; k >= 0; --k) {
                if (k >= 32) {
                    U[i][0] = (U[i][0] << 1) | (IU[i].testBit(k) ? 1 : 0);
                    V[i][0] = (V[i][0] << 1) | (IV[i].testBit(k) ? 1 : 0);
                } else {
                    U[i][1] = (U[i][1] << 1) | (IU[i].testBit(k) ? 1 : 0);
                    V[i][1] = (V[i][1] << 1) | (IV[i].testBit(k) ? 1 : 0);
                }
            }
        }

        rowType = new int[M][N];
        colType = new int[M][N];
        for (int k = 0; k < M; ++k) {
            for (int r = 0; r < N; r++) {
                if (isOR1(S[r], U[r], k)) {
                    rowType[k][r] = OR1;
                } else if (isAND0(S[r], U[r], k)) {
                    rowType[k][r] = AND0;
                } else if (isAND1(S[r], U[r], k)) {
                    rowType[k][r] = AND1;
                } else {
                    rowType[k][r] = OR0;
                }
            }

            for (int c = 0; c < N; c++) {
                if (isOR1(T[c], V[c], k)) {
                    colType[k][c] = OR1;
                } else if (isAND0(T[c], V[c], k)) {
                    colType[k][c] = AND0;
                } else if (isAND1(T[c], V[c], k)) {
                    colType[k][c] = AND1;
                } else {
                    colType[k][c] = OR0;
                }
            }
        }

        sumR = new int[N];
        sumC = new int[N];

        for (int k = 0; k < M; k++) {
            fill(k);
        }

        ans = new long[N][N][2];
        for (int r = 0; r < N; r++) {
            for (int c = 0; c < N; c++) {
                for (int k = M - 1; k >= 0; k--) {
                    if (k >= 32) {
                        ans[r][c][0] = (ans[r][c][0] << 1) | mat[k][r][c];
                    } else {
                        ans[r][c][1] = (ans[r][c][1] << 1) | mat[k][r][c];
                    }
                }
            }
        }

        if (check()) {
            for (int r = 0; r < N; r++) {
                for (int c = 0; c < N; c++) {
                    System.out.print(BigInteger.valueOf(ans[r][c][0]).shiftLeft(32).or(BigInteger.valueOf(ans[r][c][1])));
                    System.out.print(c == N - 1 ? "\n" : " ");
                }
            }
        } else {
            System.out.println("-1");
        }
    }

    public static void main(String[] args) {
        new Main().solve();
    }
}