oj.uz

Submission #698072

# Submission time Handle Problem Language Result Execution time Memory
698072 2023-02-12T08:19:11 Z finn__ City (BOI06_city) C++17
90 / 100
 1000 ms 16584 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;
    uint64_t const w = sqrt(n);

    vector<uint64_t> c(k), curr_floor(w, 0);
    for (uint64_t &x : c)
        cin >> x;

    auto compare_cost = [&c, &curr_floor, &t](uint64_t x, uint64_t y)
    {
        return t * x + c[curr_floor[x]] > t * y + c[curr_floor[y]];
    };

    priority_queue<uint64_t, vector<uint64_t>, decltype(compare_cost)> q(compare_cost);
    for (uint64_t i = 0; i < w; i++)
        q.push(i);
    uint64_t leftover = n, cost = 0;

    while (leftover)
    {
        uint64_t x = q.top();
        q.pop();
        cost += min(leftover, 4 * (x + 1)) * (t * x + c[curr_floor[x]]);
        leftover -= min(leftover, 4 * (x + 1));
        curr_floor[x]++;
        if (curr_floor[x] < k)
            q.push(x);
    }

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

Subtask #1
90.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 201 ms 16400 KB Output is correct
3 Correct 4 ms 856 KB Output is correct
4 Correct 194 ms 1364 KB Output is correct
5 Correct 8 ms 1368 KB Output is correct
6 Correct 4 ms 856 KB Output is correct
7 Execution timed out 1088 ms 16584 KB Time limit exceeded
8 Correct 827 ms 2256 KB Output is correct
9 Correct 473 ms 2128 KB Output is correct
10 Correct 1 ms 212 KB Output is correct