# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
493762 | vulpes | City (BOI06_city) | C++17 | 1084 ms | 77736 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |