結果

問題 No.7 プライムナンバーゲーム
コンテスト
ユーザー aimy
提出日時 2017-04-28 10:12:08
言語 Haskell
(9.10.1)
結果
MLE  
実行時間 -
コード長 822 bytes
コンパイル時間 4,095 ms
コンパイル使用メモリ 170,368 KB
実行使用メモリ 827,712 KB
最終ジャッジ日時 2024-09-13 16:21:53
合計ジャッジ時間 19,247 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other MLE * 1 -- * 16
権限があれば一括ダウンロードができます
コンパイルメッセージ
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:16: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."
   |
16 |    | head bs == 0 = query' left (tail bs)
   |      ^^^^

Main.hs:16: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."
   |
16 |    | head bs == 0 = query' left (tail bs)
   |                                  ^^^^

Main.hs:17: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."
   |
17 |    | otherwise = query' right (tail bs)
   |                                ^^^^
[2 of 2] Linking a.out

ソースコード

diff # 

import Data.Tuple
import Data.List
import Data.Bool
import Data.Bits

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)

primes = 2:3:[x | i<-[1..], j<-[-1,1], let x = 6*i+j, isPrime x]
 where isPrime n = null [i | i <- takeWhile (\x -> x^2 <= n) primes, mod n i == 0]

main = readLn >>= putStrLn . bool "Lose" "Win" . pgame

pgame = memoize $ \f n -> if n<=3 then False else all (not . f . (n-)) (takeWhile (<=n) primes)
0