【CUGBACM15级BC第36场 B】hdu 5199 Gunner
来源:互联网 发布:直播软件apk下载 编辑:程序博客网 时间:2024/06/05 02:22
Gunner
Time Limit: 8000/4000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 1893 Accepted Submission(s): 852
Total Submission(s): 1893 Accepted Submission(s): 852
Problem Description
Long long ago, there is a gunner whose name is Jack. He likes to go hunting very much. One day he go to the grove. There aren birds and n trees. The i−th bird stands on the top of the i−th tree. The trees stand in straight line from left to the right. Every tree has its height. Jack stands on the left side of the left most tree. When Jack shots a bullet in height H to the right, the bird which stands in the tree with heightH will falls.
Jack will shot many times, he wants to know how many birds fall during each shot.
a bullet can hit many birds, as long as they stand on the top of the tree with height ofH .
Jack will shot many times, he wants to know how many birds fall during each shot.
a bullet can hit many birds, as long as they stand on the top of the tree with height of
Input
There are multiple test cases (about 5), every case givesn,m in the first line, n indicates there are n trees and n birds, m means Jack will shot m times.
In the second line, there aren numbers h [1],h[2],h [3],…,h [n] which describes the height of the trees.
In the third line, there are m numbersq [1],q [2],q[3],…,q[m] which describes the height of the Jack’s shots.
Please process to the end of file.
[Technical Specification]
1≤n,m≤1000000(106)
1≤h[i ],q[i ]≤1000000000(109)
All inputs are integers.
In the second line, there are
In the third line, there are m numbers
Please process to the end of file.
[Technical Specification]
All inputs are integers.
Output
For each q[i ] , output an integer in a single line indicates the number of birds Jack shot down.
Sample Input
4 31 2 3 41 1 4
Sample Output
101HintHuge input, fast IO is recommended.
题意:有n课树,每棵树上有一只鸟站在树的顶端,给出每棵树的高度
猎人依次从m个高度射出一颗子弹,问每次能射死几只鸟
分析:
map的应用
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>#include <cmath>#include <map>using namespace std;#define N 1000005map<int, int> ma;int main(){ int n, m, t; while (~scanf("%d %d", &n, &m)) { ma.clear(); for (int i = 1; i <= n; i++) { scanf("%d", &t); ma[t]++; } for (int i = 1; i <= m; i++) { scanf("%d", &t); printf("%d\n", ma[t]); ma[t] = 0; } } return 0;}
阅读全文
0 0
- 【CUGBACM15级BC第36场 B】hdu 5199 Gunner
- 【CUGBACM15级BC第15场 B】hdu 5082 Instruction
- 【CUGBACM15级BC第17场 B】hdu 5101 Select
- 【CUGBACM15级BC第20场 B】hdu 5124 lines
- 【CUGBACM15级BC第26场 B】hdu 5159 Card
- 【CUGBACM15级BC第28场 B】hdu 5167 Fibonacci
- HDU 5199/BC 36B Gunner
- 【CUGBACM15级BC第12场 B】hdu 5059 Help him
- 【CUGBACM15级BC第11场 B】hdu 5055 Bob and math problem
- 【CUGBACM15级BC第13场 B】hdu 5063 Operation the Sequence
- 【CUGBACM15级BC第18场 B】hdu 5105 Math Problem
- 【CUGBACM15级BC第22场 B】hdu 5143 NPY and arithmetic progression
- 【CUGBACM15级BC第23场 B】hdu 5147 Sequence II
- 【CUGBACM15级BC第25场 B】hdu 5155 Harry And Magic Box
- 【CUGBACM15级BC第27场 B】hdu 5163 Taking Bus
- 【CUGBACM15级BC第10场 B】hdu 5019 Revenge of GCD
- 【CUGBACM15级BC第8场 B】hdu 4990 Reading comprehension
- 【CUGBACM15级BC第7场 B】hdu 4986 Little Pony and Alohomora Part I
- java中package的浅解
- 奋斗群群赛9总结与心得
- Spark调优高级篇:数据倾斜调优
- 华为机试_字符串数字反转逆序
- java集合
- 【CUGBACM15级BC第36场 B】hdu 5199 Gunner
- Android强制指定安装目录
- the operation of recursion
- 循环二叉树(去哪儿2017校招真题)
- SylixOS 系统执行至halVmmInit()错误解决
- 第二周项目 2—C/C++语言中函数参数传递的三种方式
- 啥是so文件
- Apache Beam 快速入门(Python 版)
- 第二周项目三-体验复杂度