HDU 6869 Slime and Stones (威佐夫博弈扩展)

原题题面

Orac and Slime are playing a game.
There are two groups of stones, the first group contains a stones and the second contains b stones. Orac and Slime operate them by turns in the game. For each operation, they have two choices:

1. Pick up any number of stones from a certain group;
2. Pick up $x$ stones from the first group and $y$ from the second group, which $x,y$ satisfy $|x-y|\le k$. $k$ is a given constant.
   Notice that not picking up any stone in an operation is not allowed. If there is no stone left in both groups at the beginning of one’s turn, he loses the game.
   Orac would like to know whether there exists a winning strategy for him if he operates first. They will play many times, so he will make multiple queries.

输入格式

The first line contains one integer $T(1\le T\le 10^5)$, which stands for the number of queries that Orac makes.
In the following $T$ lines, each line contains three integer $a,b,k(1\le a\le 10^8,1\le b\le 10^8,0\le k\le 10^8)$.

输出格式

The output contains $T$ lines, with an integer $0$ or $1$ in each line, stand for there exist/not exist a winning strategy for the given situation.

输入样例

4
1 2 0
2 4 0
1 2 1
2 6 1

输出样例

0
1
1
0

Hint

n the first query, if Orac picks up all the stones from a group, Slime will pick up all the stones from the other group, and if Orac picks up a stone from the second group, Slime will pick up a stone from both groups.

题面分析

易知$k=0$时为威佐夫博弈的一般形式。
当$k=1$时，我们可以利用威佐夫博弈的类似推导方法——去寻找必败态。
对于两个石堆$(a,b)$，不妨设$a\le b$，稍加打表可以得到
(1,3)
(2,6)
(4,10)
(5,13)
(7,17)
(8,20)
…
于是我们可以得到一个规律：
$a[i]=a[i]$和$b[i]$中未出现的最小值,$b[i]=a[i]+i\ast (k+1)$
我们知道威佐夫博弈的通项是$a[i]=[i\ast f],b[i]=a[i]+i,(f=\frac{1+\sqrt{5}}{2})$
这个和威佐夫博弈的形式很像，所以我们可以用类似的方法推导公式——Betty方程（具体证明过程请自行百度贝蒂定理，这里不再赘述）。
我们列出Betty方程$\frac{1}{\alpha }+\frac{1}{\alpha +k+1}=1$
解得$\alpha =\frac{1-k+\sqrt{k^2+2k+5}}{2}$
因此我们可以得到
$$a[i]=\lfloor \frac{1-k+\sqrt{k^2+2k+5}}{2}i\rfloor$$
$$b[i]=\lfloor \frac{3+k+\sqrt{k^2+2k+5}}{2}i\rfloor$$
所以验证的时候只需要先计算$i$即可。
注意到$$b[i]-a[i]=\lfloor (k+1)i\rfloor$$
所以$$i=\lfloor \frac{b[i]-a[i]}{k+1}\rfloor$$
然后验证下$a[i],b[i]$的值对不对即可(按理来说只需要验证一个，但$\alpha$是个浮点数，会有精度误差)

AC代码(78ms)

#include<bits/stdc++.h>
using namespace std;
const int maxn=5e7;
#define _rep(i, a, b) for(int i=(a);i<=(b);i++)
#define _repp(i, a, b) for(int i=(a);i<(b);i++)
#define _per(i, a, b) for(int i=(b);i>=(a);i--)
#define _pper(i, a, b) for(int i=(b);i>(a);i--)
#define mem(a) memset(a,0,sizeof(a))
double f1(double k)
{
    double delta=(sqrt(k*k+2*k+5.0)+1-k*1.0)/2.0;
    return delta;
}
double f2(double k)
{
    double delta=(sqrt(k*k+2*k+5.0)+3+k*1.0)/2.0;
    return delta;
}
inline void solve()
{
    int t;
    scanf("%d", &t);
    while(t--)
    {
        int a,b,k;
        scanf("%d%d%d",&a,&b,&k);
        if(a>b)
            swap(a,b);
        double k1=f1(k*1.0);
        double k2=f2(k*1.0);
        int d=(b-a)/(k+1);
        if(floor(d*k1)==a && floor(d*k2)==b)
        {
            printf("0\n");
        }
        else
        {
            printf("1\n");
        }
    }
}
signed main()
{
//    ios_base::sync_with_stdio(false);
//    cin.tie(0);
//    cout.tie(0);
#ifdef ACM_LOCAL
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w", stdout);
    long long test_index_for_debug=1;
    char acm_local_for_debug;
    while(cin>>acm_local_for_debug)
    {
        cin.putback(acm_local_for_debug);
        if (test_index_for_debug>100)
        {
            throw runtime_error("Check the stdin!!!");
        }
        auto start_clock_for_debug=clock();
        solve();
        auto end_clock_for_debug=clock();
        cout<<"\nTest "<<test_index_for_debug<<" successful"<<endl;
        cerr<<"Test "<<test_index_for_debug++<<" Run Time: "
            <<double(end_clock_for_debug-start_clock_for_debug)/CLOCKS_PER_SEC<<"s"<<endl;
        cout<<"--------------------------------------------------"<<endl;
    }
#else
    solve();
#endif
    return 0;
}

后记

赛时结束前5分钟推出结论，赛后5分钟迟迟AC…
DrGilbert 2020.8.18