Problem p02704 (python)

Fixed submission:
import numpy as np

N = int(input())

S = list(map(int,input().split()))
T = list(map(int,input().split()))
U = np.array(list(map(int,input().split())),dtype = np.uint64)
V = np.array(list(map(int,input().split())),dtype = np.uint64)

ans = np.zeros((N,N),dtype = np.uint64)

for n in range(64):
  u = (U>>n)&1
  v = (V>>n)&1
  su = [int(S[i]*2+u[i]) for i in range(N)]
  tv = [int(T[i]*2+v[i]) for i in range(N)]
  suzerozero = []
  suoneone = []
  tvzerozero = []
  tvoneone = []
  for i in range(N):
    if su[i] == 0:
      suzerozero.append(i)
    if su[i] == 3:
      suoneone.append(i)
  for i in range(N):
    if tv[i] == 0:
      tvzerozero.append(i)
    if tv[i] == 3:
      tvoneone.append(i)
  
  b = np.zeros((N,N),dtype = np.uint64)
  ###行のAND=1とOR=0を埋める###
  for i in range(N):
    if su[i] == 1:
      b[i] = np.ones(N,int)
  ###列のAND=1とOR=0を埋める###
  for i in range(N):
    if tv[i] == 1:
      b[:,i] = np.ones(N,int)
  ###行と列の値が一致するところを埋める###  
  b |= np.dot(np.array([u]).T,np.ones((1,N),dtype = np.uint64)) & np.dot(np.array([v]).T,np.ones((1,N),dtype = np.uint64)).T
  ###行のOR=1を満たしていく### 
  if 1 not in tv and 3 not in tv:
    m = len(tvzerozero)
    now = 0
    for i in suoneone:
      b[i][tvzerozero[now%m]] += 1
      now += 1
  ###列のOR=1を満たしていく### 
  if 1 not in su and 3 not in su:
    m = len(suzerozero)
    now = 0
    for i in tvoneone:
      b[suzerozero[now%m]][i] += 1
      now += 1
  ans += b<<n

def end():
  print(-1)
  exit()
for i in range(N):
  if S[i] == 0:
    now = ans[i][0]
    for j in range(1,N):
      now &= ans[i][j]
  if S[i] == 1:
    now = ans[i][0]
    for j in range(1,N):
      now |= ans[i][j]
  if now != U[i]:
    end()
for i in range(N):
  if T[i] == 0:
    now = ans[0][i]
    for j in range(1,N):
      now &= ans[j][i]
  if T[i] == 1:
    now = ans[0][i]
    for j in range(1,N):
      now |= ans[j][i]
  if now != V[i]:
    end()

for item in ans:
  print(*list(item))

Buggy submission (verdict: Runtime Error):
import numpy as np

N = int(input())

S = list(map(int,input().split()))
T = list(map(int,input().split()))
U = np.array(list(map(int,input().split())),dtype = np.uint64)
V = np.array(list(map(int,input().split())),dtype = np.uint64)

ans = np.zeros((N,N),dtype = np.uint64)

for n in range(64):
  u = (U>>n)&1
  v = (V>>n)&1
  su = [int(S[i]*2+u[i]) for i in range(N)]
  tv = [int(T[i]*2+v[i]) for i in range(N)]
  suzerozero = []
  suoneone = []
  tvzerozero = []
  tvoneone = []
  for i in range(N):
    if su[i] == 0:
      suzerozero.append(i)
    if su[i] == 3:
      suoneone.append(i)
  for i in range(N):
    if tv[i] == 0:
      tvzerozero.append(i)
    if tv[i] == 3:
      tvoneone.append(i)
  
  b = np.zeros((N,N),dtype = np.uint64)
  ###行のAND=1とOR=0を埋める###
  for i in range(N):
    if su[i] == 1:
      b[i] = np.ones(N,int)
  ###列のAND=1とOR=0を埋める###
  for i in range(N):
    if tv[i] == 1:
      b[:,i] = np.ones(N,int)
  ###行と列の値が一致するところを埋める###  
  b |= np.dot(np.array([u]).T,np.ones((1,N),dtype = np.uint64)) & np.dot(np.array([v]).T,np.ones((1,N),dtype = np.uint64)).T

  ###行のOR=1を満たしていく### 
  if 1 not in tv and 3 not in tv:
    m = len(tvzerozero)
    if m != 0:
      now = 0
      for i in suoneone:
        b[i][tvzerozero[now%m]] += 1
        now += 1
      
  ###列のOR=1を満たしていく### 
  if 1 not in su and 3 not in su:
    m = len(suzerozero)
    if m != 0:
      now = 0
      for i in tvoneone:
        b[svzerozero[now%m]][i] += 1
        now += 1
  ans += b<<n

def end():
  print(-1)
  exit()
