Submission #126457

---

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 (s,e) = s++[c]++e

organize = overlap.(fmap roundTime).sort

roundTime (s,e) = (rs, re)
                where s'  = fromIntegral s
                      e'  = fromIntegral e
                      rs  = (*) 5 $ floor   $ s' / 5
                      re' = (*) 5 $ ceiling $ e' / 5
                      re  | re' `mod` 100 == 60 = re'+40
                          | otherwise           = re'

overlap (x:xs) = overlap' x xs
               where overlap' x [] = [x]
                     overlap' px@(ps, pe) (nx@(ns, ne):xs)
                       | ns <= pe  = overlap' (s, e) xs
                       | otherwise = px : overlap' nx xs
                       where ts = [ps, pe, ns, ne]
                             s = minimum ts
                             e = maximum ts

main = do
  --Read # of rows.
  n <- readLn

  --Convert [String] to [(Int,Int)].
  list <- getLines n >>= (runKleisli $ arr $ map $ 
                            (\x -> split '-' x) 
                            >>> rInt *** rInt)

  --Organize memo.
  list <- return $ organize list

  --Convert [(Int,Int)] to [String].
  let tpadding s = padding s '0' 4
  list <- return list>>= (runKleisli $ arr $ map $ 
                            show *** show 
                            >>> (\(x,y) -> (tpadding x, tpadding y))
                            >>> (\x -> unsplit '-' x))

  --Output
  mapM_ putStrLn list

Submission Info

Judge Result