結果

問題 No.870 無敵囲い
ユーザー 情報学生情報学生
提出日時 2019-08-30 22:01:27
言語 Haskell
(9.8.2)
結果
RE  
実行時間 -
コード長 806 bytes
コンパイル時間 7,211 ms
コンパイル使用メモリ 168,320 KB
実行使用メモリ 5,376 KB
最終ジャッジ日時 2024-06-29 06:18:22
合計ジャッジ時間 2,404 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 1 ms
5,376 KB
testcase_03 AC 2 ms
5,376 KB
testcase_04 AC 2 ms
5,376 KB
testcase_05 AC 2 ms
5,376 KB
testcase_06 AC 1 ms
5,376 KB
testcase_07 AC 2 ms
5,376 KB
testcase_08 AC 2 ms
5,376 KB
testcase_09 AC 1 ms
5,376 KB
testcase_10 AC 2 ms
5,376 KB
testcase_11 AC 1 ms
5,376 KB
testcase_12 RE -
testcase_13 RE -
testcase_14 RE -
testcase_15 AC 1 ms
5,376 KB
testcase_16 AC 2 ms
5,376 KB
testcase_17 AC 2 ms
5,376 KB
testcase_18 AC 2 ms
5,376 KB
testcase_19 AC 2 ms
5,376 KB
testcase_20 AC 2 ms
5,376 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
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:17:37: 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."
   |
17 | check _ xs (a, b) [] = let (c, d) = head xs
   |                                     ^^^^

Main.hs:20:7: 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."
   |
20 |     | head xs == a && (head . tail) xs == b = check (g zs) ((g zs) : ys) k xss
   |       ^^^^

Main.hs:20:24: 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."
   |
20 |     | head xs == a && (head . tail) xs == b = check (g zs) ((g zs) : ys) k xss
   |                        ^^^^

Main.hs:20:31: 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."
   |
20 |     | head xs == a && (head . tail) xs == b = check (g zs) ((g zs) : ys) k xss
   |                               ^^^^
[2 of 2] Linking a.out

ソースコード

diff # 

main :: IO ()
main = interact $ solve . map read . words 

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

solve :: [Int] -> String
solve (n:xs) = if all id [a, b, c] then "YES" else "NO"
    where
        xss = splitEvery4 xs
        a   = check (2, 8) [] (5, 8) xss
        b   = check (3, 9) [] (4, 8) xss
        c   = check (7, 9) [] (6, 8) xss

check :: (Int, Int) -> [(Int, Int)] -> (Int, Int) -> [[Int]] -> Bool
chcek _ [] _      [] = False
check _ xs (a, b) [] = let (c, d) = head xs
                        in a == c && b == d 
check (a, b) ys k (xs:xss)
    | head xs == a && (head . tail) xs == b = check (g zs) ((g zs) : ys) k xss
    | otherwise = check (a, b) ys k xss
    where
        g  = (\[x, y] -> (x, y))
        zs = drop 2 xs
0