for i in range(N):
  if S[i] == 0:
    now = ans[i][0]
    for j in range(1,N):
      now &= ans[i][j]
  if S[i] == 1:
    now = ans[i][0]
    for j in range(1,N):
      now |= ans[i][j]
  if now != U[i]:
    end()
for i in range(N):
  if T[i] == 0:
    now = ans[0][i]
    for j in range(1,N):
      now &= ans[j][i]
  if T[i] == 1:
    now = ans[0][i]
    for j in range(1,N):
      now |= ans[j][i]
  if now != V[i]:
    end()

for item in ans:
  print(*list(item))

Buggy submission (verdict: Runtime Error):
import numpy as np

N = int(input())

S = list(map(int,input().split()))
T = list(map(int,input().split()))
U = np.array(list(map(int,input().split())),dtype = np.uint64)
V = np.array(list(map(int,input().split())),dtype = np.uint64)

ans = np.zeros((N,N),dtype = np.uint64)

for n in range(64):
  u = (U>>n)&1
  v = (V>>n)&1
  su = [int(S[i]*2+u[i]) for i in range(N)]
  tv = [int(T[i]*2+v[i]) for i in range(N)]
  suzerozero = []
  suoneone = []
  tvzerozero = []
  tvoneone = []
  for i in range(N):
    if su[i] == 0:
      suzerozero.append(i)
    if su[i] == 3:
      suoneone.append(i)
  for i in range(N):
    if tv[i] == 0:
      tvzerozero.append(i)
    if tv[i] == 3:
      tvoneone.append(i)
  
  b = np.zeros((N,N),dtype = np.uint64)
  ###行のAND=1とOR=0を埋める###
  for i in range(N):
    if su[i] == 1:
      b[i] = np.ones(N,int)
  ###列のAND=1とOR=0を埋める###
  for i in range(N):
    if tv[i] == 1:
      b[:,i] = np.ones(N,int)
  ###行と列の値が一致するところを埋める###  
  b |= np.dot(np.array([u]).T,np.ones((1,N),dtype = np.uint64)) & np.dot(np.array([v]).T,np.ones((1,N),dtype = np.uint64)).T

  ###行のOR=1を満たしていく### 
  if 1 not in tv and 3 not in tv:
    m = len(tvzerozero)
    now = 0
    for i in suoneone:
      b[i][tvzerozero[now%m]] += 1
      now += 1
      
  ###列のOR=1を満たしていく### 
  if 1 not in su and 3 not in su:
    m = len(suzerozero)
    now = 0
    for i in tvoneone:
      b[svzerozero[now%m]][i] += 1
      now += 1
  ans += b<<n

def end():
  print(-1)
  exit()
for i in range(N):
  if S[i] == 0:
    now = ans[i][0]
    for j in range(1,N):
      now &= ans[i][j]
  if S[i] == 1:
    now = ans[i][0]
    for j in range(1,N):
      now |= ans[i][j]
  if now != U[i]:
    end()
for i in range(N):
  if T[i] == 0:
    now = ans[0][i]
    for j in range(1,N):
      now &= ans[j][i]
  if T[i] == 1:
    now = ans[0][i]
    for j in range(1,N):
      now |= ans[j][i]
  if now != V[i]:
    end()

for item in ans:
  print(*list(item))

Buggy submission (verdict: Runtime Error):
import numpy as np

N = int(input())

S = np.array(list(map(int,input().split())),dtype = np.uint64)
T = np.array(list(map(int,input().split())),dtype = np.uint64)
U = np.array(list(map(int,input().split())),dtype = np.uint64)
V = np.array(list(map(int,input().split())),dtype = np.uint64)

ans = np.zeros((N,N),dtype = np.uint64)

