結果

問題 No.4 おもりと天秤
コンテスト
ユーザー e7a894
提出日時 2018-05-22 00:07:03
言語 Haskell
(9.10.1)
結果
TLE  
実行時間 -
コード長 574 bytes
コンパイル時間 1,652 ms
コンパイル使用メモリ 172,288 KB
実行使用メモリ 14,748 KB
最終ジャッジ日時 2024-06-28 15:39:26
合計ジャッジ時間 8,317 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 18 TLE * 1 -- * 4
権限があれば一括ダウンロードができます
コンパイルメッセージ
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:14: 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."
   |
17 |       | a + (head bs) > e = resolve' ((a, tail bs):ps)
   |              ^^^^

Main.hs:17:43: 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."
   |
17 |       | a + (head bs) > e = resolve' ((a, tail bs):ps)
   |                                           ^^^^

Main.hs:18:37: 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."
   |
18 |       | otherwise = resolve' ((a + (head bs), tail bs):(a, tail bs):ps)
   |                                     ^^^^

Main.hs:18:47: 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."
   |
18 |       | otherwise = resolve' ((a + (head bs), tail bs):(a, tail bs):ps)
   |                                               ^^^^

Main.hs:18:60: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘tail’
    (imported from Data.List, but defi

ソースコード

diff #
raw source code 

import Data.List

main = do
  n <- readLn :: IO Int
  ws <- (map read . words) <$> getLine
  let e = (sum ws) `div` 2
  let ws' = filter (<= e) ws
  putStrLn $ if odd $ sum ws then "impossible" else resolve e $ reverse $ sort ws'

resolve e ws = resolve' [(0, ws)]
  where
    resolve' :: [(Int, [Int])] -> String
    resolve' [] = "impossible"
    resolve' ((a,bs):ps)
      | a == e = "possible"
      | null bs || sum bs < (e - a) = resolve' ps
      | a + (head bs) > e = resolve' ((a, tail bs):ps)
      | otherwise = resolve' ((a + (head bs), tail bs):(a, tail bs):ps)
0