poj 3648 Wedding（2-sat）

最新推荐文章于 2020-01-08 21:25:19 发布

madaidao

最新推荐文章于 2020-01-08 21:25:19 发布

阅读量428

点赞数

分类专栏：图论文章标签： acm 2-sat

本文链接：https://blog.csdn.net/madaidao/article/details/40681489

版权

图论专栏收录该内容

34 篇文章 0 订阅

订阅专栏

题目链接

Wedding

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 8410		Accepted: 2535		Special Judge

Description

Up to thirty couples will attend a wedding feast, at which they will be seated on either side of a long table. The bride and groom sit at one end, opposite each other, and the bride wears an elaborate headdress that keeps her from seeing people on the same side as her. It is considered bad luck to have a husband and wife seated on the same side of the table. Additionally, there are several pairs of people conducting adulterous relationships (both different-sex and same-sex relationships are possible), and it is bad luck for the bride to see both members of such a pair. Your job is to arrange people at the table so as to avoid any bad luck.

Input

The input consists of a number of test cases, followed by a line containing 0 0. Each test case gives n, the number of couples, followed by the number of adulterous pairs, followed by the pairs, in the form "4h 2w" (husband from couple 4, wife from couple 2), or "10w 4w", or "3h 1h". Couples are numbered from 0 to n - 1 with the bride and groom being 0w and 0h.

Output

For each case, output a single line containing a list of the people that should be seated on the same side as the bride. If there are several solutions, any one will do. If there is no solution, output a line containing "bad luck".

Sample Input

10 6
3h 7h
5w 3w
7h 6w
8w 3w
7h 3w
2w 5h
0 0

Sample Output

1h 2h 3w 4h 5h 6h 7h 8h 9h

题意：n个夫妇，编号为0到n-1。第0对夫妇为新娘和新郎。现在有一个很长的桌子，每对夫妇不能坐在同一面（共相对的两面）。新娘能看到坐在她对面的人，n对夫妇中有些有通奸的关系，如果新娘能同时看到有通奸关系的人会不吉利。问是否存在一个坐位置的方式，让新娘吉利，如果有输出坐在新娘这一面的人。

题解：有n对夫妇，2*n个人。设，第x个人跟新娘坐在同一面那么f（x）=0，否则f（x）=1。那么限制关系有：

如果x和y是夫妇：f(x) xor f(y) == 1

如果x和y通奸：f(x) and f(y) ==0

典型的2-sat问题。问题中有些人的f（x）是已知的，若f(x)==0,那么我们从表示f(x)为1的点建一条边到表示f(x)为0的点。若f(x)=1，反之。

注意:这题输入不能用scanf（"%s%s"），因为后台数据里面中间可能没有空格。

O（n*m）的代码如下：

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<stack>
#include<vector>
#include<queue>
#include<string.h>
#define inff 0x3fffffff
#define nn 2100
using namespace std;
int n,m;
struct node
{
    int st,en,next;
}E[nn*nn];
int p[nn],num;
void init()
{
    memset(p,-1,sizeof(p));
    num=0;
}
void add(int st,int en)
{
    E[num].en=en;
    E[num].next=p[st];
    p[st]=num++;
}
bool use[nn];
vector<int>vis;
bool dfs(int id)
{
    use[id]=true;
    vis.push_back(id);
    int i,w;
    bool re=true;
    for(i=p[id];i+1;i=E[i].next)
    {
        w=E[i].en;
        if(!use[w])
        {
            if(!use[w^1])
                re=re&&dfs(w);
            else
                return false;
        }
    }
    return re;
}
bool solve()
{
    memset(use,false,sizeof(use));
    int i;
    for(i=2;i<=2*n-1;i++)
    {
        if(!use[2*i]&&!use[2*i+1])
        {
            vis.clear();
            if(!dfs(2*i))
            {
                for(int j=0;j<(int)vis.size();j++)
                    use[vis[j]]=false;
                vis.clear();
                if(!dfs(2*i+1))
                    return false;
            }
        }
    }
    return true;
}
int main()
{
    int i,ix,fc;
    char s1[20],s2[10];
    while(scanf("%d%d",&n,&m)&&n+m)
    {
        init();
        for(i=1;i<n;i++)
        {
            ix=2*i,fc=2*i+1;
            add(2*ix,2*fc+1);
            add(2*fc+1,2*ix);
            add(2*fc,2*ix+1);
            add(2*ix+1,2*fc);
        }
        for(i=1;i<=m;i++)
        {
            scanf("%d%s%d%s",&ix,s1,&fc,s2);
            if(s1[0]=='h')
                ix=2*ix+1;
            else
                ix=2*ix;
            if(s2[0]=='h')
                fc=2*fc+1;
            else
                fc=2*fc;
            if(ix==0||fc==0)
                continue;
            if(ix==1)
            {
                add(2*fc+1,2*fc);
            }
            else if(fc==1)
            {
                add(2*ix+1,2*ix);
            }
            else
            {
                add(2*ix+1,2*fc);
                add(2*fc+1,2*ix);
            }
        }
        if(solve())
        {
            bool ok=true;
            for(i=4;i<=4*n-1;i++)
            {
                if(use[i])
                {
                    if(i%2==0)
                    {
                        if(ok)
                            ok=false;
                        else
                            printf(" ");
                        printf("%d",(i/2)/2);
                        if((i/2)%2)
                            printf("h");
                        else
                            printf("w");
                    }
                }
            }
            puts("");
        }
        else
            puts("bad luck");
    }
    return 0;
}

