Submission #3402164


Source Code Expand

from collections import defaultdict
def getN():
    return int(input())


def getNM():
    return map(int, input().split())


def getList():
    return list(map(int, input().split()))

N = getN()
nums = getList()
dup = defaultdict(int)

for n in nums:
    dup[n] += 1

poss = len(dup.keys())
dupdup = 0
for val in dup.values():
    if val % 2 == 0:
        dupdup += 1

if dupdup % 2 == 0:
    print(poss)
else:
    print(poss-1)

Submission Info

Submission Time
Task D - Card Eater
User socha
Language Python (3.4.3)
Score 400
Code Size 457 Byte
Status AC
Exec Time 79 ms
Memory 18656 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 20 ms 3316 KB
00_example_02.txt AC 20 ms 3316 KB
01.txt AC 20 ms 3316 KB
02.txt AC 22 ms 3956 KB
03.txt AC 20 ms 3316 KB
04.txt AC 20 ms 3316 KB
05.txt AC 20 ms 3316 KB
06.txt AC 58 ms 14900 KB
07.txt AC 59 ms 14236 KB
08.txt AC 62 ms 14196 KB
09.txt AC 59 ms 14780 KB
10.txt AC 62 ms 14216 KB
11.txt AC 61 ms 14196 KB
12.txt AC 58 ms 14232 KB
13.txt AC 60 ms 14196 KB
14.txt AC 79 ms 18656 KB
15.txt AC 58 ms 14216 KB