Submission #185076

---

Source Code Expand

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

main = do
  n <- readLn
  memo <- sort <$> (replicateM n $ sande <$> getLine)
  mapM (\(s,e) -> printf "%04d-%04d\n" s e) $ merge (head memo) (tail memo)
  return ()

sande xs = (myfloor . read . take 4 $ xs , myceil.read . drop 5 $ xs)

myfloor n = if n `mod` 10 < 5
            then n `div` 10 * 10
            else n `div` 10 * 10 + 5

myceil n
  | n `mod` 10 == 0 = n
  | n `mod` 10 <= 5 = n `div` 10 * 10 + 5
  | n `mod` 100 > 55 = (n `div` 100 + 1 ) * 100
  | otherwise = n `div` 10 * 10 + 10

merge :: (Int,Int) -> [(Int,Int)] -> [(Int,Int)]
merge x [] = [x]
merge (s0,e0) ((s1,e1):xs) = if e0 >= s1
                             then if  e1 >= e0
                                  then merge (s0,e1) xs   
                                  else merge (s0,e0) xs
                             else [(s0,e0)] ++ merge (s1,e1) xs

Submission Info

Judge Result