結果
問題 | No.355 数当てゲーム(2) |
ユーザー | okaduki |
提出日時 | 2016-04-03 02:31:53 |
言語 | Haskell (9.8.2) |
結果 |
RE
|
実行時間 | - |
コード長 | 770 bytes |
コンパイル時間 | 1,462 ms |
コンパイル使用メモリ | 172,416 KB |
実行使用メモリ | 25,616 KB |
平均クエリ数 | 1.00 |
最終ジャッジ日時 | 2024-07-16 09:40:34 |
合計ジャッジ時間 | 12,621 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | RE | - |
testcase_01 | RE | - |
testcase_02 | RE | - |
testcase_03 | RE | - |
testcase_04 | RE | - |
testcase_05 | RE | - |
testcase_06 | RE | - |
testcase_07 | RE | - |
testcase_08 | RE | - |
testcase_09 | RE | - |
testcase_10 | RE | - |
testcase_11 | RE | - |
testcase_12 | RE | - |
testcase_13 | RE | - |
testcase_14 | RE | - |
testcase_15 | RE | - |
testcase_16 | RE | - |
testcase_17 | RE | - |
testcase_18 | RE | - |
testcase_19 | RE | - |
testcase_20 | RE | - |
testcase_21 | RE | - |
testcase_22 | RE | - |
testcase_23 | RE | - |
testcase_24 | RE | - |
testcase_25 | RE | - |
testcase_26 | RE | - |
testcase_27 | RE | - |
testcase_28 | RE | - |
testcase_29 | RE | - |
testcase_30 | RE | - |
testcase_31 | RE | - |
testcase_32 | RE | - |
testcase_33 | RE | - |
testcase_34 | RE | - |
testcase_35 | RE | - |
testcase_36 | RE | - |
testcase_37 | RE | - |
testcase_38 | RE | - |
testcase_39 | RE | - |
testcase_40 | RE | - |
testcase_41 | RE | - |
testcase_42 | RE | - |
testcase_43 | RE | - |
testcase_44 | RE | - |
testcase_45 | RE | - |
testcase_46 | RE | - |
testcase_47 | RE | - |
testcase_48 | RE | - |
testcase_49 | RE | - |
testcase_50 | RE | - |
testcase_51 | RE | - |
コンパイルメッセージ
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:26:7: 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." | 26 | if (head res) == 4 then exitSuccess | ^^^^ [2 of 2] Linking a.out
ソースコード
import Control.Applicative import Control.Monad import qualified Data.ByteString.Char8 as B import Data.Maybe (fromJust) import Text.Printf import Debug.Trace import System.IO import System.Exit up xs i x = take i xs ++ [x] ++ drop (i+1) xs maxind [x] i = i maxind (x:y:xs) i = if x > y then i else maxind (y:xs) (i+1) solve :: Int -> [Int] -> IO [Int] solve i xs = do res <- forM [0..9] $ \j -> do [a,_] <- query $ up xs i j return a return $ up xs i (maxind res 0) query (n1:n2:n3:n4:_) = do printf "%d %d %d %d\n" n1 n2 n3 n4 hFlush stdout res <- fmap (read :: String -> Int) . words <$> getLine if (head res) == 4 then exitSuccess else return res main = solve 0 [0,0,0,0] >>= solve 1 >>= solve 2 >>= solve 3 >>= query