{-# 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.Strict as IntMap import qualified Data.Map as Map 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