fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int long long int
  4. #define double long double
  5. inline int power(int a, int b) {
  6. int x = 1;
  7. while (b) {
  8. if (b & 1) x *= a;
  9. a *= a;
  10. b >>= 1;
  11. }
  12. return x;
  13. }
  14.  
  15.  
  16. const int M = 1000000007;
  17. const int N = 3e5+9;
  18. const int INF = 2e9+1;
  19. const int LINF = 2000000000000000001;
  20.  
  21. //_ ***************************** START Below *******************************
  22.  
  23.  
  24.  
  25. vector<int> a;
  26. int consistency(int n, int k) {
  27.  
  28. unordered_map<int,int> mp;
  29. int ans = 0;
  30. for(int i=0; i<n; i++){
  31. if(mp.count(a[i] - k)){
  32. ans += mp[a[i]-k];
  33. }
  34. if(k!=0 && mp.count(a[i] + k)){
  35. ans += mp[a[i]+k];
  36. }
  37. mp[a[i]]++;
  38. }
  39.  
  40. return ans;
  41. }
  42.  
  43.  
  44.  
  45.  
  46.  
  47.  
  48.  
  49.  
  50.  
  51.  
  52.  
  53.  
  54.  
  55.  
  56.  
  57.  
  58.  
  59. int practice(int n, int k) {
  60.  
  61. int ans = 0;
  62.  
  63.  
  64.  
  65. return ans;
  66.  
  67. }
  68.  
  69.  
  70.  
  71. void solve() {
  72.  
  73. int n, k;
  74. cin >> n >> k;
  75. a.resize(n);
  76. for(int i=0; i<n; i++) cin >> a[i];
  77.  
  78. cout << consistency(n, k) << endl ;
  79.  
  80.  
  81. // cout << consistency(n, k) << " -> " << practice(n, k) << endl ;
  82.  
  83. }
  84.  
  85.  
  86.  
  87.  
  88.  
  89. int32_t main() {
  90. ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  91.  
  92. int t = 1;
  93. while (t--) {
  94. solve();
  95. }
  96.  
  97. return 0;
  98. }
Success #stdin #stdout 0s 5320KB
stdin
5 2
1 5 3 4 2
stdout
3