Submission #1479849


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 as)

sarray as
  | null ds = 1
  | head ds < 0 = length (cut True as)
  | otherwise = length (cut False as)
  where
    ds = filter (/= 0) $ zipWith (-) (tail as) as

cut _ [] = []
cut False xs = () : cut True (dropWhileBy (<=) xs)
cut True xs = () : cut False (dropWhileBy (>=) xs)

takeWhileBy _ [] = []
takeWhileBy _ [x] = [x]
takeWhileBy op (x1:xxs@(x2:_))
  | op x1 x2 = x1 : takeWhileBy op xxs
  | otherwise = [x1]

dropWhileBy _ [] = []
dropWhileBy _ [x] = []
dropWhileBy op (x1:xxs@(x2:_))
  | op x1 x2 = dropWhileBy op xxs
  | otherwise = xxs

Submission Info

Submission Time
Task A - Sorted Arrays
User aimy
Language Haskell (GHC 7.10.3)
Score 0
Code Size 755 Byte
Status WA
Exec Time 16 ms
Memory 2940 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 2
WA × 1
AC × 9
WA × 8
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 WA 1 ms 380 KB
sample_03.txt AC 1 ms 380 KB
subtask_1_01.txt WA 10 ms 2172 KB
subtask_1_02.txt AC 7 ms 1916 KB
subtask_1_03.txt WA 5 ms 1532 KB
subtask_1_04.txt WA 16 ms 2940 KB
subtask_1_05.txt AC 14 ms 2940 KB
subtask_1_06.txt WA 16 ms 2940 KB
subtask_1_07.txt WA 16 ms 2940 KB
subtask_1_08.txt AC 14 ms 2940 KB
subtask_1_09.txt WA 15 ms 2940 KB
subtask_1_10.txt AC 1 ms 380 KB
subtask_1_11.txt AC 2 ms 380 KB