結果
問題 |
No.4 おもりと天秤
|
ユーザー |
![]() |
提出日時 | 2018-05-18 23:46:57 |
言語 | Haskell (9.10.1) |
結果 |
TLE
|
実行時間 | - |
コード長 | 704 bytes |
コンパイル時間 | 6,479 ms |
コンパイル使用メモリ | 172,420 KB |
実行使用メモリ | 15,904 KB |
最終ジャッジ日時 | 2024-06-28 14:06:17 |
合計ジャッジ時間 | 11,583 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
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:22:63: 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." | 22 | | otherwise = (m, filter (<= (e - m)) ps):(getPairs e c (p:(tail ps))) | ^^^^ [2 of 2] Linking a.out
ソースコード
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) || (sum ws' < e) then "impossible" else resolve e ws' resolve e ws = resolve' (getPairs e 0 (reverse $ sort ws)) where resolve' :: [(Int, [Int])] -> String resolve' [] = "impossible" resolve' pairs@((a,bs):ps) | a == e = "possible" | null bs = resolve' ps | otherwise = resolve' ((getPairs e a bs) ++ ps) getPairs :: Int -> Int -> [Int] -> [(Int,[Int])] getPairs e c (p:ps) | null ps = [(m, [])] | otherwise = (m, filter (<= (e - m)) ps):(getPairs e c (p:(tail ps))) where m = c + p