P3370 【模板】字符串哈希

题意：

（来源：洛谷）

解题思路：

借用oiwiki来介绍下什么是hash

emmmm…然后hash就完事了，$O(n^2)$比较即可（这里用的是双hash）

AC代码：

#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
const int maxn = 1e4 + 10;
const int maxm = 2e3 + 10;
ll M1 = 1e9 + 7, M2 = 212370440130137957ll;
ll b1 = 233, b2 = 131;
ll ex1[maxm], ex2[maxm];
map <ll, bool> mp1, mp2;
void match_pre(int n) {
    ex1[0] = ex2[0] = 1;
    for (int i = 1; i <= n; i++)
        ex1[i] = ex1[i - 1] * b1 % M1, ex2[i] = ex2[i - 1] * b2 % M2;
}
int n;
string str[maxn];
ll hash1[maxn], hash2[maxn];
void h(string str, int p) {
    int l = str.size();
    for (int i = 0; i < l; i++)
        hash1[p] = (hash1[p] * b1 % M1 + str[i]) % M1,
        hash2[p] = (hash2[p] * b2 % M2 + str[i]) % M2;
}
int main() {
    srand(time(0));
    b1 = rand() % 233 + 322;
    b2 = rand() % 322 + 233;
    cin >> n;
    int lmax = 0;
    for (int i = 1; i <= n; i++) {
        cin >> str[i];
        lmax = max(lmax, (int)str[i].size());
    }
    match_pre(lmax);
    for (int i = 1; i <= n; i++)
        h(str[i], i);
    int cnt = 0;
    for (int i = 1; i <= n; i++) {
        if (!mp1.count(hash1[i]))
            mp1[hash1[i]] = true;
        if (!mp2.count(hash2[i]))
            mp2[hash2[i]] = true;
    }
    cout << min(mp1.size(), mp2.size()) << endl;
}