CF816B-Karen and Coffee

B. Karen and Coffee

time limit per test2.5 seconds 
memory limit per test512 megabytes 
inputstandard input 
outputstandard output 
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 li and ri 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 li and ri (1 ≤ li ≤ ri ≤ 200000), describing that the i-th recipe suggests that the coffee be brewed between li and ri 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 
3 2 4 
91 94 
92 97 
97 99 
92 94 
93 97 
95 96 
90 100 
output 
3 
3 
0 
4 
input 
2 1 1 
1 1 
200000 200000 
90 100 
output 

0

题意： 给出n个配料区间，q个查询区间，问每次查询时，该查询区间内有多少个点至少被k个配料区间覆盖。

思路： 区间标记和查询， 用了一个树状数组优化，跑了200ms。

上代码：

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
int ans[200010];
int tmp[200010];
int getf(int x)
{
    return x&(-x);
}
void add_ans(int x,int d)
{
    while(x<200010)
    {
        ans[x] += d;
        x += getf(x);
    }
    return ;
}
int get_sum_ans(int x)
{
    int sum = 0;
    while(x>0)
    {
        sum += ans[x];
        x -= getf(x);
    }
    return sum;
}
int main()
{

  int n,k,q;
  int a,b;
  while(scanf("%d%d%d", &n,&k,&q) != EOF)
  {
  memset(ans, 0,sizeof(ans));
  memset(tmp, 0,sizeof(tmp));

  for(int i=1; i<=n; i++)
  {
      scanf("%d %d",&a,&b);
      add_ans(a,1);
      add_ans(b+1,-1);
  }
  for(int i=1; i<=200005; i++)
  {
      int p = get_sum_ans(i);
      if(p>=k) tmp[i] = tmp[i-1]+1;
      else tmp[i] = tmp[i-1];
  }
  for(int i=1; i<=q; i++)
  {
      scanf("%d%d",&a,&b);
      printf("%d\n",tmp[b]-tmp[a-1]);
  }


  }
   return 0;
}

水波。