字符串哈希

P3370 【模板】字符串哈希 - 洛谷 | 计算机科学教育新生态 (luogu.com.cn)

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef double db;
typedef long double ldb;
typedef pair<int, int> pii;
typedef unsigned long long ull;
typedef pair<ll, ll> PII;
#define pb emplace_back
//#define int ll
#define all(a) a.begin(),a.end()
#define x first
#define y second
#define ps push_back
#define endl '\n'
#define IOS ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define lc u << 1
#define rc u << 1 | 1

void solve();




signed main() {
    IOS;
    ll t = 1;
//    cin >> t;
    while (t--)
        solve();
    return 0;
}

// 字符串哈希
const int N = 121;
const int mod = (1<<30);

ull haxi(string s)
{
    ull ans = 0;
    ull x = N;
    for(int i = 0; i < s.size(); ++ i)
    {
        ans = (ans + s[i]*x)%mod;
        x = (x*N)%mod;
    }
    return ans;
}

void solve() {
    ll n; cin >> n;
    vector<string> s(n);
    vector<ull> a(n);
    for(int i = 0; i < n; ++ i)
    {
        cin >> s[i];
        a[i] = haxi(s[i]);
    }
    sort(all(a));
    stack<ull> st;
    ll ans = 0;
    for(int i = 0; i < n; ++ i)
    {
        if(st.size() && st.top() == a[i]) {
            st.push(a[i]);
            continue;
        }
        st.push(a[i]);
        ans ++;
    }
    cout << ans << endl;
}