Submission #6368066
Source Code Expand
cost = list(map(int, input().split())) size = [1, 2, 4, 8] N = int(input()) * 4 ans = 0 while N > 0: min_ = (N // size[0]) * cost[0] q = 0 for i in range(1,4): tmp = (N//size[i]) * cost[i] if tmp < min_ and tmp != 0: min_ = tmp q = i ans += min_ N = N%size[q] print(ans)
Submission Info
Submission Time | |
---|---|
Task | A - Ice Tea Store |
User | jj_ |
Language | Python (3.4.3) |
Score | 300 |
Code Size | 348 Byte |
Status | AC |
Exec Time | 18 ms |
Memory | 3064 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 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 | 17 ms | 3060 KB |
sample_02.txt | AC | 17 ms | 3060 KB |
sample_03.txt | AC | 18 ms | 2940 KB |
sample_04.txt | AC | 17 ms | 3060 KB |
subtask_1_01.txt | AC | 17 ms | 3060 KB |
subtask_1_02.txt | AC | 17 ms | 3060 KB |
subtask_1_03.txt | AC | 17 ms | 3060 KB |
subtask_1_04.txt | AC | 18 ms | 2940 KB |
subtask_1_05.txt | AC | 17 ms | 3060 KB |
subtask_1_06.txt | AC | 17 ms | 3060 KB |
subtask_1_07.txt | AC | 17 ms | 3060 KB |
subtask_1_08.txt | AC | 17 ms | 3060 KB |
subtask_1_09.txt | AC | 17 ms | 3060 KB |
subtask_1_10.txt | AC | 17 ms | 2940 KB |
subtask_1_11.txt | AC | 17 ms | 3064 KB |
subtask_1_12.txt | AC | 18 ms | 3060 KB |
subtask_1_13.txt | AC | 17 ms | 3060 KB |
subtask_1_14.txt | AC | 17 ms | 3060 KB |
subtask_1_15.txt | AC | 17 ms | 3060 KB |