uva 11604

错误程序转自 http://aoxuemugualu.blog.163.com/blog/static/191501202201402431958877/

用任意两组组成一个长串，看能不能由短串组合出来这个方法是错误的。错误程序和反例如下：

//!!!!!!!!!!!错误程序和反例
#include<iostream>
#include<cstdio>
#include<cstring>
#include<string.h>
#include<algorithm>
using namespace std;
const int maxn = 100+5;
char weapon[maxn][25];
char buffer[maxn];
int L;
bool sel[maxn];
bool vis[maxn];
int len[maxn];
int succ[maxn];
int n;
inline int cmp(const void * s1 , const void * s2)
{
    int len1 = strlen((char*)s1);
    int len2 = strlen((char*)s2);
    if (len1 < len2) return 1;
    else if (len1 > len2) return -1;
    return 0;
}
void input()
{
    for (int i = 1 ; i <= n ; ++i) scanf("%*s%s",weapon[i]);
    qsort(weapon+1,n,sizeof(weapon[0]),cmp);
    for (int i = 1 ; i <= n ; ++i)
    len[i] = strlen(weapon[i]);
    for (int i = 0 ; i <= len[1]*2 ; ++i)
    {
        int j;
        for (j = 1 ; j <= n ; ++j)
         if (len[j] <= i) break;
        succ[i] = j;
    }
}
bool match(int cur,int pos)

{
    for (int i = 0 ; i < len[cur] ; ++i)
    if (buffer[pos+i]!=weapon[cur][i]) return false;
    return true;
}
bool dfs(int pos,int s,int cur,int sel1,int sel2)
{
    if (s==3) return true;
    if (pos==L) return false;
    for (int i = cur ; i <= n ; ++i) if (match(i,pos))
    {
        if (sel1==i && !(s&1))
        {
            if (!dfs(pos+len[i],s+1,succ[L-pos-len[i]],sel1,sel2))return false;
        }
        else if (sel2==i && !(s&2))
        {
            if (!dfs(pos+len[i],s+2,succ[L-pos-len[i]],sel1,sel2))return false;
        }
        else if (!dfs(pos+len[i],s,succ[L-pos-len[i]],sel1,sel2))return false;
    }
    return true;
}
void solve()

{
    for (int i = 1 ; i <= n ; ++i)
    {
        for (int j = 1 ; j <= n ; ++j)
         {
            strcpy(buffer,weapon[i]);
            strcat(buffer,weapon[j]);
            L = len[i]+len[j];
            if (!dfs(0,0,succ[L],i,j))
            {
                cout << " Ambiguous." << endl;
                return;
            }
         }
    }
    cout << " Not ambiguous." << endl;
}
int main()
{
    int Cas = 0;
    while (scanf("%d",&n),n)
     {
        ++Cas;
        input();
        printf("Case #%d:",Cas);
        solve();
    }
}
/*
5
a 0100100
b 011111110
d 010010001001000
e 1111
f 1110
a+a+b
d+e+f
*/

下面是正确程序，正确程序转自 http://blog.csdn.net/houserabbit/article/details/38943645

#include<cstdio>
#include<iostream>
#include<string>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<map>
#include<set>
#include<vector>
using namespace std;
typedef long long LL;
#define N 2500
#define M 250110
#define inf 2147483647

int t=1,n,E,tot;
bool ans;
int head[N],vis[N*25],len[N],id[N][25];
char maz[N][25];
struct edge
{
    int v,next;
}ed[M];

void add(int u,int v)
{
    ed[tot].v=v;
    ed[tot].next=head[u];
    head[u]=tot++;
}

void dfs(int u)
{
    if(u==E)
    {
        ans=true;
        return;
    }
    vis[u]=1;
    int i,v;
    for(i=head[u];~i;i=ed[i].next)
    {
        v=ed[i].v;
        if(!vis[v]) dfs(v);
        if(ans) return;
    }
}

int main()
{
    int i,j,k,h;
    while(~scanf("%d",&n))
    {
        if(!n) break;
        k=1;
        for(i=1;i<=n;i++)
        {
            scanf("%s%s",maz[i]+1,maz[i]+1);
            len[i]=strlen(maz[i]+1);
            for(j=1;j<=len[i];j++) id[i][j]=k++;
        }
        E=k;
        tot=0;
        memset(head,-1,sizeof(head));
        for(i=1;i<=n;i++)
        {
            for(h=1;h<=len[i];h++)
            {
                for(j=1;j<=n;j++)
                {
                    if(i==j&&h==1) continue;
                    for(k=1;k<=len[j]&&h+k-1<=len[i];k++)
                    {
                        if(maz[i][h+k-1]!=maz[j][k]) break;
                    }
                    if(k>len[j]&&h+k-1>len[i]) add(id[i][h],E);
                    else if(k>len[j]) add(id[i][h],id[i][h+k-1]);
                    else if(h+k-1>len[i]) add(id[i][h],id[j][k]);
                }
            }
        }
        ans=false;
        memset(vis,0,sizeof(vis));
        for(i=1;i<=n;i++)
        {
            if(!vis[id[i][1]]) dfs(id[i][1]);
            if(ans) break;
        }
        if(ans) printf("Case #%d: Ambiguous.\n",t++);
        else printf("Case #%d: Not ambiguous.\n",t++);
    }
    return 0;
}