[并查集] BZOJ 2919 [Poi1998]Word equations

所有的相同字母（包括0,1）的对应位置取值相等并且方程左右的对应位置取值相等，相等关系具有传递性，故我们使用并查集，每个位置作为一个元素，将所有取值要求相等的位置所对应的集合合并，那么有以下几种情况：

1.  左右长度不等，ans=0

2.  1与0被合并至一个集合，ans=0

3.  设k=不包含1与0的集合的个数，ans=2^k

#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cstring>
#define cl(x) memset(x,0,sizeof(x))
using namespace std;

const int con=100000000;  
class Int{  
public:long long a[1000];  
  void getdata(int x){memset(a,0,sizeof(a));while (x){a[++a[0]]=x%con;x=x/con;}}  
  void pri(bool flag){  
    if (a[0]==0||(a[0]==1&&a[1]==0)){printf("0");if (flag)printf("\n");return;}  
    printf("%lld",a[a[0]]);  
    for (int i=a[0]-1;i;i--)  
      printf("%08lld",a[i]);  
    if (flag)printf("\n");  
  }  
  bool operator <(const Int &X){  
    if (a[0]<X.a[0])return true;if (a[0]>X.a[0])return false;  
    for (int i=a[0];i;i--){if (a[i]<X.a[i])return true;if (a[i]>X.a[i])return false;}  
    return false;  
  }  
  bool operator >(const Int &X){  
    if (a[0]<X.a[0])return false;if (a[0]>X.a[0])return true;  
    for (int i=a[0];i;i--){if (a[i]<X.a[i])return false;if (a[i]>X.a[i])return true;}  
    return false;  
  }  
  bool operator <=(const Int &X){  
    if (a[0]<X.a[0])return true;if (a[0]>X.a[0])return false;  
    for (int i=a[0];i;i--){if (a[i]<X.a[i])return true;if (a[i]>X.a[i])return false;}  
    return true;  
  }  
  bool operator >=(const Int &X){  
    if (a[0]<X.a[0])return false;if (a[0]>X.a[0])return true;  
    for (int i=a[0];i;i--){if (a[i]<X.a[i])return false;if (a[i]>X.a[i])return true;}  
    return true;  
  }  
  bool operator ==(const Int &X){  
    if (a[0]!=X.a[0])return false;for (int i=a[0];i;i--)if (a[i]!=X.a[i])return false;  
    return true;  
  }  
  Int operator +(const Int &X){  
    Int c;memset(c.a,0,sizeof(c.a));  
    for (int i=1;i<=a[0]||i<=X.a[0];i++)  
      {c.a[i]=c.a[i]+a[i]+X.a[i];c.a[i+1]+=c.a[i]/con;c.a[i]%=con;}  
    c.a[0]=max(a[0],X.a[0]);if (c.a[c.a[0]+1])c.a[0]++;  
    return c;  
  }  
  Int operator +(int num){  
    Int c;memcpy(c.a,a,sizeof(c.a));c.a[1]+=num;  
    for (int i=1;i<=c.a[0]&&c.a[i]>=con;i++)c.a[i]-=con,c.a[i+1]++;  
    while (c.a[c.a[0]+1])c.a[0]++;  
    return c;  
  }  
  Int operator -(const Int &X){  
    Int c;memcpy(c.a,a,sizeof(c.a));  
    for (int i=1;i<=a[0];i++){c.a[i]=c.a[i]-X.a[i];if (c.a[i]<0){c.a[i+1]--;c.a[i]+=con;}}  
    while (c.a[0]&&!c.a[c.a[0]])c.a[0]--;  
    return c;  
  }  
  Int operator -(int num){  
    Int c;memcpy(c.a,a,sizeof(c.a));c.a[1]-=num;  
    for (int i=1;i<=c.a[0]&&c.a[i]<0;i++)c.a[i]+=con,c.a[i+1]--;  
    while (c.a[0]&&!c.a[c.a[0]])c.a[0]--;  
    return c;  
  }  
  Int operator *(const Int &X){  
    Int c;memset(c.a,0,sizeof(c.a));  
    for (int i=1;i<=a[0];i++)for (int j=1;j<=X.a[0];j++)  
                   {c.a[i+j-1]+=a[i]*X.a[j];c.a[i+j]+=c.a[i+j-1]/con;c.a[i+j-1]%=con;}  
    c.a[0]=max(a[0]+X.a[0]-1,0ll);if (c.a[a[0]+X.a[0]]>0)c.a[0]++;  
    return c;  
  }  
  Int operator *(int num){  
    Int c;memset(c.a,0,sizeof(c.a));  
    for (int i=1;i<=a[0];i++){c.a[i]+=a[i]*num;if (c.a[i]>=con){c.a[i+1]+=c.a[i]/con;c.a[i]%=con;}}  
    c.a[0]=a[0];if (c.a[c.a[0]+1]>0)c.a[0]++;  
    return c;  
  }  
  Int operator /(int num){  
    Int c;memset(c.a,0,sizeof(c.a));  
    long long x=0;for (int i=a[0];i;i--){x=x*con+a[i];c.a[i]=x/num;x=x%num;}  
    c.a[0]=a[0];if (c.a[0]&&!c.a[c.a[0]])c.a[0]--;  
    return c;  
  }  
};  

