hihoCoder 1066 : 无间道之并查集(字符串Hash函数）



样例输入 10
0 Steven David
0 Lcch Dzx
1 Lcch Dzx
1 David Dzx
0 Lcch David
0 Frank Dzx
1 Steven Dzx
1 Frank David
0 Steven Dzx
0 Dzx Frank 样例输出 yes
no
yes
yes

题意：

输入操作数，接下来输入的第一个数是零，就合并后两个字符串在一个集合，如果是1，就询问后两个字符串是否在一个集合；

典型并查集，需要字符串HASH

代码里有很多字符串HASH函数

#include<iostream>
#include<string.h>
using namespace std;
#define MAX 20000000
int fa[MAX];
int n;
unsigned int SDBMHash(char *str)
{
    unsigned int hash = 0;

    while (*str)
    {
        // equivalent to: hash = 65599*hash + (*str++);
        hash = (*str++) + (hash << 6) + (hash << 16) - hash;
    }

    return (hash & 0x7FFFFFFF)%MAX;
}
unsigned int RSHash(char *str)
{
    unsigned int b = 378551;
    unsigned int a = 63689;
    unsigned int hash = 0;

    while (*str)
    {
        hash = hash * a + (*str++);
        a *= b;
    }

    return (hash & 0x7FFFFFFF)%MAX;
}
unsigned int JSHash(char *str)
{
    unsigned int hash = 1315423911;

    while (*str)
    {
        hash ^= ((hash << 5) + (*str++) + (hash >> 2));
    }

    return (hash & 0x7FFFFFFF);
}
unsigned int PJWHash(char *str)
{
    unsigned int BitsInUnignedInt = (unsigned int)(sizeof(unsigned int) * 8);
    unsigned int ThreeQuarters    = (unsigned int)((BitsInUnignedInt  * 3) / 4);
    unsigned int OneEighth        = (unsigned int)(BitsInUnignedInt / 8);
    unsigned int HighBits         = (unsigned int)(0xFFFFFFFF) << (BitsInUnignedInt - OneEighth);
    unsigned int hash             = 0;
    unsigned int test             = 0;

    while (*str)
    {
        hash = (hash << OneEighth) + (*str++);
        if ((test = hash & HighBits) != 0)
        {
            hash = ((hash ^ (test >> ThreeQuarters)) & (~HighBits));
        }
    }

    return (hash & 0x7FFFFFFF);
}
unsigned int ELFHash(char *str)
{
    unsigned int hash = 0;
    unsigned int x    = 0;

    while (*str)
    {
        hash = (hash << 4) + (*str++);
        if ((x = hash & 0xF0000000L) != 0)
        {
            hash ^= (x >> 24);
            hash &= ~x;
        }
    }

    return (hash & 0x7FFFFFFF);
}
unsigned int BKDRHash(char *str)
{
    unsigned int seed = 131; // 31 131 1313 13131 131313 etc..
    unsigned int hash = 0;

    while (*str)
    {
        hash = hash * seed + (*str++);
    }

    return (hash & 0x7FFFFFFF)%MAX;
}
unsigned int DJBHash(char *str)
{
    unsigned int hash = 5381;

    while (*str)
    {
        hash += (hash << 5) + (*str++);
    }

    return (hash & 0x7FFFFFFF);
}
unsigned int APHash(char *str)
{
    unsigned int hash = 0;
    int i;

    for (i=0; *str; i++)
    {
        if ((i & 1) == 0)
        {
            hash ^= ((hash << 7) ^ (*str++) ^ (hash >> 3));
        }
        else
        {
            hash ^= (~((hash << 11) ^ (*str++) ^ (hash >> 5)));
        }
    }

    return (hash & 0x7FFFFFFF)%MAX;
}
void init()
{
    for(int i=0;i<MAX;i++)
    {
        fa[i]=i;
    }
}

int find(int u)
{
    if(u==fa[u])return u;
    else
    {
        return find(fa[u]);
    }
}
void join(int u,int v)
{
    if(find(u)!=find(v))
    {
        fa[find(u)]=find(v);
    }
}
int bian(char a[])
{
    int sum=0;
    for(int i=0;i<strlen(a);i++)
    {
        sum+=a[i]*(i+1);
    }
    return sum;
}
int main()
{
    int t;
    cin>>t;
    init();
    while(t--)
    {
        int op;
        char u[10000],v[10000];
        cin>>op;
        if(op==0)
        {
            cin>>u>>v;
            //cout<<RSHash(u)<<" "<<RSHash(v)<<endl;
            join(APHash(u),APHash(v));
        }
        else if(op==1)
        {
            cin>>u>>v;
            //cout<<find(BKDRHash(u))<<" "<<find(BKDRHash(v))<<endl;
            if(find(APHash(u))==find(APHash(v)))
            {
                cout<<"yes"<<endl;
            }
            else
                cout<<"no"<<endl;
        }
    }
    return 0;
}