結果
問題 |
No.138 化石のバージョン
|
ユーザー |
![]() |
提出日時 | 2019-08-15 15:13:31 |
言語 | Haskell (9.10.1) |
結果 |
WA
|
実行時間 | - |
コード長 | 425 bytes |
コンパイル時間 | 2,596 ms |
コンパイル使用メモリ | 174,336 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-09-19 15:19:00 |
合計ジャッジ時間 | 2,267 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 20 WA * 13 |
コンパイルメッセージ
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:19: 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." | 7 | solve [a, b] = if head a < head b | ^^^^ Main.hs:7: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." | 7 | solve [a, b] = if head a < head b | ^^^^ Main.hs:9:26: 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." | 9 | else if (head $ drop 1 a) < (head $ drop 1 b) | ^^^^ Main.hs:9:46: 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." | 9 | else if (head $ drop 1 a) < (head $ drop 1 b) | ^^^^ Main.hs:11:34: 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
ソースコード
import Data.List.Split main :: IO () main = interact $ solve . map (splitOn ".") . words solve :: [[String]] -> String solve [a, b] = if head a < head b then "NO" else if (head $ drop 1 a) < (head $ drop 1 b) then "NO" else if (head $ drop 2 a) < (head $ drop 2 b) then "NO" else "YES"