結果

問題 No.112 ややこしい鶴亀算
コンテスト
ユーザー iwot
提出日時 2020-05-23 00:38:32
言語 Haskell
(9.10.1)
結果
AC  
実行時間 2 ms / 5,000 ms
コード長 606 bytes
コンパイル時間 6,496 ms
コンパイル使用メモリ 171,392 KB
実行使用メモリ 6,820 KB
最終ジャッジ日時 2024-10-06 01:13:25
合計ジャッジ時間 7,377 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 23
権限があれば一括ダウンロードができます
コンパイルメッセージ
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:36: 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."
   |
11 | solve n as = if all (\n' -> n' == (head as)) as
   |                                    ^^^^

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 |              then if (head as) `div` (n-1) == 2 then [n,0] else [0,n]
   |                       ^^^^

Main.hs:16:25: 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."
   |
16 | counter n as = [length (head gc), length (last gc)]
   |                         ^^^^
[2 of 2] Linking a.out

ソースコード

diff # 

import Data.List
import Data.Ord

main :: IO ()
main = do
    n <- read <$> getLine
    as <- map read . words <$> getLine
    putStrLn $ unwords $ map show $ solve n as

solve :: Int -> [Int] -> [Int]
solve n as = if all (\n' -> n' == (head as)) as
             then if (head as) `div` (n-1) == 2 then [n,0] else [0,n]
             else counter n as

counter :: Int -> [Int] -> [Int]
counter n as = [length (head gc), length (last gc)]
    where kame_counts = sortOn Down (map (other_kame n) as)
          gc = group kame_counts

other_kame :: Int -> Int -> Int
other_kame n t = (t - (n - 1) * 2) `div` 2
0