Submission #3087916


Source Code Expand

Copy
#pr\
agma GCC optimize(2)
#include <cstdio>
#define min(a,b) ((a)<(b)?(a):(b))
#define ll long long
using namespace std;
ll a,b,c,d,n;
inline ll read()
{
    ll x=0,f=1;char ch=getchar();
    for (;ch<'0'||ch>'9';ch=getchar()) if (ch=='-') f=-1;
    for (;ch>='0'&&ch<='9';ch=getchar()) x=(x<<1)+(x<<3)+ch-'0';
    return x*f;
}
int main()
{
	a=read(),b=read(),c=read(),d=read(),n=read();
	c=min(c,min(a*4,b*2));
	printf("%lld\n",n&1?min(c*n,n/2*d+c):min(c*n,n/2*d));	
	return 0;
} 

Submission Info

Submission Time
Task A - Ice Tea Store
User luogu_bot2
Language C++14 (GCC 5.4.1)
Score 300
Code Size 502 Byte
Status
Exec Time 1 ms
Memory 128 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 0 ms 128 KB
sample_02.txt 0 ms 128 KB
sample_03.txt 0 ms 128 KB
sample_04.txt 0 ms 128 KB
subtask_1_01.txt 1 ms 128 KB
subtask_1_02.txt 1 ms 128 KB
subtask_1_03.txt 0 ms 128 KB
subtask_1_04.txt 1 ms 128 KB
subtask_1_05.txt 0 ms 128 KB
subtask_1_06.txt 0 ms 128 KB
subtask_1_07.txt 0 ms 128 KB
subtask_1_08.txt 0 ms 128 KB
subtask_1_09.txt 0 ms 128 KB
subtask_1_10.txt 0 ms 128 KB
subtask_1_11.txt 0 ms 128 KB
subtask_1_12.txt 0 ms 128 KB
subtask_1_13.txt 0 ms 128 KB
subtask_1_14.txt 0 ms 128 KB
subtask_1_15.txt 0 ms 128 KB