Submission #3402162


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 (2.7.6)
Score 0
Code Size 457 Byte
Status RE
Exec Time 16 ms
Memory 4724 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 400
Status
RE × 2
RE × 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 RE 16 ms 2928 KB
00_example_02.txt RE 11 ms 2808 KB
01.txt RE 11 ms 2808 KB
02.txt RE 11 ms 2936 KB
03.txt RE 11 ms 2808 KB
04.txt RE 11 ms 2808 KB
05.txt RE 11 ms 2808 KB
06.txt RE 16 ms 4596 KB
07.txt RE 16 ms 4596 KB
08.txt RE 15 ms 4596 KB
09.txt RE 15 ms 4596 KB
10.txt RE 16 ms 4724 KB
11.txt RE 16 ms 4596 KB
12.txt RE 15 ms 4596 KB
13.txt RE 16 ms 4596 KB
14.txt RE 15 ms 4596 KB
15.txt RE 16 ms 4724 KB