Submission #1538963


Source Code Expand

Copy
#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<deque>
#include<string>
#include<string.h>
#include<vector>
#include<set>
#include<map>
#include<stdlib.h>
#include<cassert>
using namespace std;
const long long mod=1000000009;
const long long inf=mod*mod;
const long long d2=500000004;
const double EPS=1e-10;
const double PI=acos(-1.0);
int ABS(int a){return max(a,-a);}
long long ABS(long long a){return max(a,-a);}

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

Submission Info

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

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:24: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,&e);
                                              ^

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