Submission #1539096


Source Code Expand

Copy
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<ctime>
#include<vector>
#include<queue>
#include<stack>
#include<map>
using namespace std;
#define FOR(i,s,e) for (int i=s;i<e;i++)
#define FOE(i,s,e) for (int i=s;i<=e;i++)
#define FOD(i,s,e) for (int i=s;i>=e;i--)
#define SET(a,e) memset(a,e,sizeof(a))
#define LL long long
#define LD long double
#define pb push_back
#define x first
#define y second
#define PII pair<int,int>
#define PLI pair<LL,int>
#define PIL pair<int,LL>
#define PLL pair<LL,LL>
#define eps 1e-9
#define mp make_pair

LL n,a,b,c,d,ans;

int main () {
	scanf("%lld%lld%lld%lld%lld",&a,&b,&c,&d,&n);
	b=min(a*2,b);
	c=min(b*2,c);
	d=min(c*2,d);
	ans=(n/2)*d+(n%2)*c;
	printf("%lld\n",ans);
	return 0;	
}

Submission Info

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

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:31:46: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld%lld%lld%lld%lld",&a,&b,&c,&d,&n);
                                              ^

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 0 ms 128 KB
subtask_1_02.txt 0 ms 128 KB
subtask_1_03.txt 0 ms 128 KB
subtask_1_04.txt 0 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