Submission #108854

---

Source Code Expand

import Control.Monad
import Control.Applicative
import Data.List

main = do
    n <- readLn
    l <- replicateM n $ do
             (a,b) <- break (=='-') <$> getLine
             return (baz $ foo $ read a, baz $ bar $ read $ drop 1 b)
    mapM_ (\(a,b) -> putStrLn $ show' a ++ "-" ++ show' b) $ qux l
    where show' x | x < 10 = "000" ++ show x
                  | x < 100 = "00" ++ show x
                  | x < 1000 = "0" ++ show x
                  | otherwise = show x

foo a | 0 <= x && x < 5 = a `div` 10 * 10
      | otherwise = a `div` 10 * 10 + 5
    where x = a `mod` 10

bar a | 0 == x = a `div` 10 * 10
      | 0 < x && x <= 5 = a `div` 10 * 10 + 5
      | otherwise = a `div` 10 * 10 + 10
    where x = a `mod` 10

baz a | a `mod` 100 == 60 = a + 40
      | otherwise = a

qux = sortBy compare . foldr f []
    where f t@(a,b) = (\(c,d) -> c : d) . foldr g ((a,b),[])
          g p@(a,b) (q@(c,d),acc)
            | a <= d && b >= c = ((min a c, max b d), acc)
            | otherwise = (q, p : acc)

Submission Info

Judge Result