hdu4371 Alice and Bob（博弈论）

Alice and Bob

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 55    Accepted Submission(s): 33

Problem Description

Alice and Bob are interested in playing games. One day, they invent a game which has rules below:
1. Firstly, Alice and Bob choose some random positive integers, and here we describe them as n, d ₁, d ₂,..., d _m.
2. Then they begin to write numbers alternately. At the first step, Alice has to write a “0”, here we let s ₁ = 0 ; Then, at the second step, Bob has to write a number s ₂ which satisfies the condition that s ₂ = s ₁ + d _k and s ₂ <= n, 1<= k <= m ; From the third step, the person who has to write a number in this step must write a number s _i which satisfies the condition that s _i = s _i-1 + d _k or s _i = s _i-1 - d _k , and s _i-2 < s _i <= n, 1 <= k <= m, i >= 3 at the same time.
3. The person who can’t write a legal number at his own step firstly lose the game.
Here’s the question, please tell me who will win the game if both Alice and Bob play the game optimally.

 

 

Input

At the beginning, an integer T indicating the total number of test cases.
Every test case begins with two integers n and m, which are described before. And on the next line are m positive integers d ₁, d ₂,..., d _m.
T <= 100;
1 <= n <= 10 ⁶;
1 <= m <= 100;
1 <= d _k <= 10 ⁶, 1 <= k <= m.

 

 

Output

For every test case, print “Case #k: ” firstly, where k indicates the index of the test case and begins from 1. Then if Alice will win the game, print “Alice”, otherwise “Bob”.

 

 

Sample Input

2

7 1

3

 

7 2

2 6

 

Sample Output

Case #1: Alice

Case #2: Bob

 

题意：Alice 和 Bob 轮流写数字，假设第 i 次的数字是 S（i） ，那么第 i+1 次的数字 S（i+1）= S（i）+d（k）或 S（i）-d（k），条件是 S（i+1）<= n && S（i-1）<S（i+1）。

分析：杂一看真的不好确定必输或必赢状态。那么直接想最后一步，什么时候就结束呢？s(i)+min > n 时就输了；那么s（i-1）又是什么情况呢？s(i-1) 可以选择一个 d（d >min） 或 min 这两种情况，如果选择了 min，那么下一步一定也要向上加，如果选择了是 d 那么有两种情况种是向下面减，和向上面加。于是可以发现先手如果选择了 min 那么后手只能向上加，如果先手选择了 d ，那么后手就可以减去 min ，这样可以保证自己永远有数可以写直到自己赢了。

 

View Code

 1 #include<iostream>
 2 #include<cstdio>
 3 using namespace std;
 4 int main()
 5 {
 6     int test,n,m,tmin,t,i,k;
 7     scanf("%d",&test);
 8     for(k=1;k<=test;k++)
 9     {
10         tmin=1000000;
11         scanf("%d %d",&n,&m);
12         for(i=0;i<m;i++)
13         {
14             scanf("%d",&t);
15             if(tmin>t)
16                 tmin=t;
17         }
18         n=n/tmin;
19         if(n&1) printf("Case #%d: Bob\n",k);
20         else printf("Case #%d: Alice\n",k);
21     }
22     return 0;
23 }

 

转载于:https://www.cnblogs.com/zhourongqing/archive/2012/08/16/2642966.html