Submission #1542297
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll qmul(ll a,ll b)//O(1) 二分乘法
{
ll ret = 0, k=a, sig = 1;
if(k<0)
{
sig=-1;
k=-k;
}
if(b<0)
{
sig*=-1 ;
b=-b;
}
while(b)
{
if(b&1)
ret=(ret+k);
k=(k+k);
b>>=1;
}
return ret*sig;
}
int main()
{
ll Q, H, S, D, N;
scanf("%lld%lld%lld%lld%lld", &Q, &H, &S, &D, &N);
ll a[] = {Q*4,H*2,S};
ll b[] = {Q*8,H*4,S*2,D};
sort(a,a+3);sort(b,b+4);
//ll ans = b[0] * (N / 2);
ll ans = qmul(b[0],N/2);
return !printf("%lld\n",N&1?ans+a[0]:ans);
}
Submission Info
Submission Time |
|
Task |
A - Ice Tea Store |
User |
luoyayu |
Language |
C++14 (GCC 5.4.1) |
Score |
300 |
Code Size |
686 Byte |
Status |
AC |
Exec Time |
1 ms |
Memory |
256 KB |
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:29:54: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%lld%lld%lld%lld%lld", &Q, &H, &S, &D, &N);
^
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
300 / 300 |
Status |
|
|
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 |
1 ms |
256 KB |
sample_02.txt |
AC |
1 ms |
256 KB |
sample_03.txt |
AC |
1 ms |
256 KB |
sample_04.txt |
AC |
1 ms |
256 KB |
subtask_1_01.txt |
AC |
1 ms |
256 KB |
subtask_1_02.txt |
AC |
1 ms |
256 KB |
subtask_1_03.txt |
AC |
1 ms |
256 KB |
subtask_1_04.txt |
AC |
1 ms |
256 KB |
subtask_1_05.txt |
AC |
1 ms |
256 KB |
subtask_1_06.txt |
AC |
1 ms |
256 KB |
subtask_1_07.txt |
AC |
1 ms |
256 KB |
subtask_1_08.txt |
AC |
1 ms |
256 KB |
subtask_1_09.txt |
AC |
1 ms |
256 KB |
subtask_1_10.txt |
AC |
1 ms |
256 KB |
subtask_1_11.txt |
AC |
1 ms |
256 KB |
subtask_1_12.txt |
AC |
1 ms |
256 KB |
subtask_1_13.txt |
AC |
1 ms |
256 KB |
subtask_1_14.txt |
AC |
1 ms |
256 KB |
subtask_1_15.txt |
AC |
1 ms |
256 KB |