結果
問題 | No.482 あなたの名は |
ユーザー | alpha_virginis |
提出日時 | 2017-02-18 00:18:28 |
言語 | Haskell (9.8.2) |
結果 |
AC
|
実行時間 | 603 ms / 2,000 ms |
コード長 | 2,519 bytes |
コンパイル時間 | 2,835 ms |
コンパイル使用メモリ | 179,244 KB |
実行使用メモリ | 128,148 KB |
最終ジャッジ日時 | 2023-08-28 18:25:32 |
合計ジャッジ時間 | 13,001 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,948 KB |
testcase_01 | AC | 2 ms
6,992 KB |
testcase_02 | AC | 3 ms
6,972 KB |
testcase_03 | AC | 2 ms
6,996 KB |
testcase_04 | AC | 2 ms
6,992 KB |
testcase_05 | AC | 3 ms
6,928 KB |
testcase_06 | AC | 3 ms
7,036 KB |
testcase_07 | AC | 3 ms
7,740 KB |
testcase_08 | AC | 3 ms
7,392 KB |
testcase_09 | AC | 3 ms
7,084 KB |
testcase_10 | AC | 2 ms
7,384 KB |
testcase_11 | AC | 3 ms
7,436 KB |
testcase_12 | AC | 3 ms
7,544 KB |
testcase_13 | AC | 3 ms
7,300 KB |
testcase_14 | AC | 3 ms
7,308 KB |
testcase_15 | AC | 603 ms
128,148 KB |
testcase_16 | AC | 583 ms
127,992 KB |
testcase_17 | AC | 572 ms
128,032 KB |
testcase_18 | AC | 572 ms
127,996 KB |
testcase_19 | AC | 572 ms
128,096 KB |
testcase_20 | AC | 583 ms
128,068 KB |
testcase_21 | AC | 562 ms
128,012 KB |
testcase_22 | AC | 563 ms
128,028 KB |
testcase_23 | AC | 553 ms
128,056 KB |
testcase_24 | AC | 562 ms
128,032 KB |
testcase_25 | AC | 573 ms
128,060 KB |
testcase_26 | AC | 563 ms
128,072 KB |
testcase_27 | AC | 562 ms
127,996 KB |
testcase_28 | AC | 563 ms
128,104 KB |
testcase_29 | AC | 452 ms
120,832 KB |
testcase_30 | AC | 3 ms
6,996 KB |
コンパイルメッセージ
Loaded package environment from /home/judge/.ghc/x86_64-linux-9.6.1/environments/default [1 of 2] Compiling Main ( Main.hs, Main.o ) [2 of 2] Linking a.out
ソースコード
{-# LANGUAGE OverloadedStrings #-} module Main where import Data.Maybe import qualified Data.ByteString.Char8 as C import Control.Monad(forM_) import Data.Int import Data.List import Data.Array import Data.Word import Data.Bits yes :: C.ByteString yes = "YES" no :: C.ByteString no = "NO" getInts :: IO [Int] getInts = do ss <- C.getLine return $ map (fst . fromJust . C.readInt) $ C.words ss getIntss :: Int -> IO [[Int]] getIntss 0 = return [] getIntss n = do xs <- getInts xss <- getIntss (n - 1) return $ xs : xss -- end standard template -- -- begin tree template -- data Tree a = Node (Tree a) a (Tree a) initTree :: a -> Tree a initTree x = Node (initTree x) x (initTree x) update' :: Int -> (a -> a) -> Tree a -> Tree a update' 0 f (Node l x r) = Node l (f x) r update' i f (Node l x r) | mod i 2 == 1 = Node l' x r | otherwise = Node l x r' where i' = div i 2 l' = (update' i' f l) r' = (update' (i' - 1) f r) at :: Tree a -> Int -> a at (Node _ x _) 0 = x at (Node l _ r) i | mod i 2 == 1 = at l i' | otherwise = at r (i' - 1) where i' = div i 2 -- end tree template -- -- begin boolean flags template -- type Flags = Tree Word64 initFlags :: Flags initFlags = initTree 0 setFlag :: Int -> Flags -> Flags setFlag i flags = update' (i `shiftR` 6) f flags where f = \x -> x .|. (1 `shiftL` (i .&. 0x3f)) getFlag :: Int -> Flags -> Bool getFlag i flags = ((flags `at` (i `shiftR` 6)) .&. (1 `shiftL` (i .&. 0x3f))) /= 0 -- end boolean flags template -- main :: IO () main = do [n,k] <- getInts xs <- getInts let ss = solve n k xs C.putStrLn ss solve :: Int -> Int -> [Int] -> C.ByteString solve n k xs = if diff <= k && mod diff 2 == mod k 2 then yes else no where xs' = listArray (1,n) xs visited = initFlags (_, count) = f n xs' visited 0 diff = count f :: Int -> Array Int Int -> Flags -> Int -> (Flags, Int) f 0 xs visited count = (visited, count) f i xs visited count = if getFlag (toEnum i) visited == True then f (i - 1) xs visited count else f (i - 1) xs visited' (count + count') where (visited', count') = g i i xs visited 0 g :: Int -> Int -> Array Int Int -> Flags -> Int -> (Flags, Int) g s i xs visited count = if (xs ! i) == s then (visited', count) else g s (xs ! i) xs visited' (count + 1) where visited' = setFlag i visited