HDU 4115 Eliminate the Conflict（2-SAT）（2011 Asia ChengDu Regional Contest）

最新推荐文章于 2024-04-22 15:35:45 发布

weixin_30781775

最新推荐文章于 2024-04-22 15:35:45 发布

阅读量70

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/oyking/p/3178544.html

本文介绍了一种使用2-SAT算法解决冲突的游戏策略。通过预测对手的选择并结合特定的约束条件，文章展示了如何判断玩家是否有可能在游戏中获胜。

Problem Description

Conflicts are everywhere in the world, from the young to the elderly, from families to countries. Conflicts cause quarrels, fights or even wars. How wonderful the world will be if all conflicts can be eliminated.
Edward contributes his lifetime to invent a 'Conflict Resolution Terminal' and he has finally succeeded. This magic item has the ability to eliminate all the conflicts. It works like this:
If any two people have conflict, they should simply put their hands into the 'Conflict Resolution Terminal' (which is simply a plastic tube). Then they play 'Rock, Paper and Scissors' in it. After they have decided what they will play, the tube should be opened and no one will have the chance to change. Finally, the winner have the right to rule and the loser should obey it. Conflict Eliminated!
But the game is not that fair, because people may be following some patterns when they play, and if the pattern is founded by others, the others will win definitely.
Alice and Bob always have conflicts with each other so they use the 'Conflict Resolution Terminal' a lot. Sadly for Bob, Alice found his pattern and can predict how Bob plays precisely. She is very kind that doesn't want to take advantage of that. So she tells Bob about it and they come up with a new way of eliminate the conflict:
They will play the 'Rock, Paper and Scissors' for N round. Bob will set up some restricts on Alice.
But the restrict can only be in the form of "you must play the same (or different) on the ith and jth rounds". If Alice loses in any round or break any of the rules she loses, otherwise she wins.
Will Alice have a chance to win?

Input

The first line contains an integer T(1 <= T <= 50), indicating the number of test cases.
Each test case contains several lines.
The first line contains two integers N,M(1 <= N <= 10000, 1 <= M <= 10000), representing how many round they will play and how many restricts are there for Alice.
The next line contains N integers B₁,B₂, ...,B_N, where B_i represents what item Bob will play in the i^th round. 1 represents Rock, 2 represents Paper, 3 represents Scissors.
The following M lines each contains three integers A,B,K(1 <= A,B <= N,K = 0 or 1) represent a restrict for Alice. If K equals 0, Alice must play the same on A^th and B^thround. If K equals 1, she must play different items on Ath and Bthround.

Output

For each test case in the input, print one line: "Case #X: Y", where X is the test case number (starting with 1) and Y is "yes" or "no" represents whether Alice has a chance to win.

题目大意：现在你和别人玩石头剪刀布，你已经预知了别人第几次出什么，但是你有所限制：若A,B,K，K=0则ROUND A、B要出一样的，若A,B,K，K=1则ROUND A、B不能出一样的，完成n ROUND如果没有输过就算赢了。现在问能不能赢。

