oj.uz

답안 #493762

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

typedef long long ll;
const ll K = 20007;
ll t, c[K];

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

Subtask #1
60.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 695 ms 77736 KB Output is correct
3 Correct 6 ms 1356 KB Output is correct
4 Execution timed out 1084 ms 332 KB Time limit exceeded
5 Correct 12 ms 2380 KB Output is correct
6 Correct 5 ms 1228 KB Output is correct
7 Execution timed out 1084 ms 1388 KB Time limit exceeded
8 Incorrect 505 ms 608 KB Output isn't correct
9 Incorrect 403 ms 604 KB Output isn't correct
10 Correct 0 ms 204 KB Output is correct