結果

問題 No.326 あみだますたー
ユーザー aimyaimy
提出日時 2017-04-24 23:16:37
言語 Haskell
(9.8.2)
結果
WA  
実行時間 -
コード長 737 bytes
コンパイル時間 1,747 ms
コンパイル使用メモリ 171,900 KB
実行使用メモリ 10,624 KB
最終ジャッジ日時 2024-09-13 12:12:39
合計ジャッジ時間 6,052 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 WA -
testcase_02 WA -
testcase_03 WA -
testcase_04 WA -
testcase_05 AC 2 ms
6,944 KB
testcase_06 WA -
testcase_07 AC 9 ms
8,448 KB
testcase_08 AC 25 ms
8,576 KB
testcase_09 WA -
testcase_10 AC 37 ms
9,984 KB
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 WA -
権限があれば一括ダウンロードができます
コンパイルメッセージ
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:10:20: 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."
   |
10 |  is <- map (read . head . words) <$> replicateM k getLine
   |                    ^^^^

Main.hs:23:17: 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."
   |
23 |  let xi = fst $ head $ dropWhile (uncurry (==)) $ zip goal xs
   |                 ^^^^
[2 of 2] Linking a.out

ソースコード

diff # 

import Control.Monad
import Data.List (foldl', findIndex, unfoldr)

replace i xs = xs1 ++ (xj : xi : xs2)
 where (xs1,(xi:xj:xs2)) = splitAt (i-2) xs

main = do
 n <- readLn
 k <- readLn
 is <- map (read . head . words) <$> replicateM k getLine
 goal <- map read . words <$> getLine
 let start = amida [1..n] (map pred is)
 let inss = unfoldr (insert goal) start
 print (length inss)
 putStr $ (unlines . map (unwords . map show)) inss

amida :: [Int] -> [Int] -> [Int]
amida xs = foldl' (flip replace) xs

insert :: [Int] -> [Int] -> Maybe ([Int],[Int])
insert goal xs = do
 guard (goal /= xs)
 let xi = fst $ head $ dropWhile (uncurry (==)) $ zip goal xs
 i <- succ <$> findIndex (==xi) xs 
 let ji = [i-1,i]
 return (ji, replace i xs)
0