Submission #11190145

Source Code Expand

import           Control.Monad
import qualified Data.ByteString.Char8 as BS
import           Data.Maybe
import qualified Data.Vector.Unboxed   as V

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

main = do
  [n, k] <- getIntList
  ss <- V.fromList <$> replicateM n getInt

  let solve res prod i j | j == n    = if prod <= k then max res (n-i) else res
                         | prod <= k = solve (max res (j-i)) (prod * (ss V.! j)) i (j+1)
                         | otherwise = solve res (prod `div` (ss V.! i)) (i+1) j

      ans | V.elem 0 ss = n
          | k == 0      = 0
          | otherwise   = solve 0 (ss V.! 0) 0 1

  print ans

Submission Info

Submission Time
Task C - 列
User unnohideyuki
Language Haskell (GHC 7.10.3)
Score 100
Code Size 764 Byte
Status AC
Exec Time 59 ms
Memory 22780 KiB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 20 / 20 80 / 80
Status
AC × 4
AC × 27
AC × 44
Set Name Test Cases
Sample subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt
Subtask1 subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_corner.txt, subtask1_killer1.txt, subtask1_killer2.txt, subtask1_killer3.txt, subtask1_killer4.txt, subtask1_killer5.txt
Subtask2 subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_corner.txt, subtask1_killer1.txt, subtask1_killer2.txt, subtask1_killer3.txt, subtask1_killer4.txt, subtask1_killer5.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt, subtask2_14.txt, subtask2_15.txt, subtask2_16.txt, subtask2_17.txt
Case Name Status Exec Time Memory
subtask0_sample_01.txt AC 1 ms 380 KiB
subtask0_sample_02.txt AC 1 ms 380 KiB
subtask0_sample_03.txt AC 1 ms 380 KiB
subtask0_sample_04.txt AC 1 ms 380 KiB
subtask1_01.txt AC 2 ms 1020 KiB
subtask1_02.txt AC 2 ms 1020 KiB
subtask1_03.txt AC 2 ms 1020 KiB
subtask1_04.txt AC 2 ms 1020 KiB
subtask1_05.txt AC 2 ms 1020 KiB
subtask1_06.txt AC 2 ms 1020 KiB
subtask1_07.txt AC 2 ms 1020 KiB
subtask1_08.txt AC 2 ms 1020 KiB
subtask1_09.txt AC 2 ms 1020 KiB
subtask1_10.txt AC 2 ms 1020 KiB
subtask1_11.txt AC 2 ms 1020 KiB
subtask1_12.txt AC 2 ms 1020 KiB
subtask1_13.txt AC 2 ms 1020 KiB
subtask1_14.txt AC 2 ms 1020 KiB
subtask1_15.txt AC 2 ms 1020 KiB
subtask1_16.txt AC 2 ms 1020 KiB
subtask1_17.txt AC 2 ms 1020 KiB
subtask1_corner.txt AC 1 ms 380 KiB
subtask1_killer1.txt AC 1 ms 380 KiB
subtask1_killer2.txt AC 1 ms 380 KiB
subtask1_killer3.txt AC 1 ms 380 KiB
subtask1_killer4.txt AC 1 ms 508 KiB
subtask1_killer5.txt AC 1 ms 508 KiB
subtask2_01.txt AC 51 ms 22780 KiB
subtask2_02.txt AC 51 ms 22780 KiB
subtask2_03.txt AC 57 ms 21372 KiB
subtask2_04.txt AC 53 ms 22780 KiB
subtask2_05.txt AC 56 ms 21372 KiB
subtask2_06.txt AC 57 ms 21372 KiB
subtask2_07.txt AC 54 ms 22780 KiB
subtask2_08.txt AC 53 ms 21500 KiB
subtask2_09.txt AC 53 ms 22780 KiB
subtask2_10.txt AC 54 ms 22780 KiB
subtask2_11.txt AC 53 ms 21500 KiB
subtask2_12.txt AC 54 ms 21372 KiB
subtask2_13.txt AC 54 ms 21628 KiB
subtask2_14.txt AC 55 ms 21372 KiB
subtask2_15.txt AC 59 ms 22652 KiB
subtask2_16.txt AC 52 ms 22780 KiB
subtask2_17.txt AC 52 ms 21500 KiB