結果

問題 No.966 引き算をして門松列（その１）
ユーザー keikei
提出日時 2020-01-13 20:42:25
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 20 ms / 2,000 ms
コード長 3,951 bytes
コンパイル時間 1,923 ms
コンパイル使用メモリ 173,164 KB
実行使用メモリ 6,820 KB
最終ジャッジ日時 2024-12-21 16:34:16
合計ジャッジ時間 2,564 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,820 KB
testcase_01 AC 2 ms
6,816 KB
testcase_02 AC 2 ms
6,816 KB
testcase_03 AC 2 ms
6,820 KB
testcase_04 AC 15 ms
6,816 KB
testcase_05 AC 16 ms
6,820 KB
testcase_06 AC 20 ms
6,816 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
template<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << "(" << o.first << "," << o.second << ")"; return out; }
template<class T> ostream& operator << (ostream& out,const vector<T>& V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << " ";} return out; }
template<class T> ostream& operator << (ostream& out,const vector<vector<T> >& Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; }
template<class S,class T> ostream& operator << (ostream& out,const map<S,T>& mp){ out << "{ "; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << ":" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << ", "; } out << " }"; return out; }
template<typename T>vector<T> make_v(size_t a){return vector<T>(a);}
template<typename T,typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));}
template<typename T,typename V> typename enable_if<is_class<T>::value==0>::type fill_v(T &t,const V &v){t=v;}
template<typename T,typename V> typename enable_if<is_class<T>::value!=0>::type fill_v(T &t,const V &v){for(auto &e:t) fill_v(e,v);}
/*
 <url:>
 問題文============================================================
 =================================================================
 解説=============================================================
 ================================================================
 */

bool isKadomatsu(ll A,ll B,ll C){
    if(A == B || B == C || C == A) return false;
    vector<ll> vs = {A,B,C};
    sort(vs.begin(),vs.end());
    if(vs[1] == A || vs[1] == C) return true;
    return false;
}
template<class Type>
Type solve(Type res = Type()){
    ll T; cin >> T;
    while(T--){
        ll A,B,C; cin >> A >> B >> C;
        
        if(isKadomatsu(A, B, C)){
            cout << 0 << endl;
            continue;
        }
        
        ll ans = LINF;
        if(A < C) swap(A,C);
        
        {// 1 3 2
            ll tA = A, tB = B, tC = C;
            ll T = 0;
            if(tA <= tC){
                T += tC-tA+1;
                tC = tA-1;
            }
            if(tC <= tB){
                T += tB-tC+1;
                tB = tC-1;
            }
            if(tA >= 1 && tB >= 1 && tC >= 1){
                ans = min(ans,T);
            }
        }
        {// 2 3 1
            ll tA = A, tB = B, tC = C;
            ll T = 0;
            if(tC <= tA){
                T += tA-tC+1;
                tA = tC-1;
            }
            if(tA <= tB){
                T += tB-tA+1;
                tB = tA-1;
            }
            if(tA >= 1 && tB >= 1 && tC >= 1){
                ans = min(ans,T);
            }
        }
        {// 2 1 3
            ll tA = A, tB = B, tC = C;
            ll T = 0;
            if(tB <= tA){
                T += tA-tB+1;
                tA = tB-1;
            }
            if(tA <= tC){
                T += tC-tA+1;
                tC = tA-1;
            }
            if(tA >= 1 && tB >= 1 && tC >= 1){
                ans = min(ans,T);
            }
        }
        {// 3 1 2
            ll tA = A, tB = B, tC = C;
            ll T = 0;
            if(tB <= tC){
                T += tC-tB+1;
                tC = tB-1;
            }
            if(tC <= tA){
                T += tA-tC+1;
                tA = tC-1;
            }
            if(tA >= 1 && tB >= 1 && tC >= 1){
                ans = min(ans,T);
            }
        }
        
        if(ans == LINF) ans = -1;
        
        cout << ans << endl;
        
    }
    return res;
}
int main(void) {
    cin.tie(0); ios::sync_with_stdio(false);
    solve<ll>(0);
    // cout << fixed << setprecision(12) << solve<ll>() << endl;
    return 0;
}
0