結果

問題 No.968 引き算をして門松列（その３）
ユーザー tsutajtsutaj
提出日時 2020-01-13 21:53:02
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 5,278 bytes
コンパイル時間 850 ms
コンパイル使用メモリ 101,860 KB
実行使用メモリ 6,948 KB
最終ジャッジ日時 2024-06-02 06:15:30
合計ジャッジ時間 1,729 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 WA -
testcase_03 WA -
testcase_04 WA -
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

// #define _GLIBCXX_DEBUG // for STL debug (optional)
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
#include <bitset>
using namespace std;
using ll = long long int;
using int64 = long long int;
 
template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}
 
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
const int INF = 1LL << 29;
const ll LONGINF = 1LL << 62;
const ll MOD = 1000000007LL;

void solve() {
    ll a, b, c, x, y, z; cin >> a >> b >> c >> x >> y >> z;
    ll res = LONGINF;

    /*
    // 真ん中を最も高く
    for(int p=0; p<2; p++) {
        for(int q=0; q<2; q++) {
            ll A = a, B = b, C = c, ans = 0;
            fprintf(stderr, "A = %lld, B = %lld, C = %lld\n", A, B, C);

            if(A >= B) {
                ll diff = A - (B - 1);
                if(p) {
                    ans += diff * z;
                    A -= diff, C -= diff;
                }
                else {
                    ans += diff * (x + z);
                    A -= 2 * diff, B -= diff, C -= diff;                    
                }
            }
            if(C >= B) {
                ll diff = C - (B - 1);
                if(q) {
                    ans += diff * z;
                    A -= diff, C -= diff;
                }
                else {
                    ans += diff * (y + z);
                    A -= diff, B -= diff, C -= 2 * diff;
                }
            }

            if(A == C) {
                if(x > y) {
                    ans += y;
                    B -= 1, C -= 1;
                }
                else {
                    ans += x;
                    A -= 1, B -= 1;
                }

                if(A == B) {
                    ans += z;
                    A -= 1, C -= 1;
                }
                if(B == C) {
                    ans += z;
                    A -= 1, C -= 1;
                }
            }


            bool ok = true;
            ok &= (A > 0 and B > 0 and C > 0);
            ok &= (A != B);
            ok &= (B != C);
            ok &= (C != A);
            if(ok) chmin(res, ans);
            
            fprintf(stderr, "1 (%d, %d): A = %lld, B = %lld, C = %lld, ans = %lld\n", p, q, A, B, C, ans);
        }
    }

    // 真ん中を最も低く
    {
        ll A = a, B = b, C = c, ans = 0;
        ll target = min(min(A, C) - 1, B);
        ans += (B - target) * (x + y);
        A -= (B - target);
        C -= (B - target);
        B -= (B - target) * 2;

        if(A == C) {
            if(x > y) {
                ans += y;
                B -= 1, C -= 1;
            }
            else {
                ans += x;
                A -= 1, B -= 1;
            }

            if(A == B) {
                ans += z;
                A -= 1, C -= 1;
            }
            if(B == C) {
                ans += z;
                A -= 1, C -= 1;
            }
        }
        
        bool ok = true;
        ok &= (A > 0 and B > 0 and C > 0);
        ok &= (A != B);
        ok &= (B != C);
        ok &= (C != A);
        if(ok) chmin(res, ans);
        fprintf(stderr, "2: A = %lld, B = %lld, C = %lld, ans = %lld\n", A, B, C, ans);
    }
    */


    {
        ll A = a, B = b, C = c, ans = 0;
        ll diff = max({A+1, C+1, B}) - B;
        ans += diff * z;
        A -= diff, C -= diff;

        if(A == C) {
            if(x > y) {
                ans += y;
                B -= 1, C -= 1;
            }
            else {
                ans += x;
                A -= 1, B -= 1;
            }

            if(A == B or B == C) {
                ans += z;
                A -= 1, C -= 1;
            }
        }

        bool ok = true;
        ok &= (A > 0 and B > 0 and C > 0);
        ok &= (A != B);
        ok &= (B != C);
        ok &= (C != A);
        if(ok) chmin(res, ans);
        fprintf(stderr, "1: A = %lld, B = %lld, C = %lld\n", A, B, C);
    }
    {
        ll A = a, B = b, C = c, ans = 0;
        ll diff = B - min({A-1, C-1, B});
        ans += diff * (x + y);
        A -= diff, C -= diff, B -= 2 * diff;

        if(A == C) {
            if(x > y) {
                ans += y;
                B -= 1, C -= 1;
            }
            else {
                ans += x;
                A -= 1, B -= 1;
            }

            if(A == B or B == C) {
                ans += z;
                A -= 1, C -= 1;
            }
        }
        
        bool ok = true;
        ok &= (A > 0 and B > 0 and C > 0);
        ok &= (A != B);
        ok &= (B != C);
        ok &= (C != A);
        if(ok) chmin(res, ans);
        fprintf(stderr, "2: A = %lld, B = %lld, C = %lld\n", A, B, C);
    }
    cout << (res == LONGINF ? -1 : res) << endl;
}

int main() {
    int T; cin >> T;
    while(T--) solve();
    return 0;
}
0