Submission #1679390


Source Code Expand

#include <bits/stdc++.h>

using namespace std;

const int MOD = 1e9 + 7, maxn = 1e5 + 500;
int a[maxn], cnt[maxn];
set <int> myset;

int main(){
    ios_base::sync_with_stdio(false);
    int n;
    cin >> n;
    for (int i = 0; i < n; i++){
        cin >> a[i];
        myset.insert(a[i]);
        cnt[a[i]] ++;
    }
    int shm = 0;
    for (int i = 0; i < maxn - 300; i++)
        if (cnt[i] > 0)
            shm += cnt[i] - 1;
    if (shm % 2 == 1)
        cout << myset.size() - 1 << endl;
    else
        cout << myset.size() << endl;
}

Submission Info

Submission Time
Task D - Card Eater
User vjudge2
Language C++14 (GCC 5.4.1)
Score 400
Code Size 544 Byte
Status AC
Exec Time 30 ms
Memory 5760 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 2 ms 256 KB
00_example_02.txt AC 2 ms 256 KB
01.txt AC 2 ms 384 KB
02.txt AC 2 ms 384 KB
03.txt AC 2 ms 640 KB
04.txt AC 2 ms 512 KB
05.txt AC 2 ms 512 KB
06.txt AC 14 ms 896 KB
07.txt AC 14 ms 896 KB
08.txt AC 25 ms 1536 KB
09.txt AC 14 ms 896 KB
10.txt AC 12 ms 768 KB
11.txt AC 23 ms 1408 KB
12.txt AC 14 ms 896 KB
13.txt AC 19 ms 1152 KB
14.txt AC 30 ms 5760 KB
15.txt AC 10 ms 640 KB