Submission #109089

---

Source Code Expand

import Control.Monad
import Data.List

trans :: Int -> Int
trans x = (x`div`100)*60+x`mod`100

parse :: String -> (Int, Int)
parse str = (trans(read(take 4 str))`div`5*5, (trans(read(drop 5 str))+4)`div`5*5)

split :: [String] -> [(Int, Int)]
split (x:[]) = [parse x]
split (x:xs) = [parse x] ++ (split xs)

cover :: (Int, Int) -> (Int, Int) -> Bool
cover (a, b) (c, d) = c <= b

merge :: [(Int, Int)] -> [(Int, Int)]
merge (x:[]) = [x]
merge (x:y:[]) = if cover x y
					then [(fst x, max (snd x) (snd y))]
					else [x, y]
merge (x:y:xs) = if cover x y
					then merge ([(fst x, max (snd x) (snd y))] ++ xs)
					else [x] ++ (merge ([y]++xs))

revtrans :: Int -> String
revtrans x = drop 1 (show (10000+x`div`60*100+x`mod`60))

revtranstuple :: (Int, Int) -> String
revtranstuple (a, b) = (revtrans a) ++ "-" ++ (revtrans b)

changeforout :: [(Int, Int)] -> String
changeforout (x:[]) = revtranstuple x
changeforout (x:xs) = revtranstuple x ++ "\n" ++ (changeforout xs)

main = do
    n <- getLine
    dat <- replicateM (read n) getLine
    let sorted = merge (sort (split dat))
    putStrLn (changeforout sorted)

Submission Info

Judge Result