inline char nc(){
  static char buf[100000],*p1=buf,*p2=buf;
  if (p1==p2) { p2=(p1=buf)+fread(buf,1,100000,stdin); if (p1==p2) return EOF; }
  return *p1++;
}

inline void read(int &x){
  char c=nc(),b=1;
  for (;!(c>='0' && c<='9');c=nc()) if (c=='-') b=-1;
  for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()); x*=b;
}

inline void read(char *s){
  char c=nc(); int len=0;
  for (;!((c>='0'&&c<='1') || (c>='a' && c<='z'));c=nc());
  for (;(c>='0'&&c<='1') || (c>='a' && c<='z');s[++len]=c,c=nc());
}

const int N=100005;

namespace Tset{
  int fat[N],rank[N];
  inline void init(int n){
    for (int i=1;i<=n;i++) fat[i]=i,rank[i]=0;
  }
  inline int Fat(int u){
    return u==fat[u]?u:fat[u]=Fat(fat[u]);
  }
  inline bool Merge(int x,int y){
    x=Fat(x); y=Fat(y); if (x==y) return 0;
    if (rank[x]>rank[y]) swap(x,y);
    if (rank[x]==rank[y]) rank[y]++;
    fat[x]=y; return 1;
  }
}

int n,len[N];
int pos[26][N];
int pos2[2][N];
int lena,lenb;
char a[N],b[N];
int tota,totb;
int tag[N];

int main(){
  using namespace Tset;
  int Q,cur;
  freopen("t.in","r",stdin);
  freopen("t.out","w",stdout);
  read(Q);
  while (Q--){
    for (int i=0;i<26;i++) pos[i][0]=0;
    for (int i=0;i<2;i++) pos2[i][0]=0;
    read(n);
    for (int i=0;i<n;i++) read(len[i]);
    read(lena); read(a); read(lenb); read(b);
    tota=0;
    for (int i=1;i<=lena;i++) if ('a'<=a[i] && a[i]<='z') tota+=len[a[i]-'a']; else tota++;
    totb=0;
    for (int i=1;i<=lenb;i++) if ('a'<=b[i] && b[i]<='z') totb+=len[b[i]-'a']; else totb++;
    if (tota!=totb){
      printf("0\n"); continue;
    }
    cur=1;
    for (int i=1;i<=lena;i++) {
      if ('a'<=a[i] && a[i]<='z')pos[a[i]-'a'][++*pos[a[i]-'a']]=cur;
      if ('a'<=a[i] && a[i]<='z') cur+=len[a[i]-'a']; else cur++;
    }
    cur=tota+1;
    for (int i=1;i<=lenb;i++) {
      if ('a'<=b[i] && b[i]<='z')pos[b[i]-'a'][++*pos[b[i]-'a']]=cur;
      if ('a'<=b[i] && b[i]<='z') cur+=len[b[i]-'a']; else cur++;
    }
    cur=1;
    for (int i=1;i<=lena;i++) {
      if ('0'<=a[i] && a[i]<='1')pos2[a[i]-'0'][++*pos2[a[i]-'0']]=cur;
      if ('a'<=a[i] && a[i]<='z') cur+=len[a[i]-'a']; else cur++;
    }
    cur=tota+1;
    for (int i=1;i<=lenb;i++) {
      if ('0'<=b[i] && b[i]<='1')pos2[b[i]-'0'][++*pos2[b[i]-'0']]=cur;
      if ('a'<=b[i] && b[i]<='z') cur+=len[b[i]-'a']; else cur++;
    }
    init(tota<<1);
    for (int i=1;i<=tota;i++)
      Merge(i,tota+i);
    for (int i=0;i<n;i++)
      for (int t=2;t<=*pos[i];t++)
	for (int j=0;j<len[i];j++)
	  Merge(pos[i][t-1]+j,pos[i][t]+j);
    int flag=0;
    for (int i=1;i<=*pos2[0] && !flag;i++)
      for (int j=1;j<=*pos2[1] && !flag;j++)
	if (Fat(pos2[0][i])==Fat(pos2[1][j]))
	  flag=1;
    if (flag){
      printf("0\n"); continue;
    }
    cl(tag);
    for (int i=1;i<=*pos2[0] && !flag;i++)
      tag[Fat(pos2[0][i])]=1;
    for (int i=1;i<=*pos2[1] && !flag;i++)
      tag[Fat(pos2[1][i])]=1;
    int cnt=0;
    for (int i=1;i<=tota+totb;i++)
      if (Fat(i)==i && !tag[i])
	cnt++;
    Int ans;
    ans.getdata(1);
    for (int i=1;i<=cnt;i++)
      ans=ans*2;
    ans.pri(1);
  }
  return 0;
}