Submission #1540567
Source Code Expand
#include<iostream> using namespace std; int min1(int a, int b, int c) { if(a<=b && a<=c) { return a; } else if(b<=a && b<=c) { return b; } else if(c<=a && c<=b) { return c; } else { return 0; } } int min2(int a, int b, int c, int d) { if(a<=b && a<=c && a<=d) { return a; } else if(b<=a && b<=c && b<=d) { return b; } else if(c<=a && c<=b && c<=d) { return c; } else if(d!=0 && d<=a&& d<=b && d<=c) { return d; } else { return 0; } } void out(int a) { cout << a << endl; } int main() { int q,h,s,d,n; cin>>q>>h>>s>>d>>n; int min_1=min1(q*4,h*2,s); //1Lの最安値 int min_2=min2(q*8,h*4,s*2,d); //2Lの最安値 cout << min_1 <<" " <<min_2 << endl; if(n==1) { cout << min_1 << endl; } else if(n>=2) { if(min_1*2<min_2) { cout << min_1*n << endl; } else if(min_1*2>=min_2) { if(n%2==1) { int cost = min_2*(n/2); n%=2; cost += min_1; cout << cost << endl; } else { cout << min_2*n/2 << endl; } } else {} } return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Ice Tea Store |
User | wander_a_street |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1224 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 |