思路：2-SAT问题，首先别人出布，你肯定不能出石头，那么你只能在剩下的两个之中选一个，那么剪刀 OR 布 = true且石头=false；若A、B不能出一样的，比如那么对于剪刀来讲，A出了剪刀，B就不能出剪刀，B出了剪刀，A就不能出剪刀；A、B要一样也类似。最后，一局只能出一个，选一个其他两个就不能选。

  1 #include <cstdio>
  2 #include <cstring>
  3 
  4 const int MAXN = 10010*6;
  5 const int MAXM = 20*10010;
  6 const int WE = 6;
  7 
  8 struct TwoSAT{
  9     int n, ecnt, dfs_clock, scc_cnt;
 10     int St[MAXN], c;
 11     int head[MAXN], sccno[MAXN], pre[MAXN], lowlink[MAXN];
 12     int next[MAXM], to[MAXM];
 13 
 14     void init(int nn){
 15         n = nn;
 16         ecnt = 2; dfs_clock = scc_cnt = 0;
 17         memset(head,0,sizeof(head));
 18         memset(sccno,0,sizeof(sccno));
 19         memset(pre,0,sizeof(pre));
 20     }
 21 
 22     void addEdge(int x, int y){
 23         to[ecnt] = y; next[ecnt] = head[x]; head[x] = ecnt++;
 24         //printf("%d->%d\n",x,y);
 25     }
 26 
 27     void addEdge2(int x, int y){
 28         addEdge(x,y); addEdge(y,x);
 29     }
 30 
 31     void dfs(int u){
 32         lowlink[u] = pre[u] = ++dfs_clock;
 33         St[++c] = u;
 34         for(int p = head[u]; p; p = next[p]){
 35             int &v = to[p];
 36             if(!pre[v]){
 37                 dfs(v);
 38                 if(lowlink[u] > lowlink[v]) lowlink[u] = lowlink[v];
 39             }else if(!sccno[v]){
 40                 if(lowlink[u] > pre[v]) lowlink[u] = pre[v];
 41             }
 42         }
 43         if(lowlink[u] == pre[u]){
 44             ++scc_cnt;
 45             while(true){
 46                 int x = St[c--];
 47                 sccno[x] = scc_cnt;
 48                 if(x == u) break;
 49             }
 50         }
 51     }
 52 
 53     bool solve(){
 54         for(int i = 0; i < n; ++i)
 55             if(!pre[i]) dfs(i);
 56         for(int i = 0; i < n; i += 2)
 57             if(sccno[i] == sccno[i^1]) return false;
 58         return true;
 59     }
 60 
 61     void test(){
 62         for(int i = 0; i < n; ++i){
 63             printf("%d\n",i+1);
 64             for(int p = head[i]; p; p = next[p]) printf("%d ", to[p]+1);
 65         }
 66     }
 67 
 68 } G;
 69 
 70 int B[MAXN];
 71 
 72 int main(){
 73     int T, n, m, a, b, k;
 74     scanf("%d", &T);
 75     for(int t = 1; t <= T; ++t){
 76         scanf("%d%d",&n,&m);
 77         G.init(n*WE);
 78         for(int i = 0; i < n; ++i){
 79             scanf("%d", &b);
 80             if(b == 1) {
 81                 //G.addEdge(i*WE+2*2, i*WE+2*2+1);
 82                 G.addEdge(i*WE+1*2+1, i*WE+0*2);
 83                 G.addEdge(i*WE+0*2+1, i*WE+1*2);
 84             }
 85             if(b == 2) {
 86                 //G.addEdge(i*WE+0*2, i*WE+0*2+1);
 87                 G.addEdge(i*WE+1*2+1, i*WE+2*2);
 88                 G.addEdge(i*WE+2*2+1, i*WE+1*2);
 89             }
 90             if(b == 3) {
 91                 //G.addEdge(i*WE+1*2, i*WE+1*2+1);
 92                 G.addEdge(i*WE+0*2+1, i*WE+2*2);
 93                 G.addEdge(i*WE+2*2+1, i*WE+0*2);
 94             }
 95         }
 96         while(m--){
 97             scanf("%d%d%d", &a, &b, &k);
 98             --a, --b;
 99             if(k == 0){
100                 for(int i = 0; i < 3; ++i) {
101                     G.addEdge2(a*WE+i*2, b*WE+i*2);
102                     G.addEdge2(a*WE+i*2+1, b*WE+i*2+1);
103                 }
104             }else{
105                 for(int i = 0; i < 3; ++i){
106                     G.addEdge(a*WE+i*2, b*WE+i*2+1);
107                     G.addEdge(b*WE+i*2, a*WE+i*2+1);
108                 }
109             }
110         }
111         for(int i = 0; i < n; ++i)
112             for(int j = 0; j < 3; ++j)
113                 for(int k = 0; k < 3; ++k) if(j != k){
114                     G.addEdge(i*WE+j*2, i*WE+k*2+1);
115                 }
116         if(G.solve()) printf("Case #%d: yes\n", t);
117         else printf("Case #%d: no\n", t);
118     }
119     return 0;
120 }

93MS

