結果

問題 No.123 カードシャッフル
コンテスト
ユーザー tottoripaper
提出日時 2015-03-03 19:22:29
言語 Haskell
(9.10.1)
結果
AC  
実行時間 420 ms / 5,000 ms
コード長 467 bytes
コンパイル時間 7,502 ms
コンパイル使用メモリ 180,536 KB
実行使用メモリ 37,376 KB
最終ジャッジ日時 2024-06-24 01:15:26
合計ジャッジ時間 9,244 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 10
権限があれば一括ダウンロードができます
コンパイルメッセージ
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:28: 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 |       f (x:xs) cs = f xs ((head ss) : fs ++ (tail ss))
   |                            ^^^^

Main.hs:16:46: 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."
   |
16 |       f (x:xs) cs = f xs ((head ss) : fs ++ (tail ss))
   |                                              ^^^^

Main.hs:19:15: 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."
   |
19 |    in print $ head $ f as [1..n]
   |               ^^^^
[2 of 2] Linking a.out

ソースコード

diff # 

import Control.Monad
import qualified Data.ByteString.Char8 as B
import Data.Maybe (mapMaybe)
import Data.List (splitAt)
    
readInts :: B.ByteString -> [Int]
readInts = map fst . mapMaybe B.readInt . B.words

getInts = liftM readInts B.getLine
           
main = do
  [n, m] <- getInts
  as <- getInts
  let
      f [] cs = cs
      f (x:xs) cs = f xs ((head ss) : fs ++ (tail ss))
       where
         (fs, ss) = splitAt (x-1) cs
   in print $ head $ f as [1..n]
0