-
Notifications
You must be signed in to change notification settings - Fork 0
/
1583C C. Number of Pairs.cpp
95 lines (94 loc) · 2.92 KB
/
1583C C. Number of Pairs.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
/*
problem link: https://codeforces.com/contest/1538/problem/C
my solution on codeforces :https://codeforces.com/contest/1538/submission/175346396
problem name: C. Number of Pairs
status: accepted
author: lilian_steven or LELLO
*/
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <cmath>
#include <unordered_map>
#include <algorithm>
#include <iomanip>
#include <bitset>
#include <utility>
#include <string>
#include <cctype>
#include <iomanip>
#include <numeric> // for NTH
#define bye return;
#define ll long long
#define lli long long int
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) ((x).size())
#define ison(num, bit) (num & (1 << bit))
#define setoff(num, bit) (num ^= (1 << bit)) // iff (num &(1<<bit))
#define flipbit(num, bit) (num ^= (1 << bit))
#define setbit(num, bit) (num |= (1 << bit))
#define clearbit(num, bit) (num &= ~(1 << bit))
#define pop_count(num) __builtin_popcount(num)
#define Num_of_Digits(n) ((ll)log10(n) + 1)
#define ceill(n, m) (((n) / (m)) + ((n) % (m) ? 1 : 0))
#define lastOne(x) (__builtin_clzll(x))
#define Pi 3.14159265358979323846264
#define sin(a) sin((a)*PI/180)
#define cos(a) cos((a)*PI/180)
ll sgn(ll x){ if(x > 0) return 1; if(x < 0) return -1; return 0;}
ll gcd(ll a, ll b){if(b == 0) return a; return gcd(b, a%b);}
ll lcm(ll a, ll b){return a/gcd(a, b)*b;}
using namespace std;
void AC() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr); // or cin.tie(NULL)
cout.tie(nullptr); // or cout.tie(0)
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
// #endif
}
bool cmp(pair<int,int>&a, pair<int,int>&b){
if(a.first == b.first){
return a.second > b.second;
}
return a.first < b.first;
}
// int dx[] = {1,-1,0,0} , dy[] = {0,0,1,-1}; // 4 Direction
// int dx[] = {1,-1,0,0,1,1,-1,-1} , dy[] = {0,0,1,-1,1,-1,1,-1}; // 8 Direction
// int dx[] = {1,-1,1,-1,2,2,-2,-2} , dy[] = {2,2,-2,-2,1,-1,1,-1}; // Knight Direction
// int dx[] = {2,-2,1,1,-1,-1} , dy[] = {0,0,1,-1,1,-1}; // Hexagonal Direction
void LELLO()
{
ll n , l , r , ans(0); cin >> n >> l >> r ;
vector<ll> vc(n);
for (ll i = 0; i < n; i++)
{
cin >> vc[i];
}
sort(all(vc));
for (ll i = 0; i < n; i++)
{
// to get (l-a[j]) value , my lower limit in the range that satisfy the condition l <= vc[i]+vc[j] <= r
ll ind1 = lower_bound(vc.begin()+i+1 , vc.end() , l-vc[i])-vc.begin();
// to get (r-a[j]) value , my upper limit in the range that satisfy the condition l <= vc[i]+vc[j] <= r
ll ind2 = upper_bound(vc.begin()+i+1 , vc.end() , r-vc[i])-vc.begin();
// cout<< ind1 <<' '<<ind2 <<endl;
ans += ind2-ind1 ;
}
cout<< ans <<endl;
}
void driver(ll t)
{
while (t--) LELLO();
}
signed main()
{
AC();
// sieve();
ll test ; cin >> test ;
driver(test);
}