Submission #1480245


Source Code Expand

import qualified Data.ByteString.Char8 as B
import Data.List
 
main = do
  _ <- getLine
  as <- map (maybe undefined fst . B.readInt) . B.words <$> B.getLine
  print (sarray 0 as)
 
sarray acc [] = acc
sarray acc [x] = acc + 1
sarray acc xxs@(x:xs)
  | lg > ls = sarray (acc + 1) (drop (lg + 1) xxs)
  | otherwise = sarray (acc + 1) (drop (ls + 1) xxs)
  where
    ds = map signum $ zipWith (-) xs xxs
    lg = length $ takeWhile (/= -1) ds
    ls = length $ takeWhile (/= 1) ds

Submission Info

Submission Time
Task A - Sorted Arrays
User aimy
Language Haskell (GHC 7.10.3)
Score 300
Code Size 496 Byte
Status AC
Exec Time 34 ms
Memory 16636 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 17
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 380 KB
sample_02.txt AC 1 ms 380 KB
sample_03.txt AC 1 ms 380 KB
subtask_1_01.txt AC 11 ms 2172 KB
subtask_1_02.txt AC 15 ms 5884 KB
subtask_1_03.txt AC 6 ms 1532 KB
subtask_1_04.txt AC 17 ms 2940 KB
subtask_1_05.txt AC 25 ms 8572 KB
subtask_1_06.txt AC 18 ms 2940 KB
subtask_1_07.txt AC 18 ms 2940 KB
subtask_1_08.txt AC 34 ms 16636 KB
subtask_1_09.txt AC 18 ms 2940 KB
subtask_1_10.txt AC 1 ms 380 KB
subtask_1_11.txt AC 1 ms 380 KB