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