Submission #985948

---

Source Code Expand

n = gets.to_i

m = Array.new(n){ Array.new(2) }

for i in 0..n-1 do
  m[i][0], m[i][1] = gets.chomp.split("-").map(&:to_i)
  m[i][0] = m[i][0] - m[i][0] % 5
  if !(m[i][1] % 5 == 0) then
    m[i][1] = m[i][1] + (5 - m[i][1] % 5)
    if m[i][1] % 100 == 60 then
      m[i][1] = m[i][1] + 40
    end
  end
end

m = m.sort

j = 1
while j < n do
  if m[j][0] >= m[j-1][0] && m[j][0] <= m[j-1][1] then
    if m[j][1] >= m[j-1][1] then
      m[j-1][1] = m[j][1]
    end
    m.delete_at(j)
    j = j - 1
    n = n - 1
  end
  j = j + 1
end

for i in 0..n-1 do
  if m[i][0] / 1000 == 0 then
  	if m[i][0] / 100 == 0 then
  	  if m[i][0] / 10 == 0 then
  	    m[i][0] = "0" + m[i][0].to_s
  	  end
      m[i][0] = "0" + m[i][0].to_s
  	end
  	m[i][0] = "0" + m[i][0].to_s
  end
  if m[i][1] / 1000 == 0 then
  	if m[i][1] / 100 == 0 then
  	  if m[i][1] / 10 == 0 then
  	    m[i][1] = "0" + m[i][1].to_s
  	  end
      m[i][1] = "0" + m[i][1].to_s
  	end
  	m[i][1] = "0" + m[i][1].to_s
  end
  print("#{m[i][0]}-#{m[i][1]}\n")
end

Submission Info

Judge Result