Submission #1543411
Source Code Expand
#include<cstdio>
#include<cstring>
#include<algorithm>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define Rep(i,x) for(int i=head[x];i+1;i=nxt[i])
#define rep2(i,a,b) for(int i=(a);i<(b);i++)
#define ff first
#define ss second
using namespace std;
const int N=200005;
const int inf=1e9+7;
typedef long long ll;
//------------------------------------------head---------------------------------------------------//
int main()
{
ll a,b,c,d,n;scanf("%lld%lld%lld%lld%lld",&a,&b,&c,&d,&n);
ll f1=min(4ll*a,min(2ll*b,c));
ll f2=min(f1*2ll,d);
ll ans=(n/2ll)*f2;
if(n&1)ans+=f1;
printf("%lld\n",ans);
return 0;
}
Submission Info
Submission Time
2017-08-26 22:38:22+0900
Task
A - Ice Tea Store
User
sillybee
Language
C++14 (GCC 5.4.1)
Score
300
Code Size
684 Byte
Status
AC
Exec Time
1 ms
Memory
128 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:17:59: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
ll a,b,c,d,n;scanf("%lld%lld%lld%lld%lld",&a,&b,&c,&d,&n);
^
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
300 / 300
Status
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
0 ms
128 KB
sample_02.txt
AC
0 ms
128 KB
sample_03.txt
AC
0 ms
128 KB
sample_04.txt
AC
0 ms
128 KB
subtask_1_01.txt
AC
0 ms
128 KB
subtask_1_02.txt
AC
0 ms
128 KB
subtask_1_03.txt
AC
0 ms
128 KB
subtask_1_04.txt
AC
1 ms
128 KB
subtask_1_05.txt
AC
0 ms
128 KB
subtask_1_06.txt
AC
0 ms
128 KB
subtask_1_07.txt
AC
0 ms
128 KB
subtask_1_08.txt
AC
0 ms
128 KB
subtask_1_09.txt
AC
0 ms
128 KB
subtask_1_10.txt
AC
0 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
0 ms
128 KB
subtask_1_14.txt
AC
0 ms
128 KB
subtask_1_15.txt
AC
0 ms
128 KB