思路2：2-SAT问题，首先别人出布，你肯定不能出石头，那么你只能在剩下的两个之中选一个，那么剪刀 xor 布 = true且石头=false；若A、B不能出一样的，比如那么对于剪刀来讲，A出了剪刀，B就不能出剪刀，B出了剪刀，A就不能出剪刀；A、B要一样也类似。

  1 #include <cstdio>
  2 #include <cstring>
  3 
  4 const int MAXN = 10010*6;
  5 const int MAXM = 20*10010;
  6 const int WE = 6;
  7 
  8 struct TwoSAT{
  9     int n, ecnt, dfs_clock, scc_cnt;
 10     int St[MAXN], c;
 11     int head[MAXN], sccno[MAXN], pre[MAXN], lowlink[MAXN];
 12     int next[MAXM], to[MAXM];
 13 
 14     void init(int nn){
 15         n = nn;
 16         ecnt = 2; dfs_clock = scc_cnt = 0;
 17         memset(head,0,sizeof(head));
 18         memset(sccno,0,sizeof(sccno));
 19         memset(pre,0,sizeof(pre));
 20     }
 21 
 22     void addEdge(int x, int y){
 23         to[ecnt] = y; next[ecnt] = head[x]; head[x] = ecnt++;
 24         //printf("%d->%d\n",x,y);
 25     }
 26 
 27     void addEdge2(int x, int y){
 28         addEdge(x,y); addEdge(y,x);
 29     }
 30 
 31     void dfs(int u){
 32         lowlink[u] = pre[u] = ++dfs_clock;
 33         St[++c] = u;
 34         for(int p = head[u]; p; p = next[p]){
 35             int &v = to[p];
 36             if(!pre[v]){
 37                 dfs(v);
 38                 if(lowlink[u] > lowlink[v]) lowlink[u] = lowlink[v];
 39             }else if(!sccno[v]){
 40                 if(lowlink[u] > pre[v]) lowlink[u] = pre[v];
 41             }
 42         }
 43         if(lowlink[u] == pre[u]){
 44             ++scc_cnt;
 45             while(true){
 46                 int x = St[c--];
 47                 sccno[x] = scc_cnt;
 48                 if(x == u) break;
 49             }
 50         }
 51     }
 52 
 53     bool solve(){
 54         int i;
 55         for(i = 0; i < n; ++i)
 56             if(!pre[i]) dfs(i);
 57         for(i = 0; i < n; i += 2)
 58             if(sccno[i] == sccno[i^1]) return false;
 59         return true;
 60     }
 61 
 62     void test(){
 63         for(int i = 0; i < n; ++i){
 64             printf("%d\n",i+1);
 65             for(int p = head[i]; p; p = next[p]) printf("%d ", to[p]+1);
 66         }
 67     }
 68 
 69 } G;
 70 
 71 int B[MAXN];
 72 
 73 int main(){
 74     int T, n, m, a, b, k;
 75     scanf("%d", &T);
 76     for(int t = 1; t <= T; ++t){
 77         scanf("%d%d",&n,&m);
 78         G.init(n*WE);
 79         for(int i = 0; i < n; ++i){
 80             scanf("%d", &b);
 81             if(b == 1) {
 82                 G.addEdge(i*WE+2*2, i*WE+2*2+1);
 83                 G.addEdge2(i*WE+1*2+1, i*WE+0*2);
 84                 G.addEdge2(i*WE+1*2, i*WE+0*2+1);
 85             }
 86             if(b == 2) {
 87                 G.addEdge(i*WE+0*2, i*WE+0*2+1);
 88                 G.addEdge2(i*WE+1*2+1, i*WE+2*2);
 89                 G.addEdge2(i*WE+1*2, i*WE+2*2+1);
 90             }
 91             if(b == 3) {
 92                 G.addEdge(i*WE+1*2, i*WE+1*2+1);
 93                 G.addEdge2(i*WE+0*2+1, i*WE+2*2);
 94                 G.addEdge2(i*WE+0*2, i*WE+2*2+1);
 95             }
 96         }
 97         while(m--){
 98             scanf("%d%d%d", &a, &b, &k);
 99             --a, --b;
100             if(k == 0){
101                 for(int i = 0; i < 3; ++i) {
102                     G.addEdge2(a*WE+i*2, b*WE+i*2);
103                     G.addEdge2(a*WE+i*2+1, b*WE+i*2+1);
104                 }
105             }else{
106                 for(int i = 0; i < 3; ++i){
107                     G.addEdge(a*WE+i*2, b*WE+i*2+1);
108                     G.addEdge(b*WE+i*2, a*WE+i*2+1);
109                 }
110             }
111         }
112         if(G.solve()) printf("Case #%d: yes\n", t);
113         else printf("Case #%d: no\n", t);
114     }
115     return 0;
116 }