結果

問題 No.1 道のショートカット
ユーザー らっしー(raccy)
提出日時 2015-06-04 21:42:22
言語 Haskell
(9.10.1)
結果
TLE  
実行時間 -
コード長 1,495 bytes
コンパイル時間 1,572 ms
コンパイル使用メモリ 174,176 KB
実行使用メモリ 16,028 KB
最終ジャッジ日時 2024-07-08 04:04:34
合計ジャッジ時間 8,371 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 4 TLE * 1 -- * 35
権限があれば一括ダウンロードができます
コンパイルメッセージ
Loaded package environment from /home/judge/.ghc/x86_64-linux-9.8.2/environments/default
[1 of 2] Compiling Main             ( Main.hs, Main.o )
[2 of 2] Linking a.out

ソースコード

diff # 

import Data.Maybe
import Data.List
import Control.Applicative

main = do
    n <- read <$> getLine
    c <- read <$> getLine
    v <- read <$> getLine
    s <- map read . words <$> getLine
    t <- map read . words <$> getLine
    y <- map read . words <$> getLine
    m <- map read . words <$> getLine
    print $ no1 n c v s t y m

no1 :: Int -> Int -> Int -> [Int] -> [Int] -> [Int] -> [Int] -> Int
no1 n c v s t y m = fromMaybe (-1) $ no1' n c v s t y m

no1' :: Int -> Int -> Int -> [Int] -> [Int] -> [Int] -> [Int] -> Maybe Int
no1' n c _ s t y m = maybeMinimum $ map time $ filter (\a -> place a == n) $  foldl' (>>=) [PlaceCost { place = 1, coin = c, time = 0 }] $ replicate n (`fromTo` createRouteList s t y m)

data PlaceCost = PlaceCost { place :: Int, coin :: Int, time :: Int}
    deriving (Show)

data Route = Route { from :: Int, to :: Int, cost :: Int, rtime :: Int}
    deriving (Show)

fromTo :: PlaceCost -> [Route] -> [PlaceCost]
fromTo pc [] = [pc]
fromTo pc (r:rs)
    | place pc /= from r = fromTo pc rs
    | remainCoin < 0 = fromTo pc rs
    | otherwise = PlaceCost { place = to r, coin = remainCoin, time = tookTime } : fromTo pc rs
    where remainCoin = coin pc - cost r
          tookTime = time pc + rtime r

createRouteList :: [Int] -> [Int] -> [Int] -> [Int] -> [Route]
createRouteList = zipWith4 (\s t y m -> Route { from = s , to = t, cost = y, rtime = m })

maybeMinimum :: (Ord a) => [a] -> Maybe a
maybeMinimum [] = Nothing
maybeMinimum x = Just $ minimum x
0