for n in range(64):
  u = (U>>n)&1
  v = (V>>n)&1
  invu = np.ones(N,dtype = np.uint64)-u
  invv = np.ones(N,dtype = np.uint64)-v
  b = np.zeros((N,N),dtype = np.uint64)
  check = np.zeros((N,N),dtype = np.uint64)
  ###行のAND=1とOR=0を埋める###
  for i in range(N):
    if S[i] != u[i]:
      if u[i] == 1:
        b[i] = np.ones(N,int)
      check[i] = np.ones(N,int)
  ###列のAND=1とOR=0を埋める###
  for i in range(N):
    if T[i] != v[i]:
      if v[i] == 1:
        if max(b[:,i]^check[:,i])!=0:
          print(-1)
          exit()
        b[:,i] = np.ones(N,int)
      if v[i] == 0:
        if max(b[:,i])!=0:
          print(-1)
          exit()
      check[:,i] = np.ones((1,N),int)
  ###行と列の値が一致するところを埋める###  
  same1 = np.dot(np.array([u]).T,np.ones((1,N),dtype = np.uint64)) & np.dot(np.array([v]).T,np.ones((1,N),dtype = np.uint64)).T
  same0 = np.dot(np.array([invu]).T,np.ones((1,N),dtype = np.uint64)) & np.dot(np.array([invv]).T,np.ones((1,N),dtype = np.uint64)).T
  b |= same1
  check |= (same1|same0)
  
  SUoneonelist = []
  for i in range(N):
    if S[i] == u[i] == 0:
      SUoneonelist.append(i)
  TVoneonelist = []
  for i in range(N):
    if T[i] == v[i] == 0:
      TVoneonelist.append(i)
  SUzerozerolist = []
  for i in range(N):
    if S[i] == u[i] == 0:
      SUzerozerolist.append(i)
  TVoneonelist = []
  for i in range(N):
    if T[i] == v[i] == 0:
      TVzerozerolist.append(i)
  continue
  ###行のOR=1を満たしていく###  
  for i in range(N):
    if S[i] == u[i] == 1 and max(b[i]) == 0: #まだ満たされてない行を発見した場合
      pass
      """
      flag = 0 #未解決
      for j in range(N):
        if T[j] == v[j] == b[i][j] == check[i][j] == 0 and sum(b[:,j]) < N-1:
          b[i][j] = check[i][j] = flag = 1
          break
      if not flag:
        print(-1)
        exit()
      """
  
  ###列のOR=1を満たしていく### 
  for i in range(N):
    if T[i] == v[i] == 1 and max(b[:,i]) == 0: #まだ満たされてない列を発見した場合
      pass
      """
      flag = 0 #未解決
      for j in range(N):
        if S[j] == u[j] == b[j][i] == check[j][i] == 0 and sum(b[j]) < N-1:
          b[j][i] = check[j][i] = flag = 1
          break
      if not flag:
        print(-1)
        exit()
      """
  """
  for i in range(N):
    if S[i] == 0 and((u>>i) & 1) == 0:
      if b & mask_gyo[i] == mask_gyo[i]:
        print(-1)
        exit()
    if S[i] == 0 and((u>>i) & 1) == 1:
      if b & mask_gyo[i] != mask_gyo[i]:
        print(-1)
        exit()
    if S[i] == 1 and((u>>i) & 1) == 0:
      if b & mask_gyo[i] != 0:
        print(-1)
        exit()
    if S[i] == 1 and((u>>i) & 1) == 1:
      if b & mask_gyo[i] == 0:
        print(-1)
        exit()
  
  for i in range(N):
    if T[i] == 0 and((v>>i) & 1) == 0:
      if b & mask_retu[i] == mask_retu[i]:
        print(-1)
        exit()
    if T[i] == 0 and((v>>i) & 1) == 1:
      if b & mask_retu[i] != mask_retu[i]:
        print(-1)
        exit()
    if T[i] == 1 and((v>>i) & 1) == 0:
      if b & mask_retu[i] != 0:
        print(-1)
        exit()
    if T[i] == 1 and((v>>i) & 1) == 1:
      if b & mask_retu[i] == 0:
        print(-1)
        exit()
  """
  ans += b<<n


for item in ans:
  print(*list(item))

Buggy submission (verdict: Runtime Error):
import numpy as np

N = int(input())

S = np.array(list(map(int,input().split())),dtype = np.int64)
T = np.array(list(map(int,input().split())),dtype = np.int64)
U = np.array(list(map(int,input().split())),dtype = np.int64)
V = np.array(list(map(int,input().split())),dtype = np.int64)

ans = np.zeros((N,N),dtype = np.int64)
exit()
for n in range(64):
  u = (U>>n)&1
  v = (V>>n)&1
  invu = np.ones(N,int)-u
  invv = np.ones(N,int)-v
  b = np.zeros((N,N),int)
  check = np.zeros((N,N),int)
  ###行のAND=1とOR=0を埋める###
  for i in range(N):
    if S[i] != u[i]:
      if u[i] == 1:
        b[i] = np.ones(N,int)
      check[i] = np.ones(N,int)
  ###列のAND=1とOR=0を埋める###
  for i in range(N):
    if T[i] != v[i]:
      if v[i] == 1:
        if max(b[:,i]^check[:,i])!=0:
          print(-1)
          exit()
        b[:,i] = np.ones(N,int)
      if v[i] == 0:
        if max(b[:,i])!=0:
          print(-1)
          exit()
      check[:,i] = np.ones((1,N),int)
  ###行と列の値が一致するところを埋める###  
  same1 = np.dot(np.array([u]).T,np.ones((1,N),int)) & np.dot(np.array([v]).T,np.ones((1,N),int)).T
  same0 = np.dot(np.array([invu]).T,np.ones((1,N),int)) & np.dot(np.array([invv]).T,np.ones((1,N),int)).T
  b |= same1
  check |= (same1|same0)
  ###行のOR=1を満たしていく###  
  for i in range(N):
    if S[i] == u[i] == 1 and max(b[i]) == 0: #まだ満たされてない行を発見した場合
      flag = 0 #未解決
      for j in range(N):
        if T[j] == v[j] == b[i][j] == check[i][j] == 0 and sum(b[:,j]) < N-1:
          b[i][j] = check[i][j] = flag = 1
          break
      if not flag:
        print(-1)
        exit()
  
  ###列のOR=1を満たしていく### 
  for i in range(N):
    if T[i] == v[i] == 1 and max(b[:,i]) == 0: #まだ満たされてない列を発見した場合
      flag = 0 #未解決
      for j in range(N):
        if S[j] == u[j] == b[j][i] == check[j][i] == 0 and sum(b[j]) < N-1:
          b[j][i] = check[j][i] = flag = 1
          break
      if not flag:
        print(-1)
        exit()
  """
  for i in range(N):
    if S[i] == 0 and((u>>i) & 1) == 0:
      if b & mask_gyo[i] == mask_gyo[i]:
        print(-1)
        exit()
    if S[i] == 0 and((u>>i) & 1) == 1:
      if b & mask_gyo[i] != mask_gyo[i]:
        print(-1)
        exit()
    if S[i] == 1 and((u>>i) & 1) == 0:
      if b & mask_gyo[i] != 0:
        print(-1)
        exit()
    if S[i] == 1 and((u>>i) & 1) == 1:
      if b & mask_gyo[i] == 0:
        print(-1)
        exit()
  
  for i in range(N):
    if T[i] == 0 and((v>>i) & 1) == 0:
      if b & mask_retu[i] == mask_retu[i]:
        print(-1)
        exit()
    if T[i] == 0 and((v>>i) & 1) == 1:
      if b & mask_retu[i] != mask_retu[i]:
        print(-1)
        exit()
    if T[i] == 1 and((v>>i) & 1) == 0:
      if b & mask_retu[i] != 0:
        print(-1)
        exit()
    if T[i] == 1 and((v>>i) & 1) == 1:
      if b & mask_retu[i] == 0:
        print(-1)
        exit()
  """
  ans += b<<n


for item in ans:
  print(*list(item))

Buggy submission (verdict: Runtime Error):
import numpy as np

N = int(input())

S = np.array(list(map(int,input().split())),dtype = np.int64)
T = np.array(list(map(int,input().split())),dtype = np.int64)
U = np.array(list(map(int,input().split())),dtype = np.int64)
V = np.array(list(map(int,input().split())),dtype = np.int64)

ans = np.zeros((N,N),dtype = np.int64)

for n in range(64):
  u = (U>>n)&1
  v = (V>>n)&1
  invu = np.ones(N,int)-u
  invv = np.ones(N,int)-v
  b = np.zeros((N,N),int)
  check = np.zeros((N,N),int)
  ###行のAND=1とOR=0を埋める###
  for i in range(N):
    if S[i] != u[i]:
      if u[i] == 1:
        b[i] = np.ones(N,int)
      check[i] = np.ones(N,int)
  ###列のAND=1とOR=0を埋める###
  for i in range(N):
    if T[i] != v[i]:
      if v[i] == 1:
        if max(b[:,i]^check[:,i])!=0:
          print(-1)
          exit()
        b[:,i] = np.ones(N,int)
      if v[i] == 0:
        if max(b[:,i])!=0:
          print(-1)
          exit()
      check[:,i] = np.ones((1,N),int)
  break
  ###行と列の値が一致するところを埋める###  
  same1 = np.dot(np.array([u]).T,np.ones((1,N),int)) & np.dot(np.array([v]).T,np.ones((1,N),int)).T
  same0 = np.dot(np.array([invu]).T,np.ones((1,N),int)) & np.dot(np.array([invv]).T,np.ones((1,N),int)).T
  b |= same1
  check |= (same1|same0)
  ###行のOR=1を満たしていく###  
  for i in range(N):
    if S[i] == u[i] == 1 and max(b[i]) == 0: #まだ満たされてない行を発見した場合
      flag = 0 #未解決
      for j in range(N):
        if T[j] == v[j] == b[i][j] == check[i][j] == 0 and sum(b[:,j]) < N-1:
          b[i][j] = check[i][j] = flag = 1
          break
      if not flag:
        print(-1)
        exit()
  
  ###列のOR=1を満たしていく### 
  for i in range(N):
    if T[i] == v[i] == 1 and max(b[:,i]) == 0: #まだ満たされてない列を発見した場合
      flag = 0 #未解決
      for j in range(N):
        if S[j] == u[j] == b[j][i] == check[j][i] == 0 and sum(b[j]) < N-1:
          b[j][i] = check[j][i] = flag = 1
          break
      if not flag:
        print(-1)
        exit()
  """
  for i in range(N):
    if S[i] == 0 and((u>>i) & 1) == 0:
      if b & mask_gyo[i] == mask_gyo[i]:
        print(-1)
        exit()
    if S[i] == 0 and((u>>i) & 1) == 1:
      if b & mask_gyo[i] != mask_gyo[i]:
        print(-1)
        exit()
    if S[i] == 1 and((u>>i) & 1) == 0:
      if b & mask_gyo[i] != 0:
        print(-1)
        exit()
    if S[i] == 1 and((u>>i) & 1) == 1:
      if b & mask_gyo[i] == 0:
        print(-1)
        exit()
  
  for i in range(N):
    if T[i] == 0 and((v>>i) & 1) == 0:
      if b & mask_retu[i] == mask_retu[i]:
        print(-1)
        exit()
    if T[i] == 0 and((v>>i) & 1) == 1:
      if b & mask_retu[i] != mask_retu[i]:
        print(-1)
        exit()
    if T[i] == 1 and((v>>i) & 1) == 0:
      if b & mask_retu[i] != 0:
        print(-1)
        exit()
    if T[i] == 1 and((v>>i) & 1) == 1:
      if b & mask_retu[i] == 0:
        print(-1)
        exit()
  """
  ans += b<<n


for item in ans:
  print(*list(item))

Buggy submission (verdict: Runtime Error):
import numpy as np

N = int(input())

S = np.array(list(map(int,input().split())),dtype = np.int64)
T = np.array(list(map(int,input().split())),dtype = np.int64)
U = np.array(list(map(int,input().split())),dtype = np.int64)
V = np.array(list(map(int,input().split())),dtype = np.int64)

ans = np.zeros((N,N),dtype = np.int64)

for n in range(64):
  u = (U>>n)&1
  v = (V>>n)&1
  invu = np.ones(N,int)-u
  invv = np.ones(N,int)-v
  b = np.zeros((N,N),int)
  check = np.zeros((N,N),int)
  ###行のAND=1とOR=0を埋める###
  for i in range(N):
    if S[i] != u[i]:
      if u[i] == 1:
        b[i] = np.ones(N,int)
      check[i] = np.ones(N,int)
  ###列のAND=1とOR=0を埋める###
  for i in range(N):
    if T[i] != v[i]:
      if v[i] == 1:
        if max(b[:,i]^check[:,i])!=0:
          print(-1)
          exit()
        b[:,i] = np.ones(N,int)
      if v[i] == 0:
        if max(b[:,i])!=0:
          print(-1)
          exit()
      check[:,i] = np.ones((1,N),int)
  ###行と列の値が一致するところを埋める###  
  same1 = np.dot(np.array([u]).T,np.ones((1,N),int)) & np.dot(np.array([v]).T,np.ones((1,N),int)).T
  same0 = np.dot(np.array([invu]).T,np.ones((1,N),int)) & np.dot(np.array([invv]).T,np.ones((1,N),int)).T
  b |= same1
  check |= (same1|same0)
  ###行のOR=1を満たしていく###  
  for i in range(N):
    if S[i] == u[i] == 1 and max(b[i]) == 0: #まだ満たされてない行を発見した場合
      flag = 0 #未解決
      for j in range(N):
        if T[j] == v[j] == b[i][j] == check[i][j] == 0 and sum(b[:,j]) < N-1:
          b[i][j] = check[i][j] = flag = 1
          break
      if not flag:
        print(-1)
        exit()
  
  ###列のOR=1を満たしていく### 
  for i in range(N):
    if T[i] == v[i] == 1 and max(b[:,i]) == 0: #まだ満たされてない列を発見した場合
      flag = 0 #未解決
      for j in range(N):
        if S[j] == u[j] == b[j][i] == check[j][i] == 0 and sum(b[j]) < N-1:
          b[j][i] = check[j][i] = flag = 1
          break
      if not flag:
        print(-1)
        exit()
  """
  for i in range(N):
    if S[i] == 0 and((u>>i) & 1) == 0:
      if b & mask_gyo[i] == mask_gyo[i]:
        print(-1)
        exit()
    if S[i] == 0 and((u>>i) & 1) == 1:
      if b & mask_gyo[i] != mask_gyo[i]:
        print(-1)
        exit()
    if S[i] == 1 and((u>>i) & 1) == 0:
      if b & mask_gyo[i] != 0:
        print(-1)
        exit()
    if S[i] == 1 and((u>>i) & 1) == 1:
      if b & mask_gyo[i] == 0:
        print(-1)
        exit()
  
  for i in range(N):
    if T[i] == 0 and((v>>i) & 1) == 0:
      if b & mask_retu[i] == mask_retu[i]:
        print(-1)
        exit()
    if T[i] == 0 and((v>>i) & 1) == 1:
      if b & mask_retu[i] != mask_retu[i]:
        print(-1)
        exit()
    if T[i] == 1 and((v>>i) & 1) == 0:
      if b & mask_retu[i] != 0:
        print(-1)
        exit()
    if T[i] == 1 and((v>>i) & 1) == 1:
      if b & mask_retu[i] == 0:
        print(-1)
        exit()
  """
  ans += b<<n
  break

