제출 #698077

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
698077		finn__	City (BOI06_city)	C++17	90 / 100	1087 ms	16840 KiB

city

#include <bits/stdc++.h>
using namespace std;

#pragma GCC optimize("O3")
#pragma GCC target("avx2")

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';
}

• Subtask 1: 90 / 100