fork download
copy 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int              long long int
  4. #define double           long double
  5. #define print(a)         for(auto x : a) cout << x << " "; cout << endl
  6.  
  7.  
  8. const int M = 1000000007;
  9. const int N = 3e5+9;
  10. const int INF = 2e9+1;
  11. const int LINF = 2000000000000000001;
  12.  
  13. inline int power(int a, int b, int mod=M) {
  14.     int x = 1;
  15.     a %= mod;
  16.     while (b) {
  17.         if (b & 1) x = (x * a) % mod; 
  18.         a = (a * a) % mod;
  19.         b >>= 1;
  20.     }
  21.     return x;
  22. }
  23.  
  24.  
  25. //_ ***************************** START Below *******************************
  26.  
  27. // 4
  28. // 4 1
  29. // 1 1 1 2
  30. // 8 1
  31. // 1 1 1 2 2 2 1 2
  32. // 2 0
  33. // 1 2
  34. // 10 0
  35. // 1 1 2 2 3 3 3 3 3 3
  36.  
  37.  
  38. vector<int> a;
  39.  
  40. int consistency(int n, int k){
  41.  
  42. 	unordered_map<int,int> mp;
  43.  
  44. 	for(int i=0; i<n; i++){
  45. 		mp[a[i]]++;
  46. 	}
  47.  
  48. 	int ans = 0;
  49.  
  50. 	for(auto& t : mp){
  51. 		int x = t.first;
  52. 		int ct = t.second;
  53.  
  54. 		if(k==0){
  55. 			if(ct >= 2) ans++;
  56. 		}
  57. 		else{
  58. 			if(mp.count(x+k)){
  59. 				ans++;
  60. 			}
  61. 		}
  62. 	}
  63.  
  64.     return ans;
  65. }
  66.  
  67.  
  68.  
  69.  
  70.  
  71.  
  72.  
  73.  
  74.  
  75.  
  76.  
  77.  
  78.  
  79.  
  80.  
  81. int practice(int n, int k){
  82.  
  83.  
  84. }
  85.  
  86.  
  87.  
  88.  
  89.  
  90. void solve() {
  91.  
  92.     int n, k;
  93.     cin>> n >> k;
  94.  
  95.     a.resize(n);
  96.     for(int i=0; i<n; i++) cin >> a[i];
  97.  
  98.     cout << consistency(n, k) << endl;
  99.  
  100.     // cout << consistency(n, k) << " " << practice(n, k) << endl;
  101.  
  102.  
  103. }
  104.  
  105.  
  106.  
  107.  
  108.  
  109. int32_t main() {
  110.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  111.  
  112.     int t = 1;
  113.     cin >> t;
  114.     while (t--) {
  115.         solve();
  116.     }
  117.  
  118.     return 0;
  119. }
Success #stdin #stdout 0.01s 5288KB
comments (?)
stdin
copy 
4
4 1
1 1 1 2
8 1
1 1 1 2 2 2 1 2
2 0
1 2
10 0
1 1 2 2 3 3 3 3 3 3
stdout
copy 
1
1
0
3
https://ideone.com/1JTUwK
language:
C++14 (gcc 8.3)
created:
2 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!