scau 1138 代码等式

代码借鉴大佬：https://www.cnblogs.com/DOLFAMINGO/p/7538771.html

 

#include<cstdio>//scau 1138 代码等式
#include<cstring>
#include<cstdlib>
#include<cmath>

int fa[10010],length[30],beg[30];//fa是用来放爸爸的，length是用来放每一个字母的长度，beg是用来放字母代表的一串数字的第一个数的值

int find(int x)
{
    return (x==fa[x]?x:find(fa[x]));
}

void Union(int m, int n)
{
    m = find(m);
    n = find(n);
    if(m!=n)
        fa[m] = n;
}

int main()
{
    int n, s1[10010],s2[10010],len1 = 0,len2 = 0;//n伟字母的个数，然后是s1和s2分别是左边和右边的转化完之后的串存放的数组，len1和len2分别是左边式子和右边式子转化后数字的个数
    scanf("%d",&n);
    scanf("%d",&length[0]);
    beg[0] = 2;
    for(int i = 1; i<n; i++)
    {
        scanf("%d",&length[i]);
        beg[i] = beg[i-1] + length[i-1];
    }

    char ch;
    getchar();
    while((ch= getchar())!='=')
    {
        if(ch=='0' || ch=='1')
            s1[len1++] = ch-'0';

        else
        {
            for(int i = 0; i<length[ch-'a']; i++)
                s1[len1++] = beg[ch-'a'] + i;
        }
    }

    while((ch= getchar())!='
')
    {
        if(ch=='0' || ch=='1')
            s2[len2++] = ch-'0';

        else
        {
            for(int i = 0; i<length[ch-'a']; i++)
                s2[len2++] = beg[ch-'a'] + i;
        }
    }

    if(len1!=len2)
    {
        printf("0
");
        return 0;
    }
    
    for(int i = 0; i<beg[n-1]+length[n-1]; i++) //初始化每个单位变量的集合为自己
        fa[i] = i;

    for(int i = 0; i<len1; i++)//并查集
    {
        if(s1[i]+s2[i]==1)
        {
            printf("0
");
            return 0;
        }

        Union(s1[i],s2[i]);
    }

    int ans = 0;
    for(int i = 0; i<beg[n-1]+length[n-1]; i++)//遍历每个单位变量，统计集合个数
        if(fa[i]==i) ans++;

    printf("%.0lf
",pow(2,ans-2));
    return 0;
}