Submission #4035543
Source Code Expand
#include <bits/stdc++.h> using namespace std;; #define ll long long #define REP(i, n) for(int i = 0;i < n;i++) #define REPR(i, n) for(int i = n;i >= 0;i--) #define FOR(i, m, n) for(int i = m;i < n;i++) #define FORR(i, m, n) for(int i = m;i >= n;i--) #define INF 1<<30 #define LINF 1LL<<62 #define all(x) (x).begin(), (x).end() #define mp make_pair #define pb push_back const int MOD = 1000000007; typedef pair<int, int> P; typedef pair<ll, ll> LP; typedef pair<int, P> PP; typedef pair<ll, LP> LPP; int main(){ ios::sync_with_stdio(false); cin.tie(0); ll n;cin >> n; map<ll,ll> m; REP(i,n){ ll tmp;cin >> tmp; m[tmp]++; } ll s = m.size(); s -= (s%2==0); cout << s << endl; }
Submission Info
Submission Time | |
---|---|
Task | D - Card Eater |
User | mathda1 |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 740 Byte |
Status | AC |
Exec Time | 44 ms |
Memory | 6528 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 | 2 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 | 12 ms | 256 KB |
07.txt | AC | 12 ms | 256 KB |
08.txt | AC | 22 ms | 896 KB |
09.txt | AC | 12 ms | 256 KB |
10.txt | AC | 11 ms | 256 KB |
11.txt | AC | 21 ms | 768 KB |
12.txt | AC | 12 ms | 256 KB |
13.txt | AC | 17 ms | 384 KB |
14.txt | AC | 44 ms | 6528 KB |
15.txt | AC | 9 ms | 256 KB |