[hdu5199]统计数据的水题

题意：统计一个数出现了多少次，统计后删去它所有的出现。思路：乱搞。。自己没事写的hash，不过赶脚效率有点低。

#pragma comment(linker, "/STACK:10240000,10240000")

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <cstring>
#include <map>
#include <queue>
#include <deque>
#include <cmath>
#include <vector>
#include <ctime>
#include <cctype>
#include <set>

using namespace std;

#define mem0(a) memset(a, 0, sizeof(a))
#define lson l, m, rt << 1
#define rson m + 1, r, rt << 1 | 1
#define define_m int m = (l + r) >> 1
#define Rep(a, b) for(int a = 0; a < b; a++)
#define lowbit(x) ((x) & (-(x)))
#define constructInt4(name, a, b, c, d) name(int a = 0, int b = 0, int c = 0, int d = 0): a(a), b(b), c(c), d(d) {}
#define constructInt3(name, a, b, c) name(int a = 0, int b = 0, int c = 0): a(a), b(b), c(c) {}
#define constructInt2(name, a, b) name(int a = 0, int b = 0): a(a), b(b) {}

typedef double db;
typedef long long LL;
typedef pair<int, int> pii;
typedef multiset<int> msi;
typedef multiset<int>::iterator msii;
typedef set<int> si;
typedef set<int>::iterator sii;
typedef vector<int> vi;

const int dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
const int dy[8] = {0, -1, 0, 1, -1, 1, 1, -1};
const int maxn = 1e6 + 7;
const int maxm = 1e5 + 7;
const int maxv = 1e7 + 7;
const int max_val = 1e6 + 7;
const int MD = 1e9 +7;
const int INF = 1e9 + 7;
const double PI = acos(-1.0);
const double eps = 1e-10;

inline int ReadInt() {
    char c = getchar();
    while(!isdigit(c)) c = getchar();

    int x = 0;
    while(isdigit(c)) {
        x = x * 10 + c - '0';
        c = getchar();
    }
    return x;
}

inline void WriteInt(int i) {
    int p = 0;
    static int buf[10];
    if(i == 0) buf[p++] = 0;
    else while(i) {
        buf[p++] = i % 10;
        i /= 10;
    }
    for(int j = p - 1; j >= 0; j--) putchar('0' + buf[j]);
}
template<class T> struct HashList {
    vector<T> hash[max_val];
    HashList<T>() { }
    void clear() { mem0(hash); }
    void insert(T x) { hash[x % max_val].push_back(x); }
    void erase(T x) {
        int node = x % max_val;
        for (int i = 0; i < hash[node].size(); i++) {
            if (hash[node][i] == x) {
                hash[node].erase(hash[node].begin() + i, hash[node].begin() + i + 1);
                return ;
            }
        }
    }
    void erase_all(T x) {
        int node = x % max_val;
        for (int i = 0; i < hash[node].size(); i++) {
            if (hash[node][i] == x) {
                hash[node].erase(hash[node].begin() + i, hash[node].begin() + i + 1);
                i--;
            }
        }
    }
    bool find(T x) {
        int node = x % max_val;
        for (int i = 0; i < hash[node].size(); i++) {
            if (hash[node][i] == x) return true;
        }
        return false;
    }
    int find_cnt(T x) {
        int node = x % max_val, cnt = 0;
        for (int i = 0; i < hash[node].size(); i++) {
            if (hash[node][i] == x) cnt++;
        }
        return cnt;
    }
};

HashList<int> Hash;

int main() {
    //freopen("in.txt", "r", stdin);
    int n, m;
    while (cin >> n >> m) {
        Hash.clear();
        for (int i = 0; i < n; i++) {
            Hash.insert(ReadInt());
        }
        for (int i = 0, x; i < m; i++) {
            x = ReadInt();
            WriteInt(Hash.find_cnt(x));
            putchar('
');
            Hash.erase_all(x);
        }
    }
    return 0;
}