CodeForces
来源:互联网 发布:手机查淘宝消费总金额 编辑:程序博客网 时间:2024/05/21 07:11
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?
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.
For each question, output a single integer on a line by itself, the number of admissible integer temperatures between a and b degrees, inclusive.
3 2 491 9492 9797 9992 9493 9795 9690 100
3304
2 1 11 1200000 20000090 100
0
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 94 degrees 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 97 degrees 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 97 degrees 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次的数的个数
前缀和。
创建一个初始全为0的数组a,所给条件的区间[l,r],另a[l]++,a[r+1]--,然后对数组a求前缀和。
创建一个初始全为0的数组sum,如果第i位前缀和大于等于k,sum[i++].对sum求前缀和。
若询问[l,r]中满足条件的个数,答案即为sum[r]-sum[l-1];
#include<iostream>#include<stdio.h>#include<stdlib.h>#define maxn 200001using namespace std;int main(){ int n,k,q,a[maxn],sum[maxn]; while(scanf("%d%d%d",&n,&k,&q)!=EOF) { fill(a,a+maxn,0); fill(sum,sum+maxn,0); int l,r,i; for(i=0;i<n;i++) { scanf("%d%d",&l,&r); a[l]++; a[r+1]--; } for(i=1;i<maxn;i++) { a[i]=a[i-1]+a[i]; if(a[i]>=k) sum[i]++; } for(i=1;i<maxn;i++) { sum[i]=sum[i-1]+sum[i]; } while(q--) { int ans=0; scanf("%d%d",&l,&r); printf("%d\n",sum[r]-sum[l-1]); } }}
- codeforces~~~
- Codeforces
- codeforces
- Codeforces
- codeforces
- codeforces
- Codeforces
- Codeforces
- CodeForces
- CodeForces
- CodeForces
- CodeForces
- CodeForces
- Codeforces
- Codeforces
- Codeforces
- Codeforces
- Codeforces
- 达内课程-面向对象之构造方法和重载
- Java 类图(UML)
- 复习一下快速排序(带非递归)
- Vim光标移动命令
- Java编程开发学习路线图(附所有免费课程+在线自测)
- CodeForces
- 栈ADT
- UVa815--Flooded--洪水
- bzoj4724 [POI2017]Podzielno 数论
- 贫血,充血模型的解释以及一些经验
- 欢迎使用CSDN-markdown编辑器
- Bagging和Boosting 概念及区别
- 确保非局部静态对象使用前被初始化
- scala中_的作用