oj.uz

답안 #493767

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
493767 2021-12-12T23:56:21 Z vulpes City (BOI06_city) C++17
90 / 100
 1000 ms 88768 KB 
#include <bits/stdc++.h>
using namespace std;

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

bool cmp(const pair<ll,ll> &a, const pair<ll,ll> &b) {
    return a.first * t + c[a.second] <
           b.first * t + c[b.second];
}

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];
    }
    multiset<pair<ll,ll>, decltype(&cmp)> q(cmp);
    ll r = 0; q.insert({0, 0});
    map<ll,bool> m;
    while (n) {
        pair<ll,ll> h = *q.begin();
        q.erase(q.begin());
        ll z = min(n, 4 * (h.first + 1)); n -= z;
        r += z * (h.first * t + c[h.second]);
        if (h.second + 1 < k) {
            q.insert({h.first, h.second + 1});
        }
        if (!m[h.first + 1]) {
            m[h.first + 1] = true;
            q.insert({h.first + 1, 0});
        }
    }
    cout << r << endl;
}

Subtask #1
90.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 918 ms 88768 KB Output is correct
3 Correct 6 ms 1740 KB Output is correct
4 Correct 234 ms 404 KB Output is correct
5 Correct 16 ms 3112 KB Output is correct
6 Correct 7 ms 1612 KB Output is correct
7 Execution timed out 1094 ms 620 KB Time limit exceeded
8 Correct 731 ms 488 KB Output is correct
9 Correct 426 ms 784 KB Output is correct
10 Correct 0 ms 204 KB Output is correct