Submission #212063

---

Source Code Expand

import Control.Applicative
import Control.Monad
import Data.List (sort)
import Text.Printf (printf)

parseTime :: String -> [Int]
parseTime [h1, h2, m1, m2, _, h3, h4, m3, m4] =
    read <$> [[h1, h2], [m1, m2], [h3, h4], [m3, m4]]

toFiveMinResolutin :: [Int] -> [Int]
toFiveMinResolutin [h, m, h', m'] =
    let newm  =  m       `div` 5 * 5
        newm' = (m' + 4) `div` 5 * 5 in
    [h, newm] ++ if 60 <= newm' then [h' + 1, 0] else [h', newm']

fuseMap :: (a -> a -> Maybe a) -> [a] -> [a]
fuseMap fusionFunc arr =
    reverse $ f [] arr
    where
        f acc [] = acc
        f [] (x:xs) = f [x] xs
        f yall@(y:ys) (x:xs) = case fusionFunc y x of
                               Nothing -> f (x:yall) xs
                               Just n -> f (n:ys) xs

main :: IO ()
main = do
    n <- readLn
    inputRanges <- map parseTime <$> replicateM n getLine
    forM_ (fuseMap isOverlapping $ sort (toFiveMinResolutin <$> inputRanges)) printRange
        where
            isOverlapping [ash, asm, aeh, aem] [bsh, bsm, beh, bem]
                | [beh, bem] <= [aeh, aem] = Just [ash, asm, aeh, aem]
                | [bsh, bsm] <= [aeh, aem] = Just [ash, asm, beh, bem]
                | otherwise = Nothing
            printRange [a, b, c, d] = putStrLn $ printf "%02d%02d-%02d%02d" a b c d

Submission Info

Judge Result