Submission #3444413
Source Code Expand
#include <iostream> #include <cstdio> #include <vector> #include <algorithm> #include <limits.h> #include <queue> #include <map> using namespace std; typedef long long ll; typedef unsigned long long ull; #define REP(i, n) for(int i=0; i<n; i++) map<int, int> A; int main(){ int N; cin >> N; REP(i,N){ int a; cin >> a; if(A[a] <= 1){ A[a]++; } else if(A[a] == 2){ A[a] = 1; } } int s = 0; int d = 0; for(auto&& a : A){ if(a.second == 1) s++; else d++; } //printf("s:%d\td:%d\n",s,d); while(d > 1){ d -= 2; s += 2; } //if(d == 1){ // d--; //} int ans = s; cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Card Eater |
User | kurakura |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 813 Byte |
Status | AC |
Exec Time | 78 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 | 41 ms | 256 KB |
07.txt | AC | 40 ms | 256 KB |
08.txt | AC | 61 ms | 640 KB |
09.txt | AC | 40 ms | 256 KB |
10.txt | AC | 40 ms | 256 KB |
11.txt | AC | 59 ms | 640 KB |
12.txt | AC | 41 ms | 256 KB |
13.txt | AC | 54 ms | 384 KB |
14.txt | AC | 78 ms | 4992 KB |
15.txt | AC | 37 ms | 256 KB |