Karen and Coffee CodeForces - 816B （差分数组+预处理前缀和）

Posted 2021-02-06 qieqiemin

tags:

篇首语：本文由小常识网(cha138.com)小编为大家整理，主要介绍了Karen and Coffee CodeForces - 816B （差分数组+预处理前缀和）相关的知识，希望对你有一定的参考价值。

To stay woke and attentive during classes, Karen needs some coffee!

$技术分享图片$

Karen, a coffee aficionado, wants to know the optimal temperature for brewing the perfect cup of coffee. Indeed, she has spent some time reading several recipe books, including the universally acclaimed "The Art of the Covfefe".

She knows n coffee recipes. The i-th recipe suggests that coffee should be brewed between l_i and r_i degrees, inclusive, to achieve the optimal taste.

Karen thinks that a temperature is admissible if at least k recipes recommend it.

Karen has a rather fickle mind, and so she asks q questions. In each question, given that she only wants to prepare coffee with a temperature between a and b, inclusive, can you tell her how many admissible integer temperatures fall within the range?

Input

The first line of input contains three integers, n, k (1 ≤ k ≤ n ≤ 200000), and q (1 ≤ q ≤ 200000), the number of recipes, the minimum number of recipes a certain temperature must be recommended by to be admissible, and the number of questions Karen has, respectively.

The next n lines describe the recipes. Specifically, the i-th line among these contains two integers l_i and r_i (1 ≤ l_i ≤ r_i ≤ 200000), describing that the i-th recipe suggests that the coffee be brewed between l_i and r_i degrees, inclusive.

The next q lines describe the questions. Each of these lines contains a and b, (1 ≤ a ≤ b ≤ 200000), describing that she wants to know the number of admissible integer temperatures between a and b degrees, inclusive.

Output

For each question, output a single integer on a line by itself, the number of admissible integer temperatures between a and b degrees, inclusive.

Examples

Input

Output

Input

2 1 1
1 1
200000 200000
90 100

Output

Note

In the first test case, Karen knows 3 recipes.

The first one recommends brewing the coffee between 91 and 94 degrees, inclusive.
The second one recommends brewing the coffee between 92 and 97 degrees, inclusive.
The third one recommends brewing the coffee between 97 and 99 degrees, inclusive.

A temperature is admissible if at least 2 recipes recommend it.

She asks 4 questions.

In her first question, she wants to know the number of admissible integer temperatures between 92 and 94 degrees, inclusive. There are 3: 92, 93 and 94degrees are all admissible.

In her second question, she wants to know the number of admissible integer temperatures between 93 and 97 degrees, inclusive. There are 3: 93, 94 and 97degrees are all admissible.

In her third question, she wants to know the number of admissible integer temperatures between 95 and 96 degrees, inclusive. There are none.

In her final question, she wants to know the number of admissible integer temperatures between 90 and 100 degrees, inclusive. There are 4: 92, 93, 94 and 97degrees are all admissible.

In the second test case, Karen knows 2 recipes.

The first one, "wikiHow to make Cold Brew Coffee", recommends brewing the coffee at exactly 1 degree.
The second one, "What good is coffee that isn‘t brewed at at least 36.3306 times the temperature of the surface of the sun?", recommends brewing the coffee at exactly 200000 degrees.

A temperature is admissible if at least 1 recipe recommends it.

In her first and only question, she wants to know the number of admissible integer temperatures that are actually reasonable. There are none.

思路：

先用差分数组处理下每一个温度有几个人能适应

然后扫一边差分数组的前缀和数组，值大于等于k的给数组a赋值为1

然后再求一下数组a的前缀和，

每一个咨询就可以O（1）求求出。

细节见代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <vector>
#define sz(a) int(a.size())
#define all(a) a.begin(), a.end()
#define rep(i,x,n) for(int i=x;i<n;i++)
#define repd(i,x,n) for(int i=x;i<=n;i++)
#define pii pair<int,int>
#define pll pair<long long ,long long>
#define gbtb ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define MS0(X) memset((X), 0, sizeof((X)))
#define MSC0(X) memset((X), ‘‘, sizeof((X)))
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define eps 1e-6
#define gg(x) getInt(&x)
#define db(x) cout<<"== [ "<<x<<" ] =="<<endl;
using namespace std;
typedef long long ll;
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
ll powmod(ll a,ll b,ll MOD){ll ans=1;while(b){if(b%2)ans=ans*a%MOD;a=a*a%MOD;b/=2;}return ans;}
inline void getInt(int* p);
const int maxn=1000010;
const int inf=0x3f3f3f3f;
/*** TEMPLATE CODE * * STARTS HERE ***/
int n,q,k;
int f[maxn];
int sum[maxn];
int a[maxn];
int asum[maxn];
int l,r;
int main()
{
    gg(n);
    gg(k);
    gg(q);
    repd(i,1,n)
    {
        gg(l),gg(r);
        f[l]++;
        f[r+1]--;
    }
    repd(i,1,maxn-5)
    {
        sum[i]=sum[i-1]+f[i];
    }
    repd(i,1,maxn-5)
    {
        if(sum[i]>=k)
        {
            a[i]++;
        }
        asum[i]=asum[i-1]+a[i];
    }
    repd(i,1,q)
    {
        int ans=0;
        gg(l),gg(r);
        ans=asum[r]-asum[l-1];
        printf("%d
", ans);
    }
    return 0;
}

inline void getInt(int* p) {
    char ch;
    do {
        ch = getchar();
    } while (ch == ‘ ‘ || ch == ‘
‘);
    if (ch == ‘-‘) {
        *p = -(getchar() - ‘0‘);
        while ((ch = getchar()) >= ‘0‘ && ch <= ‘9‘) {
            *p = *p * 10 - ch + ‘0‘;
        }
    }
    else {
        *p = ch - ‘0‘;
        while ((ch = getchar()) >= ‘0‘ && ch <= ‘9‘) {
            *p = *p * 10 + ch - ‘0‘;
        }
    }
}

以上是关于Karen and Coffee CodeForces - 816B （差分数组+预处理前缀和）的主要内容，如果未能解决你的问题，请参考以下文章

CodeForces - 816B Karen and Coffee (线段树的区间插入+单点查询)

CF816B Karen and Coffee

#419（div2) B. Karen and Coffee

Codeforces Round #419 (Div. 2)B. Karen and Coffee

Codeforces 815 C Karen and Supermarket

Codeforces Round #460 D. Karen and Cards