fork download
  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.  
  28.  
  29.  
  30. vector<int> a;
  31.  
  32. int consistency(int n, int k){
  33.  
  34. if(k&1) return 0;
  35.  
  36. int val = k/2;
  37.  
  38. int ct1 = 0; //* count(<val)
  39. int ct2 = 0; //* count(< (-val))
  40.  
  41. for(int i=0; i<n; i++){
  42. if( abs(a[i]) < val ) ct1++;
  43. if(abs(a[i]) == val) ct2++;
  44. }
  45.  
  46. int ans = ct1*ct2;
  47. ans += ct2*(ct2-1)/2;
  48.  
  49. return ans;
  50.  
  51. }
  52.  
  53.  
  54.  
  55.  
  56.  
  57.  
  58.  
  59.  
  60.  
  61.  
  62.  
  63.  
  64.  
  65.  
  66.  
  67. int practice(int n, int k){
  68.  
  69.  
  70. return 0;
  71. }
  72.  
  73.  
  74.  
  75.  
  76.  
  77. void solve() {
  78.  
  79. int n, k;
  80. cin>> n >> k;
  81.  
  82. a.resize(n);
  83. for(int i=0; i<n; i++) cin >> a[i];
  84.  
  85. cout << consistency(n, k) << endl;
  86.  
  87.  
  88. }
  89.  
  90.  
  91.  
  92.  
  93.  
  94. int32_t main() {
  95. ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  96.  
  97. int t = 1;
  98. cin >> t;
  99. while (t--) {
  100. solve();
  101. }
  102.  
  103. return 0;
  104. }
Success #stdin #stdout 0.01s 5268KB
stdin
3
4 2
1 3 2 0
4 4
1 4 -1 2
15 10
-12 -10 -4 -5 -5 -1 2 3 5 5 5 5 8 10 13
stdout
1
2
39