Submission #1540625


Source Code Expand

#include <cstdio>
#include <cmath>
#include <vector>
#include <iostream>
#include <set>
#include <queue>
#include <cstring>
#include <algorithm>
using namespace std;
#define mst(a,b) memset((a),(b),sizeof(a))
#define rush() int T;scanf("%d",&T);while(T--)

typedef long long ll;
const int maxn = 100005;
const ll mod = 1e9+7;
const int INF = 0x3f3f3f3f;
const double eps = 1e-9;

double n,m;

struct node
{
    double price,rate,w;
    int id;
}a[maxn];

bool cmp(const node a,const node b)
{
    return a.rate<b.rate;
}

int main()
{
    for(int i=1;i<=4;i++)
    {
        scanf("%lf",&a[i].w);
        if(i==1) a[i].price=0.25;
        if(i==2) a[i].price=0.50;
        if(i==3) a[i].price=1.00;
        if(i==4) a[i].price=2.00;
        a[i].rate=a[i].w/a[i].price;
        a[i].id=i;
    }
    scanf("%lf",&n);
    sort(a+1,a+5,cmp);
    if(a[1].id!=4)
    {
        ll ans=(ll)((ll)(1.0*n/(a[1].price))*a[1].w);
        printf("%lld\n",ans);
    }
    else
    {
        ll temp=(ll)n;
        if(temp%2==0)
        {
            ll ans=(ll)((ll)(1.0*n/(a[1].price))*a[1].w);
            printf("%lld\n",ans);
        }
        else
        {
            ll ans=(ll)((1.0*(n-1)/(a[1].price))*a[1].w+(ll)(1.0/(a[2].price))*a[2].w);
            printf("%lld\n",ans);
        }
    }
    return 0;
}

Submission Info

Submission Time
Task A - Ice Tea Store
User Lotus26
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1369 Byte
Status WA
Exec Time 1 ms
Memory 256 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:36:29: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lf",&a[i].w);
                             ^
./Main.cpp:44: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 0 / 300
Status
AC × 4
AC × 19
WA × 4
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 WA 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 WA 1 ms 256 KB
subtask_1_09.txt WA 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 WA 1 ms 256 KB
subtask_1_15.txt AC 1 ms 256 KB