Submission #1540601
Source Code Expand
#include<iostream> #include<cstdio> #include<cmath> #include<cstring> #include<algorithm> #define fo(i,a,b) for(int i=a;i<=b;i++) #define fod(i,a,b) for(int i=a;i>=b;i--) using namespace std; typedef long long ll; double n; struct Cup{ double cupp; int val; bool operator < (const Cup &rhs) const { return double(rhs.val)/rhs.cupp>double(val)/cupp; } }a[5]; ll ans=0; int main() { a[1].cupp=0.25;a[2].cupp=0.5;a[3].cupp=1;a[4].cupp=2; scanf("%d%d%d%d%lf",&a[1].val,&a[2].val,&a[3].val,&a[4].val,&n); sort(a+1,a+1+4); while(n) { for(int i=1;i<=4;i++){ if(n>=a[i].cupp) { ans+=a[i].val; n-=a[i].cupp; break; } } } cout<<ans<<endl; }
Submission Info
Submission Time | |
---|---|
Task | A - Ice Tea Store |
User | Lifel |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 697 Byte |
Status | TLE |
Exec Time | 2103 ms |
Memory | 256 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:21:65: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%d%d%d%lf",&a[1].val,&a[2].val,&a[3].val,&a[4].val,&n); ^
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | 201 ms | 256 KB |
subtask_1_01.txt | AC | 1 ms | 256 KB |
subtask_1_02.txt | AC | 812 ms | 256 KB |
subtask_1_03.txt | AC | 812 ms | 256 KB |
subtask_1_04.txt | AC | 816 ms | 256 KB |
subtask_1_05.txt | AC | 1799 ms | 256 KB |
subtask_1_06.txt | AC | 455 ms | 256 KB |
subtask_1_07.txt | AC | 15 ms | 256 KB |
subtask_1_08.txt | AC | 480 ms | 256 KB |
subtask_1_09.txt | AC | 600 ms | 256 KB |
subtask_1_10.txt | AC | 1423 ms | 256 KB |
subtask_1_11.txt | TLE | 2103 ms | 256 KB |
subtask_1_12.txt | AC | 1621 ms | 256 KB |
subtask_1_13.txt | AC | 768 ms | 256 KB |
subtask_1_14.txt | AC | 801 ms | 256 KB |
subtask_1_15.txt | AC | 472 ms | 256 KB |