Submission #1539469

---

Source Code Expand

#include <algorithm>
#include <cstdio>
#include <cstring>
#include <vector>

const long long INF = 1000000000000000000LL;

int main()
{
#ifdef LOCAL_JUDGE
    freopen("A.in", "r", stdin);
#endif
    int n_, cost[4];
    while (scanf("%d%d%d%d%d", cost, cost + 1, cost + 2, cost + 3, &n_) == 5) {
        long long n = n_ * 4LL;
        long long result = INF;
        long long dp[8];
        for (int i = 0; i < 8; ++ i) {
            dp[i] = INF;
        }
        dp[0] = 0;
        for (int i = 0; i < 4; ++ i) {
            for (int j = 1 << i; j < 8; ++ j) {
                dp[j] = std::min(dp[j], dp[j - (1 << i)] + cost[i]);
            }
        }
        for (int i = 0; i < 4; ++ i) {
            result = std::min(result, dp[n % (1 << i)] + (n / (1 << i)) * cost[i]);
        }
        printf("%lld\n", result);
    }
}

Submission Info

Judge Result