Submission #1541237


Source Code Expand

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <map>
#include <functional>

using namespace std;
typedef long long lint;
typedef pair<lint, lint> Pii;

#define MIN(a,b) ((a)<(b)?(a):(b))
#define MAX(a,b) ((a)>(b)?(a):(b))

template <typename _KTy, typename _Ty>
ostream& operator << (ostream& ostr, const pair<_KTy, _Ty>& m) {
	cout << "{" << m.first << ", " << m.second << "}";
	return ostr;
}

template <typename _KTy, typename _Ty>
ostream& operator << (ostream& ostr, const map<_KTy, _Ty>& m) {
	if (m.empty()) {
		cout << "{ }";
		return ostr;
	}
	cout << "{" << *m.begin();
	for (auto itr = ++m.begin(); itr != m.end(); itr++) {
		cout << ", " << *itr;
	}
	cout << "}";
	return ostr;
}

struct compare {
	bool operator() (Pii a, Pii b) {
		return ((double)a.second / a.first) > ((double)b.second / b.first);
	}
};

int main()
{
	lint V[4], N, ans = 0;
	cin >> V[0] >> V[1] >> V[2] >> V[3];
	cin >> N;

	//val per 2L
	priority_queue<Pii, vector<Pii>, compare > pq;
	pq.push(Pii(1, V[0] * 4));
	pq.push(Pii(2, V[1] * 4));
	pq.push(Pii(4, V[2] * 4));
	pq.push(Pii(8, V[3] * 4));
	N *= 4;

	while (pq.size()) {
		ans += (N / pq.top().first) * pq.top().second;
		N -= pq.top().first * (N / pq.top().first);
		pq.pop();
	}

	cout << ans / 4 << endl;

	return 0;
}

Submission Info

Submission Time
Task A - Ice Tea Store
User komori3
Language C++14 (GCC 5.4.1)
Score 300
Code Size 1436 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 4
AC × 23
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