Submission #126455

---

Source Code Expand

import Control.Arrow
import Data.List

padding s c n 
  | len < n   = c : padding s c (n-1)
  | len == n  = s
  where 
    len = length s

rInt :: String -> Int
rInt = read

getLines n = do
  if n == 0 then return []
  else do 
    x <- getLine
    xs <- getLines $ n-1
    return $ x : xs

split c s = case break(==c) s of
  (w, _:s) -> (w, s) 

unsplit c x = (fst x)++[c]++(snd x)

organize = overlap.roundAll.sort

roundAll [] = []
roundAll (x:xs) = (rs,re): roundAll xs
  where s = (fromIntegral.fst) x
        e = (fromIntegral.snd) x
        rs = (*) 5 $ floor $ s / 5
        re | re' `mod` 100 == 60 = re'+40
           | otherwise           = re'
           where re' = (*) 5 $ ceiling $ e / 5

overlap (x:xs) = overlap' x xs
  where 
    overlap' x (xn:xs)
      | fst xn <= snd x  = overlap' (s, e) xs
      | otherwise        = x : overlap' xn xs
      where ns = [fst x, snd x, fst xn, snd xn]
            s = minimum ns
            e = maximum ns
    overlap' x [] = [x]

main = do
  n <- readLn
  list <- getLines n >>= (runKleisli $ arr $ map $ 
                            (\x -> split '-' x) 
                            >>> rInt *** rInt)
  list <- return $ organize list
  list <- return list>>= (runKleisli $ arr $ map $ 
                            show *** show 
                            >>> (\(x,y) -> (padding x '0' 4, padding y '0' 4))
                            >>> (\x -> unsplit '-' x))
  mapM_ putStrLn list

Submission Info

Judge Result