結果
| 問題 |
No.998 Four Integers
|
| コンテスト | |
| ユーザー |
|
| 提出日時 | 2020-10-31 11:12:53 |
| 言語 | Haskell (9.10.1) |
| 結果 |
AC
|
| 実行時間 | 2 ms / 1,000 ms |
| コード長 | 1,561 bytes |
| コンパイル時間 | 6,959 ms |
| コンパイル使用メモリ | 215,328 KB |
| 実行使用メモリ | 6,944 KB |
| 最終ジャッジ日時 | 2024-07-22 04:47:37 |
| 合計ジャッジ時間 | 8,053 ms |
|
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 23 |
コンパイルメッセージ
Loaded package environment from /home/judge/.ghc/x86_64-linux-9.8.2/environments/default [1 of 2] Compiling Main ( Main.hs, Main.o ) [2 of 2] Linking a.out
ソースコード
{-# LANGUAGE BangPatterns #-}
{-# LANGUAGE TupleSections #-}
module Main where
import Control.Monad
import Control.Monad.ST
import Control.Monad.State
import Data.Bits
import Data.Bool
import Data.Char
import Data.Coerce
import Data.Word
import Unsafe.Coerce
import qualified Data.ByteString.Char8 as BSC8
import qualified Data.Vector.Fusion.Stream.Monadic as VFSM
import qualified Data.Vector.Generic as VG
import qualified Data.Vector.Generic.Mutable as VGM
import qualified Data.Vector.Unboxed as VU
main :: IO ()
main = do
xs <- seqInput 4
putStrLn $ bool "No" "Yes" (solve xs)
solve :: VU.Vector Int -> Bool
solve xs = runST $ do
let
ys = bucketSort 100 xs
a = ys VU.! 0
b = ys VU.! 1
c = ys VU.! 2
d = ys VU.! 3
return ((a + 1 == b) && (b + 1 == c) && (c + 1 == d))
type CParser a = StateT BSC8.ByteString Maybe a
runCParser :: CParser a -> BSC8.ByteString -> Maybe (a, BSC8.ByteString)
runCParser = runStateT
{-# INLINE runCParser #-}
int :: CParser Int
int = coerce $ BSC8.readInt . BSC8.dropWhile isSpace
{-# INLINE int #-}
seqInput :: Int -> IO (VU.Vector Int)
seqInput n = VU.unfoldrN n (runCParser int) <$> BSC8.getLine
{-# INLINE seqInput #-}
bucketSort :: Int -> VU.Vector Int -> VU.Vector Int
bucketSort bucketSize
= VU.concatMap (uncurry $ flip VU.replicate)
. VU.indexed
. VU.unsafeAccumulate (+) (VU.replicate bucketSize 0)
. VU.map (,1)
{-# INLINE bucketSort #-}