結果
問題 |
No.3252 Constrained Moving
|
ユーザー |
|
提出日時 | 2025-09-06 12:20:44 |
言語 | Haskell (9.10.1) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,520 bytes |
コンパイル時間 | 10,770 ms |
コンパイル使用メモリ | 205,684 KB |
実行使用メモリ | 34,612 KB |
最終ジャッジ日時 | 2025-09-06 12:20:58 |
合計ジャッジ時間 | 14,174 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 27 WA * 3 |
コンパイルメッセージ
Loaded package environment from /home/judge/.ghc/x86_64-linux-9.10.1/environments/default [1 of 2] Compiling Main ( Main.hs, Main.o ) [2 of 2] Linking a.out
ソースコード
{-# OPTIONS_GHC -Wno-unused-imports -Wno-unused-top-binds #-} import Control.Monad import Data.Maybe import qualified Data.ByteString.Char8 as BS import Control.Monad.ST import Data.Ix import Data.Array (Array) import Data.Array.IArray import Data.Array.IO import Data.Array.MArray import Data.Array.ST import Data.Array.Unboxed (UArray) import Data.Char import Data.List as L import Data.Foldable import Data.Function import Control.Exception import Data.Array.Base (STUArray(STUArray), UArray (UArray)) import Data.Array.IO.Internals (IOUArray(IOUArray)) import Data.Ord import GHC.Float main :: IO () main = do [n, s, t, k] <- getIntList as <- getIntList let mina = minimum as ss = as !! (s - 1) tt = as !! (t - 1) ans | ss + tt <= k = 1 | mina + tt <= k = 2 | otherwise = -1 print ans --library-------------- modulus :: Int modulus = 10 ^ 9 + 7 addMod, subMod, mulMod :: Int -> Int -> Int addMod x y = (x + y) `mod` modulus subMod x y = (x - y) `mod` modulus mulMod x y = (x * y) `mod` modulus tuplify2 :: [b] -> (b, b) tuplify2 (x:y:_) = (x,y) tuplify2 _ = undefined readInt :: BS.ByteString -> Int readInt = fst . fromJust . BS.readInt readIntTuple :: BS.ByteString -> (Int, Int) readIntTuple = tuplify2 . map readInt . BS.words readIntList :: BS.ByteString -> [Int] readIntList = map readInt . BS.words getInt :: IO Int getInt = readInt <$> BS.getLine getIntList :: IO [Int] getIntList = readIntList <$> BS.getLine