Advertisement
MohamedAbdel3al

C. Counting Elements

May 5th, 2022
86
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 2.22 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2.  
  3. using namespace std;
  4.  
  5. #define cin(vec) for(auto& i : vec) cin >> i
  6. #define cin_2d(vec, n, m) for(int i = 0; i < n; i++) for(int j = 0; j < m && cin >> vec[i][j]; j++);
  7. #define cout(vec) for(auto& i : vec) cout << i << " "; cout << "\n";
  8. #define cout_2d(vec, n, m) for(int i = 0; i < n; i++, cout << "\n") for(int j = 0; j < m && cout << vec[i][j] << " "; j++);
  9. #define cout_map(mp) for(auto& [f, s] : mp) cout << f << "  " << s << "\n";
  10. #define Time cerr << "Time Taken: " << (float)clock() / CLOCKS_PER_SEC << " Secs" << "\n";
  11. #define fixed(n) fixed << setprecision(n)
  12. //#define ceil(n, m) (((n) / (m)) + ((n) % (m) ? 1 : 0))
  13. #define fill(vec, value) memset(vec, value, sizeof(vec));
  14. #define Num_of_Digits(n) ((int)log10(n)+1)
  15. #define all(vec) vec.begin(),vec.end()
  16. #define rall(vec) vec.rbegin(),vec.rend()
  17. #define sz(x) int(x.size())
  18. #define TC int t; cin >> t;   while(t--)
  19. #define fi first
  20. #define se second
  21. #define Pair pair < int, int >
  22. #define ll long long
  23. #define ull unsigned long long
  24. #define Mod  1'000'000'007
  25. #define OO 2'000'000'000
  26. #define EPS 1e-9
  27. #define PI acos(-1)
  28. #define imin INT_MIN
  29. #define imax INT_MAX
  30. #define getline(s) getline(cin >> ws , s)
  31. #define pb(x) push_back(x)
  32. #define to_decimal(bin) stoi(bin, nullptr, 2)
  33. #define mod_combine(a, b, m) (((a % m) * (b % m)) % m)
  34. #define debug(x) cout << #x << ": " << (x) << "\n";
  35.  
  36.  
  37. void Code_Crush(){
  38.     ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
  39. #ifndef ONLINE_JUDGE
  40.     freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);  
  41. #endif
  42.     Time
  43. }
  44.  
  45. void Solve (){  
  46.     int n;
  47.     cin >> n;
  48.     vector < int > nums(n);
  49.     for(auto& i : nums) cin >> i;
  50.     sort(all(nums));
  51.     map < int, int > freq;
  52.     map < int, bool > check;
  53.     for(int i = 0; i < n; i++)
  54.         freq[nums[i]]++;  
  55.     for(int i = 0; i < n - 1; i++)
  56.         if(nums[i + 1] - nums[i] == 1) check[nums[i]] = true;
  57.     int cnt = 0;
  58.     for(int i = 0; i < n - 1; i++){
  59.         if(check[nums[i]] && nums[i] != nums[i + 1]) cnt += freq[nums[i]];
  60.     }
  61.     cout << cnt;
  62. }
  63.  
  64.  
  65. int main (){
  66.     Code_Crush();
  67.     int t = 1;
  68.     //cin >> t;
  69.     while(t--){
  70.         Solve();
  71.     }
  72.     return 0;
  73. }  
  74.  
  75.  
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement