結果

問題 No.185 和風
コンテスト
ユーザー 情報学生
提出日時 2019-08-21 15:45:04
言語 Haskell
(9.10.1)
結果
AC  
実行時間 7 ms / 1,000 ms
コード長 399 bytes
コンパイル時間 6,748 ms
コンパイル使用メモリ 169,472 KB
実行使用メモリ 8,064 KB
最終ジャッジ日時 2024-10-09 04:34:48
合計ジャッジ時間 7,061 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 7
権限があれば一括ダウンロードができます
コンパイルメッセージ
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:7:84: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘tail’
    (imported from Data.List, 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."
  |
7 | main = interact $ show . solve . map (\[x, y] -> y - x) . splitEvery2 . map read . tail . words
  |                                                                                    ^^^^

Main.hs:12:25: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘head’
    (imported from Data.List, 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."
   |
12 |                 else if head xs <= 0 then -1 else head xs
   |                         ^^^^

Main.hs:12:51: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘head’
    (imported from Data.List, 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."
   |
12 |                 else if head xs <= 0 then -1 else head xs
   |                                                   ^^^^
[2 of 2] Linking a.out

ソースコード

diff # 

import Data.List

splitEvery2 :: [Int] -> [[Int]]
splitEvery2 = takeWhile (not . null) . map (take 2) . iterate (drop 2)

main :: IO ()
main = interact $ show . solve . map (\[x, y] -> y - x) . splitEvery2 . map read . tail . words

solve :: [Int] -> Int
solve xs = if t /= 1 
                then -1 
                else if head xs <= 0 then -1 else head xs
    where
        t = length $ group xs
0