結果

問題 No.1169 Row and Column and Diagonal
ユーザー poapoapoapoa
提出日時 2020-08-15 01:11:00
言語 Haskell
(9.8.2)
結果
AC  
実行時間 34 ms / 2,000 ms
コード長 423 bytes
コンパイル時間 3,936 ms
コンパイル使用メモリ 171,520 KB
実行使用メモリ 8,192 KB
最終ジャッジ日時 2024-10-10 16:59:42
合計ジャッジ時間 4,165 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 2 ms
5,248 KB
testcase_03 AC 1 ms
5,248 KB
testcase_04 AC 1 ms
5,248 KB
testcase_05 AC 2 ms
5,248 KB
testcase_06 AC 6 ms
7,936 KB
testcase_07 AC 10 ms
7,936 KB
testcase_08 AC 13 ms
7,936 KB
testcase_09 AC 18 ms
7,936 KB
testcase_10 AC 29 ms
8,064 KB
testcase_11 AC 32 ms
8,192 KB
testcase_12 AC 33 ms
7,936 KB
testcase_13 AC 33 ms
7,936 KB
testcase_14 AC 34 ms
7,936 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
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:12: 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."
   |
16 | shift xs = tail xs ++ [head xs]
   |            ^^^^

Main.hs:16:24: 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."
   |
16 | shift xs = tail xs ++ [head xs]
   |                        ^^^^
[2 of 2] Linking a.out

ソースコード

diff # 

import qualified Control.Monad         as M
main :: IO ()
main = do
  n <- readLn :: IO Int
  let m  = (n `div` 2) + 1
  let xs = merge [1..m] [m+1..n] 
  let ys = iterate shift xs
  putStr . unlines . map (unwords . map show) . take n $ ys

merge :: [Int] -> [Int] -> [Int]
merge xs     []     = xs
merge []     ys     = ys
merge (x:xs) (y:ys) = x : y : merge xs ys

shift :: [Int] -> [Int]
shift xs = tail xs ++ [head xs]
0