結果

問題 No.1020 Reverse
ユーザー poapoapoapoa
提出日時 2020-07-30 12:06:50
言語 Haskell
(9.10.1)
結果
WA  
実行時間 -
コード長 1,059 bytes
コンパイル時間 6,344 ms
コンパイル使用メモリ 207,952 KB
実行使用メモリ 38,912 KB
最終ジャッジ日時 2024-07-03 20:47:26
合計ジャッジ時間 7,867 ms
ジャッジサーバーID
(参考情報)
judge5 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2 WA * 1
other AC * 2 WA * 13
権限があれば一括ダウンロードができます
コンパイルメッセージ
Loaded package environment from /home/judge/.ghc/x86_64-linux-9.8.2/environments/default
[1 of 2] Compiling Main             ( Main.hs, Main.o )
[2 of 2] Linking a.out

ソースコード

diff #
プレゼンテーションモードにする

import qualified Control.Arrow as Arrow
import qualified Control.Monad as Monad
import qualified Data.Char as Char
import qualified Data.List as List
import qualified Data.ByteString.Char8 as BSC8
import qualified Data.Vector.Unboxed as VU
import qualified Data.Ord as Ord
getI :: BSC8.ByteString -> Maybe (Int, BSC8.ByteString)
getI = fmap (Arrow.second BSC8.tail) . BSC8.readInt
getAB :: IO (Int, Int)
getAB = (\vec -> (vec VU.! 0, vec VU.! 1)) . VU.unfoldrN 2 getI <$> BSC8.getLine
main :: IO ()
main = do
(n, k) <- getAB
s <- BSC8.unpack <$> BSC8.getLine
if even (n - k)
then solve' n k s
else solve'' n k s
solve', solve'' :: Int -> Int -> String -> IO ()
solve' n k s
= let xs = [k, k + 1 .. n] ++ [k - 1, k - 2 .. 1]
ys = zip xs s
zs = List.sortBy (Ord.comparing fst) ys
in putStrLn $ map snd zs
solve'' n k s
= let xs = [k, k + 1 .. n] ++ [1 .. k - 1]
ys = zip xs s
zs = List.sortBy (Ord.comparing fst) ys
in putStrLn $ map snd zs
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0