Submission #1916158


Source Code Expand

#include <cstring>
#include <cstdio>
#include <algorithm>
#define ld long double
#define ll long long
using namespace std;

int N, Q, H, S, D;
ll vq, vh, vs, vd, vmin;

int main() {
    scanf("%d%d%d%d%d", &Q, &H, &S, &D, &N);
    vq = Q * 8LL, vh = H * 4LL, vs = S * 2LL, vd = D;
    vmin = min( min(vq, vh), min(vs, vd) );

    ll Ans = 0;
    if(vmin == vq) Ans = (ll)N * 4 * Q;
    else if(vmin == vh) Ans = (ll)N * 2 * H;
    else if(vmin == vs) Ans = (ll)N * S;
    else {
    	Ans = (ll)(N / 2) * D;
        if(N & 1) Ans += min( min(4 * Q, 2 * H), S );
    }
    printf("%lld", Ans);
}

Submission Info

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

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:12:44: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d%d%d%d", &Q, &H, &S, &D, &N);
                                            ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 4
AC × 23
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt
All 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 AC 1 ms 128 KB
sample_02.txt AC 1 ms 128 KB
sample_03.txt AC 1 ms 128 KB
sample_04.txt AC 1 ms 128 KB
subtask_1_01.txt AC 1 ms 128 KB
subtask_1_02.txt AC 1 ms 128 KB
subtask_1_03.txt AC 1 ms 128 KB
subtask_1_04.txt AC 1 ms 128 KB
subtask_1_05.txt AC 1 ms 128 KB
subtask_1_06.txt AC 1 ms 128 KB
subtask_1_07.txt AC 1 ms 128 KB
subtask_1_08.txt AC 1 ms 128 KB
subtask_1_09.txt AC 1 ms 128 KB
subtask_1_10.txt AC 1 ms 128 KB
subtask_1_11.txt AC 0 ms 128 KB
subtask_1_12.txt AC 0 ms 128 KB
subtask_1_13.txt AC 1 ms 128 KB
subtask_1_14.txt AC 1 ms 128 KB
subtask_1_15.txt AC 1 ms 128 KB