結果

問題 No.158 奇妙なお使い
ユーザー fumiphysfumiphys
提出日時 2019-09-21 22:42:42
言語 C++14
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 28 ms / 5,000 ms
コード長 3,782 bytes
コンパイル時間 1,609 ms
コンパイル使用メモリ 168,272 KB
実行使用メモリ 51,364 KB
最終ジャッジ日時 2023-10-19 06:50:10
合計ジャッジ時間 4,443 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge11
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 15 ms
47,108 KB
testcase_01 AC 15 ms
50,604 KB
testcase_02 AC 14 ms
47,108 KB
testcase_03 AC 15 ms
50,588 KB
testcase_04 AC 28 ms
47,876 KB
testcase_05 AC 15 ms
50,588 KB
testcase_06 AC 16 ms
47,108 KB
testcase_07 AC 15 ms
50,588 KB
testcase_08 AC 15 ms
47,804 KB
testcase_09 AC 15 ms
50,588 KB
testcase_10 AC 15 ms
50,588 KB
testcase_11 AC 14 ms
50,588 KB
testcase_12 AC 14 ms
50,588 KB
testcase_13 AC 14 ms
50,588 KB
testcase_14 AC 14 ms
50,588 KB
testcase_15 AC 14 ms
50,596 KB
testcase_16 AC 15 ms
50,600 KB
testcase_17 AC 15 ms
50,600 KB
testcase_18 AC 17 ms
50,708 KB
testcase_19 AC 15 ms
50,592 KB
testcase_20 AC 15 ms
50,604 KB
testcase_21 AC 15 ms
50,844 KB
testcase_22 AC 17 ms
51,364 KB
testcase_23 AC 15 ms
50,588 KB
testcase_24 AC 15 ms
50,588 KB
testcase_25 AC 15 ms
50,588 KB
testcase_26 AC 15 ms
50,592 KB
testcase_27 AC 14 ms
50,588 KB
testcase_28 AC 15 ms
50,592 KB
testcase_29 AC 14 ms
50,592 KB
testcase_30 AC 15 ms
50,632 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// includes
#include <bits/stdc++.h>
using namespace std;

// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define bit(n) (1LL<<(n))
// functions
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
//  types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io{
  fast_io(){ios_base::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(20);}
} fast_io_;

int a[3], b[3], c[3], db, dc;
int memo[11][110][10010];

int calc(int a0, int a1, int a2){
  if(memo[a0][a1][a2] >= 0)return memo[a0][a1][a2];
  int res = 0;
  int tdb = db;
  int b0 = min(tdb / 1000, a0); tdb -= b0 * 1000;
  int b1 = min(tdb / 100, a1); tdb -= b1 * 100;
  int b2 = tdb;
  if(b2 <= a2){
    res = max(res, 1 + calc(a0 - b0 + b[0], a1 - b1 + b[1], a2 - b2 + b[2]));
  }
  tdb = dc;
  b0 = min(tdb / 1000, a0); tdb -= b0 * 1000;
  b1 = min(tdb / 100, a1); tdb -= b1 * 100;
  b2 = tdb;
  if(b2 <= a2){
    res = max(res, 1 + calc(a0 - b0 + c[0], a1 - b1 + c[1], a2 - b2 + c[2]));
  }
  return memo[a0][a1][a2] = res;
}

int main(int argc, char const* argv[])
{
  rep(i, 3)cin >> a[i];
  cin >> db;
  rep(i, 3)cin >> b[i];
  cin >> dc;
  rep(i, 3)cin >> c[i];
  rep(i, 11){
    rep(j, 101){
      rep(k, 10001)memo[i][j][k] = -1;
    }
  }
  cout << calc(a[0], a[1], a[2]) << endl;
  return 0;
}
0