結果

問題 No.565 回転拡大
ユーザー okaduki
提出日時 2017-09-09 07:20:37
言語 Haskell
(9.10.1)
結果
AC  
実行時間 2 ms / 2,000 ms
コード長 787 bytes
コンパイル時間 5,431 ms
コンパイル使用メモリ 180,180 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-11-07 07:49:10
合計ジャッジ時間 3,466 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 30
権限があれば一括ダウンロードができます
コンパイルメッセージ
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:10:20: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘head’
    (imported from Prelude, 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."
   |
10 | rotr xs = if null (head xs) then []
   |                    ^^^^

Main.hs:11:31: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘head’
    (imported from Prelude, 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."
   |
11 |           else (reverse $ map head xs) : rotr (map tail xs)
   |                               ^^^^

Main.hs:11:52: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘tail’
    (imported from Prelude, 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."
   |
11 |           else (reverse $ map head xs) : rotr (map tail xs)
   |                                                    ^^^^
[2 of 2] Linking a.out

ソースコード

diff # 

{-# LANGUAGE FlexibleContexts, OverloadedStrings #-}
import Control.Applicative
import Control.Monad
import qualified Data.ByteString.Char8 as B
import Data.Maybe (fromJust)
import Text.Printf
import Debug.Trace

rot i xs = snd $ until ((==0) . fst) (\(i,ys) -> (i-1,rotr ys)) (i,xs)
rotr xs = if null (head xs) then []
          else (reverse $ map head xs) : rotr (map tail xs)

zoom k = foldr f []
  where f x acc = replicate k (concat (map (replicate k) x)) ++ acc

main = do
  [r,k] <- getInts
  [h,w] <- getInts
  ss <- zoom k <$> rot (r `div` 90) <$> replicateM h getLine
  mapM_ putStrLn ss


-- util
getInts :: IO [Int]
getInts = map (fst . fromJust . B.readInt) . B.words <$> B.getLine

substr :: Int -> Int -> B.ByteString -> B.ByteString
substr b l s = B.take l $ B.drop b s
0