Submission #1697337


Source Code Expand

#include "bits/stdc++.h"
#define rep(i,n) for(int i=0;i<n;i++)
#define ALL(v) (v).begin(),(v).end()
typedef long long LL;
const int INF = 1 << 25;
const LL MOD = 1000000007LL;
using namespace std;
typedef pair<int, int> P;
int cnt[100001];
int main() {
	int N;
	cin >> N;
	rep(i, N) {
		int A;
		cin >> A;
		cnt[A]++;
	}
	int odd = 0, even = 0;
	for (int i = 1; i <= 100000; i++) {
		if (cnt[i] == 0) continue;
		if (cnt[i] % 2 == 0) even++;
		else odd++;
	}
	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 589 Byte
Status AC
Exec Time 38 ms
Memory 640 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 4 ms 256 KB
03.txt AC 2 ms 512 KB
04.txt AC 2 ms 512 KB
05.txt AC 2 ms 512 KB
06.txt AC 36 ms 512 KB
07.txt AC 36 ms 512 KB
08.txt AC 37 ms 640 KB
09.txt AC 35 ms 384 KB
10.txt AC 37 ms 256 KB
11.txt AC 36 ms 640 KB
12.txt AC 36 ms 512 KB
13.txt AC 36 ms 640 KB
14.txt AC 38 ms 640 KB
15.txt AC 37 ms 256 KB