結果

問題 No.675 ドットちゃんたち
ユーザー torus711torus711
提出日時 2019-06-22 17:34:11
言語 Haskell
(9.8.2)
結果
WA  
実行時間 -
コード長 1,264 bytes
コンパイル時間 8,601 ms
コンパイル使用メモリ 181,132 KB
実行使用メモリ 78,208 KB
最終ジャッジ日時 2024-06-07 22:57:02
合計ジャッジ時間 7,435 ms
ジャッジサーバーID
(参考情報)
judge1 / judge4
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,816 KB
testcase_01 AC 1 ms
6,940 KB
testcase_02 AC 1 ms
6,944 KB
testcase_03 AC 2 ms
6,940 KB
testcase_04 AC 2 ms
6,944 KB
testcase_05 AC 244 ms
57,216 KB
testcase_06 AC 377 ms
72,704 KB
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
権限があれば一括ダウンロードができます
コンパイルメッセージ
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:33:1: warning: [GHC-94817] [-Wtabs]
    Tab character found here, and in 7 further locations.
    Suggested fix: Please use spaces instead.
   |
33 |         [ n, px, py ] :: [Integer] <- map fromIntegral <$> readInts
   | ^^^^^^^^

Main.hs:35:95: 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."
   |
35 |         mapM_ ( uncurry $ printf "%ld %ld\n" ) $ map ( \( a, b, _ ) -> ( a, b ) ) $ reverse $ tail $ scanl compose ( px, py, 0 ) commands
   |                                                                                               ^^^^
[2 of 2] Linking a.out

ソースコード

diff #

{-# LANGUAGE BangPatterns #-}
{-# LANGUAGE BinaryLiterals #-}
{-# LANGUAGE MultiWayIf #-}
{-# LANGUAGE NumDecimals #-}
{-# LANGUAGE ScopedTypeVariables #-}
{-# LANGUAGE TupleSections #-}

import Control.Applicative
import Control.Arrow
import Control.Monad
import Control.Monad.ST

import Data.Char
import Data.List
import Data.Maybe

import qualified Data.ByteString.Char8 as B

import Data.Array.ST.Safe
import Data.STRef

import Debug.Trace
import Text.Printf

readInt = readLn :: IO Int
readInts = map ( fst . fromJust . B.readInt ) . B.words <$> B.getLine
readNInts = readInt >>= flip replicateM readInt

which a b f = if f then a else b
mp [ a, b ] = ( a, b )

main = do
	[ n, px, py ] :: [Integer] <- map fromIntegral <$> readInts
	commands <- reverse . map decode <$> replicateM ( fromIntegral n ) ( map fromIntegral <$> readInts )
	mapM_ ( uncurry $ printf "%ld %ld\n" ) $ map ( \( a, b, _ ) -> ( a, b ) ) $ reverse $ tail $ scanl compose ( px, py, 0 ) commands

decode [ 1, dx ] = ( dx, 0, 0 )
decode [ 2, dy ] = ( 0, dy, 0 )
decode [ 3 ] = ( 0, 0, 1 )

compose ( x, y, d ) ( _, _, 1 ) = ( y, -x, ( succ d ) `mod` 4 )
compose ( x1, y1, d ) ( x2, y2, 0 ) = ( x1 + dx, y1 + dy, d )
	where
		dx = [ x2,  y2, -x2, -y2 ] !! d
		dy = [ y2, -x2, -y2,  x2 ] !! d
0