HDU -> ACM -> Shopping

Shopping

Time Limit : 10000/5000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other)

Total Submission(s) : 16   Accepted Submission(s) : 6

Problem Description

Every girl likes shopping,so does dandelion.Now she finds the shop is increasing the price every day because the Spring Festival is coming .She is fond of a shop which is called "memory". Now she wants to know the rank of this shop's price after the change of everyday.

 

Input

One line contians a number n ( n<=10000),stands for the number of shops.Then n lines ,each line contains a string (the length is short than 31 and only contains lowercase letters and capital letters.)stands for the name of the shop.Then a line contians a number m (1<=m<=50),stands for the days .Then m parts , every parts contians n lines , each line contians a number s and a string p ,stands for this day ,the shop p 's price has increased s.

 

Output

Contains m lines ,In the ith line print a number of the shop "memory" 's rank after the ith day. We define the rank as :If there are t shops' price is higher than the "memory" , than its rank is t+1.

 

Sample Input

3

memory

kfc

wind

2

49 memory

49 kfc

48 wind

80 kfc

85 wind

83 memory

 

Sample Output

1

2

 

#include <iostream>  
#include <cstring>  
#include <queue>  
#include <cstdio>  
#include <algorithm>  
using namespace std;  
#define LL unsigned int  
#define M 10005  
#define N 3131  
  
struct shop{  
    int p;  
    char s[35];  
}sp[M];  
vector<shop> g[N];//用二位数组主要是为了防止地址冲突  
  
bool cmp (shop a, shop b)  
{  
    return strcmp (a.s, b.s) < 0;  
}  
  
int BKDR_hash(char *str)  
 {  
    int seed = 131;  
    int hash = 0;  
      while (*str) hash = hash * seed + (*str++);  
     return (hash & 0x7FFFFFFF) % N;//&0x7FFFFFFF这是为了防止负数产生  
 }  
  
int main()  
{  
    int  key;  
    #ifdef xxz  
    freopen("in.txt","r",stdin);  
#endif  
    int n, i, j, k, d, x, rank, ans;  
    char s[35];  
    while (~scanf ("%d", &n))  
    {  
        for (i = 0; i < N; i++)  
            g[i].clear();  
        for (i = 0; i < n; i++)  
        {  
            scanf ("%s", sp[i].s);  
            sp[i].p = 0;  
            key = BKDR_hash (sp[i].s);  
            g[key].push_back (sp[i]);  
        }  
        scanf ("%d", &d);  
        ans = 0;  
        for (i = 0; i < d; i++)  
        {  
            for (j = 0; j < n; j++)  
            {  
                scanf ("%d %s", &x, s);  
                key = BKDR_hash(s) % N;  
                for (k = 0; k < g[key].size(); k++)  
                {  
                    if (strcmp (g[key][k].s, s) == 0)  
                    {  
                        g[key][k].p += x;  
                        if (strcmp (s, "memory") == 0)  
                            ans = g[key][k].p;  
                        break;  
                    }  
                }  
            }  
            rank = 1;  
            for (j = 0; j < N; j++)  
                for (k = 0; k < g[j].size(); k++)  
                    if (g[j][k].p > ans)  
                        rank++;  
            printf ("%d\n", rank);  
        }  
    }  
    return 0;  
}