Submission #1539875


Source Code Expand

//Author: Lixiang
#include<stdio.h>
#include<algorithm>
#include<iostream>
using namespace std;
const double L[]={0,0.25,0.5,1,2};
const int maxn=5;
struct Cup{
	double val;
	double l;
	bool operator <(struct Cup b){
		return val*b.l<b.val*l;
	}
};
struct A{
	Cup a[maxn];
	int N;
	void init(){
		for(int i=1;i<=4;i++){
			scanf("%lf",&a[i].val);
			a[i].l=L[i];
		}
		sort(a+1,a+5);
		scanf("%d",&N);
	}
	void work(){
		double ans=0,cnt;
		for(int i=1;i<=4;i++){
			cnt=(int)(N/a[i].l);
			ans+=cnt*a[i].val;
			N-=a[i].l*cnt;
		}
		cout<<ans<<endl;
	}
}sol;
int main(){
	sol.init();
	sol.work();
	return 0;
}

Submission Info

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

Compile Error

./Main.cpp: In member function ‘void A::init()’:
./Main.cpp:20:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
    scanf("%lf",&a[i].val);
                          ^
./Main.cpp:24:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&N);
                 ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 3
WA × 1
AC × 7
WA × 16
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 WA 1 ms 256 KB
subtask_1_01.txt AC 1 ms 256 KB
subtask_1_02.txt WA 1 ms 256 KB
subtask_1_03.txt WA 1 ms 256 KB
subtask_1_04.txt WA 1 ms 256 KB
subtask_1_05.txt WA 1 ms 256 KB
subtask_1_06.txt WA 1 ms 256 KB
subtask_1_07.txt WA 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 WA 1 ms 256 KB
subtask_1_11.txt WA 1 ms 256 KB
subtask_1_12.txt WA 1 ms 256 KB
subtask_1_13.txt WA 1 ms 256 KB
subtask_1_14.txt WA 1 ms 256 KB
subtask_1_15.txt WA 1 ms 256 KB