UVALive 4452 The Ministers' Major Mess --- 2-SAT问题

原文链接 http://www.bubuko.com/infodetail-1185933.html?__cf_chl_jschl_tk__=fe338f4b84387ae9c490e0e5810ec56a4ee4fa31-1584608202-0-AbtJYBtZ6x1AwYYT0O7PwsL_hWT3KEZaW4FAQQCecepwOam_JbTLw0rnND8U5NdbC0bc97ZLL33rLEk4rUncvjw3vU4aeVK0igIHsu9h3BJnZ9pBv0F_2O1UJI5m-QPZUDMkIv0RHKJvy8K0Fw0pHAOhOTGnsV71BjRqz_p7eYlrh8CmSsHh96LCeYWF7brnbtk2sOhCn-pIIsdOmEajMbAH1vNd6KWq-8KlVQcscrQFN_NnCuMcWFN7E-2PnUGV4Y09YqIGjU9ovWtXGy13vW_N9W926m8MIwaSXTHQ-LrCpxyL6cxpEg1ESuDlncnzqg 

# include<iostream>
# include<cstdio>
# include<vector>
# include<queue>
# include<cstring>
# include<algorithm>
using namespace std;
# define LL long long
# define REP(i,s,n) for(int i=s;i<n;++i)
# define CLS(a,b) memset(a,b,sizeof(a))
# define CLL(a,b,n) fill(a,a+n,b)

const int N=105;
vector<int>G[N<<1];
int n,m,a[5],b[5],must[N+N],mark[N+N],flag[N],s[N+N],cnt;

void add(int x,int u,int y,int v)
{
    x=x*2+u;
    y=y*2+v;
    G[x^1].push_back(y);
    G[y^1].push_back(x);
}

void dfs1(int u)
{
    must[u]=1;
    REP(i,0,G[u].size()) if(!must[G[u][i]]) dfs1(G[u][i]);
}

void clear()
{
    CLS(mark,0);
    REP(i,0,n+n) mark[i]=must[i];
}

bool dfs(int x)
{
    if(mark[x^1]) return false;
    if(mark[x]) return true;
    mark[x]=1;
    s[cnt++]=x;
    REP(i,0,G[x].size()) if(!dfs(G[x][i])) return false;
    return true;
}

bool solve()
{
    for(int i=0;i<n+n;i+=2){
        if(mark[i]&&mark[i+1]) return false;
        if(!mark[i]&&!mark[i+1]){
            cnt=0;
            if(!dfs(i)){
                while(cnt>0) mark[s[--cnt]]=0;
                if(!dfs(i+1)) return false;
            }
        }
    }
    return true;
}

void init()
{
    REP(i,0,n*2) G[i].clear();
    CLS(must,0);
    CLS(mark,0);
}

int main()
{
    int k,cas=0;
    char c;
    while(scanf("%d%d",&n,&m)&&(n+m))
    {
        init();
        CLS(flag,0);
        while(m--)
        {
            scanf("%d",&k);
            REP(i,0,k){
                scanf("%d %c",&a[i],&c);
                --a[i];
                if(c=='y') b[i]=1;
                else b[i]=0;
            }
            if(k<=2){
                REP(i,0,k) must[a[i]*2+b[i]]=1;
            }else
                REP(i,0,k) REP(j,i+1,k) add(a[i],b[i],a[j],b[j]);
        }

        REP(i,0,n+n) if(must[i]) dfs1(i);

        printf("Case %d: ",++cas);
        REP(i,0,n){
            if(must[i*2]||must[i*2+1]) continue;
            clear();
            mark[i*2]=1;
            bool yy1=solve();
            clear();
            mark[i*2+1]=1;
            bool yy2=solve();
            if(yy1&&yy2) flag[i]=1;
        }
        clear();
        if(!solve()){
            printf("impossible\n");
            continue;
        }
        REP(i,0,n){
            if(flag[i]) printf("?");
            else if(mark[i*2]) printf("n");
            else printf("y");
        }
        printf("\n");
    }
    return 0;
}