fork download
  1. #include <bits/stdc++.h>
  2. #include <chrono>
  3. using namespace std;
  4. using namespace chrono;
  5. // "AJEET JAIN"----"JAI JINENDRA"
  6. /* "णमो अरिहंताणं",
  7.   "णमो सिद्धाणं",
  8.   "णमो आयरियाणं",
  9.   "णमो उवज्झायाणं",
  10.   "णमो लोए सव्वसाहूणं",
  11.   "",
  12.   "एसो पंच नमोक्कारो, सव्व पावप्पणासणो",
  13.   "मंगलाणं च सव्वेसिं, पडमं हवै मंगलं", */
  14.  
  15.  
  16. // Aliases to op
  17. using ll = long long;
  18. using ull = unsigned long long;
  19. using ld = double;
  20. using vll = vector<ll>;
  21.  
  22.  
  23. // Constants
  24. constexpr ll INF = 4e18;
  25. constexpr ld EPS = 1e-9;
  26. constexpr ll MOD = 1e9 + 7;
  27.  
  28.  
  29.  
  30. // Macros
  31. #define F first
  32. #define S second
  33. #define all(x) begin(x), end(x)
  34. #define allr(x) rbegin(x), rend(x)
  35. #define py cout<<"YES\n";
  36. #define pn cout<<"NO\n";
  37. #define forn(i,n) for(int i=0;i<n;i++)
  38. #define for1(i,n) for(int i=1;i<=n;i++)
  39.  
  40. // #define insert push_back
  41. #define pb push_back
  42. #define MP make_pair
  43. #define endl '\n'
  44.  
  45. /*
  46.   remove substring or subarray ---> try to think about sliding w
  47.  
  48.   */
  49.  
  50. /*
  51.  
  52.   Golden Rule
  53.  
  54.   1) problem is easy
  55.   2) proofs is easy
  56.   3) implementation is easy
  57.  
  58.   /*
  59.   ROUGH --
  60.  
  61.   */
  62.  
  63. void AJNJ(){
  64. ll n, k1 , k2;
  65. cin>>n>>k1>>k2;
  66.  
  67. vector<ll> b(n);
  68. forn(i , n){
  69. cin >> b[i];
  70. }
  71. ll cnt = 0;
  72.  
  73. for(int j = 1 ; j < n - 1 ; j++){
  74. ll i = j - 1 , cnt1 = 0;
  75. while(i >= 0){
  76. if(b[i] + b[j] > k1){
  77. ++cnt1;
  78. }
  79. i--;
  80. }
  81. ll k = j + 1 , cnt2 = 0 , l = n - 1;
  82. while(k < l){
  83. if(b[k] + b[l] > k2){
  84. cnt2 += abs(k - l);
  85. l--;
  86. }
  87. else{
  88. k++;
  89. }
  90. }
  91. cnt += cnt1*cnt2;
  92. }
  93. cout << cnt << endl;
  94. }
  95.  
  96.  
  97. int main(){
  98. ios::sync_with_stdio(0);
  99. cin.tie(0);
  100. cout.tie(0);
  101. int T = 1;
  102. cin>>T;
  103. auto start1 = high_resolution_clock::now();
  104. while(T--){
  105. AJNJ();
  106. }
  107. auto stop1 = high_resolution_clock::now();
  108. auto duration = duration_cast<microseconds>(stop1 - start1);
  109. cerr << "Time: " << duration . count() / 1000 << " ms" << endl;
  110.  
  111. return 0;
  112. }
Success #stdin #stdout #stderr 0.01s 5324KB
stdin
Standard input is empty
stdout
0
stderr
Time: 0 ms