Submission #3787694

---

Source Code Expand

import Control.Monad
import Text.Printf

height :: Int -> Int -> [[Int]] -> Int
height cx cy ps = if (all (\[x, y, h] -> h == (max 0 ch - (abs (cx - x)) - (abs (cy - y)))) ps) then ch else 0
  where
    [x0, y0, h0]:_ = filter (\[x, y, h] -> h > 0) ps
    ch = h0 + (abs (cx - x0)) + (abs (cy - y0))

solve :: [[Int]] -> (Int, Int, Int)
solve ps = t
  where
    t =
      case (filter (\(x, y, h) -> h > 0) [(cx, cy, height cx cy ps) | cx <- [0 .. 101], cy <- [0 .. 101]]) of
      t:_ -> t
      _ -> (0, 0, 0)


main :: IO ()
main = do
  n <- readLn :: IO Int
  ps <- replicateM n $ (map (\s -> read s :: Int)) . words <$> getLine
  let (cx, cy, ch) = solve ps in
    printf "%d %d %d\n" cx cy ch

Submission Info

Judge Result