結果
| 問題 | 
                            No.239 にゃんぱすー
                             | 
                    
| コンテスト | |
| ユーザー | 
                             | 
                    
| 提出日時 | 2019-04-12 12:32:45 | 
| 言語 | Haskell  (9.10.1)  | 
                    
| 結果 | 
                             
                                AC
                                 
                             
                            
                         | 
                    
| 実行時間 | 35 ms / 2,000 ms | 
| コード長 | 559 bytes | 
| コンパイル時間 | 9,164 ms | 
| コンパイル使用メモリ | 170,752 KB | 
| 実行使用メモリ | 15,232 KB | 
| 最終ジャッジ日時 | 2024-09-13 23:37:35 | 
| 合計ジャッジ時間 | 6,281 ms | 
| 
                            ジャッジサーバーID (参考情報)  | 
                        judge5 / judge2 | 
(要ログイン)
| ファイルパターン | 結果 | 
|---|---|
| sample | AC * 4 | 
| other | AC * 33 | 
コンパイルメッセージ
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:20: 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 | transpose xs = map head xs : transpose (map tail xs)
  |                    ^^^^
Main.hs:7:45: 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."
  |
7 | transpose xs = map head xs : transpose (map tail xs)
  |                                             ^^^^
[2 of 2] Linking a.out
            
            ソースコード
import Control.Monad (replicateM)
import Data.List (elemIndex)
import Data.Maybe (fromJust)
transpose :: [[a]] -> [[a]]
transpose ([]:_) = []
transpose xs = map head xs : transpose (map tail xs)
solve :: [[String]] -> Int
solve ns
    | isrentyon = succ $ fromJust $ elemIndex True r
    | otherwise = -1
    where
        r = map (all f) ys
        f s = s == "nyanpass" || s == "-"
        ys = transpose ns
        isrentyon = (length . filter (==True)) r == 1
main = do
    n <- readLn
    ns <- map words <$> replicateM n getLine
    print $ solve ns