Submission #1243562
Source Code Expand
#include "bits/stdc++.h" #include <regex> using namespace std; #ifndef _DEBUG #define main_ main #endif #define FOR(i,s,e) for (int i = int(s); i != int(e); i++) #define INF (INT_MAX/2) #define EPS (1.0e-8) #define LINF (LONG_MAX/2) typedef long long ll; typedef vector<int> vi; typedef vector<vi> vvi; template <typename T> using keyVal = pair<string, T>; template<typename T> bool val_greater(const keyVal<T>& left, const keyVal<T>& right) { return left.second > right.second; } int main_() { int N; cin >> N; vi A(N); FOR(i,0,N) { cin >> A[i]; } int cnt[100001] = {0}; FOR(i, 0, N) { cnt[A[i]]++; } int ans = 0; for (int n : cnt) { if (n > 0) ans += n - 1; } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Bumble Bee |
User | apprec |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 770 Byte |
Status | AC |
Exec Time | 31 ms |
Memory | 1152 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt |
All | sample_01.txt, sample_02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask1_26.txt, subtask1_27.txt, subtask1_28.txt, subtask1_29.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 1 ms | 640 KB |
sample_02.txt | AC | 1 ms | 640 KB |
subtask1_01.txt | AC | 24 ms | 896 KB |
subtask1_02.txt | AC | 2 ms | 640 KB |
subtask1_03.txt | AC | 4 ms | 640 KB |
subtask1_04.txt | AC | 29 ms | 1024 KB |
subtask1_05.txt | AC | 16 ms | 896 KB |
subtask1_06.txt | AC | 23 ms | 896 KB |
subtask1_07.txt | AC | 27 ms | 1024 KB |
subtask1_08.txt | AC | 11 ms | 768 KB |
subtask1_09.txt | AC | 22 ms | 896 KB |
subtask1_10.txt | AC | 15 ms | 768 KB |
subtask1_11.txt | AC | 21 ms | 896 KB |
subtask1_12.txt | AC | 5 ms | 640 KB |
subtask1_13.txt | AC | 20 ms | 896 KB |
subtask1_14.txt | AC | 20 ms | 896 KB |
subtask1_15.txt | AC | 29 ms | 1024 KB |
subtask1_16.txt | AC | 31 ms | 1024 KB |
subtask1_17.txt | AC | 29 ms | 1024 KB |
subtask1_18.txt | AC | 29 ms | 1152 KB |
subtask1_19.txt | AC | 29 ms | 1024 KB |
subtask1_20.txt | AC | 29 ms | 1024 KB |
subtask1_21.txt | AC | 29 ms | 1024 KB |
subtask1_22.txt | AC | 29 ms | 1024 KB |
subtask1_23.txt | AC | 29 ms | 1024 KB |
subtask1_24.txt | AC | 29 ms | 1024 KB |
subtask1_25.txt | AC | 29 ms | 1024 KB |
subtask1_26.txt | AC | 29 ms | 1024 KB |
subtask1_27.txt | AC | 29 ms | 1024 KB |
subtask1_28.txt | AC | 29 ms | 1024 KB |
subtask1_29.txt | AC | 29 ms | 1024 KB |