Submission #1539846

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <algorithm>
#include <ctime>
#include <cassert>
#include <memory.h>

#define forn(i, n) for (int i = 0; i < int(n); ++i)
#define ford(i, n) for (int i = int(n) - 1; i >= 0; --i)
#define sz(c) int((c).size())
#define all(c) (c).begin(), (c).end()
#define mp(x, y) make_pair(x, y)
#define fst first
#define snd second

using namespace std;

using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using pii = pair<int, int>;
using vii = vector<pii>;
using vvi = vector<vi>;

#define FILE_NAME ""

ll q, h, s, d, n;
const ll inf = (ll)1e18;

bool read() {
  if (!(cin >> q >> h >> s >> d >> n)) {
    return 0;
  }
  return 1;
}

void solve() {
  n *= 4;
  ll cost = min({d, 2 * s, 4 * h, 8 * q});
  
  ll ans = (n / 8) * cost;
  n %= 8;

  vll dp(n + 1, inf);
  dp[0] = 0;
  vi add = {1, 2, 4, 8};
  vll cst = {q, h, s, d};
  
  forn (i, n) {
    forn (j, 4) if (i + add[j] <= n) {
      dp[i + add[j]] = min(dp[i + add[j]], dp[i] + cst[j]);  
    }
  }

  cout << dp[n] + ans << endl;
}

int main() {
#ifdef LOCAL
  freopen(FILE_NAME ".in", "r", stdin);
  freopen(FILE_NAME ".out", "w", stdout);
#endif

  ios_base::sync_with_stdio(false);

  while (read()) {
    solve();
  }

#ifdef LOCAL
  cerr << "Time: " << clock() * 1.0 / CLOCKS_PER_SEC << endl;
#endif
  return 0;
}

Submission Info

Judge Result