Submission #1515179


Source Code Expand

import qualified Data.ByteString.Char8 as B
import Data.List

readInt :: B.ByteString -> Int
readInt = maybe undefined fst . B.readInt

readInts :: B.ByteString -> [Int]
readInts = map readInt . B.words

main = do
  n <- readLn
  as <- readInts <$> B.getLine
  print (eater n as)

eater n = (\x -> if odd x then n-(x+1) else n-x) . sum . map (pred . length) . group . sort

Submission Info

Submission Time
Task D - Card Eater
User aimy
Language Haskell (GHC 7.10.3)
Score 400
Code Size 386 Byte
Status AC
Exec Time 215 ms
Memory 15740 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 2
AC × 17
Set Name Test Cases
Sample 00_example_01.txt, 00_example_02.txt
All 00_example_01.txt, 00_example_02.txt, 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt
Case Name Status Exec Time Memory
00_example_01.txt AC 2 ms 508 KB
00_example_02.txt AC 2 ms 508 KB
01.txt AC 2 ms 508 KB
02.txt AC 8 ms 2300 KB
03.txt AC 2 ms 636 KB
04.txt AC 2 ms 1020 KB
05.txt AC 2 ms 508 KB
06.txt AC 209 ms 15740 KB
07.txt AC 202 ms 15740 KB
08.txt AC 209 ms 15740 KB
09.txt AC 202 ms 15740 KB
10.txt AC 183 ms 15740 KB
11.txt AC 209 ms 15740 KB
12.txt AC 215 ms 15740 KB
13.txt AC 205 ms 15740 KB
14.txt AC 34 ms 13052 KB
15.txt AC 35 ms 13692 KB