結果

問題 No.482 あなたの名は
コンテスト
ユーザー alpha_virginis
提出日時 2017-02-14 01:36:02
言語 Haskell
(9.10.1)
結果
AC  
実行時間 1,557 ms / 2,000 ms
コード長 2,140 bytes
コンパイル時間 9,864 ms
コンパイル使用メモリ 180,932 KB
実行使用メモリ 211,328 KB
最終ジャッジ日時 2024-12-29 21:02:01
合計ジャッジ時間 30,488 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 28
権限があれば一括ダウンロードができます
コンパイルメッセージ
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

ソースコード

diff # 

{-# 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

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)

insert' :: Int -> a -> Tree a -> Tree a
insert' 0 y (Node l _ r) = Node l y r
insert' i y (Node l x r)
  | mod i 2 == 1 = Node l' x r
  | otherwise = Node l x r'
    where i' = div i 2
          l' = (insert' i' y l)
          r' = (insert' (i' - 1) y 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 --

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 = C.pack $ show diff
solve n k xs = if diff <= k && mod diff 2 == mod k 2 then yes else no
  where
    xs' = listArray (1,n) xs
    visited = initTree False
    (_, count) = f n xs' visited 0
    diff = count

f :: Int -> Array Int Int -> Tree Bool -> Int -> (Tree Bool, Int)
f 0 xs visited count = (visited, count)
f i xs visited count = if visited `at` i == 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 -> Tree Bool -> Int -> (Tree Bool, 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' = insert' i True visited
0