Submission #128862

---

Source Code Expand

import Control.Applicative ((<$>))
import Control.Monad (replicateM, forM_)
import GHC.Exts      (sortWith)

data Range = Range Int Int
           deriving (Show)

main :: IO ()
main = do
  n <- read<$>getLine
  r:ranges <- sortWith fst <$> replicateM n (conv<$>getLine)
  mapM_ (putStrLn . p) $ reverse $ foldl (\((b2, e2):rest) (b1, e1) ->
                              if e2 >= b1
                              then (b2, max e1 e2):rest
                              else (b1, e1):(b2, e2):rest) [r] ranges
  where conv :: String -> (Int, Int)
        conv s = let (begin, '-':end) = splitAt 4 s
                 in (roundDown $ read begin, roundUp $ read end)
        roundDown i = (i `div` 5) * 5
        roundUp   i = let n = ((i+4) `div` 5) * 5 in
          if n `mod` 100 <= 55
          then n
          else (n `div` 100 + 1) * 100
        p (a, b) = (pad 4 '0' $ show a) ++ "-" ++ (pad 4 '0' $ show b)
        pad n fill seq = let m = n - (length seq) in replicate m fill ++ seq

Submission Info

Judge Result