Submission #4025478

---

Source Code Expand

#include <iostream>
#include <stdio.h>
#include <cstring>
#include <cstdio>
#include <math.h>
#include <algorithm>
#include <vector>
#include <string>
#include <stdlib.h>
#include <queue>
#include <stack>
#include <utility>
#include <fstream>
#include <random>
#include <map>
#include <unordered_map>
#include <cstdlib>
#include <functional>
#include <random>
#include <time.h>
#include <chrono>
#include <sstream>
#include <iomanip>
#define rep(i,n) for(int i=0;i<n;i++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define ll long long
#define INF 1000000001
#define mod 1000000007
#define sort(s) sort(s.begin(), s.end());
#define reverse(s) reverse(s.begin(), s.end());
int dx[4] = { 0,1,0,-1 };
int dy[4] = { 1,0,-1,0 };
using namespace std;
int POW(int x, int y) { return int(pow(double(x), double(y))); }
double log(double a, double b) { return log(b) / log(a); }

unsigned int randxor()
{
	static unsigned int x = 123456789, y = 362436069, z = 521288629, w = 88675123;
	unsigned int t;
	t = (x ^ (x << 11)); x = y; y = z; z = w; return(w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)));
}



int main() {
	int n;
	cin >> n;
	vector<int> a(n);
	rep(i, n) {
		cin >> a[i];
	}
	sort(a);
	int c=0;
	int x;
	vector<int> b;
	rep(i, n) {
		if (i == 0) {
			x = a[i];
			c++;
		}
		else {
			if (x == a[i]) {
				c++;
			}
			else {
				if (c > 1) {
					rep(j, c - 1) {
						b.push_back(x);
					}
				}

				c = 1;
				x = a[i];
			}
		}
	}
	if (c > 1) {
		rep(j, c - 1) {
			b.push_back(x);
		}
	}
	int bs = b.size();
	if (bs == 0) {
		cout << n << endl;
		return 0;
	}
	if (bs % 2 == 1) {
		cout << n - bs - 1 << endl;
	}
	else {
		cout << n - bs << endl;
	}
}

Submission Info

Judge Result