Submission #233513

---

Source Code Expand

import Data.List
import Text.Printf

type Term = (Int,Int)

main :: IO ()
main = do n <- readLn
          xs <- getTerms n
          putTerms ((arrange.grid.sort) xs)

getTerms :: Int -> IO [Term]
getTerms 0 = return []
getTerms n = do x <- getTerm
                xs <- getTerms (n-1)
                return (x:xs)

getTerm :: IO Term
getTerm = do xs <- getLine
             return (read (takeWhile (/= '-') xs),
                     read (tail (dropWhile (/= '-') xs)))

putTerms :: [Term] -> IO ()
putTerms []         = return ()
putTerms ((x,y):xs) = do printf "%04d-%04d\n" x y
                         putTerms xs

grid :: [Term] -> [Term]
grid []         = []
grid ((x,y):xs) = (nx,ny):grid xs
  where
    nx = x - x `mod` 5 
    ny = if ny' `mod` 100 == 60 then ny' + 40 else ny'
    ny' = if y `mod` 5 == 0 then y else y + (5 - y `mod` 5)

arrange :: [Term] -> [Term]
arrange []         = []
arrange ((x,y):xs) = (x,n):zs
  where
    (n,zs) = arrange' y ys
    ys = arrange xs

arrange' :: Int -> [Term] -> (Int,[Term])
arrange' n []         = (n,[])
arrange' n ((x,y):xs) = if n >= x
                          then arrange' (max n y) xs
                          else (n,(x,y):xs)

Submission Info

Judge Result