Submission #5400982

---

Source Code Expand

#!/usr/bin/env python3
import sys
from collections import defaultdict


def solve(N: int, A: "List[int]"):
    L = [0] * (100001)
    for a in A:
        L[a] += 1
        if L[a] >= 3:
            L[a] -= 2
    c = L.count(2)
    p, q = divmod(c, 2)
    res = sum(L) - 2 * (p + q)
    print(res)
    return


# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    A = [ int(next(tokens)) for _ in range(N) ]  # type: "List[int]"
    solve(N, A)

if __name__ == '__main__':
    main()

Submission Info

Judge Result