Submission #493762

#TimeUsernameProblemLanguageResultExecution timeMemory
493762vulpesCity (BOI06_city)C++17
60 / 100
1084 ms77736 KiB
#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; }
#Verdict Execution timeMemoryGrader output
Fetching results...