結果
問題 | No.482 あなたの名は |
ユーザー | alpha_virginis |
提出日時 | 2017-02-18 00:30:50 |
言語 | Haskell (9.8.2) |
結果 |
AC
|
実行時間 | 664 ms / 2,000 ms |
コード長 | 2,042 bytes |
コンパイル時間 | 1,615 ms |
コンパイル使用メモリ | 180,280 KB |
実行使用メモリ | 238,932 KB |
最終ジャッジ日時 | 2023-08-28 18:26:24 |
合計ジャッジ時間 | 14,084 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 5 ms
11,128 KB |
testcase_01 | AC | 5 ms
11,160 KB |
testcase_02 | AC | 5 ms
11,144 KB |
testcase_03 | AC | 5 ms
11,204 KB |
testcase_04 | AC | 5 ms
11,148 KB |
testcase_05 | AC | 4 ms
11,160 KB |
testcase_06 | AC | 5 ms
11,284 KB |
testcase_07 | AC | 12 ms
12,980 KB |
testcase_08 | AC | 7 ms
13,120 KB |
testcase_09 | AC | 5 ms
11,228 KB |
testcase_10 | AC | 7 ms
13,036 KB |
testcase_11 | AC | 7 ms
13,068 KB |
testcase_12 | AC | 8 ms
13,068 KB |
testcase_13 | AC | 12 ms
13,052 KB |
testcase_14 | AC | 7 ms
13,084 KB |
testcase_15 | AC | 664 ms
233,268 KB |
testcase_16 | AC | 653 ms
233,256 KB |
testcase_17 | AC | 632 ms
233,348 KB |
testcase_18 | AC | 643 ms
233,232 KB |
testcase_19 | AC | 633 ms
233,292 KB |
testcase_20 | AC | 632 ms
233,188 KB |
testcase_21 | AC | 642 ms
233,336 KB |
testcase_22 | AC | 643 ms
233,284 KB |
testcase_23 | AC | 632 ms
233,784 KB |
testcase_24 | AC | 633 ms
233,884 KB |
testcase_25 | AC | 632 ms
233,288 KB |
testcase_26 | AC | 643 ms
233,200 KB |
testcase_27 | AC | 642 ms
233,840 KB |
testcase_28 | AC | 643 ms
233,304 KB |
testcase_29 | AC | 532 ms
238,932 KB |
testcase_30 | AC | 5 ms
11,156 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 import qualified Data.IntMap as IntMap 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 boolean flags template -- type Flags = IntMap.IntMap Word64 initFlags :: Flags initFlags = IntMap.fromList (zip [0..10000] (repeat 0)) setFlag :: Int -> Flags -> Flags setFlag i flags = IntMap.update f (i `shiftR` 6) flags where f = \x -> Just $ x .|. (1 `shiftL` (i .&. 0x3f)) getFlag :: Int -> Flags -> Bool getFlag i flags = ((flags IntMap.! (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