Submission #5802117


Source Code Expand

Copy
#include <iostream>
#include <vector>
#include <map>
#include <string>
#include <algorithm>
#include <numeric>
#include <stack>
#include <cmath>
#include <utility>
#include <complex>

using ll = long long;
template <class T>
using vec = std::vector<T>;

using pos = std::complex<int>;

int main()
{
    using namespace std;

    vec<ll> costs(4);
    ll n;

    for (auto& e : costs)
    {
        cin >> e;
    }
    cin >> n;

    for (int i = 0; i < 3; ++i)
    {
        costs[i + 1] = min(costs[i + 1], costs[i] * 2);
    }

    ll ans{};

    if (n >= 2)
    {
        ans += (n / 2) * costs[3];
        n %= 2;
    }
    if (n == 1)
    {
        ans += costs[2];
    }

    cout << ans << endl;

    return 0;
}

Submission Info

Submission Time
Task A - Ice Tea Store
User siiiec
Language C++14 (GCC 5.4.1)
Score 300
Code Size 769 Byte
Status
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name Score / Max Score Test Cases
Sample 0 / 0 sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt
All 300 / 300 sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt
Case Name Status Exec Time Memory
sample_01.txt 1 ms 256 KB
sample_02.txt 1 ms 256 KB
sample_03.txt 1 ms 256 KB
sample_04.txt 1 ms 256 KB
subtask_1_01.txt 1 ms 256 KB
subtask_1_02.txt 1 ms 256 KB
subtask_1_03.txt 1 ms 256 KB
subtask_1_04.txt 1 ms 256 KB
subtask_1_05.txt 1 ms 256 KB
subtask_1_06.txt 1 ms 256 KB
subtask_1_07.txt 1 ms 256 KB
subtask_1_08.txt 1 ms 256 KB
subtask_1_09.txt 1 ms 256 KB
subtask_1_10.txt 1 ms 256 KB
subtask_1_11.txt 1 ms 256 KB
subtask_1_12.txt 1 ms 256 KB
subtask_1_13.txt 1 ms 256 KB
subtask_1_14.txt 1 ms 256 KB
subtask_1_15.txt 1 ms 256 KB