Submission #1540602
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll Q,H,S,D;
double n;
pair<double ,double> per[5];
#define MP make_pair
map<double,ll> cost;
int main()
{
scanf("%lld%lld%lld%lld",&Q,&H,&S,&D);
scanf("%lf",&n);
per[1]=MP(Q*4.0,0.25),per[2]=MP(H*2.0,0.5),per[3]=MP(S*1.0,1.0),per[4]=MP(D/2.0,2.0);
cost[0.25]=Q,cost[0.5]=H,cost[1.0]=S,cost[2.0]=D;
sort(per+1,per+5);
int tmp=1;
ll Ans=0;
while(n>0.0 && tmp<=4){
int res=0;
//printf("n=%lf per[%d].second=%lf\n",n,tmp,per[tmp].second);
if(n>=per[tmp].second){
res=(int)floor(n/per[tmp].second);
//printf("res=%d\n",res);
n-=(double)res*per[tmp].second;
Ans+=res*cost[per[tmp].second];
}
tmp++;
}
printf("%lld\n",Ans);
return 0;
}
Submission Info
Submission Time
2017-08-26 21:26:38+0900
Task
A - Ice Tea Store
User
owarisunezeko
Language
C++14 (GCC 5.4.1)
Score
300
Code Size
860 Byte
Status
AC
Exec Time
1 ms
Memory
256 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:11:42: 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:12:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%lf",&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