oj.uz

Submission #493775

# Submission time Handle Problem Language Result Execution time Memory
493775 2021-12-13T00:25:33 Z vulpes City (BOI06_city) C++17
90 / 100
 1000 ms 25004 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
ll t, c[20002];

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    ll n, k; cin >> n >> t >> k;
    for (int i = 0; i < k; i++) {
        cin >> c[i];
    }
    priority_queue<tuple<ll,ll,ll>> q;
    ll r = 0, d = 1, t1, t2, t3, z;
    q.push({-c[0], 4, 0});
    while (n) {
        tie(t1, t2, t3) = q.top(); q.pop();
        z = min(n, t2); n -= z; r -= z * t1;
        if (t3 + 1 < k) {
            q.push({t1 - c[t3 + 1] + c[t3], t2, t3 + 1});
        }
        if (q.empty() || -c[0] - t * d > get<0>(q.top())) {
            q.push({-c[0] - t * d, 4 * d + 4, 0}); d++;
        }
    }
    cout << r << endl;
}

Subtask #1
90.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 105 ms 25004 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 90 ms 384 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Execution timed out 1094 ms 676 KB Time limit exceeded
8 Correct 256 ms 412 KB Output is correct
9 Correct 176 ms 476 KB Output is correct
10 Correct 0 ms 204 KB Output is correct