結果

問題 No.506 限られたジャパリまん
ユーザー aimyaimy
提出日時 2017-04-29 10:35:26
言語 Haskell
(9.8.2)
結果
TLE  
実行時間 -
コード長 1,448 bytes
コンパイル時間 7,201 ms
コンパイル使用メモリ 198,276 KB
実行使用メモリ 16,540 KB
最終ジャッジ日時 2024-06-28 04:17:44
合計ジャッジ時間 9,560 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
13,752 KB
testcase_01 AC 2 ms
6,940 KB
testcase_02 AC 7 ms
8,064 KB
testcase_03 AC 1 ms
6,944 KB
testcase_04 AC 41 ms
8,192 KB
testcase_05 AC 4 ms
6,940 KB
testcase_06 AC 2 ms
6,944 KB
testcase_07 AC 43 ms
8,320 KB
testcase_08 TLE -
testcase_09 -- -
testcase_10 -- -
testcase_11 -- -
testcase_12 -- -
testcase_13 -- -
testcase_14 -- -
testcase_15 -- -
testcase_16 -- -
testcase_17 -- -
testcase_18 -- -
testcase_19 -- -
testcase_20 -- -
testcase_21 -- -
testcase_22 -- -
testcase_23 -- -
testcase_24 -- -
権限があれば一括ダウンロードができます
コンパイルメッセージ
Loaded package environment from /home/judge/.ghc/x86_64-linux-9.8.2/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.List):
    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons 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.List):
    "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or 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.List):
    "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
   |
16 |    | otherwise = query' right (tail bs)
   |                                ^^^^
[2 of 2] Linking a.out

ソースコード

diff # 

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