Submission #1532834
Source Code Expand
#include "bits/stdc++.h" using namespace std; #define rep(i,n) for(int i=0;i<n;i++) #define REP(i,x,n) for(int i=x;i<n;i++) #define ALL(v) (v).begin(),(v).end() typedef long long LL; typedef pair<int, int> PI; typedef vector<int> VI; const LL MOD = 1000000007LL; int main() { int N; cin >> N; map<int, int> cnt; rep(i, N) { int A; cin >> A; cnt[A]++; } int odd = 0, even = 0; for (auto e : cnt) { if (e.second % 2 == 1) odd++; else even++; } if (even % 2 == 0) { cout << odd + even << endl; } else { cout << odd + even - 1 << endl; } }
Submission Info
Submission Time | |
---|---|
Task | D - Card Eater |
User | Div9851 |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 590 Byte |
Status | AC |
Exec Time | 50 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 | 32 ms | 256 KB |
07.txt | AC | 32 ms | 256 KB |
08.txt | AC | 42 ms | 640 KB |
09.txt | AC | 31 ms | 256 KB |
10.txt | AC | 31 ms | 256 KB |
11.txt | AC | 40 ms | 640 KB |
12.txt | AC | 34 ms | 256 KB |
13.txt | AC | 36 ms | 384 KB |
14.txt | AC | 50 ms | 4992 KB |
15.txt | AC | 29 ms | 256 KB |