O（m）的代码如下：

<pre class="sh-cpp sh-sourceCode" style="font-family: Courier New,Courier,monospace;"><span class="sh-preproc">#include</span><span class="sh-string"><stdio.h></span>
<span class="sh-preproc">#include</span><span class="sh-string"><iostream></span>
<span class="sh-preproc">#include</span><span class="sh-string"><algorithm></span>
<span class="sh-preproc">#include</span><span class="sh-string"><stack></span>
<span class="sh-preproc">#include</span><span class="sh-string"><vector></span>
<span class="sh-preproc">#include</span><span class="sh-string"><queue></span>
<span class="sh-preproc">#include</span><span class="sh-string"><string.h></span>
<span class="sh-preproc">#define</span> inff <span class="sh-number">0x3fffffff</span>
<span class="sh-preproc">#define</span> nn <span class="sh-number">2100</span>
<span class="sh-keyword">using</span> <span class="sh-keyword">namespace</span> std<span class="sh-symbol">;</span>
<span class="sh-type">int</span> n<span class="sh-symbol">,</span>m<span class="sh-symbol">;</span>
<span class="sh-keyword">struct</span><span class="sh-normal"> </span><span class="sh-classname">node</span>
<span class="sh-cbracket">{</span>
    <span class="sh-type">int</span> st<span class="sh-symbol">,</span>en<span class="sh-symbol">,</span>next<span class="sh-symbol">;</span>
<span class="sh-cbracket">}</span>E<span class="sh-symbol">[</span>nn<span class="sh-symbol">*</span>nn<span class="sh-symbol">];</span>
<span class="sh-type">int</span> p<span class="sh-symbol">[</span>nn<span class="sh-symbol">],</span>num<span class="sh-symbol">;</span>
<span class="sh-type">void</span> <span class="sh-function">init</span><span class="sh-symbol">()</span>
<span class="sh-cbracket">{</span>
    <span class="sh-function">memset</span><span class="sh-symbol">(</span>p<span class="sh-symbol">,-</span><span class="sh-number">1</span><span class="sh-symbol">,</span><span class="sh-keyword">sizeof</span><span class="sh-symbol">(</span>p<span class="sh-symbol">));</span>
    num<span class="sh-symbol">=</span><span class="sh-number">0</span><span class="sh-symbol">;</span>
<span class="sh-cbracket">}</span>
<span class="sh-type">void</span> <span class="sh-function">add</span><span class="sh-symbol">(</span><span class="sh-type">int</span> st<span class="sh-symbol">,</span><span class="sh-type">int</span> en<span class="sh-symbol">)</span>
<span class="sh-cbracket">{</span>
    E<span class="sh-symbol">[</span>num<span class="sh-symbol">].</span>en<span class="sh-symbol">=</span>en<span class="sh-symbol">;</span>
    E<span class="sh-symbol">[</span>num<span class="sh-symbol">].</span>next<span class="sh-symbol">=</span>p<span class="sh-symbol">[</span>st<span class="sh-symbol">];</span>
    p<span class="sh-symbol">[</span>st<span class="sh-symbol">]=</span>num<span class="sh-symbol">++;</span>
<span class="sh-cbracket">}</span>
<span class="sh-type">int</span> dfn<span class="sh-symbol">[</span>nn<span class="sh-symbol">],</span>low<span class="sh-symbol">[</span>nn<span class="sh-symbol">];</span>
<span class="sh-type">bool</span> insta<span class="sh-symbol">[</span>nn<span class="sh-symbol">];</span>
stack<span class="sh-symbol"><</span><span class="sh-type">int</span><span class="sh-symbol">></span>sta<span class="sh-symbol">;</span>
<span class="sh-type">int</span> cnt<span class="sh-symbol">,</span>vis<span class="sh-symbol">;</span>
<span class="sh-type">int</span> fa<span class="sh-symbol">[</span>nn<span class="sh-symbol">];</span>
<span class="sh-type">void</span> <span class="sh-function">dfs</span><span class="sh-symbol">(</span><span class="sh-type">int</span> id<span class="sh-symbol">)</span>
<span class="sh-cbracket">{</span>
    dfn<span class="sh-symbol">[</span>id<span class="sh-symbol">]=</span>low<span class="sh-symbol">[</span>id<span class="sh-symbol">]=++</span>vis<span class="sh-symbol">;</span>
    sta<span class="sh-symbol">.</span><span class="sh-function">push</span><span class="sh-symbol">(</span>id<span class="sh-symbol">);</span>
    insta<span class="sh-symbol">[</span>id<span class="sh-symbol">]=</span><span class="sh-keyword">true</span><span class="sh-symbol">;</span>
    <span class="sh-type">int</span> i<span class="sh-symbol">,</span>w<span class="sh-symbol">;</span>
    <span class="sh-keyword">for</span><span class="sh-symbol">(</span>i<span class="sh-symbol">=</span>p<span class="sh-symbol">[</span>id<span class="sh-symbol">];</span>i<span class="sh-number">+1</span><span class="sh-symbol">;</span>i<span class="sh-symbol">=</span>E<span class="sh-symbol">[</span>i<span class="sh-symbol">].</span>next<span class="sh-symbol">)</span>
    <span class="sh-cbracket">{</span>
        w<span class="sh-symbol">=</span>E<span class="sh-symbol">[</span>i<span class="sh-symbol">].</span>en<span class="sh-symbol">;</span>
        <span class="sh-keyword">if</span><span class="sh-symbol">(</span>dfn<span class="sh-symbol">[</span>w<span class="sh-symbol">]==-</span><span class="sh-number">1</span><span class="sh-symbol">)</span>
        <span class="sh-cbracket">{</span>
            <span class="sh-function">dfs</span><span class="sh-symbol">(</span>w<span class="sh-symbol">);</span>
            low<span class="sh-symbol">[</span>id<span class="sh-symbol">]=</span><span class="sh-function">min</span><span class="sh-symbol">(</span>low<span class="sh-symbol">[</span>id<span class="sh-symbol">],</span>low<span class="sh-symbol">[</span>w<span class="sh-symbol">]);</span>
        <span class="sh-cbracket">}</span>
        <span class="sh-keyword">else</span> <span class="sh-keyword">if</span><span class="sh-symbol">(</span>insta<span class="sh-symbol">[</span>w<span class="sh-symbol">])</span>
        <span class="sh-cbracket">{</span>
            low<span class="sh-symbol">[</span>id<span class="sh-symbol">]=</span><span class="sh-function">min</span><span class="sh-symbol">(</span>low<span class="sh-symbol">[</span>id<span class="sh-symbol">],</span>dfn<span class="sh-symbol">[</span>w<span class="sh-symbol">]);</span>
        <span class="sh-cbracket">}</span>
    <span class="sh-cbracket">}</span>
    <span class="sh-keyword">if</span><span class="sh-symbol">(</span>dfn<span class="sh-symbol">[</span>id<span class="sh-symbol">]==</span>low<span class="sh-symbol">[</span>id<span class="sh-symbol">])</span>
    <span class="sh-cbracket">{</span>
        <span class="sh-symbol">++</span>cnt<span class="sh-symbol">;</span>
        <span class="sh-type">int</span> ix<span class="sh-symbol">;</span>
        <span class="sh-keyword">while</span><span class="sh-symbol">(</span><span class="sh-number">1</span><span class="sh-symbol">)</span>
        <span class="sh-cbracket">{</span>
            ix<span class="sh-symbol">=</span>sta<span class="sh-symbol">.</span><span class="sh-function">top</span><span class="sh-symbol">();</span>
            sta<span class="sh-symbol">.</span><span class="sh-function">pop</span><span class="sh-symbol">();</span>
            insta<span class="sh-symbol">[</span>ix<span class="sh-symbol">]=</span><span class="sh-keyword">false</span><span class="sh-symbol">;</span>
            fa<span class="sh-symbol">[</span>ix<span class="sh-symbol">]=</span>cnt<span class="sh-symbol">;</span>
            <span class="sh-keyword">if</span><span class="sh-symbol">(</span>ix<span class="sh-symbol">==</span>id<span class="sh-symbol">)</span>
                <span class="sh-keyword">break</span><span class="sh-symbol">;</span>
        <span class="sh-cbracket">}</span>
    <span class="sh-cbracket">}</span>
<span class="sh-cbracket">}</span>
queue<span class="sh-symbol"><</span><span class="sh-type">int</span><span class="sh-symbol">></span>que<span class="sh-symbol">;</span>
vector<span class="sh-symbol"><</span><span class="sh-type">int</span><span class="sh-symbol">></span>ve<span class="sh-symbol">[</span>nn<span class="sh-symbol">];</span>
<span class="sh-type">int</span> du<span class="sh-symbol">[</span>nn<span class="sh-symbol">];</span>
<span class="sh-type">int</span> biao<span class="sh-symbol">[</span>nn<span class="sh-symbol">];</span>
<span class="sh-type">int</span> dy<span class="sh-symbol">[</span>nn<span class="sh-symbol">];</span>
<span class="sh-type">bool</span> <span class="sh-function">solve</span><span class="sh-symbol">()</span>
<span class="sh-cbracket">{</span>
    cnt<span class="sh-symbol">=</span>vis<span class="sh-symbol">=</span><span class="sh-number">0</span><span class="sh-symbol">;</span>
    <span class="sh-type">int</span> i<span class="sh-symbol">;</span>
    <span class="sh-function">memset</span><span class="sh-symbol">(</span>dfn<span class="sh-symbol">,-</span><span class="sh-number">1</span><span class="sh-symbol">,</span><span class="sh-keyword">sizeof</span><span class="sh-symbol">(</span>dfn<span class="sh-symbol">));</span>
    <span class="sh-function">memset</span><span class="sh-symbol">(</span>insta<span class="sh-symbol">,</span><span class="sh-keyword">false</span><span class="sh-symbol">,</span><span class="sh-keyword">sizeof</span><span class="sh-symbol">(</span>insta<span class="sh-symbol">));</span>
    <span class="sh-keyword">for</span><span class="sh-symbol">(</span>i<span class="sh-symbol">=</span><span class="sh-number">0</span><span class="sh-symbol">;</span>i<span class="sh-symbol"><=</span><span class="sh-number">1000</span><span class="sh-symbol">;</span>i<span class="sh-symbol">++)</span>
        ve<span class="sh-symbol">[</span>i<span class="sh-symbol">].</span><span class="sh-function">clear</span><span class="sh-symbol">();</span>
    <span class="sh-function">memset</span><span class="sh-symbol">(</span>biao<span class="sh-symbol">,-</span><span class="sh-number">1</span><span class="sh-symbol">,</span><span class="sh-keyword">sizeof</span><span class="sh-symbol">(</span>biao<span class="sh-symbol">));</span>
    <span class="sh-function">memset</span><span class="sh-symbol">(</span>du<span class="sh-symbol">,</span><span class="sh-number">0</span><span class="sh-symbol">,</span><span class="sh-keyword">sizeof</span><span class="sh-symbol">(</span>du<span class="sh-symbol">));</span>
    <span class="sh-keyword">for</span><span class="sh-symbol">(</span>i<span class="sh-symbol">=</span><span class="sh-number">4</span><span class="sh-symbol">;</span>i<span class="sh-symbol"><=</span><span class="sh-number">4</span><span class="sh-symbol">*</span>n<span class="sh-number">-1</span><span class="sh-symbol">;</span>i<span class="sh-symbol">++)</span>
    <span class="sh-cbracket">{</span>
        <span class="sh-keyword">if</span><span class="sh-symbol">(</span>dfn<span class="sh-symbol">[</span>i<span class="sh-symbol">]==-</span><span class="sh-number">1</span><span class="sh-symbol">)</span>
        <span class="sh-cbracket">{</span>
            <span class="sh-function">dfs</span><span class="sh-symbol">(</span>i<span class="sh-symbol">);</span>
        <span class="sh-cbracket">}</span>
    <span class="sh-cbracket">}</span>
    <span class="sh-type">int</span> j<span class="sh-symbol">,</span>w<span class="sh-symbol">;</span>
    <span class="sh-keyword">for</span><span class="sh-symbol">(</span>i<span class="sh-symbol">=</span><span class="sh-number">4</span><span class="sh-symbol">;</span>i<span class="sh-symbol"><=</span><span class="sh-number">4</span><span class="sh-symbol">*</span>n<span class="sh-number">-1</span><span class="sh-symbol">;</span>i<span class="sh-symbol">++)</span>
    <span class="sh-cbracket">{</span>
        <span class="sh-keyword">if</span><span class="sh-symbol">(</span>fa<span class="sh-symbol">[</span>i<span class="sh-symbol">]==</span>fa<span class="sh-symbol">[</span>i<span class="sh-symbol">^</span><span class="sh-number">1</span><span class="sh-symbol">])</span>
        <span class="sh-cbracket">{</span>
            <span class="sh-keyword">return</span> <span class="sh-keyword">false</span><span class="sh-symbol">;</span>
        <span class="sh-cbracket">}</span>
        dy<span class="sh-symbol">[</span>fa<span class="sh-symbol">[</span>i<span class="sh-symbol">]]=</span>fa<span class="sh-symbol">[</span>i<span class="sh-symbol">^</span><span class="sh-number">1</span><span class="sh-symbol">];</span>
        dy<span class="sh-symbol">[</span>fa<span class="sh-symbol">[</span>i<span class="sh-symbol">^</span><span class="sh-number">1</span><span class="sh-symbol">]]=</span>fa<span class="sh-symbol">[</span>i<span class="sh-symbol">];</span>
        <span class="sh-keyword">for</span><span class="sh-symbol">(</span>j<span class="sh-symbol">=</span>p<span class="sh-symbol">[</span>i<span class="sh-symbol">];</span>j<span class="sh-number">+1</span><span class="sh-symbol">;</span>j<span class="sh-symbol">=</span>E<span class="sh-symbol">[</span>j<span class="sh-symbol">].</span>next<span class="sh-symbol">)</span>
        <span class="sh-cbracket">{</span>
           w<span class="sh-symbol">=</span>E<span class="sh-symbol">[</span>j<span class="sh-symbol">].</span>en<span class="sh-symbol">;</span>
           <span class="sh-keyword">if</span><span class="sh-symbol">(</span>fa<span class="sh-symbol">[</span>w<span class="sh-symbol">]!=</span>fa<span class="sh-symbol">[</span>i<span class="sh-symbol">])</span>
           <span class="sh-cbracket">{</span>
               ve<span class="sh-symbol">[</span>fa<span class="sh-symbol">[</span>w<span class="sh-symbol">]].</span><span class="sh-function">push_back</span><span class="sh-symbol">(</span>fa<span class="sh-symbol">[</span>i<span class="sh-symbol">]);</span>
               du<span class="sh-symbol">[</span>fa<span class="sh-symbol">[</span>i<span class="sh-symbol">]]++;</span>
           <span class="sh-cbracket">}</span>
        <span class="sh-cbracket">}</span>
    <span class="sh-cbracket">}</span>
    <span class="sh-keyword">for</span><span class="sh-symbol">(</span>i<span class="sh-symbol">=</span><span class="sh-number">1</span><span class="sh-symbol">;</span>i<span class="sh-symbol"><=</span>cnt<span class="sh-symbol">;</span>i<span class="sh-symbol">++)</span>
    <span class="sh-cbracket">{</span>
        <span class="sh-keyword">if</span><span class="sh-symbol">(</span>du<span class="sh-symbol">[</span>i<span class="sh-symbol">]==</span><span class="sh-number">0</span><span class="sh-symbol">)</span>
        <span class="sh-cbracket">{</span>
            que<span class="sh-symbol">.</span><span class="sh-function">push</span><span class="sh-symbol">(</span>i<span class="sh-symbol">);</span>
        <span class="sh-cbracket">}</span>
    <span class="sh-cbracket">}</span>
    <span class="sh-type">int</span> sta<span class="sh-symbol">;</span>
    <span class="sh-keyword">while</span><span class="sh-symbol">(</span>que<span class="sh-symbol">.</span><span class="sh-function">size</span><span class="sh-symbol">())</span>
    <span class="sh-cbracket">{</span>
        sta<span class="sh-symbol">=</span>que<span class="sh-symbol">.</span><span class="sh-function">front</span><span class="sh-symbol">();</span>
        que<span class="sh-symbol">.</span><span class="sh-function">pop</span><span class="sh-symbol">();</span>
        <span class="sh-keyword">if</span><span class="sh-symbol">(</span>biao<span class="sh-symbol">[</span>sta<span class="sh-symbol">]==-</span><span class="sh-number">1</span><span class="sh-symbol">)</span>
        <span class="sh-cbracket">{</span>
            biao<span class="sh-symbol">[</span>sta<span class="sh-symbol">]=</span><span class="sh-number">1</span><span class="sh-symbol">;</span>
            <span class="sh-keyword">for</span><span class="sh-symbol">(</span>i<span class="sh-symbol">=</span><span class="sh-number">0</span><span class="sh-symbol">;</span>i<span class="sh-symbol"><(</span><span class="sh-type">int</span><span class="sh-symbol">)</span>ve<span class="sh-symbol">[</span>sta<span class="sh-symbol">].</span><span class="sh-function">size</span><span class="sh-symbol">();</span>i<span class="sh-symbol">++)</span>
            <span class="sh-cbracket">{</span>
                w<span class="sh-symbol">=</span>ve<span class="sh-symbol">[</span>sta<span class="sh-symbol">][</span>i<span class="sh-symbol">];</span>
                du<span class="sh-symbol">[</span>w<span class="sh-symbol">]--;</span>
                <span class="sh-keyword">if</span><span class="sh-symbol">(</span>du<span class="sh-symbol">[</span>w<span class="sh-symbol">]==</span><span class="sh-number">0</span><span class="sh-symbol">)</span>
                    que<span class="sh-symbol">.</span><span class="sh-function">push</span><span class="sh-symbol">(</span>w<span class="sh-symbol">);</span>
            <span class="sh-cbracket">}</span>
            biao<span class="sh-symbol">[</span>dy<span class="sh-symbol">[</span>sta<span class="sh-symbol">]]=</span><span class="sh-number">0</span><span class="sh-symbol">;</span>
        <span class="sh-cbracket">}</span>
    <span class="sh-cbracket">}</span>
    <span class="sh-keyword">return</span> <span class="sh-keyword">true</span><span class="sh-symbol">;</span>
<span class="sh-cbracket">}</span>
<span class="sh-type">int</span> <span class="sh-function">main</span><span class="sh-symbol">()</span>
<span class="sh-cbracket">{</span>
    <span class="sh-type">int</span> i<span class="sh-symbol">,</span>ix<span class="sh-symbol">,</span>fc<span class="sh-symbol">;</span>
    <span class="sh-type">char</span> s1<span class="sh-symbol">[</span><span class="sh-number">20</span><span class="sh-symbol">],</span>s2<span class="sh-symbol">[</span><span class="sh-number">10</span><span class="sh-symbol">];</span>
    <span class="sh-keyword">while</span><span class="sh-symbol">(</span><span class="sh-function">scanf</span><span class="sh-symbol">(</span><span class="sh-string">"%d%d"</span><span class="sh-symbol">,&</span>n<span class="sh-symbol">,&</span>m<span class="sh-symbol">)&&</span>n<span class="sh-symbol">+</span>m<span class="sh-symbol">)</span>
    <span class="sh-cbracket">{</span>
        <span class="sh-function">init</span><span class="sh-symbol">();</span>
        <span class="sh-keyword">for</span><span class="sh-symbol">(</span>i<span class="sh-symbol">=</span><span class="sh-number">1</span><span class="sh-symbol">;</span>i<span class="sh-symbol"><</span>n<span class="sh-symbol">;</span>i<span class="sh-symbol">++)</span>
        <span class="sh-cbracket">{</span>
            ix<span class="sh-symbol">=</span><span class="sh-number">2</span><span class="sh-symbol">*</span>i<span class="sh-symbol">,</span>fc<span class="sh-symbol">=</span><span class="sh-number">2</span><span class="sh-symbol">*</span>i<span class="sh-number">+1</span><span class="sh-symbol">;</span>
            <span class="sh-function">add</span><span class="sh-symbol">(</span><span class="sh-number">2</span><span class="sh-symbol">*</span>ix<span class="sh-symbol">,</span><span class="sh-number">2</span><span class="sh-symbol">*</span>fc<span class="sh-number">+1</span><span class="sh-symbol">);</span>
            <span class="sh-function">add</span><span class="sh-symbol">(</span><span class="sh-number">2</span><span class="sh-symbol">*</span>fc<span class="sh-number">+1</span><span class="sh-symbol">,</span><span class="sh-number">2</span><span class="sh-symbol">*</span>ix<span class="sh-symbol">);</span>
            <span class="sh-function">add</span><span class="sh-symbol">(</span><span class="sh-number">2</span><span class="sh-symbol">*</span>fc<span class="sh-symbol">,</span><span class="sh-number">2</span><span class="sh-symbol">*</span>ix<span class="sh-number">+1</span><span class="sh-symbol">);</span>
            <span class="sh-function">add</span><span class="sh-symbol">(</span><span class="sh-number">2</span><span class="sh-symbol">*</span>ix<span class="sh-number">+1</span><span class="sh-symbol">,</span><span class="sh-number">2</span><span class="sh-symbol">*</span>fc<span class="sh-symbol">);</span>
        <span class="sh-cbracket">}</span>
        <span class="sh-keyword">for</span><span class="sh-symbol">(</span>i<span class="sh-symbol">=</span><span class="sh-number">1</span><span class="sh-symbol">;</span>i<span class="sh-symbol"><=</span>m<span class="sh-symbol">;</span>i<span class="sh-symbol">++)</span>
        <span class="sh-cbracket">{</span>
            <span class="sh-function">scanf</span><span class="sh-symbol">(</span><span class="sh-string">"%d%s%d%s"</span><span class="sh-symbol">,&</span>ix<span class="sh-symbol">,</span>s1<span class="sh-symbol">,&</span>fc<span class="sh-symbol">,</span>s2<span class="sh-symbol">);</span>
            <span class="sh-keyword">if</span><span class="sh-symbol">(</span>s1<span class="sh-symbol">[</span><span class="sh-number">0</span><span class="sh-symbol">]==</span><span class="sh-string">'h'</span><span class="sh-symbol">)</span>
                ix<span class="sh-symbol">=</span><span class="sh-number">2</span><span class="sh-symbol">*</span>ix<span class="sh-number">+1</span><span class="sh-symbol">;</span>
            <span class="sh-keyword">else</span>
                ix<span class="sh-symbol">=</span><span class="sh-number">2</span><span class="sh-symbol">*</span>ix<span class="sh-symbol">;</span>
            <span class="sh-keyword">if</span><span class="sh-symbol">(</span>s2<span class="sh-symbol">[</span><span class="sh-number">0</span><span class="sh-symbol">]==</span><span class="sh-string">'h'</span><span class="sh-symbol">)</span>
                fc<span class="sh-symbol">=</span><span class="sh-number">2</span><span class="sh-symbol">*</span>fc<span class="sh-number">+1</span><span class="sh-symbol">;</span>
            <span class="sh-keyword">else</span>
                fc<span class="sh-symbol">=</span><span class="sh-number">2</span><span class="sh-symbol">*</span>fc<span class="sh-symbol">;</span>
            <span class="sh-keyword">if</span><span class="sh-symbol">(</span>ix<span class="sh-symbol">==</span><span class="sh-number">0</span><span class="sh-symbol">||</span>fc<span class="sh-symbol">==</span><span class="sh-number">0</span><span class="sh-symbol">)</span>
                <span class="sh-keyword">continue</span><span class="sh-symbol">;</span>
            <span class="sh-keyword">if</span><span class="sh-symbol">(</span>ix<span class="sh-symbol">==</span><span class="sh-number">1</span><span class="sh-symbol">)</span>
            <span class="sh-cbracket">{</span>
                <span class="sh-function">add</span><span class="sh-symbol">(</span><span class="sh-number">2</span><span class="sh-symbol">*</span>fc<span class="sh-number">+1</span><span class="sh-symbol">,</span><span class="sh-number">2</span><span class="sh-symbol">*</span>fc<span class="sh-symbol">);</span>
            <span class="sh-cbracket">}</span>
            <span class="sh-keyword">else</span> <span class="sh-keyword">if</span><span class="sh-symbol">(</span>fc<span class="sh-symbol">==</span><span class="sh-number">1</span><span class="sh-symbol">)</span>
            <span class="sh-cbracket">{</span>
                <span class="sh-function">add</span><span class="sh-symbol">(</span><span class="sh-number">2</span><span class="sh-symbol">*</span>ix<span class="sh-number">+1</span><span class="sh-symbol">,</span><span class="sh-number">2</span><span class="sh-symbol">*</span>ix<span class="sh-symbol">);</span>
            <span class="sh-cbracket">}</span>
            <span class="sh-keyword">else</span>
            <span class="sh-cbracket">{</span>
                <span class="sh-function">add</span><span class="sh-symbol">(</span><span class="sh-number">2</span><span class="sh-symbol">*</span>ix<span class="sh-number">+1</span><span class="sh-symbol">,</span><span class="sh-number">2</span><span class="sh-symbol">*</span>fc<span class="sh-symbol">);</span>
                <span class="sh-function">add</span><span class="sh-symbol">(</span><span class="sh-number">2</span><span class="sh-symbol">*</span>fc<span class="sh-number">+1</span><span class="sh-symbol">,</span><span class="sh-number">2</span><span class="sh-symbol">*</span>ix<span class="sh-symbol">);</span>
            <span class="sh-cbracket">}</span>
        <span class="sh-cbracket">}</span>
        <span class="sh-keyword">if</span><span class="sh-symbol">(</span><span class="sh-function">solve</span><span class="sh-symbol">())</span>
        <span class="sh-cbracket">{</span>
            <span class="sh-type">bool</span> ok<span class="sh-symbol">=</span><span class="sh-keyword">true</span><span class="sh-symbol">;</span>
            <span class="sh-keyword">for</span><span class="sh-symbol">(</span>i<span class="sh-symbol">=</span><span class="sh-number">4</span><span class="sh-symbol">;</span>i<span class="sh-symbol"><=</span><span class="sh-number">4</span><span class="sh-symbol">*</span>n<span class="sh-number">-1</span><span class="sh-symbol">;</span>i<span class="sh-symbol">++)</span>
            <span class="sh-cbracket">{</span>
                <span class="sh-keyword">if</span><span class="sh-symbol">(</span>biao<span class="sh-symbol">[</span>fa<span class="sh-symbol">[</span>i<span class="sh-symbol">]]==</span><span class="sh-number">1</span><span class="sh-symbol">)</span>
                <span class="sh-cbracket">{</span>
                    <span class="sh-keyword">if</span><span class="sh-symbol">(</span>i<span class="sh-symbol">%</span><span class="sh-number">2</span><span class="sh-symbol">==</span><span class="sh-number">0</span><span class="sh-symbol">)</span>
                    <span class="sh-cbracket">{</span>
                        <span class="sh-keyword">if</span><span class="sh-symbol">(!</span>ok<span class="sh-symbol">)</span>
                            <span class="sh-function">printf</span><span class="sh-symbol">(</span><span class="sh-string">" "</span><span class="sh-symbol">);</span>
                        <span class="sh-keyword">else</span>
                            ok<span class="sh-symbol">=</span><span class="sh-keyword">false</span><span class="sh-symbol">;</span>
                        <span class="sh-function">printf</span><span class="sh-symbol">(</span><span class="sh-string">"%d"</span><span class="sh-symbol">,(</span>i<span class="sh-symbol">/</span><span class="sh-number">2</span><span class="sh-symbol">)/</span><span class="sh-number">2</span><span class="sh-symbol">);</span>
                        <span class="sh-keyword">if</span><span class="sh-symbol">((</span>i<span class="sh-symbol">/</span><span class="sh-number">2</span><span class="sh-symbol">)%</span><span class="sh-number">2</span><span class="sh-symbol">==</span><span class="sh-number">0</span><span class="sh-symbol">)</span>
                        <span class="sh-cbracket">{</span>
                            <span class="sh-function">printf</span><span class="sh-symbol">(</span><span class="sh-string">"w"</span><span class="sh-symbol">);</span>
                        <span class="sh-cbracket">}</span>
                        <span class="sh-keyword">else</span>
                            <span class="sh-function">printf</span><span class="sh-symbol">(</span><span class="sh-string">"h"</span><span class="sh-symbol">);</span>
                    <span class="sh-cbracket">}</span>
                <span class="sh-cbracket">}</span>
            <span class="sh-cbracket">}</span>
            <span class="sh-function">puts</span><span class="sh-symbol">(</span><span class="sh-string">""</span><span class="sh-symbol">);</span>
        <span class="sh-cbracket">}</span>
        <span class="sh-keyword">else</span>
            <span class="sh-function">puts</span><span class="sh-symbol">(</span><span class="sh-string">"bad luck"</span><span class="sh-symbol">);</span>
    <span class="sh-cbracket">}</span>
    <span class="sh-keyword">return</span> <span class="sh-number">0</span><span class="sh-symbol">;</span>
<span class="sh-cbracket">}</span>