Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <queue>
- #include <cmath>
- #include <vector>
- using namespace std;
- struct node {
- int idx;
- double shortest_path;
- node () {}
- node(int _idx, double _shortest_path) {
- idx = _idx;
- shortest_path = _shortest_path;
- }
- bool operator < (const node & tmp) const {
- return shortest_path > tmp.shortest_path;
- }
- };
- const int maxn = 505;
- int main(){
- int n;
- cin >> n;
- int a[n][2];
- for(int i = 0; i < n; i++) {
- cin >> a[i][0] >> a[i][1];
- }
- vector<pair<int, double>> graph[maxn];
- for(int i = 0; i < n; i++) {
- for(int j = i + 1; j < n; j++) {
- double distance = sqrt((a[i][0] - a[j][0]) * (a[i][0] - a[j][0]) + (a[i][1] - a[j][1]) * (a[i][1] - a[j][1]));
- if(distance <= 10.0) {
- graph[i].push_back(make_pair(j, distance));
- graph[j].push_back(make_pair(i, distance));
- }
- }
- }
- priority_queue<node> pq;
- pq.push(node(0, 0.0));
- vector<bool> visited(n, false);
- vector<double> dist(n, 2e9);
- dist[0] = 0.0;
- while(!pq.empty()) {
- node c = pq.top();
- pq.pop();
- if(visited[c.idx]) {
- continue;
- }
- visited[c.idx] = true;
- for(int i = 0; i < (int) graph[c.idx].size(); i++) {
- int neighbour = graph[c.idx][i].first;
- double weight = graph[c.idx][i].second;
- if(!visited[neighbour] and c.shortest_path + weight < dist[neighbour]) {
- dist[neighbour] = c.shortest_path + weight;
- pq.push(node(neighbour, dist[neighbour]));
- }
- }
- }
- cout << dist[n - 1] << endl;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement
