844B - Rectangles - CodeForces Solution

from operator import mul    from fractions import Fraction
from functools import reduce

sol_super_comb = {i:0 for i in range(51)}

def retangles():
  n, m = map(int, input().split())
  vectors = [[[0]*n, [0]*m], [[0]*n, [0]*m]]
  maior = max(n,m)

  [[summs(vectors, row, col, 1) if x=='1' else summs(vectors, row, col, 0) for col,x in enumerate(input().split())] for row in range(n)]

  soma=n*m
  for elem_one_zero in vectors:
    for row_or_col in elem_one_zero:
      for i in row_or_col:
        if(i>1):
          soma+=super_comb(i)
  print(soma)

def summs(v, r, c, e):
  v[e][0][r]+=1
  v[e][1][c]+=1
  return 0

def super_comb(n):
  if(sol_super_comb[n]>0):
    return sol_super_comb[n]
  soma = 0
  for i in range(n):
    if(i>=1):
      soma+=comb(n,i+1)
  sol_super_comb[n] = soma
  return soma

  
def comb(n,k): 
  return int( reduce(mul, (Fraction(n-i, i+1) for i in range(k)), 1) )
retangles()