Submission #308776

---

Source Code Expand

import Control.Applicative
import Data.List

main = do
  str <- getContents
  let times = tail $ lines str
  let pairs = sortBy sf $ map mkpair times
  print_loop $ sortBy sf $ loop pairs []

mkpair str = (normalize (kirisage st),  normalize (kiriage ed))
  where
    [st, ed] = map read $ [take 4 str, drop 5 str]

normalize n =
  if drop 2 (show n) == "60" then n - 60 + 100
  else n

kiriage n =
  if n `mod` 5 == 0 then n
  else n + (5 - n `mod` 5)

kirisage n =
  if n `mod` 5 == 0 then n
  else n - (n `mod` 5)

myprint n =
  putStr $ replicate (4 - length s) '0' ++ s
  where s = show n

loop [] acc = acc
loop ((st, ed) : rest) acc =
  loop rest (update st ed acc)
  
update st ed acc = f r
  where r = find (\(a, b) -> st <= b) acc
        f Nothing = acc ++ [(st,ed)]
        f (Just (a,b)) = sortBy sf $ (min a st, max b ed) : delete (a,b) acc

print_loop [] = return ()
print_loop ((st, ed) : rest) = do
  myprint st
  putStr "-"
  myprint ed
  putStrLn ""
  print_loop rest

sf (a, _) (b, _)
  | a < b = LT
  | a > b = GT
  | otherwise = EQ

Submission Info

Judge Result