# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
468947 | 2021-08-30T09:14:39 Z | Josia | Building Bridges (CEOI17_building) | C++14 | 60 ms | 8700 KB |
#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
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 204 KB | Output is correct |
2 | Correct | 1 ms | 332 KB | Output is correct |
3 | Correct | 1 ms | 460 KB | Output is correct |
4 | Correct | 60 ms | 8628 KB | Output is correct |
5 | Incorrect | 47 ms | 8700 KB | Output isn't correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 25 ms | 6604 KB | Output is correct |
2 | Incorrect | 25 ms | 6600 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 204 KB | Output is correct |
2 | Correct | 1 ms | 332 KB | Output is correct |
3 | Correct | 1 ms | 460 KB | Output is correct |
4 | Correct | 60 ms | 8628 KB | Output is correct |
5 | Incorrect | 47 ms | 8700 KB | Output isn't correct |