結果
問題 | No.968 引き算をして門松列(その3) |
ユーザー |
![]() |
提出日時 | 2020-01-13 20:53:04 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 34 ms / 2,000 ms |
コード長 | 3,592 bytes |
コンパイル時間 | 1,382 ms |
コンパイル使用メモリ | 117,700 KB |
実行使用メモリ | 19,780 KB |
最終ジャッジ日時 | 2024-12-21 17:04:50 |
合計ジャッジ時間 | 2,050 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 10 |
ソースコード
#include<iostream>#include<string>#include<cstdio>#include<vector>#include<cmath>#include<algorithm>#include<functional>#include<iomanip>#include<queue>#include<ciso646>#include<random>#include<map>#include<set>#include<bitset>#include<stack>#include<unordered_map>#include<utility>#include<cassert>#include<complex>using namespace std;//#define int long longtypedef long long ll;typedef unsigned long long ul;typedef unsigned int ui;const ll mod = 1000000007;const ll INF = (1e+18) + 7;typedef pair<int, int>P;#define stop char nyaa;cin>>nyaa;#define rep(i,n) for(int i=0;i<n;i++)#define per(i,n) for(int i=n-1;i>=0;i--)#define Rep(i,sta,n) for(int i=sta;i<n;i++)#define rep1(i,n) for(int i=1;i<=n;i++)#define per1(i,n) for(int i=n;i>=1;i--)#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)#define all(v) (v).begin(),(v).end()typedef pair<ll, ll> LP;typedef long double ld;typedef pair<ld, ld> LDP;const ld eps = 1e-6;const ld pi = acos(-1.0);//typedef vector<vector<ll>> mat;typedef vector<int> vec;ll mod_pow(ll a, ll n) {ll res = 1;while (n) {if (n & 1)res = res * a%mod;a = a * a%mod; n >>= 1;}return res;}struct modint {ll n;modint() :n(0) { ; }modint(ll m) :n(m) {if (n >= mod)n %= mod;else if (n < 0)n = (n%mod + mod) % mod;}operator int() { return n; }};bool operator==(modint a, modint b) { return a.n == b.n; }modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }modint operator+(modint a, modint b) { return a += b; }modint operator-(modint a, modint b) { return a -= b; }modint operator*(modint a, modint b) { return a *= b; }modint operator^(modint a, int n) {if (n == 0)return modint(1);modint res = (a*a) ^ (n / 2);if (n % 2)res = res * a;return res;}ll inv(ll a, ll p) {return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);}modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }const int max_n = 1 << 20;modint fact[max_n], factinv[max_n];void init() {fact[0] = modint(1);for (int i = 0; i < max_n - 1; i++) {fact[i + 1] = fact[i] * modint(i + 1);}factinv[max_n - 1] = modint(1) / fact[max_n - 1];for (int i = max_n - 2; i >= 0; i--) {factinv[i] = factinv[i + 1] * modint(i + 1);}}modint comb(int a, int b) {if (a < 0 || b < 0 || a < b)return 0;return fact[a] * factinv[b] * factinv[a - b];}int dx[4] = { 1,0,-1,0 };int dy[4] = { 0,1,0,-1 };vector<ll> trans(vector<ll> &x, vector<int> &v) {ll mi = -INF;vector<ll> res(3);rep(i, 3) {res[v[i]] = max(mi + 1, x[v[i]]);mi = max(mi, res[v[i]]);}return res;}void solve() {ll a, b, c; cin >> a >> b >> c;vector<ll> x = { a,b,c };vector<ll> cost(3); rep(i, 3)cin >> cost[i];cost = { cost[1],cost[2],cost[0] };vector<int> v(3); rep(i, 3)v[i]=i;ll ans = INF;while (true) {vector<ll> las = trans(x, v);ll sum = 0;ll t = 0;rep(i, 3)t += (las[i] - x[i]);rep(i, 3)sum += cost[i]*(las[i]-x[i]);ll mi = min({ las[0],las[1],las[2] });ll ma = max({ las[0],las[1],las[2] });if (mi-t >= 1&&las[0]+las[1]+las[2]-mi-ma!=las[1]) {ans = min(ans, sum);}if (!next_permutation(v.begin(), v.end()))break;}if (ans == INF)ans = -1;cout << ans << endl;}signed main() {ios::sync_with_stdio(false);cin.tie(0);//cout << fixed << setprecision(7);//init();int t; cin >> t; rep(i, t)solve();//solve();stopreturn 0;}