結果
問題 | No.92 逃走経路 |
ユーザー | ducktail |
提出日時 | 2018-06-16 17:15:51 |
言語 | Haskell (9.8.2) |
結果 |
AC
|
実行時間 | 32 ms / 5,000 ms |
コード長 | 1,162 bytes |
コンパイル時間 | 1,624 ms |
コンパイル使用メモリ | 163,488 KB |
実行使用メモリ | 11,904 KB |
最終ジャッジ日時 | 2023-09-13 06:07:57 |
合計ジャッジ時間 | 3,145 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 12 ms
11,868 KB |
testcase_01 | AC | 2 ms
7,472 KB |
testcase_02 | AC | 3 ms
7,488 KB |
testcase_03 | AC | 2 ms
7,520 KB |
testcase_04 | AC | 2 ms
7,464 KB |
testcase_05 | AC | 22 ms
11,712 KB |
testcase_06 | AC | 5 ms
10,008 KB |
testcase_07 | AC | 5 ms
10,064 KB |
testcase_08 | AC | 2 ms
7,788 KB |
testcase_09 | AC | 12 ms
11,612 KB |
testcase_10 | AC | 32 ms
11,772 KB |
testcase_11 | AC | 32 ms
11,804 KB |
testcase_12 | AC | 32 ms
11,796 KB |
testcase_13 | AC | 12 ms
11,668 KB |
testcase_14 | AC | 12 ms
11,644 KB |
testcase_15 | AC | 22 ms
11,684 KB |
testcase_16 | AC | 22 ms
11,752 KB |
testcase_17 | AC | 22 ms
11,904 KB |
testcase_18 | AC | 12 ms
11,160 KB |
testcase_19 | AC | 7 ms
10,388 KB |
コンパイルメッセージ
Loaded package environment from /home/judge/.ghc/x86_64-linux-9.6.1/environments/default [1 of 2] Compiling Main ( Main.hs, Main.o ) [2 of 2] Linking a.out
ソースコード
import Control.Applicative ((<$>), (<*>)) import Control.Monad (replicateM) import Data.ByteString.Char8 (ByteString) import qualified Data.ByteString.Char8 as B import Data.List (unfoldr, foldl') import Data.Char (isSpace) import Data.Map (Map) import qualified Data.Map as M import Data.IntSet (IntSet) import qualified Data.IntSet as IS main :: IO () main = do [n, m, _] <- f solve n <$> replicateM m f <*> f >>= mapM_ putStrLn where f = readil B.readInt <$> B.getLine solve :: Int -> [[Int]] -> [Int] -> [String] solve n fts fs = let ls = foldl' (g mp) (IS.fromList [1..n]) fs in [(show . IS.size) ls, (unwords . map show . IS.toList) ls] where f mp [a, b, c] = M.insertWith (++) (a, c) [b] (M.insertWith (++) (b, c) [a] mp) mp = foldl' f M.empty fts g mp st d = IS.foldl' h IS.empty st where h s p = case M.lookup (p, d) mp of Just xs -> IS.union s (IS.fromList xs) Nothing -> s readil :: Integral a => (ByteString -> Maybe (a, ByteString)) -> ByteString -> [a] readil f = unfoldr g where g s = do (n, s') <- f s return (n, B.dropWhile isSpace s')