結果

問題 No.10 ＋か×か
ユーザー okaduki
提出日時 2017-05-20 04:49:43
言語 Haskell
(9.10.1)
結果
AC  
実行時間 2,358 ms / 5,000 ms
コード長 1,155 bytes
コンパイル時間 7,238 ms
コンパイル使用メモリ 195,412 KB
実行使用メモリ 174,464 KB
最終ジャッジ日時 2024-12-14 15:38:58
合計ジャッジ時間 13,399 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 12
権限があれば一括ダウンロードができます
コンパイルメッセージ
Loaded package environment from /home/judge/.ghc/x86_64-linux-9.8.2/environments/default
[1 of 2] Compiling Main             ( Main.hs, Main.o )

Main.hs:16:19: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘head’
    (imported from Prelude, but defined in GHC.List):
    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
   |
16 |   writeArray arr (head xs) ""
   |                   ^^^^

Main.hs:30:16: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘tail’
    (imported from Prelude, but defined in GHC.List):
    "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
   |
30 |         ) arr (tail xs)
   |                ^^^^
[2 of 2] Linking a.out

ソースコード

diff # 

{-# LANGUAGE FlexibleContexts, OverloadedStrings #-}
import Control.Applicative
import Control.Monad
import qualified Data.ByteString.Char8 as B
import Data.Maybe (fromJust)
import Text.Printf
import Debug.Trace
import Data.Array.IArray
import Data.Array.ST

getInts :: IO [Int]
getInts = map (fst . fromJust . B.readInt) . B.words <$> B.getLine

g tot xs = runSTArray $ do
  arr <- newArray (0,tot) "%"
  writeArray arr (head xs) ""
  foldM (\a x -> do
            a' <- newArray (0,tot) "%"
            plused <- forM [i | i <- [0..tot], i+x <= tot]
              (\i -> readArray a i >>= \s -> return (i+x, B.append s "+"))
            forM_ plused (\(i,x) -> writeArray a' i x)

            multied <- forM [i | i <- [0..tot], i*x <= tot]
              (\i -> readArray a i >>= \s -> return (i*x, B.append s "*"))
            forM_ multied $ \(i,x) -> do
                  px <- readArray a' i
                  if x > px then writeArray a' i x
                    else return ()
            return a'
        ) arr (tail xs)

solve tot xs = (g tot xs)!tot

main = do
  [n] <- getInts
  [tot] <- getInts
  xs <- getInts
  B.putStrLn $ solve tot xs
0