結果

問題 No.3067 +10 Seconds Clock
コンテスト
ユーザー torus711
提出日時 2025-03-21 21:47:16
言語 Haskell
(9.10.1)
結果
AC  
実行時間 60 ms / 2,000 ms
コード長 1,593 bytes
コンパイル時間 6,123 ms
コンパイル使用メモリ 205,552 KB
実行使用メモリ 25,728 KB
最終ジャッジ日時 2025-03-21 21:47:27
合計ジャッジ時間 7,886 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 23
権限があれば一括ダウンロードができます
コンパイルメッセージ
Loaded package environment from /home/judge/.ghc/x86_64-linux-9.10.1/environments/default
[1 of 2] Compiling Main             ( Main.hs, Main.o )
Main.hs:36:11: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘head’
    (imported from Data.List, but defined in GHC.Internal.List):
    "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
   |
36 | readStr = head <$> readStrs
   |           ^^^^

[2 of 2] Linking a.out

ソースコード

diff # 

{-# LANGUAGE BangPatterns #-}
{-# LANGUAGE BinaryLiterals #-}
{-# LANGUAGE MultiWayIf #-}
{-# LANGUAGE NumDecimals #-}
{-# LANGUAGE ScopedTypeVariables #-}
{-# LANGUAGE TupleSections #-}
{-# LANGUAGE FlexibleContexts #-}

{-# OPTIONS_GHC -O2 #-}
{-# OPTIONS_GHC -Wno-tabs #-}

import Control.Applicative
import Control.Arrow
import Control.Monad
import Control.Monad.ST

import Data.Char
import Data.List
import Data.Maybe
import Data.Either
import Data.Bool

import qualified Data.ByteString.Char8 as B

import Data.Array
import Data.Array.ST.Safe
import Data.STRef

import Debug.Trace
import Text.Printf

readInt = fst . fromJust . B.readInt <$> B.getLine
readInteger = fst . fromJust . B.readInteger <$> B.getLine
readInts = map ( fst . fromJust . B.readInt ) . B.words <$> B.getLine
readIntegers = map ( fst . fromJust . B.readInteger ) . B.words <$> B.getLine
readStr = head <$> readStrs
readStrs = map B.unpack . B.words <$> B.getLine

yesno = bool "No" "Yes"
mp [ a, b ] = ( a, b )

modifyArray a i f = writeArray a i =<< f <$> readArray a i

printList :: Show a => [a] -> IO ()
printList = putStrLn . intercalate " " . map show

main = do
	[ n, t ] <- readInts
	ts <- readInts
	k <- readInt
	cs <- elems . accumArray (+) 0 ( 1, n ) . flip zip ( repeat 1 ) <$> readInts
	print $ fromMaybe (-1) $ solve t 0 cs ts

solve _ _ _ [] = Just 0
solve cnt s (c:cs) (t:ts)
	| 0 < cnt - t = solve ( cnt - t ) ( s + c ) cs ts
	| 0 < cnt + ( s + c ) * 10 - t = ( need + ) <$> solve ( cnt + need * 10 - t ) ( s + c - need ) cs ts
	| otherwise = Nothing
	where
	need = ( -( cnt - t ) + 10 ) `div` 10
0