Submission #2399305


Source Code Expand

//只有p4特殊,其余三个都可以选择如果一元的单价小就买光
//P1 P2 P3选一个最小的pX
//如果是偶数而且p4小于pX那么全买第四种
//如果是偶数且P4大于pX那么全买第PX种
//如果是奇数且大于 那么全买第px种
//如果是奇数且小于 那么买n/2个p4
#include<bits/stdc++.h>
using namespace std;
long long P1,P2,P3,PX,Q,H,S,D,N;
double P4=D/2;
long long ans;
int main()
{
    scanf("%lld %lld %lld %lld %lld",&Q,&H,&S,&D,&N);
    P1=Q*4;
    P2=H*2;
    P3=S;
    PX=min(min(P1,P2),P3);
    P4=(double)D/2;
    if(N&1)
    {
        if(P4>=PX)
        {
            ans=N*PX;
        }
        else
        {
            ans=N/2*D+PX;
        }
    }
    else
    {
        if(P4>=PX)
        {
            ans=N*PX;
        }
        else
        {
            ans=N/2*D;
        }
    }
    printf("%lld\n",ans);
}

Submission Info

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

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:14:53: 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
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 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