Submission #1530256
Source Code Expand
#include <iostream> #include <map> using namespace std; int main() { int N, duplicated = 0; cin >> N; map<int, int> counter; for (int i = 0; i < N; i++) { int A; cin >> A; counter[A]++; if (counter[A] >= 2) { duplicated++; } } int ans = counter.size(); ans -= duplicated % 2; cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Card Eater |
User | myusa |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 427 Byte |
Status | AC |
Exec Time | 68 ms |
Memory | 4992 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 400 / 400 | ||||
Status |
|
|
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 | 1 ms | 256 KB |
00_example_02.txt | AC | 1 ms | 256 KB |
01.txt | AC | 1 ms | 256 KB |
02.txt | AC | 3 ms | 256 KB |
03.txt | AC | 1 ms | 256 KB |
04.txt | AC | 1 ms | 256 KB |
05.txt | AC | 1 ms | 256 KB |
06.txt | AC | 33 ms | 256 KB |
07.txt | AC | 32 ms | 256 KB |
08.txt | AC | 47 ms | 640 KB |
09.txt | AC | 33 ms | 256 KB |
10.txt | AC | 31 ms | 256 KB |
11.txt | AC | 46 ms | 640 KB |
12.txt | AC | 32 ms | 256 KB |
13.txt | AC | 41 ms | 512 KB |
14.txt | AC | 68 ms | 4992 KB |
15.txt | AC | 29 ms | 256 KB |