Submission #2193954
Source Code Expand
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
//typedef pair<int,int> P;
int main(){
long long Q,H,S,D;
scanf("%lld %lld %lld %lld", &Q, &H, &S, &D);
long long N;
scanf("%lld", &N);
long long min = 8*Q;
long long min2;
bool isD = false;
if(min>4*H) min = 4*H;
if(min>2*S) min = 2*S;
min2 = min;
if(min>D){
isD = true;
min = D;
}
long long ans;
if(isD){
ans = (N/2)*D + (N%2)*min2/2;
}else{
ans = N*min/2;
}
printf("%lld\n", ans);
return 0;
}
Submission Info
Submission Time
2018-03-12 02:10:54+0900
Task
A - Ice Tea Store
User
uchina
Language
C++14 (GCC 5.4.1)
Score
300
Code Size
637 Byte
Status
AC
Exec Time
1 ms
Memory
128 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:18: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:20: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
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
128 KB
sample_02.txt
AC
1 ms
128 KB
sample_03.txt
AC
1 ms
128 KB
sample_04.txt
AC
1 ms
128 KB
subtask_1_01.txt
AC
1 ms
128 KB
subtask_1_02.txt
AC
1 ms
128 KB
subtask_1_03.txt
AC
1 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
1 ms
128 KB
subtask_1_07.txt
AC
1 ms
128 KB
subtask_1_08.txt
AC
1 ms
128 KB
subtask_1_09.txt
AC
1 ms
128 KB
subtask_1_10.txt
AC
1 ms
128 KB
subtask_1_11.txt
AC
1 ms
128 KB
subtask_1_12.txt
AC
1 ms
128 KB
subtask_1_13.txt
AC
1 ms
128 KB
subtask_1_14.txt
AC
1 ms
128 KB
subtask_1_15.txt
AC
1 ms
128 KB