Submission #18926690

---

Source Code Expand

defmodule Main do
  def main do
    [n, m, t] = IO.read(:line) |> String.trim() |> String.split(" ") |> Enum.map(&String.to_integer/1)
    list =
      1..m
      |> Enum.reduce([], fn _, acc ->
        line = IO.read(:line) |> String.trim() |> String.split(" ") |> Enum.map(&String.to_integer/1)
        [line | acc]
      end)

    solve(n, m, t, list) |> IO.puts()
  end

  def solve(n, m, t, list) do
    [[t, t] | list]
    |> Enum.reverse()
    |> Enum.reduce_while([n, 0], fn p, acc ->
      rem = Enum.at(acc, 0) - (Enum.at(p, 0) - Enum.at(acc, 1))
      if rem > 0 do
        charge = Enum.at(p, 1) - Enum.at(p, 0)
        {:cont, [min(n, rem + charge), Enum.at(p, 1)]}
      else
        {:halt, rem}
      end
    end)
    |> ans()
  end

  def ans(n) when n > 0, do: "Yes"
  def ans(_), do: "No"
end

Submission Info

Compile Error

warning: variable "m" is unused (if the variable is not meant to be used, prefix it with an underscore)
  Main.ex:14: Main.solve/4

Judge Result