for item in ans:
  print(*list(item))

Buggy submission (verdict: Runtime Error):
import numpy as np

N = int(input())

S = np.array(list(map(int,input().split())),dtype = np.int64)
T = np.array(list(map(int,input().split())),dtype = np.int64)
U = np.array(list(map(int,input().split())),dtype = np.int64)
V = np.array(list(map(int,input().split())),dtype = np.int64)

ans = np.zeros((N,N),dtype = np.int64)

for n in range(63):
  u = (U>>n)&1
  v = (V>>n)&1
  invu = np.ones(N,int)-u
  invv = np.ones(N,int)-v
  b = np.zeros((N,N),int)
  check = np.zeros((N,N),int)
  ###行のAND=1とOR=0を埋める###
  for i in range(N):
    if S[i] != u[i]:
      if u[i] == 1:
        b[i] = np.ones(N,int)
      check[i] = np.ones(N,int)
  ###列のAND=1とOR=0を埋める###
  for i in range(N):
    if T[i] != v[i]:
      if v[i] == 1:
        if max(b[:,i]^check[:,i])!=0:
          print(-1)
          exit()
        b[:,i] = np.ones(N,int)
      if v[i] == 0:
        if max(b[:,i])!=0:
          print(-1)
          exit()
      check[:,i] = np.ones((1,N),int)
  ###行と列の値が一致するところを埋める###  
  same1 = np.dot(np.array([u]).T,np.ones((1,N),int)) & np.dot(np.array([v]).T,np.ones((1,N),int)).T
  same0 = np.dot(np.array([invu]).T,np.ones((1,N),int)) & np.dot(np.array([invv]).T,np.ones((1,N),int)).T
  b |= same1
  check |= (same1|same0)
  ###行のOR=1を満たしていく###  
  for i in range(N):
    if S[i] == u[i] == 1 and max(b[i]) == 0: #まだ満たされてない行を発見した場合
      flag = 0 #未解決
      for j in range(N):
        if T[j] == v[j] == b[i][j] == check[i][j] == 0 and sum(b[:,j]) < N-1:
          b[i][j] = check[i][j] = flag = 1
          break
      if not flag:
        print(-1)
        exit()
  
  ###列のOR=1を満たしていく### 
  for i in range(N):
    if T[i] == v[i] == 1 and max(b[:,i]) == 0: #まだ満たされてない列を発見した場合
      flag = 0 #未解決
      for j in range(N):
        if S[j] == u[j] == b[j][i] == check[j][i] == 0 and sum(b[j]) < N-1:
          b[j][i] = check[j][i] = flag = 1
          break
      if not flag:
        print(-1)
        exit()
  """
  for i in range(N):
    if S[i] == 0 and((u>>i) & 1) == 0:
      if b & mask_gyo[i] == mask_gyo[i]:
        print(-1)
        exit()
    if S[i] == 0 and((u>>i) & 1) == 1:
      if b & mask_gyo[i] != mask_gyo[i]:
        print(-1)
        exit()
    if S[i] == 1 and((u>>i) & 1) == 0:
      if b & mask_gyo[i] != 0:
        print(-1)
        exit()
    if S[i] == 1 and((u>>i) & 1) == 1:
      if b & mask_gyo[i] == 0:
        print(-1)
        exit()
  
  for i in range(N):
    if T[i] == 0 and((v>>i) & 1) == 0:
      if b & mask_retu[i] == mask_retu[i]:
        print(-1)
        exit()
    if T[i] == 0 and((v>>i) & 1) == 1:
      if b & mask_retu[i] != mask_retu[i]:
        print(-1)
        exit()
    if T[i] == 1 and((v>>i) & 1) == 0:
      if b & mask_retu[i] != 0:
        print(-1)
        exit()
    if T[i] == 1 and((v>>i) & 1) == 1:
      if b & mask_retu[i] == 0:
        print(-1)
        exit()
  """
  ans += b<<n

for item in ans:
  print(*list(item))

Buggy submission (verdict: Runtime Error):
import numpy as np

N = int(input())

S = np.array(list(map(int,input().split())),dtype = np.int64)
T = np.array(list(map(int,input().split())),dtype = np.int64)
U = np.array(list(map(int,input().split())),dtype = np.int64)
V = np.array(list(map(int,input().split())),dtype = np.int64)

ans = np.zeros((N,N),dtype = np.int64)

