Submission #2869453
Source Code Expand
#include <iostream> #include <cmath> #include <string> #include <algorithm> #include <set> #include <vector> #include <map> #include <list> #include <stack> #define REP(i, n) for(i=0; i<n; i++) #define REPR(i, n) for(i=n; i>=0; i--) #define FOR(i, m, n) for(i=m; i<n; i++) #define max(a, b) ((a)>(b) ? (a):(b)) #define min(a, b) ((a)<(b) ? (a):(b)) #define INF 10000000000 #define MOD 1000000007LL using namespace std; typedef long long ll; typedef pair<ll, ll> p; typedef pair<double, double> doup; ll rec(ll n); int main(void) { ll n, ans=0; doup pir[4]; double e[4], par[4]; cin >> e[0] >> e[1] >> e[2] >> e[3]; cin >> n; ll i; for(i=0; i<4; i++) { par[i]=e[i]/(0.25*pow(2, i)); pir[i]=make_pair(par[i], (0.25*(double)pow(2, i))); } sort(pir, pir+4); if(pir[0].second==2) { ans+=n/2*pir[0].first*2; n%=2; } ans+=n*pir[1].first; cout << ans; }
Submission Info
Submission Time | |
---|---|
Task | A - Ice Tea Store |
User | eQe |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 996 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 | AC | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | WA | 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 | AC | 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 | 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 | 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 | AC | 1 ms | 256 KB |
subtask_1_14.txt | WA | 1 ms | 256 KB |
subtask_1_15.txt | AC | 1 ms | 256 KB |