Submission #1875378
Source Code Expand
#include <iostream> #include <iomanip> // << fixed << setprecision(xxx) #include <algorithm> // do { } while ( next_permutation(A, A+xxx) ) ; #include <vector> #include <string> // to_string(nnn) // substr(m, n) // stoi(nnn) #include <complex> #include <tuple> // get<n>(xxx) #include <queue> #include <stack> #include <map> // if (M.find(key) != M.end()) { } #include <set> // S.insert(M); // if (S.find(key) != S.end()) { } // for (auto it=S.begin(); it != S.end(); it++) { } // auto it = S.lower_bound(M); #include <random> // random_device rd; mt19937 mt(rd()); #include <cctype> #include <cassert> #include <cmath> #include <cstdio> #include <cstdlib> // atoi(xxx) using namespace std; #define DEBUG 0 // change 0 -> 1 if we need debug. // insert #if<tab> by my emacs. #if DEBUG == 1 ... #end typedef long long ll; // const int dx[4] = {1, 0, -1, 0}; // const int dy[4] = {0, 1, 0, -1}; // const int C = 1e6+10; // const ll M = 1000000007; int main () { int N; cin >> N; int a[100010]; for (auto i = 0; i < N; ++i) { cin >> a[i]; } int cnt[100010]; fill(cnt, cnt+100010, 0); int ans = 0; for (auto i = 0; i < N; ++i) { if (a[i] > N) { ans++; } else { cnt[a[i]]++; } } for (auto i = 1; i <= N; ++i) { if (cnt[i] >= i) { ans += cnt[i] - i; } else { ans += cnt[i]; } } cout << ans << endl; }
Submission Info
Submission Time | |
---|---|
Task | C - Good Sequence |
User | kazunetakahashi |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 1436 Byte |
Status | AC |
Exec Time | 58 ms |
Memory | 1024 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 | 640 KB |
0_01.txt | AC | 1 ms | 640 KB |
0_02.txt | AC | 1 ms | 640 KB |
0_03.txt | AC | 1 ms | 640 KB |
0_04.txt | AC | 1 ms | 640 KB |
1_00.txt | AC | 1 ms | 640 KB |
1_01.txt | AC | 1 ms | 640 KB |
1_02.txt | AC | 19 ms | 1024 KB |
1_03.txt | AC | 37 ms | 1024 KB |
1_04.txt | AC | 41 ms | 1024 KB |
1_05.txt | AC | 42 ms | 1024 KB |
1_06.txt | AC | 58 ms | 1024 KB |
1_07.txt | AC | 36 ms | 1024 KB |
1_08.txt | AC | 40 ms | 1024 KB |
1_09.txt | AC | 43 ms | 1024 KB |
1_10.txt | AC | 46 ms | 1024 KB |
1_11.txt | AC | 49 ms | 1024 KB |
1_12.txt | AC | 51 ms | 1024 KB |