Submission #107979

---

Source Code Expand

import Text.Printf
import Control.Applicative
import Control.Monad
import Data.List

main :: IO ()
main = do
  n <- readLn
  ss0 <- replicateM n $ map read . words . map (\c -> if c == '-' then ' ' else c) <$> getLine
  mapM_ p $ reverse $ foldl mrg [] $ sort $ map g $ map (map f) ss0

f :: Int -> Int
f s = s `div` 100 * 60 + s `mod` 100

g [s, t] = [s `div` 5 * 5, (t + 4) `div` 5 * 5]

p [s, t] = printf "%02d%02d-%02d%02d\n" (s`div`60) (s`mod`60) (t`div`60) (t`mod`60)

mrg [] s = [s]
mrg ([s1,e1]:ss) [s2,e2]
  | s2 <= e1 = [s1,max e1 e2]:ss
  | otherwise = [s2,e2]:[s1,e1]:ss

Submission Info

Judge Result