結果
問題 | No.2309 [Cherry 5th Tune D] 夏の先取り |
ユーザー | 👑 amentorimaru |
提出日時 | 2023-05-19 23:55:38 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 459 ms / 3,000 ms |
コード長 | 5,802 bytes |
コンパイル時間 | 3,825 ms |
コンパイル使用メモリ | 189,596 KB |
実行使用メモリ | 6,820 KB |
最終ジャッジ日時 | 2024-12-20 03:04:55 |
合計ジャッジ時間 | 15,952 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 22 ms
6,816 KB |
testcase_01 | AC | 245 ms
6,816 KB |
testcase_02 | AC | 218 ms
6,816 KB |
testcase_03 | AC | 232 ms
6,816 KB |
testcase_04 | AC | 213 ms
6,816 KB |
testcase_05 | AC | 203 ms
6,816 KB |
testcase_06 | AC | 208 ms
6,816 KB |
testcase_07 | AC | 208 ms
6,820 KB |
testcase_08 | AC | 239 ms
6,816 KB |
testcase_09 | AC | 216 ms
6,816 KB |
testcase_10 | AC | 198 ms
6,816 KB |
testcase_11 | AC | 198 ms
6,816 KB |
testcase_12 | AC | 202 ms
6,820 KB |
testcase_13 | AC | 234 ms
6,820 KB |
testcase_14 | AC | 195 ms
6,820 KB |
testcase_15 | AC | 224 ms
6,820 KB |
testcase_16 | AC | 187 ms
6,816 KB |
testcase_17 | AC | 222 ms
6,816 KB |
testcase_18 | AC | 201 ms
6,816 KB |
testcase_19 | AC | 183 ms
6,816 KB |
testcase_20 | AC | 189 ms
6,816 KB |
testcase_21 | AC | 180 ms
6,816 KB |
testcase_22 | AC | 161 ms
6,816 KB |
testcase_23 | AC | 184 ms
6,816 KB |
testcase_24 | AC | 248 ms
6,820 KB |
testcase_25 | AC | 210 ms
6,816 KB |
testcase_26 | AC | 249 ms
6,816 KB |
testcase_27 | AC | 211 ms
6,816 KB |
testcase_28 | AC | 208 ms
6,816 KB |
testcase_29 | AC | 227 ms
6,820 KB |
testcase_30 | AC | 243 ms
6,820 KB |
testcase_31 | AC | 423 ms
6,816 KB |
testcase_32 | AC | 422 ms
6,820 KB |
testcase_33 | AC | 423 ms
6,820 KB |
testcase_34 | AC | 420 ms
6,816 KB |
testcase_35 | AC | 419 ms
6,816 KB |
testcase_36 | AC | 52 ms
6,816 KB |
testcase_37 | AC | 13 ms
6,820 KB |
testcase_38 | AC | 38 ms
6,820 KB |
testcase_39 | AC | 23 ms
6,816 KB |
testcase_40 | AC | 33 ms
6,816 KB |
testcase_41 | AC | 459 ms
6,816 KB |
testcase_42 | AC | 457 ms
6,816 KB |
testcase_43 | AC | 233 ms
6,820 KB |
testcase_44 | AC | 231 ms
6,816 KB |
testcase_45 | AC | 194 ms
6,816 KB |
testcase_46 | AC | 205 ms
6,820 KB |
testcase_47 | AC | 49 ms
6,816 KB |
testcase_48 | AC | 55 ms
6,816 KB |
testcase_49 | AC | 156 ms
6,820 KB |
ソースコード
#define ATCODER #define _USE_MATH_DEFINES #include<stdio.h> #include<iostream> #include<fstream> #include<algorithm> #include<vector> #include<string> #include <cassert> #include <numeric> #include <unordered_map> #include <unordered_set> #include <queue> #include <math.h> #include <climits> #include <set> #include <map> #include <list> #include <random> #include <iterator> #include <bitset> using namespace std; using ll = long long; using ld = long double; using pll = pair<ll, ll>; using pdd = pair<ld, ld>; //template<class T> using pq = priority_queue<T, vector<T>, greater<T>>; #define FOR(i, a, b) for(ll i=(a); i<(b);i++) #define REP(i, n) for(ll i=0; i<(n);i++) #define ROF(i, a, b) for(ll i=(b-1); i>=(a);i--) #define PER(i, n) for(ll i=n-1; i>=0;i--) #define REPREP(i,j,a,b) for(ll i=0;i<a;i++)for(ll j=0;j<b;j++) #define VV(type) vector< vector<type> > #define VV2(type,n,m,val) vector< vector<type> > val;val.resize(n);for(ll i;i<n;i++)val[i].resize(m) #define vec(type) vector<type> #define VEC(type,n,val) vector<type> val;val.resize(n) #define VL vector<ll> #define VVL vector< vector<ll> > #define VP vector< pair<ll,ll> > #define SZ size() #define all(i) begin(i),end(i) #define SORT(i) sort(all(i)) #define BITI(i) (1<<i) #define BITSET(x,i) x | (ll(1)<<i) #define BITCUT(x,i) x & ~(ll(1)<<i) #define EXISTBIT(x,i) (((x>>i) & 1) != 0) #define ALLBIT(n) (ll(1)<<n-1) #define TOMAX(n,v) n=n<v?v:n #define TOMIN(n,v) n=n>v?v:n #define MP(a,b) make_pair(a,b) #define DET2(x1,y1,x2,y2) x1*y2-x2*y1 #define DET3(x1,y1,z1,x2,y2,z2,x3,y3,z3) x1*y2*z3+x2*y3*z1+x3*y1*z2-z1*y2*x3-z2*y3*x1-z3*y1*x2 #define INC(a) for(auto& v:a)v++; #define DEC(a) for(auto& v:a)v--; #define SQU(x) (x)*(x) #define L0 ll(0) #ifdef ATCODER #include <atcoder/all> using namespace atcoder; using mint = modint1000000007; using mint2 = modint998244353; #endif template<typename T = ll> vector<T> read(size_t n) { vector<T> ts(n); for (size_t i = 0; i < n; i++) cin >> ts[i]; return ts; } template<typename TV, const ll N> void read_tuple_impl(TV&) {} template<typename TV, const ll N, typename Head, typename... Tail> void read_tuple_impl(TV& ts) { get<N>(ts).emplace_back(*(istream_iterator<Head>(cin))); read_tuple_impl<TV, N + 1, Tail...>(ts); } template<typename... Ts> decltype(auto) read_tuple(size_t n) { tuple<vector<Ts>...> ts; for (size_t i = 0; i < n; i++) read_tuple_impl<decltype(ts), 0, Ts...>(ts); return ts; } using val = ll; using func = ll; val op(val a, val b) { return a + b; } val e() { return 0; } val mp(func f, val a) { if (f == -1) return a; return f; } func comp(func f, func g) { if (f == -1) return g; return f; } func id() { return -1; } ll di[4] = { 1,0,-1,0 }; ll dj[4] = { 0,1,0,-1 }; //ll di[4] = { -1,-1,1,1 }; //ll dj[4] = { -1,1,-1,1 }; ll di8[8] = { 0,-1,-1,-1,0,1,1,1 }; ll dj8[8] = { -1,-1,0,1,1,1,0,-1 }; ll z; bool f(ll v) { return v < z; } int main() { ll t; cin >> t; while (t--) { VL c = read(3); VL p = read(4); ll ans = 0; REP(i, 3) { // とりあえず全部買うので固定するもの REP(j, c[i] + 1) { ll tmp = 0; VL cc = c; cc[(i + 0) % 3] -= j; cc[(i + 1) % 3] -= j; tmp += j * p[i]; if (cc[0] < 0 || cc[1] < 0 || cc[2] < 0) continue; ll z = cc[(i + 0) % 3]; cc[(i + 2) % 3] -= z; cc[(i + 0) % 3] -= z; tmp += z * p[(i + 2) % 3]; if (cc[0] < 0 || cc[1] < 0 || cc[2] < 0) continue; tmp += min(cc[(i + 1) % 3], cc[(i + 2) % 3]) * p[(i + 1) % 3]; TOMAX(ans, tmp); } REP(j, c[i]) { ll tmp = p[3]; VL cc = c; cc[0]--; cc[1]--; cc[2]--; cc[(i + 0) % 3] -= j; cc[(i + 1) % 3] -= j; tmp += j * p[i]; if (cc[0] < 0 || cc[1] < 0 || cc[2] < 0) continue; ll z = cc[(i + 0) % 3]; cc[(i + 2) % 3] -= z; cc[(i + 0) % 3] -= z; tmp += z * p[(i + 2) % 3]; if (cc[0] < 0 || cc[1] < 0 || cc[2] < 0) continue; tmp += min(cc[(i + 1) % 3], cc[(i + 2) % 3]) * p[(i + 1) % 3]; TOMAX(ans, tmp); } } REP(k, 3) { // 全部買う奴その1+これを買わない奴は0or1 REP(i, 3) { // 全部買う奴その2 if (i == k) continue; REP(j, c[i] + 1) { ll tmp = 0; VL cc = c; cc[(i + 0) % 3] -= j; cc[(i + 1) % 3] -= j; cc[(i + 2) % 3] -= j; tmp += j * p[3]; if (cc[0] < 0 || cc[1] < 0 || cc[2] < 0) continue; ll z = cc[i]; cc[i] -= z; cc[k] -= z; ll kk = abs(i - k) != 1 ? 2 : min(i, k); tmp += z * p[kk]; ll jj = 3 ^ i ^ k; ll jk = abs(k - jj) != 1 ? 2 : min(k, jj); if (cc[0] < 0 || cc[1] < 0 || cc[2] < 0) continue; tmp += min(cc[k], cc[jj]) * p[jk]; TOMAX(ans, tmp); } REP(j, c[i] + 1) { ll jj = 3 ^ i ^ k; ll tmp = p[(k + 1)%3]; VL cc = c; cc[0]--; cc[1]--; cc[2]--; cc[k]++; cc[(i + 0) % 3] -= j; cc[(i + 1) % 3] -= j; cc[(i + 2) % 3] -= j; tmp += j * p[3]; if (cc[0] < 0 || cc[1] < 0 || cc[2] < 0) continue; ll z = cc[i]; cc[i] -= z; cc[k] -= z; ll kk = abs(i - k) > 1 ? 2 : min(i, k); ll jk = abs(k - jj) > 1 ? 2 : min(k, jj); tmp += z * p[kk]; if (cc[0] < 0 || cc[1] < 0 || cc[2] < 0) continue; tmp += min(cc[k], cc[jj]) * p[jk]; TOMAX(ans, tmp); } } } cout << ans << "\n"; } return 0; }