Submission #267989

---

Source Code Expand

def solve(c)
  ts = []
  rs = []
  c.times do |i|
    ts << gets.split('-').map(&:to_i)
    t[i][0] -= t[i][0] % 5
    t[i][1] += (5 - t[i][1]) % 5
    t[i][1] = t[i][1]+=40 if t[i][1] % 100 >= 60
  end
  ts.uniq!
  ts.sort!

  b = 2400
  e = 0
  ts.each do |t|
    if e != 0 and e < t[0]
      rs << [b,e]
      b = t[0]
      e = t[1]
    else
      b = t[0] if b > t[0]
      e = t[1] if e < t[1]
    end
  end
  rs << [b,e]
  
  rs.each do |r|
    #printf "%04d-%04d\n",r[0],r[1]
  end
end

begin
  n = gets.to_i
  exit if n == 0
  solve(n)
end while true

Submission Info

Judge Result