Submission #1540423
Source Code Expand
#include<iostream> #include<algorithm> #include<cstdio> #include<functional> #include<vector> #include<map> #include<string> #include<set> #include<unordered_set> #include<unordered_map> #define int long long #define P pair<int,int> using namespace std; P a[4];//1Lあたりの値段 量 signed main() { double b, c, d, e; cin >> b >> c >> d >> e; double S; cin >> S; S *= 4; a[0] = { b * 8,1}; a[1] = { c * 4,2 }; a[2] = { d * 2,4 }; a[3] = { e * 1,8 }; sort(a, a + 4); long long ans = 0; for (int i = 0; i < 4; i++) { long long f = S / a[i].second; ans += f*a[i].first*a[i].second; S -= f*a[i].second; } for (int i = 0; i < 4; i++) { long long f = S / a[i].second; ans += f*a[i].first*a[i].second; S -= f*a[i].second; } for (int i = 0; i < 4; i++) { long long f = S / a[i].second; ans += f*a[i].first*a[i].second; S -= f*a[i].second; } for (int i = 0; i < 4; i++) { long long f = S / a[i].second; ans += f*a[i].first*a[i].second; S -= f*a[i].second; } for (int i = 0; i < 4; i++) { long long f = S / a[i].second; ans += f*a[i].first*a[i].second; S -= f*a[i].second; } for (int i = 0; i < 4; i++) { long long f = S / a[i].second; ans += f*a[i].first*a[i].second; S -= f*a[i].second; } for (int i = 0; i < 4; i++) { long long f = S / a[i].second; ans += f*a[i].first*a[i].second; S -= f*a[i].second; } cout << ans << endl; }
Submission Info
Submission Time | |
---|---|
Task | A - Ice Tea Store |
User | naoki2016 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1454 Byte |
Status | WA |
Exec Time | 1 ms |
Memory | 256 KB |
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 | WA | 1 ms | 256 KB |
sample_02.txt | WA | 1 ms | 256 KB |
sample_03.txt | WA | 1 ms | 256 KB |
sample_04.txt | WA | 1 ms | 256 KB |
subtask_1_01.txt | WA | 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 |