标签：

Shopping

3
memory
kfc
wind
2
49 memory
49 kfc
48 wind
80 kfc
85 wind
83 memory

1
2

dandelion

用map肯能会超时

#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;
}

HDU2648(简单hash)

标签：

原文地址：http://blog.csdn.net/u013445530/article/details/42031753