Submission #1679444
Source Code Expand
// :) #include <bits/stdc++.h> using namespace std; typedef long long ll; const int MAXN = 1e5 + 5; int d[MAXN]; int main () { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n; cin >> n; for (int i = 0; i < n; i++) { int x; cin >> x; d[x]++; } int opnum = 0; int k = 0; for (int i = 0; i < MAXN; i++) { if (d[i] <= 1) continue; opnum += (d[i]-1)/2; if (d[i] % 2 == 0) k++; } opnum += k/2 + k%2; cout << n - opnum*2 << "\n"; }
Submission Info
Submission Time | |
---|---|
Task | D - Card Eater |
User | vjudge1 |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 466 Byte |
Status | AC |
Exec Time | 9 ms |
Memory | 640 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 | 2 ms | 256 KB |
01.txt | AC | 2 ms | 384 KB |
02.txt | AC | 2 ms | 384 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 | 9 ms | 512 KB |
07.txt | AC | 9 ms | 512 KB |
08.txt | AC | 9 ms | 640 KB |
09.txt | AC | 9 ms | 512 KB |
10.txt | AC | 9 ms | 384 KB |
11.txt | AC | 9 ms | 640 KB |
12.txt | AC | 9 ms | 512 KB |
13.txt | AC | 9 ms | 640 KB |
14.txt | AC | 9 ms | 640 KB |
15.txt | AC | 9 ms | 256 KB |