結果

問題 No.506 限られたジャパリまん
コンテスト
ユーザー aimy
提出日時 2017-04-29 10:35:26
言語 Haskell
(9.14.1)
コンパイル:
ghc -rtsopts -with-rtsopts=-K1G -o a.out -O2 _filename_
実行:
./a.out
結果
WA  
実行時間 -
コード長 1,448 bytes
記録
記録タグの例:
初AC ショートコード 純ショートコード 純主流ショートコード 最速実行時間
コンパイル時間 5,058 ms
コンパイル使用メモリ 192,896 KB
実行使用メモリ 11,904 KB
最終ジャッジ日時 2026-03-16 15:29:47
合計ジャッジ時間 14,094 ms
ジャッジサーバーID
（参考情報） 		judge3_0 / judge1_0
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 24 WA * 1
権限があれば一括ダウンロードができます
コンパイルメッセージ
Loaded package environment from /home/judge/.ghc/x86_64-linux-9.14.1/environments/default
[1 of 2] Compiling Main             ( Main.hs, Main.o )
Main.hs:15:6: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘head’
    (imported from Data.List, but defined in GHC.Internal.List):
    "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
   |
15 |    | head bs == 0 = query' left (tail bs)
   |      ^^^^

Main.hs:15:34: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘tail’
    (imported from Data.List, but defined in GHC.Internal.List):
    "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
   |
15 |    | head bs == 0 = query' left (tail bs)
   |                                  ^^^^

Main.hs:16:32: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘tail’
    (imported from Data.List, but defined in GHC.Internal.List):
    "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
   |
16 |    | otherwise = query' right (tail bs)
   |                                ^^^^

[2 of 2] Linking a.out

ソースコード

diff #
raw source code 

import Data.Tuple
import Data.List
import Data.Ord

data Tree a = Node a (Tree a) (Tree a)
memoize f = memof where memof = f (query (blank memof))
blank f = blank' 1 where blank' k = Node (f k) (blank' (2*k)) (blank' (2*k+1))

query m x = query' m bits
 where
  bits = reverse (take w (unfoldr (return . swap . flip divMod 2) x))
  w = floor (logBase 2 (fromIntegral x))
  query' (Node v left right) bs
   | bs == [] = v
   | head bs == 0 = query' left (tail bs)
   | otherwise = query' right (tail bs)

combBy :: Integer -> [a] -> [[a]]
combBy 0 _ = [[]]
combBy _ [] = []
combBy n (x:xs) = map (x:) (combBy (n-1) xs) ++ combBy n xs

main = do
 [h,w,k,p] <- map read . words <$> getLine
 xyns <- map ((\[x,y,n] -> ((read x, read y),n)) . words) . lines <$> getContents
 let (r,fs) = japari (h+1) (w+1) k p xyns
 print (mod r (10^9+7))
 mapM_ putStrLn fs

japari :: Integer -> Integer -> Integer -> Integer -> [((Integer,Integer),String)] -> (Integer, [String])
japari h w k p xyns = (route h w (map (pos.fst) left) 0, (map snd xyns) \\ (map snd left))
 where
  left = maximumBy (comparing (\fs -> route h w (map (pos.fst) fs) 0)) (combBy (k-p) xyns)
  pos (x,y) = y*h + x

route h w fs = memoize $ 
 \f n -> 
  if isFriend n then 0 else
  if isGoal n then 1 else
  if isNB n then f (n+1) else
  if isEB n then f (n+h) else f (n+1) + f (n+h)
 where
  isGoal n = n == h*w-1
  isNB n = div n h == w-1
  isEB n = mod n h == h-1
  isFriend n = elem n fs
0