Submission #36237827


Source Code Expand

import Control.Monad
import Data.Maybe
import qualified Data.ByteString.Char8 as BS
import Data.List

readInt = fst . fromJust . BS.readInt
readIntList = map readInt . BS.words
getInt = readInt <$> BS.getLine
getIntList = readIntList <$> BS.getLine

main = do
    n <- getInt
    xs <- reverse <$> getIntList
    putStrLn . unwords. map show $ solve xs

solve xs = reverse $ ys ++ [h] ++ zs
    where f [] = 0
          f [x] = 1
          f (x:y:ps) | x > y = 1 + f (y : ps)
                     | otherwise = 1
          d = f xs
          ds = take d xs
          a = head $ drop d xs
          zs = drop (d + 1) xs
          h = maximum $ filter (< a) ds 
          ys = sort $ filter (/= h) (a:ds)

Submission Info

Submission Time
Task C - Previous Permutation
User pel
Language Haskell (GHC 8.8.3)
Score 300
Code Size 727 Byte
Status AC
Exec Time 7 ms
Memory 3756 KiB

Compile Error

Loaded package environment from /home/contestant/.ghc/x86_64-linux-8.8.3/environments/default

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 2
AC × 12
Set Name Test Cases
Sample example_00.txt, example_01.txt
All example_00.txt, example_01.txt, test_00.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt
Case Name Status Exec Time Memory
example_00.txt AC 7 ms 3556 KiB
example_01.txt AC 2 ms 3656 KiB
test_00.txt AC 2 ms 3756 KiB
test_01.txt AC 2 ms 3740 KiB
test_02.txt AC 2 ms 3684 KiB
test_03.txt AC 2 ms 3496 KiB
test_04.txt AC 3 ms 3680 KiB
test_05.txt AC 2 ms 3668 KiB
test_06.txt AC 2 ms 3608 KiB
test_07.txt AC 2 ms 3616 KiB
test_08.txt AC 2 ms 3560 KiB
test_09.txt AC 2 ms 3716 KiB