for n in range(64):
  u = (U>>n)&1
  v = (V>>n)&1
  invu = np.ones(N,int)-u
  invv = np.ones(N,int)-v
  b = np.zeros((N,N),int)
  check = np.zeros((N,N),int)
  ###行のAND=1とOR=0を埋める###
  for i in range(N):
    if S[i] != u[i]:
      if u[i] == 1:
        b[i] = np.ones(N,int)
      check[i] = np.ones(N,int)
  ###列のAND=1とOR=0を埋める###
  for i in range(N):
    if T[i] != v[i]:
      if v[i] == 1:
        if max(b[:,i]^check[:,i])!=0:
          print(-1)
          exit()
        b[:,i] = np.ones(N,int)
      if v[i] == 0:
        if max(b[:,i])!=0:
          print(-1)
          exit()
      check[:,i] = np.ones((1,N),int)
  ###行と列の値が一致するところを埋める###  
  same1 = np.dot(np.array([u]).T,np.ones((1,N),int)) & np.dot(np.array([v]).T,np.ones((1,N),int)).T
  same0 = np.dot(np.array([invu]).T,np.ones((1,N),int)) & np.dot(np.array([invv]).T,np.ones((1,N),int)).T
  b |= same1
  check |= (same1|same0)
  ###行のOR=1を満たしていく###  
  for i in range(N):
    if S[i] == u[i] == 1 and max(b[i]) == 0: #まだ満たされてない行を発見した場合
      flag = 0 #未解決
      for j in range(N):
        if T[j] == v[j] == b[i][j] == check[i][j] == 0 and sum(b[:,j]) < N-1:
          b[i][j] = check[i][j] = flag = 1
          break
      if not flag:
        print(-1)
        exit()
  
  ###列のOR=1を満たしていく### 
  for i in range(N):
    if T[i] == v[i] == 1 and max(b[:,i]) == 0: #まだ満たされてない列を発見した場合
      flag = 0 #未解決
      for j in range(N):
        if S[j] == u[j] == b[j][i] == check[j][i] == 0 and sum(b[j]) < N-1:
          b[j][i] = check[j][i] = flag = 1
          break
      if not flag:
        print(-1)
        exit()
  """
  for i in range(N):
    if S[i] == 0 and((u>>i) & 1) == 0:
      if b & mask_gyo[i] == mask_gyo[i]:
        print(-1)
        exit()
    if S[i] == 0 and((u>>i) & 1) == 1:
      if b & mask_gyo[i] != mask_gyo[i]:
        print(-1)
        exit()
    if S[i] == 1 and((u>>i) & 1) == 0:
      if b & mask_gyo[i] != 0:
        print(-1)
        exit()
    if S[i] == 1 and((u>>i) & 1) == 1:
      if b & mask_gyo[i] == 0:
        print(-1)
        exit()
  
  for i in range(N):
    if T[i] == 0 and((v>>i) & 1) == 0:
      if b & mask_retu[i] == mask_retu[i]:
        print(-1)
        exit()
    if T[i] == 0 and((v>>i) & 1) == 1:
      if b & mask_retu[i] != mask_retu[i]:
        print(-1)
        exit()
    if T[i] == 1 and((v>>i) & 1) == 0:
      if b & mask_retu[i] != 0:
        print(-1)
        exit()
    if T[i] == 1 and((v>>i) & 1) == 1:
      if b & mask_retu[i] == 0:
        print(-1)
        exit()
  """
  ans += b<<n

for item in ans:
  print(*list(item))

Buggy submission (verdict: Runtime Error):
import numpy as np

N = int(input())

S = np.array(list(map(int,input().split())),dtype = np.int64)
T = np.array(list(map(int,input().split())),dtype = np.int64)
U = np.array(list(map(int,input().split())),dtype = np.int64)
V = np.array(list(map(int,input().split())),dtype = np.int64)

ans = np.zeros((N,N),dtype = np.int64)

