Submission #2011222
Source Code Expand
#include <math.h> #include <ctype.h> #include <bits/stdc++.h> using namespace std; #define FOR(i, a, n) for (int i = a; i < n; i++) #define REP(i, n) for(int i = 0; i < n; i++) struct omt{omt(){ios::sync_with_stdio(false);cin.tie(0);}}star; int main(){ int n; cin >> n; vector<int> A(n); for(auto &x : A) cin >> x; unordered_map<int, int> mp; REP(i, n){ mp[A[i]]++; } int cnt = 0; for(auto &x : mp){ if(x.first < x.second){ cnt += x.second - x.first; }else if(x.first > x.second){ cnt += x.second; } } cout << cnt << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Good Sequence |
User | tokizo |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 670 Byte |
Status | AC |
Exec Time | 27 ms |
Memory | 4644 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt |
All | 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_00.txt | AC | 1 ms | 256 KB |
0_01.txt | AC | 1 ms | 256 KB |
0_02.txt | AC | 1 ms | 256 KB |
0_03.txt | AC | 1 ms | 256 KB |
0_04.txt | AC | 1 ms | 256 KB |
1_00.txt | AC | 1 ms | 256 KB |
1_01.txt | AC | 1 ms | 256 KB |
1_02.txt | AC | 8 ms | 640 KB |
1_03.txt | AC | 10 ms | 640 KB |
1_04.txt | AC | 11 ms | 640 KB |
1_05.txt | AC | 11 ms | 640 KB |
1_06.txt | AC | 13 ms | 640 KB |
1_07.txt | AC | 11 ms | 640 KB |
1_08.txt | AC | 14 ms | 1536 KB |
1_09.txt | AC | 18 ms | 2316 KB |
1_10.txt | AC | 20 ms | 2956 KB |
1_11.txt | AC | 25 ms | 4132 KB |
1_12.txt | AC | 27 ms | 4644 KB |