Submission #1540401


Source Code Expand

Copy
#include<cstdio>
#include<algorithm>
using namespace std;
long long n,ans,a[11];
void dfs(long long k,long long t,long long s)
{
	if (s>=ans)return;
	if (!t)ans=s;
	if ((k==3)||(t<0))return;
	dfs(k+1,t,s);
	dfs(k,t-(1<<k),s+a[k]);
}
int main()
{
	for (int i=0;i<4;i++)scanf("%lld",&a[i]);
	scanf("%lld",&n);
	n*=4;
	ans=a[0]*(n%8);
	dfs(0,n%8,0);
	printf("%lld\n",ans+n/8*min(min(a[0]*8,a[1]*4),min(a[2]*2,a[3])));
}

Submission Info

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

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:15:42: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  for (int i=0;i<4;i++)scanf("%lld",&a[i]);
                                          ^
./Main.cpp:16:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld",&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