for n in range(64):
  u = (U>>n)&1
  v = (V>>n)&1
  invu = np.ones(N,int)-u
  invv = np.ones(N,int)-v
  b = np.zeros((N,N),int)
  check = np.zeros((N,N),int)
  ###行のAND=1とOR=0を埋める###
  for i in range(N):
    if S[i] != u[i]:
      if u[i] == 1:
        b[i] = np.ones(N,int)
      check[i] = np.ones(N,int)
  ###列のAND=1とOR=0を埋める###
  for i in range(N):
    if T[i] != v[i]:
      if v[i] == 1:
        if max(b[:,i]^check[:,i])!=0:
          print(-1)
          exit()
        b[:,i] = np.ones(N,int)
      if v[i] == 0:
        if max(b[:,i])!=0:
          print(-1)
          exit()
      check[:,i] = np.ones((1,N),int)
  ###行と列の値が一致するところを埋める###  
  same1 = np.dot(np.array([u]).T,np.ones((1,N),int)) & np.dot(np.array([v]).T,np.ones((1,N),int)).T
  same0 = np.dot(np.array([invu]).T,np.ones((1,N),int)) & np.dot(np.array([invv]).T,np.ones((1,N),int)).T
  b |= same1
  check |= (same1|same0)
  ###行のOR=1を満たしていく###  
  for i in range(N):
    if S[i] == u[i] == 1 and max(b[i]) == 0: #まだ満たされてない行を発見した場合
      flag = 0 #未解決
      for j in range(N):
        if T[j] == v[j] == b[i][j] == check[i][j] == 0 and sum(b[:,j]) < N-1:
          b[i][j] = check[i][j] = flag = 1
          break
      if not flag:
        print(-1,233)
        exit()
  
  ###列のOR=1を満たしていく### 
  for i in range(N):
    if T[i] == v[i] == 1 and max(b[:,i]) == 0: #まだ満たされてない列を発見した場合
      flag = 0 #未解決
      for j in range(N):
        if S[j] == u[j] == b[j][i] == check[j][i] == 0 and sum(b[j]) < N-1:
          b[j][i] = check[j][i] = flag = 1
          break
      if not flag:
        print(-1)
        exit()
  """
  for i in range(N):
    if S[i] == 0 and((u>>i) & 1) == 0:
      if b & mask_gyo[i] == mask_gyo[i]:
        print(-1)
        exit()
    if S[i] == 0 and((u>>i) & 1) == 1:
      if b & mask_gyo[i] != mask_gyo[i]:
        print(-1)
        exit()
    if S[i] == 1 and((u>>i) & 1) == 0:
      if b & mask_gyo[i] != 0:
        print(-1)
        exit()
    if S[i] == 1 and((u>>i) & 1) == 1:
      if b & mask_gyo[i] == 0:
        print(-1)
        exit()
  
  for i in range(N):
    if T[i] == 0 and((v>>i) & 1) == 0:
      if b & mask_retu[i] == mask_retu[i]:
        print(-1)
        exit()
    if T[i] == 0 and((v>>i) & 1) == 1:
      if b & mask_retu[i] != mask_retu[i]:
        print(-1)
        exit()
    if T[i] == 1 and((v>>i) & 1) == 0:
      if b & mask_retu[i] != 0:
        print(-1)
        exit()
    if T[i] == 1 and((v>>i) & 1) == 1:
      if b & mask_retu[i] == 0:
        print(-1)
        exit()
  """
  ans += b<<n

for item in ans:
  print(*list(item))

Buggy submission (verdict: Runtime Error):
N = int(input())
S = list(map(int,input().split()))
T = list(map(int,input().split()))
U = list(map(int,input().split()))
V = list(map(int,input().split()))

mask_gyo = [((1<<N)-1)<<(N*i) for i in range(N)]
mask_retu = [(sum(1<<(N*j) for j in range(N)))<<i for i in range(N)]

res = [[0 for i in range(N)] for j in range(N)]

for n in range(64):
  u = [(i>>n)&1 for i in U]
  v = [(i>>n)&1 for i in V]
  b = 0
  check = 0
  ###行のAND=1とOR=0を埋める###
  for i in range(N):
    if S[i] != u[i]:
      if u[i] == 1:
        b |= mask_gyo[i]
      check |= mask_gyo[i]
  ###列のAND=1とOR=0を埋める###
  for i in range(N):
    if T[i] != v[i]:
      if v[i] == 1:
        if b & mask_retu[i] != check & mask_retu[i]:
          print(-1)
          exit()
        b |= mask_retu[i]
      if v[i] == 0:
        if (b & mask_retu[i]) ^ (check & mask_retu[i]) != (check & mask_retu[i]):
          print(-1)
          exit()
      check |= mask_retu[i]
  ###行と列の値が一致するところを埋める###  
  for j in range(N):
    for i in range(N):
      if u[j] == v[i]:
        digit = (1<<i)<<(N*j)
        b |= digit*u[i]
        check |= digit
  ###行のOR=1を満たしていく###  
  for i in range(N):
    if S[i] == u[i] == 1:
      if b & mask_gyo[i] == 0: #まだ満たされてない行を発見した場合
        flag = 0 #未解決
        for j in range(N):
          digit = (1<<i)<<(N*j)
          if T[j]==1 and v[j]== 0 and check & digit == 0 and count_bit(b & mask_retu[j])<N-1:
            b |= digit
            check |= digit
            flag = 1 #解決
            break
        if not flag:
          print(-1)
          exit()
  ###列のOR=1を満たしていく###  
  for i in range(N):
    if T[i] == v[i] == 1:
      if b & mask_retu[i] == 0: #まだ満たされてない列を発見した場合
        flag = 0 #未解決
        for j in range(N):
          digit = (1<<j)<<(N*i)
          if S[j]==1 and u[j]== 0 and check & digit == 0 and count_bit(b & mask_gyo[j])<N-1:
            b |= digit
            check |= digit
            flag = 1 #解決
            break         
        if not flag:
          print(-1)
          exit()
  
  for j in range(N):
    for i in range(N):
      digit = (1<<j)<<(N*i)
      a = not (b & digit == 0)
      res[i][j] += a<<n

  
for item in res:
  print(*item)