結果
| 問題 | 
                            No.349 干支の置き物
                             | 
                    
| コンテスト | |
| ユーザー | 
                             okaduki
                         | 
                    
| 提出日時 | 2016-03-26 20:49:36 | 
| 言語 | Haskell  (9.10.1)  | 
                    
| 結果 | 
                             
                                AC
                                 
                             
                            
                         | 
                    
| 実行時間 | 2 ms / 2,000 ms | 
| コード長 | 305 bytes | 
| コンパイル時間 | 6,161 ms | 
| コンパイル使用メモリ | 175,104 KB | 
| 実行使用メモリ | 5,248 KB | 
| 最終ジャッジ日時 | 2024-11-17 07:28:54 | 
| 合計ジャッジ時間 | 7,137 ms | 
| 
                            ジャッジサーバーID (参考情報)  | 
                        judge1 / judge3 | 
(要ログイン)
| ファイルパターン | 結果 | 
|---|---|
| sample | AC * 3 | 
| other | AC * 29 | 
コンパイルメッセージ
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:12:23: 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 |   putStrLn $ answer $ head xs - 1 <= (sum $ tail xs)
   |                       ^^^^
Main.hs:12:45: 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."
   |
12 |   putStrLn $ answer $ head xs - 1 <= (sum $ tail xs)
   |                                             ^^^^
[2 of 2] Linking a.out
            
            ソースコード
import Control.Monad import Data.List import Control.Applicative answer True = "YES" answer False = "NO" main = do n <- (read :: String -> Int) <$> getLine ss <- forM [1..n] $ \_ -> getLine let xs = reverse $ sort $ map length $ group $ sort ss putStrLn $ answer $ head xs - 1 <= (sum $ tail xs)
            
okaduki