結果

問題 No.365 ジェンガソート
ユーザー momen999
提出日時 2017-08-01 08:10:13
言語 Haskell
(9.10.1)
結果
AC  
実行時間 377 ms / 2,000 ms
コード長 252 bytes
コンパイル時間 9,136 ms
コンパイル使用メモリ 175,616 KB
実行使用メモリ 82,944 KB
最終ジャッジ日時 2024-10-11 05:45:04
合計ジャッジ時間 14,348 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 41
権限があれば一括ダウンロードができます
コンパイルメッセージ
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:4:7: 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."
  |
4 |     | head xs == n  = jenga (n - 1) (tail xs)
  |       ^^^^

Main.hs:4:38: 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."
  |
4 |     | head xs == n  = jenga (n - 1) (tail xs)
  |                                      ^^^^

Main.hs:5:32: 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."
  |
5 |     | otherwise     = jenga n (tail xs)
  |                                ^^^^
[2 of 2] Linking a.out

ソースコード

diff # 

jenga :: Int -> [Int] -> Int
jenga n xs
    | null xs       = n
    | head xs == n  = jenga (n - 1) (tail xs)
    | otherwise     = jenga n (tail xs)
    
main = do
    n <- readLn
    xs <- map read . words <$> getLine
    print $ jenga n (reverse xs)
0