Submission #2248871


Source Code Expand

module Main where

import qualified Data.Map as Map
import Control.Monad

main :: IO ()
main = do
    n <- read <$> getLine
    s <- replicateM n getLine
    m <- read <$> getLine
    t <- replicateM m getLine
    print $ solve s t

solve :: [String] -> [String] -> Int
solve s t =
    let l = ((\x -> (x, 1)) <$> s) ++ ((\x -> (x, -1)) <$> t)
        m = Map.fromListWith (+) l
    in  Map.foldr (+) 0 $ Map.filter (>0) m

Submission Info

Submission Time
Task A - Two Coins
User winjii
Language Haskell (GHC 7.10.3)
Score 0
Code Size 439 Byte
Status RE
Exec Time 1 ms
Memory 508 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 100
Status
RE × 4
RE × 10
Set Name Test Cases
Sample example_0, example_1, example_2, example_3
All example_0, example_1, example_2, example_3, rand_0, rand_1, rand_2, rand_3, rand_4, rand_5
Case Name Status Exec Time Memory
example_0 RE 1 ms 508 KiB
example_1 RE 1 ms 508 KiB
example_2 RE 1 ms 508 KiB
example_3 RE 1 ms 508 KiB
rand_0 RE 1 ms 508 KiB
rand_1 RE 1 ms 508 KiB
rand_2 RE 1 ms 508 KiB
rand_3 RE 1 ms 508 KiB
rand_4 RE 1 ms 508 KiB
rand_5 RE 1 ms 508 KiB