Submission #1241359

Source Code Expand

import Data.List (foldl')

main = do
    [n,a,b] <- getInts
    xs <- getInts
    print $ solve a b xs

getInts :: IO [Int]
getInts = map read . words <$> getLine

solve :: Int -> Int -> [Int] -> Int
solve a b xs = foldl' (\s (l,r)-> s + min (a*(r-l)) b) 0 $ zip xs (tail xs)

Submission Info

Submission Time
Task D - Walk and Teleport
User iyou1993
Language Haskell (GHC 7.10.3)
Score 500
Code Size 288 Byte
Status AC
Exec Time 548 ms
Memory 36220 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 500 / 500
Status
AC × 3
AC × 15
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_balancedmax_01.txt, subtask_1_balancedmax_02.txt, subtask_1_max_01.txt, subtask_1_max_02.txt, subtask_1_min_01.txt, subtask_1_onlya_01.txt, subtask_1_onlyamax_01.txt, subtask_1_onlyb_01.txt, subtask_1_onlybmax_01.txt, subtask_1_rand_01.txt, subtask_1_rand_02.txt, subtask_1_rand_03.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 508 KB
sample_02.txt AC 1 ms 508 KB
sample_03.txt AC 1 ms 508 KB
subtask_1_balancedmax_01.txt AC 543 ms 36220 KB
subtask_1_balancedmax_02.txt AC 546 ms 36220 KB
subtask_1_max_01.txt AC 545 ms 36220 KB
subtask_1_max_02.txt AC 548 ms 36220 KB
subtask_1_min_01.txt AC 1 ms 508 KB
subtask_1_onlya_01.txt AC 281 ms 18812 KB
subtask_1_onlyamax_01.txt AC 546 ms 36220 KB
subtask_1_onlyb_01.txt AC 132 ms 11644 KB
subtask_1_onlybmax_01.txt AC 548 ms 36220 KB
subtask_1_rand_01.txt AC 342 ms 18812 KB
subtask_1_rand_02.txt AC 462 ms 36220 KB
subtask_1_rand_03.txt AC 210 ms 17916 KB