Submission #10405897


Source Code Expand

import Data.Vector

main = do
    i <- read <$> getLine
    ns <- fromList . fmap read . words <$> getLine
    putStrLn . show $ cost (i - 1) ns

cost :: Int -> Vector Int -> Int
cost 0 ns = 0
cost 1 ns = abs $ ns ! 0 - ns ! 1
cost i ns = min (cost (i - 2) ns + abs (ns ! (i - 2) - ns ! i)) (cost (i - 1) ns + abs (ns ! (i - 1) - ns ! i))

Submission Info

Submission Time
Task A - Frog 1
User A_kirisaki
Language Haskell (GHC 7.10.3)
Score 0
Code Size 350 Byte
Status TLE
Exec Time 2106 ms
Memory 38524 KB

Judge Result

Set Name All
Score / Max Score 0 / 100
Status
AC × 5
TLE × 6
Set Name Test Cases
All 0_00, 0_01, 0_02, 1_00, 1_01, 1_02, 1_03, 1_04, 1_05, 1_06, 1_07
Case Name Status Exec Time Memory
0_00 AC 2 ms 508 KB
0_01 AC 1 ms 508 KB
0_02 AC 2 ms 508 KB
1_00 AC 1 ms 508 KB
1_01 AC 2 ms 508 KB
1_02 TLE 2105 ms 28028 KB
1_03 TLE 2105 ms 28028 KB
1_04 TLE 2106 ms 38524 KB
1_05 TLE 2105 ms 30076 KB
1_06 TLE 2104 ms 32148 KB
1_07 TLE 2105 ms 30076 KB