# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
698076 | finn__ | City (BOI06_city) | C++17 | 1089 ms | 16888 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
uint64_t n, t, k;
cin >> n >> t >> k;
vector<uint64_t> c(k);
for (uint64_t &x : c)
cin >> x;
auto compare_cost = [&c, &t](pair<uint64_t, uint64_t> const &x, pair<uint64_t, uint64_t> const &y)
{
return t * x.first + c[x.second] > t * y.first + c[y.second];
};
priority_queue<pair<uint64_t, uint64_t>, vector<pair<uint64_t, uint64_t>>, decltype(compare_cost)> q(compare_cost);
q.emplace(0, 0);
uint64_t leftover = n, cost = 0;
while (leftover)
{
auto const [x, f] = q.top();
q.pop();
cost += min(leftover, 4 * (x + 1)) * (t * x + c[f]);
leftover -= min(leftover, 4 * (x + 1));
if (f + 1 < k)
q.emplace(x, f + 1);
if (!f)
q.emplace(x + 1, 0);
}
cout << cost << '\n';
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |