Submission #1539183
Source Code Expand
/*
Author: CNYALI_LK
LANG: C++
PROG: A.cpp
*/
#include<bits/stdc++.h>
#define up(a,b,c) for (int a(b),a##end(c);a<=a##end;++a)
#define down(a,c,b) for (int a(b),a##end(c);a>=a##end;--a)
#define uup(a,c,b) for (int a(b),a##end(c);a<=a##end;++a)
#define udown(a,b,c) for (int a(b),a##end(c);a>=a##end;--a)
#define endl '\n'
#define debug(...) fprintf(stderr,__VA_ARGS__)
using namespace std;
const double eps=1e-8;
const double PI=acos(-1.0);
typedef long long ll;
template<class T>void chkmin(T &a,T b){a=a<b?a:b;}
template<class T>void chkmax(T &a,T b){a=a>b?a:b;}
template<class T>T sqr(T a){return a*a;}
template<class T>T mmin(T a,T b){return a<b?a:b;}
template<class T>T mmax(T a,T b){return a>b?a:b;}
int main(){
#ifdef cnyali_lk
freopen("in.txt","r",stdin);
freopen("out.txt","w",stdout);
#endif
int q,h,s,d,n;
scanf("%d%d%d%d%d",&q,&h,&s,&d,&n);
if(q*2<=h)h=q*2;
if(h*2<=s)s=h*2;
if(s*2<=d)d=s*2;
ll t=0;
t+=n/2;
t*=d;
if(n&1)t+=s;
printf("%lld\n",t);
return 0;
}
Submission Info
Submission Time
2017-08-26 21:04:29+0900
Task
A - Ice Tea Store
User
QAQAutoMaton
Language
C++14 (GCC 5.4.1)
Score
300
Code Size
1024 Byte
Status
AC
Exec Time
1 ms
Memory
256 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:28:36: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d%d%d%d",&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