結果
問題 | No.967 引き算をして門松列(その2) |
ユーザー | Haar |
提出日時 | 2020-01-13 21:15:55 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,553 bytes |
コンパイル時間 | 2,157 ms |
コンパイル使用メモリ | 202,636 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-12-22 21:19:28 |
合計ジャッジ時間 | 2,848 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,248 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 | - |
ソースコード
#include <bits/stdc++.h> #define LLI long long int #define FOR(v, a, b) for(LLI v = (a); v < (b); ++v) #define FORE(v, a, b) for(LLI v = (a); v <= (b); ++v) #define REP(v, n) FOR(v, 0, n) #define REPE(v, n) FORE(v, 0, n) #define REV(v, a, b) for(LLI v = (a); v >= (b); --v) #define ALL(x) (x).begin(), (x).end() #define RALL(x) (x).rbegin(), (x).rend() #define ITR(it, c) for(auto it = (c).begin(); it != (c).end(); ++it) #define RITR(it, c) for(auto it = (c).rbegin(); it != (c).rend(); ++it) #define EXIST(c,x) ((c).find(x) != (c).end()) #define fst first #define snd second #define popcount __builtin_popcount #define UNIQ(v) (v).erase(unique(ALL(v)), (v).end()) #define bit(i) (1LL<<(i)) #ifdef DEBUG #include <misc/C++/Debug.cpp> #else #define dump(...) ((void)0) #endif #define gcd __gcd using namespace std; template <class T> constexpr T lcm(T m, T n){return m/gcd(m,n)*n;} template <typename I> void join(ostream &ost, I s, I t, string d=" "){for(auto i=s; i!=t; ++i){if(i!=s)ost<<d; ost<<*i;}ost<<endl;} template <typename T> istream& operator>>(istream &is, vector<T> &v){for(auto &a : v) is >> a; return is;} template <typename T, typename U> bool chmin(T &a, const U &b){return (a>b ? a=b, true : false);} template <typename T, typename U> bool chmax(T &a, const U &b){return (a<b ? a=b, true : false);} template <typename T, size_t N, typename U> void fill_array(T (&a)[N], const U &v){fill((U*)a, (U*)(a+N), v);} struct Init{ Init(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(12); cerr << fixed << setprecision(12); } }init; bool is_kadomatsu(LLI a, LLI b, LLI c){ if(a <= 0 or b <= 0 or c <= 0) return false; if(a == b or b == c or c == a) return false; if(a < b and b < c) return false; if(a > b and b > c) return false; return true; } LLI solve(LLI a, LLI b, LLI c, LLI x, LLI y, LLI z){ if(is_kadomatsu(a,b,c)) return 0; LLI ret = LLONG_MAX; if(a > c){ swap(a, c); swap(x, z); } if(a == b and b == c and c == a){ if(is_kadomatsu(a, b-1, c)) chmin(ret, y); if(is_kadomatsu(a-1, b, c-2)) chmin(ret, x + z*2); if(is_kadomatsu(a-2, b, c-1)) chmin(ret, x*2 + z); return ret; } if(a == b and b != c and c != a){ if(is_kadomatsu(a, b-1, c)) chmin(ret, y); if(is_kadomatsu(a-1, b, b-2)) chmin(ret, x + z*abs(c-(b-2))); if(is_kadomatsu(a-2, b, b-1)) chmin(ret, x*2 + z*abs(c-(b-1))); return ret; } if(a != b and b == c and c != a){ REPE(i,5){ REPE(j,5){ if(is_kadomatsu(a-i, b, c-j)) chmin(ret, x*i + z*j); } } /*if(is_kadomatsu(a, b, c-1)) chmin(ret, z); if(is_kadomatsu(a, b, c-2)) chmin(ret, z*2); if(is_kadomatsu(a-1, b, c-1)) chmin(ret, x+z);*/ if(is_kadomatsu(a, a-1, c)) chmin(ret, y*abs(b-(a-1))); return ret; } if(a != b and b != c and c == a){ if(a < b){ if(is_kadomatsu(a, b, c-1)) chmin(ret, z); if(is_kadomatsu(a-1, b, c)) chmin(ret, x); }else{ REPE(i,5){ REPE(j,5){ REPE(k,5){ if(is_kadomatsu(a-i, b-j, c-k)) chmin(ret, x*i + y*j + z*k); } } } } return ret; } REPE(i,5){ if(is_kadomatsu(a, b, b-i)) chmin(ret, z*abs(c-(b-i))); if(is_kadomatsu(a, a-i, c)) chmin(ret, y*abs(b-(a-i))); } return ret; } int main(){ int T; while(cin >> T){ REP(i,T){ LLI a,b,c,x,y,z; cin >> a >> b >> c >> x >> y >> z; auto ans = solve(a,b,c,x,y,z); cout << (ans == LLONG_MAX ? -1 : ans) << endl; } } return 0; }