Author : Dipu Kumar Mohanto
CSE, Batch - 6
BRUR.
Problem Statement : 1089 – Points in Segments (II)
Source : Light Online Judge
Category : Data Structure
Algorithm : Implicit Segment Tree
Verdict : Accepted
#include "bits/stdc++.h"
#include "ext/pb_ds/assoc_container.hpp"
#include "ext/pb_ds/tree_policy.hpp"
using namespace std;
using namespace __gnu_pbds;
#define FI freopen("in.txt", "r", stdin)
#define FO freopen("out.txt", "w", stdout)
#define FAST ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define FOR(i, n) for (int i = 1; i <= n; i++)
#define For(i, n) for (int i = 0; i < n; i++)
#define ROF(i, n) for (int i = n; i >= 1; i--)
#define Rof(i, n) for (int i = n-1; i >= 0; i--)
#define FORI(i, n) for (auto i : n)
#define ll long long
#define ull unsigned long long
#define vi vector <int>
#define vl vector <ll>
#define pii pair <int, int>
#define pll pair <ll, ll>
#define mk make_pair
#define ff first
#define ss second
#define eb emplace_back
#define em emplace
#define pb push_back
#define ppb pop_back
#define All(a) a.begin(), a.end()
#define memo(a, b) memset(a, b, sizeof a)
#define Sort(a) sort(All(a))
#define ED(a) Sort(a), a.erase(unique(All(a)), a.end())
#define rev(a) reverse(All(a))
#define sz(a) (int)a.size()
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define maxAll(a) *max_element(All(a))
#define minAll(a) *min_element(All(a))
#define allUpper(a) transform(All(a), a.begin(), :: toupper)
#define allLower(a) transform(All(a), a.begin(), :: tolower)
#define endl '\n'
#define nl puts("")
#define ub upper_bound
#define lb lower_bound
#define Exp exp(1.0)
#define PIE 2*acos(0.0)
#define Sin(a) sin(((a)*PIE)/180.0)
#define EPS 1e-9
// int dr[] = {1, -1, 0, 0}; // 4 Direction
// int dc[] = {0, 0, 1, -1};
// int dr[] = {0, 0, 1, -1, 1, 1, -1, -1}; // 8 Direction
// int dc[] = {1, -1, 0, 0, 1, -1, 1, -1};
// int dr[] = {-1, 1, -2, -2, -1, 1, 2, 2}; // knight Moves
// int dc[] = {-2, -2, -1, 1, 2, 2, 1, -1};
inline int setbit(int mask, int pos) { return mask |= (1 << pos); }
inline int resetbit(int mask, int pos) { return mask &= ~(1 << pos); }
inline int togglebit(int mask, int pos) { return mask ^= (1 << pos); }
inline bool checkbit(int mask, int pos) { return (bool)(mask & (1 << pos)); }
#define popcount(mask) __builtin_popcount(mask) // count set bit
#define popcountLL(mask) __builtin_popcountll(mask) // for long long
inline int read() { int a; scanf("%d", &a); return a; }
inline ll readLL() { ll a; scanf("%lld", &a); return a; }
inline double readDD() { double a; scanf("%lf", &a); return a; }
template <typename T> string toString(T num) { stringstream ss; ss << num; return ss.str(); }
int toInt(string s) { int num; istringstream iss(s); iss >> num; return num; }
ll toLLong(string s) { ll num; istringstream iss(s); iss >> num; return num; }
#define inf 123456789
#define mod 1000000007
static const int maxn = 1e5 + 5;
static const int logn = 18;
struct node
{
ll sum;
node *lft, *rgt;
node(ll val = 0)
{
this->sum = val;
this->lft = this->rgt = nullptr;
}
~node()
{
delete lft;
delete rgt;
}
};
typedef node* pnode;
inline void add(pnode root, int a, int b, int i, int j, ll val)
{
if (a > b || a > j || b < i) return;
if (a >= i && b <= j)
{
root->sum += val;
return;
}
int mid = (a + b) >> 1;
if (root->lft == nullptr) root->lft = new node();
if (root->rgt == nullptr) root->rgt = new node();
add(root->lft, a, mid, i, j, val);
add(root->rgt, mid+1, b, i, j, val);
}
inline ll get(pnode root, int a, int b, int pos)
{
if (root == nullptr || a > b || a > pos || b < pos) return 0;
if (a == b) return root->sum;
int mid = (a + b) >> 1;
return root->sum + get(root->lft, a, mid, pos) + get(root->rgt, mid+1, b, pos);
}
int main()
{
// FI;
int tc = read();
FOR(tcase, tc)
{
pnode root = new node();
int n = read();
int q = read();
int N = 1e8 + 1;
FOR(i, n)
{
int l = read();
int r = read();
if (l > r) swap(l, r);
add(root, 0, N, l, r, 1);
}
printf("Case %d:\n", tcase);
while (q--)
{
int pos = read();
printf("%d\n", get(root, 0, N, pos));
}
delete root;
}
}
