SGU126 Boxes

SGU126 Boxes

题目大意

给出$(A,B)$两个数(要求$A \le B$，不满足则交换)
每次操作可将其变为$(A \times 2, B - A)$
问经过多少次操作后，其中一个数会变成0，若一直不会输出-1

算法思路

不难发现，要达到最终状态，前一状态只能是$A = B$
令$N = A + B$，如果N是奇数，则$A = B$不可能
否则数次操作后，$A$的形式为$A \times 2^k$
由于大小关系，此时$A$应变为$N - A \times 2^k$，答案等价于$(A \times 2^{k-1}, N \div 2)$
问题规模缩小，递归下去即可得出答案

时间复杂度: $O(log^{2}N)$

代码

/**
 * Copyright © 2015 Authors. All rights reserved.
 * 
 * FileName: 126.cpp
 * Author: Beiyu Li <sysulby@gmail.com>
 * Date: 2015-06-04
 */
#include <bits/stdc++.h>

using namespace std;

#define rep(i,n) for (int i = 0; i < (n); ++i)
#define For(i,s,t) for (int i = (s); i <= (t); ++i)
#define foreach(i,c) for (__typeof(c.begin()) i = c.begin(); i != c.end(); ++i)

typedef long long LL;
typedef pair<int, int> Pii;

const int inf = 0x3f3f3f3f;
const LL infLL = 0x3f3f3f3f3f3f3f3fLL;

int dfs(int v, int n)
{
        if (!v) return 0;
        if (n & 1) return -1;
        int res = 0;
        while (v <= n / 2) ++res, v *= 2;
        int t = dfs((n - v) / 2, n / 2);
        return ~t? res + t: -1;
}

int main()
{
        int a, b;
        scanf("%d%d", &a, &b);
        printf("%d\n", dfs(min(a, b), a + b));

        return 0;
}

---