Submission #1695994

---

Source Code Expand

// 解説を見なかった

#include <iostream>
#include <queue>
#include <vector>
#include <cmath>
#include <algorithm>
#include <map>
#include <iomanip>
#include <numeric>

using namespace std;
using ll = long long;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;

int cnt[100010];

int main() {
    int N;
    ll dup = 0;
    cin >> N;
    for (int i = 0; i < N; i++) {
        int a;
        cin >> a;
        cnt[a]++;
        if (cnt[a] >= 2) {
            dup++;
        }
    }

    N -= dup;
    if (dup % 2 == 1) N -= 1;

    cout << N << endl;

    return 0;
}

Submission Info

Judge Result