結果

問題 No.4 おもりと天秤
ユーザー e7a894e7a894
提出日時 2018-05-21 22:50:56
言語 Haskell
(9.8.2)
結果
TLE  
実行時間 -
コード長 483 bytes
コンパイル時間 8,442 ms
コンパイル使用メモリ 170,240 KB
実行使用メモリ 13,184 KB
最終ジャッジ日時 2024-06-28 15:38:14
合計ジャッジ時間 12,740 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
5,248 KB
testcase_01 AC 1 ms
5,248 KB
testcase_02 AC 3 ms
5,760 KB
testcase_03 AC 2 ms
5,376 KB
testcase_04 AC 2 ms
5,376 KB
testcase_05 TLE -
testcase_06 -- -
testcase_07 -- -
testcase_08 -- -
testcase_09 -- -
testcase_10 -- -
testcase_11 -- -
testcase_12 -- -
testcase_13 -- -
testcase_14 -- -
testcase_15 -- -
testcase_16 -- -
testcase_17 -- -
testcase_18 -- -
testcase_19 -- -
testcase_20 -- -
testcase_21 -- -
testcase_22 -- -
権限があれば一括ダウンロードができます
コンパイルメッセージ
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:15: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."
   |
15 |       | otherwise = resolve' ((a + (head bs), tail bs):(a, tail bs):ps)
   |                                     ^^^^

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

Main.hs:15:60: 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."
   |
15 |       | otherwise = resolve' ((a + (head bs), tail bs):(a, tail bs):ps)
   |                                                            ^^^^
[2 of 2] Linking a.out

ソースコード

diff # 

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) || (sum ws' < e) then "impossible" else resolve e ws'

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