# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
468947 | Josia | Building Bridges (CEOI17_building) | C++14 | 60 ms | 8700 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.
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx2")
#include <bits/stdc++.h>
#define int int64_t
using namespace std;
int dijkstra(vector<pair<int, int>> pillars) {
priority_queue<pair<int, int>> pq;
pq.push({0, 0});
vector<bool> visited(pillars.size());
while (!pq.empty()) {
int price = -pq.top().first;
int v = pq.top().second;
pq.pop();
if (v==pillars.size()-1) return price;
if (visited[v]) continue;
visited[v] = 1;
int destroyCost = 0;
for (int i = v+1; i<pillars.size(); i++) {
if (!visited[i]) pq.push({-price - destroyCost - (pillars[v].first-pillars[i].first)*(pillars[v].first-pillars[i].first), i});
destroyCost += pillars[i].second;
}
}
assert(false);
return -1;
}
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
int n; cin >> n;
vector<pair<int, int>> pillars(n);
for (int i = 0; i<n; i++) {
cin >> pillars[i].first;
}
for (int i = 0; i<n; i++) {
cin >> pillars[i].second;
}
pillars[0].second = 0;
pillars.back().second = 0;
cout << dijkstra(pillars) << "\n";
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |