제출 #1079581

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1079581		Staheos	City (BOI06_city)	C++14	50 / 100	1069 ms	26816 KiB

city

#include <iostream>
#include <queue>

using namespace std;

int main()
{
	long long n, t, k;
	cin >> n >> t >> k;
	long long* c = new long long[k];
	for (int i = 0; i < k; i++)
	{
		cin >> c[i];
	}

	auto q = priority_queue<pair<long long, pair<long long, long long>>, vector<pair<long long, pair<long long, long long>>>, std::greater<pair<long long, pair<long long, long long>>>>();
	long long s = 0;
	long long l = 0;

	for (int i = 0; i < 1000000; i++)
	{
		q.push(pair<long long, pair<long long, long long>>(c[0] + (i + 1 - 1) * t, pair<long long, long long>(i, 0))); // i, j
		//for (int j = 0; j < k; j++)
		//{
		//	// -1, bo |x| + |y| - 1
		//	//q.push(pair<long long, pair<long long, long long>>(c[j] + (i + 1 - 1) * t, pair<long long, long long>(j, (i + 1) * 4)));
		//	q.push(pair<long long, pair<long long, long long>>(c[j] + (i + 1 - 1) * t, pair<long long, long long>(i, j))); // i, j
		//}
	}

	while (l < n)
	{
		//cout << "DODANI: " << min(n - l, (long long)q.top().second) << ' ' << q.top().first * min(n - l, (long long)q.top().second) << '\n';
		//s = s + q.top().first * min(n - l, q.top().second);
		s = s + q.top().first * min(n - l, (q.top().second.first + 1) * 4);
		//l = l + min(n - l, (long long) q.top().second);
		l = l + min(n - l, (q.top().second.first + 1) * 4);
		
		q.push(pair<long long, pair<long long, long long>>(c[q.top().second.second + 1] + (q.top().second.first + 1 - 1) * t, pair<long long, long long>(q.top().second.first, q.top().second.second + 1)));
		q.pop();
	}

	cout << s << '\n';
}

• Subtask 1: 50 / 100