oj.uz

답안 #698140

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
698140 2023-02-12T12:58:19 Z finn__ City (BOI06_city) C++17
90 / 100
 1000 ms 16864 KB 
#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 p = q.top();
        q.pop();
        if (!p.second)
            q.emplace(p.first + 1, 0);
        while (leftover && !compare_cost(p, q.top()) && p.second < k)
        {
            cost += min(leftover, 4 * (p.first + 1)) * (t * p.first + c[p.second]);
            leftover -= min(leftover, 4 * (p.first + 1));
            p.second++;
        }
        if (p.second < k)
            q.push(p);
    }

    cout << cost << '\n';
}

Subtask #1
90.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 169 ms 16864 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 91 ms 384 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Execution timed out 1092 ms 584 KB Time limit exceeded
8 Correct 320 ms 436 KB Output is correct
9 Correct 180 ms 424 KB Output is correct
10 Correct 0 ms 212 KB Output is correct