Submission #1539198


Source Code Expand

#include<algorithm> 
#include<bitset> 
#include<memory.h> 
#include<cstdio> 
#include<cmath> 
#define maxn 200010
#define ll long long
#define pa pair<ll,ll> 
#define ld long double 
#define For(i,x,y)  for(ll i=x;i<=y;++i) 
#define FOr(i,x,y)  for(ll i=x;i>=y;--i) 
using namespace std; 
inline ll read(){   ll x=0,f=1;char ch=getchar();   while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}  while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}  return x*f; } 
inline void write(ll x){    if (x<0) putchar('-'),x=-x; if (x>=10) write(x/10);   putchar(x%10+'0');  } 
inline void writeln(ll x){ write(x);   puts("");   }
ll ans,n;
int main(){
	ll x=read(),y=read(),z=read(),kkk=read();
	z=min(x<<2,min(y<<1,z));
	n=read();
	if (n&1)	ans+=z,--n;
	ans+=min(z*n,kkk*n/2);
	writeln(ans);
}

Submission Info

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

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 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 0 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