Submission #1539343
Source Code Expand
#include <bits/stdc++.h> #define FOR(i,b,e) for(int i=(b); i <= (e); ++i) #define FORD(i,b,e) for(int i=(b); i >= (e); --i) #define REP(i,n) for(int i=0; i < (n); ++i) #define SIZE(c) (int) (c).size() #define ALL(c) (c).begin(), (c).end() #define PB push_back #define MP make_pair #define ST first #define ND second #define FWD(i,a,b) for (int i=(a); i<(b); ++i) #define BCK(i,a,b) for (int i=(a); i>(b); --i) #define PI 3.14159265358979311600 #define pb push_back #define mp make_pair #define st first #define nd second using namespace std; typedef long long ll; typedef pair <int, int> pii; typedef pair <ll, ll> pll; typedef vector < int > VI; typedef vector<ll> VL; typedef long double K; int main() { ios_base::sync_with_stdio(false); cin.tie(0); ll a[4]; REP(i, 4) cin >> a[i]; REP(i, 4) { int pw = 2; FOR (j, i + 1, 3) a[j] = min(a[j], pw * a[i]), pw *= 2; } ll n; cin >> n; n *= 4; ll result = 0; int pw[] = {8, 4, 2, 1}; REP(i, 4) { result += (n / pw[i]) * a[3 - i]; n %= pw[i]; } cout << result << '\n'; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Ice Tea Store |
User | nobik |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 1118 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 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 | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | AC | 1 ms | 256 KB |
sample_04.txt | AC | 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 | AC | 1 ms | 256 KB |
subtask_1_04.txt | AC | 1 ms | 256 KB |
subtask_1_05.txt | AC | 1 ms | 256 KB |
subtask_1_06.txt | AC | 1 ms | 256 KB |
subtask_1_07.txt | AC | 1 ms | 256 KB |
subtask_1_08.txt | AC | 1 ms | 256 KB |
subtask_1_09.txt | AC | 1 ms | 256 KB |
subtask_1_10.txt | AC | 1 ms | 256 KB |
subtask_1_11.txt | AC | 1 ms | 256 KB |
subtask_1_12.txt | AC | 1 ms | 256 KB |
subtask_1_13.txt | AC | 1 ms | 256 KB |
subtask_1_14.txt | AC | 1 ms | 256 KB |
subtask_1_15.txt | AC | 1 ms | 256 KB |