結果
| 問題 | No.193 筒の数式 |
| コンテスト | |
| ユーザー |
|
| 提出日時 | 2015-04-30 11:36:04 |
| 言語 | Haskell (9.10.1) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 586 bytes |
| 記録 | |
| コンパイル時間 | 1,578 ms |
| コンパイル使用メモリ | 173,952 KB |
| 実行使用メモリ | 5,376 KB |
| 最終ジャッジ日時 | 2024-07-05 17:07:47 |
| 合計ジャッジ時間 | 2,041 ms |
|
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 11 WA * 5 |
コンパイルメッセージ
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:11:11: 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."
|
11 | | head y < 0 = ((read $ drop 2 sy ++ sx) :: Int) + sum ys + ((read $ take 2 sy) :: Int)
| ^^^^
Main.hs:12: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."
|
12 | | otherwise = ((read $ tail sy ++ sx) :: Int) + sum ys + ((read [head sy]) :: Int)
| ^^^^
Main.hs:12:74: 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."
|
12 | | otherwise = ((read $ tail sy ++ sx) :: Int) + sum ys + ((read [head sy]) :: Int)
| ^^^^
Main.hs:15:21: 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."
|
15 | sy = show $ head y
| ^^^^
[2 of 2] Linking a.out
ソースコード
import Data.Char
main = getLine >>= print . solve . map (read :: String -> Int) . words . foldr ff ""
where
ff x acc
| isDigit x = x : acc
| x == '-' = ' ' : x : acc
| otherwise = ' ' : acc
solve :: [Int] -> Int
solve (x : xs)
| head y < 0 = ((read $ drop 2 sy ++ sx) :: Int) + sum ys + ((read $ take 2 sy) :: Int)
| otherwise = ((read $ tail sy ++ sx) :: Int) + sum ys + ((read [head sy]) :: Int)
where
(ys, y) = splitAt (length xs - 1) xs
sy = show $ head y
sx = show x