# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
730082 | thimote75 | City (BOI06_city) | C++14 | 1089 ms | 44476 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;
#define num long long
#define vn vector<num>
#define ph pair<num, pair<int, int>>
#define sp set<ph>
#define stage second.second
#define dist second.first
#define cost first
vn costs;
num N, T;
int K;
sp current;
ph next (ph &x) {
int s = x.stage + 1;
int d = x.dist;
num c = d * T + costs[s];
return { c, { d, s } };
}
ph create (int d) {
return { d * T + costs[0], { d, 0 } };
}
num count (int d) {
return 4 * d + 4;
}
int main () {
cin >> N >> T >> K;
costs.resize(K);
for (int i = 0; i < K; i ++) cin >> costs[i];
current.insert(create(0));
num ans = 0;
int i = 0;
while (N > 0) {
ph res = *(current.begin());
current.erase(res);
if (res.stage + 1 != K)
current.insert(next(res));
if (res.stage == 0)
current.insert(create(res.dist + 1));
num size = min(count(res.dist), N);
N -= size;
ans += size * res.cost;
}
cout << ans << endl;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |