Submission #1543578


Source Code Expand

#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
typedef long long LL;

LL q, h, s, d, n, ans;
int a[10], f[10];
int main()
{
	scanf("%lld %lld %lld %lld", &q, &h, &s, &d);
	scanf("%lld", &n);
	f[1] = q * 8;
	f[2] = h * 4;
	f[3] = s * 2;
	f[4] = d;
	a[1] = f[1];
	for(int i = 1; i <= 4; i++)
	{
		a[1] = min(a[1], f[i]);
	}
	f[1] = q * 4;
	f[2] = h * 2;
	f[3] = s;
	a[2] = f[1];
	for(int i = 1; i <= 3; i++)
	{
		a[2] = min(a[2], f[i]);
	}
	if(2 * a[2] > a[1] && n > 1) {
		ans = (LL)(n / 2) * (LL)a[1];
		if(n % 2 == 1) ans += a[2];
	}
	else ans = (LL)n * (LL)a[2];
	printf("%lld\n", ans);
	return 0;
}

Submission Info

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

Compile Error

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

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 1 ms 128 KB
subtask_1_05.txt AC 1 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 1 ms 128 KB
subtask_1_12.txt AC 0 ms 128 KB
subtask_1_13.txt AC 1 ms 128 KB
subtask_1_14.txt AC 0 ms 128 KB
subtask_1_15.txt AC 0 ms 128 KB