BC.36.Gunner(hash)

Gunner

 

 Accepts: 391

 

 Submissions: 1397

 Time Limit: 8000/4000 MS (Java/Others)

 

 Memory Limit: 65536/65536 K (Java/Others)

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 are n birds and n trees. The i−thbird 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 height H 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 of H.

Input

There are multiple test cases (about 5), every case gives n,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 are n numbers h[1],h[2],h[3],…,h[n] which describes the height of the trees.

In the third line, there are m numbers q[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.

Output

For each q[i], output an integer in a single line indicates the number of birds Jack shot down.

Sample Input

4 3
1 2 3 4
1 1 4

Sample Output

1
0
1

Hint

Huge input, fast IO is recommended.

 1 #include<stdio.h>
 2 #include<string.h>
 3 typedef long long ll ;
 4 const int M = 1000000 + 3 ;
 5 struct edge
 6 {
 7     int nxt ;
 8     ll num ;
 9 }e[M];
10 bool vis [M] ;
11 int H[M] , E ;
12 int cnt ;
13 int n , m  ;
14 ll h ;
15 
16 void init ()
17 {
18     E = 0 ;
19     memset (H , 0 , sizeof(H)) ;
20     memset (vis , 0 , sizeof(vis)) ;
21 }
22 
23 void Insert (ll x)
24 {
25     int y = x % M ;
26     if (y < 0) y += M ;
27     e[++ E].nxt = H[y] ;
28     e[E].num = x ;
29     H[y] = E ;
30 }
31 
32 bool Find (ll x)
33 {
34     int y = x % M ;
35     if (y < 0) y += M ;
36     for (int i = H[y] ; i ; i = e[i].nxt) {
37         if (e[i].num == x && vis[i]) {
38             return false ;
39         }
40         else if (e[i].num == x && !vis[i]) {
41             cnt ++ ;
42             vis[i] = true ;
43         }
44     }
45 }
46 
47 inline ll read () {
48     ll ans = 0; char c; bool flag = false;
49     while ((c = getchar()) == ' ' || c == '\n' || c == '\r');
50     if (c == '-') flag = true; else ans = c - '0';
51     while ((c = getchar()) >= '0' && c <= '9') ans = ans * 10 + c - '0';
52     return ans * (flag ? -1 : 1);
53 }
54 
55 int main ()
56 {
57    // freopen ("a.txt" , "r" , stdin ) ;
58     while (~ scanf ("%d%d" , &n , &m) ) {
59         init () ;
60         while (n--) {
61             h = read () ;
62             Insert (h) ;
63         }
64         while (m--) {
65             cnt = 0 ;
66             h = read () ;
67             Find (h) ;
68             printf ("%d\n" , cnt) ;
69         }
70     }
71     return 0 ;
72 }

View Code

 

转载于:https://www.cnblogs.com/get-an-AC-everyday/p/4394237.html