Submission #1177580
Source Code Expand
import Data.Set (fromList) main :: IO () main = do l1 <- getLine l2 <- getLine let n = read l1 :: Int let as = (map read . words) l2 :: [Int] putStrLn $ solve n as solve :: Int -> [Int] -> String solve n as = show . removeDup $ (x, n-x) where x = countDup as removeDup :: (Int, Int) -> Int removeDup (0, uni) = uni removeDup (1, uni) = uni - 1 removeDup (x, uni) = removeDup (x-2, uni) countDup :: [Int] -> Int countDup as = abs $ length as - length (fromList as)
Submission Info
Submission Time | |
---|---|
Task | D - Card Eater |
User | ykarako |
Language | Haskell (GHC 7.10.3) |
Score | 400 |
Code Size | 513 Byte |
Status | AC |
Exec Time | 590 ms |
Memory | 47484 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 400 / 400 | ||||
Status |
|
|
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 | 1 ms | 508 KB |
00_example_02.txt | AC | 2 ms | 508 KB |
01.txt | AC | 2 ms | 892 KB |
02.txt | AC | 31 ms | 3964 KB |
03.txt | AC | 2 ms | 1020 KB |
04.txt | AC | 4 ms | 1148 KB |
05.txt | AC | 2 ms | 892 KB |
06.txt | AC | 491 ms | 45436 KB |
07.txt | AC | 492 ms | 45436 KB |
08.txt | AC | 590 ms | 47484 KB |
09.txt | AC | 490 ms | 45436 KB |
10.txt | AC | 486 ms | 46460 KB |
11.txt | AC | 585 ms | 47484 KB |
12.txt | AC | 495 ms | 45436 KB |
13.txt | AC | 561 ms | 47484 KB |
14.txt | AC | 494 ms | 46460 KB |
15.txt | AC | 475 ms | 46460 KB |