結果

問題 No.723 2つの数の和
コンテスト
ユーザー momen999
提出日時 2019-04-19 13:40:27
言語 Haskell
(9.10.1)
結果
TLE  
実行時間 -
コード長 518 bytes
コンパイル時間 6,012 ms
コンパイル使用メモリ 172,604 KB
実行使用メモリ 38,944 KB
最終ジャッジ日時 2024-09-22 11:25:33
合計ジャッジ時間 9,561 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other TLE * 1 -- * 21
権限があれば一括ダウンロードができます
コンパイルメッセージ
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:10:8: 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."
   |
10 |     | (head . head) as == i = (length . head) as : f (i + 1) (tail as)
   |        ^^^^

Main.hs:10:15: 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."
   |
10 |     | (head . head) as == i = (length . head) as : f (i + 1) (tail as)
   |               ^^^^

Main.hs:10:41: 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."
   |
10 |     | (head . head) as == i = (length . head) as : f (i + 1) (tail as)
   |                                         ^^^^

Main.hs:10:63: 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."
   |
10 |     | (head . head) as == i = (length . head) as : f (i + 1) (tail as)
   |                                                               ^^^^
[2 of 2] Linking a.out

ソースコード

diff # 

import Data.List (group, sort)

main = do
    [n, x] <- map read . words <$> getLine
    as <- group . sort . map (read :: String -> Int) . words <$> getLine
    print $ solve x $ take (x + 1) $ (++ (repeat 0)) $ f 0 as

f _ [] = []
f i as 
    | (head . head) as == i = (length . head) as : f (i + 1) (tail as)
    | otherwise             = 0 : f (i + 1) as

solve x as = g 0 where
    g i | i == x    = 0
        | otherwise = a1 * a2 + g (i + 1)
        where
            a1 = as !! i
            a2 = as !! (x - i)
0