Contest Duration: ~ (local time) (150 minutes) Back to Home

Submission #1540302

Source Code Expand

Copy
```#include<iostream>
#include<algorithm>
#include<cstdio>
#include<functional>
#include<math.h>
#include<vector>
#include<map>
#include<string>
#include<set>
#include<unordered_set>
#include<unordered_map>
#define P pair<double,double>
using namespace std;

P a[4];//1Lあたりの値段　量
signed main() {
double b, c, d, e; cin >> b >> c >> d >> e;
double S; cin >> S;
a[0] = { b * 4,0.25 };
a[1] = { c * 2,0.5 };
a[2] = { d * 1,1 };
a[3] = { e * 0.5,2 };
sort(a, a + 4);
long long ans = 0;
for (int i = 0; i < 4; i++) {
long long f = floor(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 = floor(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 = floor(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 = floor(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 = floor(S / a[i].second);
ans += f*a[i].first*a[i].second;
S -= f*a[i].second;
}
cout << ans << endl;
}```

#### Submission Info

Submission Time 2017-08-26 21:20:11+0900 A - Ice Tea Store naoki2016 C++14 (GCC 5.4.1) 0 1230 Byte WA 1 ms 256 KB

#### Judge Result

Set Name Score / Max Score Test Cases
Sample 0 / 0 sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt
All 0 / 300 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 1 ms 256 KB
sample_02.txt 1 ms 256 KB
sample_03.txt 1 ms 256 KB
sample_04.txt 1 ms 256 KB
subtask_1_01.txt 1 ms 256 KB
subtask_1_02.txt 1 ms 256 KB
subtask_1_03.txt 1 ms 256 KB
subtask_1_04.txt 1 ms 256 KB
subtask_1_05.txt 1 ms 256 KB
subtask_1_06.txt 1 ms 256 KB
subtask_1_07.txt 1 ms 256 KB
subtask_1_08.txt 1 ms 256 KB
subtask_1_09.txt 1 ms 256 KB
subtask_1_10.txt 1 ms 256 KB
subtask_1_11.txt 1 ms 256 KB
subtask_1_12.txt 1 ms 256 KB
subtask_1_13.txt 1 ms 256 KB
subtask_1_14.txt 1 ms 256 KB
subtask_1_15.txt 1 ms 256 KB