冒险者分队 (20 分) 哇啊哦

话不多说，先上代码

#include <bits/stdc++.h>
#define lowbit(x) (x & (-x))
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
const int LLINF = 0x3f3f3f3f3f3f3f3f;
const ll INF = 0x3f3f3f3f;
const double DINF = 1e20;
const double eps = 1e-8;
const double PI = acos(-1.0);
const int mod = 1e9 + 7;
const int SIZE = 18;
const int MAXN = 300010;
const int N = 1e6 + 50, M = 1e6 + 50;
const int maxn = 500;

ll arr[4];

inline ll Get(ll a, ll b, ll c)
{
    if (abs(a - b) % 60) return LLINF;
    ll res = LLINF;
    ll cnt = abs(a - b) / 60;
    ll newab = min(a, b) + cnt * 20;
    ll newc = c + cnt * 20;

    if (!newab && !newc) return cnt;

    if (newab * newc < 0) {
        ll temp1 = LLINF;
        if (newab % 20 == 0 && newc % 40 == 0) {
            if (abs(newab / 20) == abs(newc / 40)) {
                temp1 = abs(newab / 20);
            }
        }

        if (newab % 40 == 0 && newc % 20 == 0) {
            if (abs(newab / 40) == abs(newc / 20)) {
                temp1 = min(temp1, abs(newab / 40));
            }
        }

        res = min(res, cnt + temp1);
    }

    newab = min(a, b) + cnt * 40;
    newc = c - cnt * 20;

    if (newab * newc < 0) {
        ll temp1 = LLINF;
        if (newab % 20 == 0 && newc % 40 == 0) {
            if (abs(newab / 20) == abs(newc / 40)) {
                temp1 = abs(newab / 20);
            }
        }

        if (newab % 40 == 0 && newc % 20 == 0) {
            if (abs(newab / 40) == abs(newc / 20)) {
                temp1 = min(temp1, abs(newab / 40));
            }
        }

        res = min(res, cnt + temp1);
    }

    return res;
}

signed main()
{
    // freopen("in.txt", "r", stdin);
    // freopen("out.txt", "w", stdout);

    ll T; scanf("%lld", &T);

    while (T--) {
        ll a, b, c, aa, bb, cc; scanf("%lld%lld%lld%lld%lld%lld", &a, &b, &c, &aa, &bb, &cc);

        ll A = aa - a, B = bb - b, C = cc - c;
        arr[1] = A, arr[2] = B, arr[3] = C;

        ll res = LLINF;

        for (ll i = 1; i <= 3; i++) {
            for (ll j = i + 1; j <= 3; j++) {
                if (i == j || i == 6 - i - j || j == 6 - i - j) continue;
                res = min(res, Get(arr[i], arr[j], arr[6 - i - j]));
            }
        }

        if (res == LLINF) puts("-1");
        else printf("%lld\n", res);
    }

    return 0;
}

思路是啥子呢

假设差值为A, B, C(从初始状态到终止状态的差值）
那么在到终止状态之前肯定是形如20， 20， -40 或 40， -20， -20的形式，当然0， 0， 0就不用改变了。可以发现，肯定有两个数是相同的，那么怎么先让两个数相同，然后取最小即可。