Codingame Solution: Lumen

Original Problem

Solution

We keep a map \(M\) as a N x N matrix, initialized by zero and add a special light matrix for each C we find in the grid. The light matrix can be created by looping over each cell and add the inverted Chebyshev distance to the place where we found the candle:

def createLight(row, col, n, l):
  return np.array([
    [max(0, l - max(abs(row - i), abs(col - j))) 
      for j in range(n)] 
        for i in range(n)])

What follows is just the frame to read in the data and loop over the matrix

import math
import numpy as np

n, l = map(int, [input(), input()])

M = np.zeros((n, n))

for i in range(n):
  line = input().split(" ")
  for j in range(len(line)):
    if line[j] == "C":
      M+= createLight(i, j, n, l)

print(n * n - np.count_nonzero(M))