Submission #17395021

---

Source Code Expand

defmodule Main do
  def main do
    n = IO.read(:line) |> String.trim() |> String.to_integer()

    1..n
    |> Enum.reduce([], fn _, acc ->
      list =
        IO.read(:line) |> String.trim() |> String.split(" ") |> Enum.map(&String.to_integer/1)

      [list | acc]
    end)
    |> Enum.reverse()
    |> solve()
    |> IO.puts()
  end

  @doc ~S"""
  https://atcoder.jp/contests/abc172/tasks/abc172_b

  ## Examples

      iex> Arc089A.solve([[3, 1, 2], [6, 1, 1]])
      "Yes"
      iex> Arc089A.solve([[2, 100, 100]])
      "No"
      iex> Arc089A.solve([[5, 1, 1], [100, 1, 1]])
      "No"

  """
  def solve(list_of_lists) do
    list_of_lists
    |> Enum.reduce_while([0, 0, 0, "No"], fn next, acc ->
      do_solve(next, acc)
    end)
    |> Enum.at(-1)
  end

  defp do_solve([next_t, next_x, next_y], [t, x, y, _])
       when abs(next_x - x) + abs(next_y - y) > next_t - t,
       do: {:halt, [next_t, next_x, next_y, "No"]}

  defp do_solve([next_t, next_x, next_y], [t, x, y, _])
       when rem(next_t - t - (abs(next_x - x) + abs(next_y - y)), 2) == 1,
       do: {:halt, [next_t, next_x, next_y, "No"]}

  defp do_solve([next_t, next_x, next_y], _),
    do: {:cont, [next_t, next_x, next_y, "Yes"]}
end

Submission Info

Judge Result