Submission #8827447


Source Code Expand

#include <cmath>
#include <iostream>
#include <iomanip>
#include <queue>
#include <vector>

using namespace std;
typedef long long ll;

struct Node {
  int id;
  double cost;
  Node() {}
  Node(int i, double c) : id(i), cost(c) {}
  friend bool operator < (const Node& lhs, const Node& rhs) { return lhs.cost > rhs.cost; };
  friend bool operator > (const Node& lhs, const Node& rhs) { return rhs < lhs; };
  friend bool operator <= (const Node& lhs, const Node& rhs) { return !(lhs > rhs); };
  friend bool operator >= (const Node& lhs, const Node& rhs) { return !(lhs < rhs); };
};

struct Point {
  ll x, y, r;
};

double dist[1002][1002];
double cost[1002];
bool visit[1002];

double INF = 1e60;
double distance(const Point& from, const Point& to) {
  return max(0.0, sqrt((from.x-to.x)*(from.x-to.x)+(from.y-to.y)*(from.y-to.y))-from.r-to.r);
}

void dijkstra(int n) {
  int s = 0;
  for (int i = 0; i < n+2; ++i) {
    cost[i] = INF;
  }
  cost[0] = 0;
  priority_queue<Node> pq;
  pq.push(Node(s, 0));
  while (!pq.empty()) {
    Node from = pq.top(); pq.pop();
    // cerr << from.id << " " << from.cost << endl;
    if (visit[from.id]) continue;
    visit[from.id] = true;
    for (int to = 0; to < n+2; ++to) {
      if (from.id == to || visit[to]) continue;
      double c = cost[from.id]+dist[from.id][to];
      if (c > cost[to]) continue;
      cost[to] = c;
      pq.push(Node(to, c));
    }
  }
}

int main() {
  int xs, ys, xt, yt;
  cin >> xs >> ys >> xt >> yt;
  int n;
  cin >> n;
  vector<Point> lp;
  lp.push_back((Point){xs, ys, 0});
  for (int i = 0; i < n; ++i) {
    int x, y, r;
    cin >> x >> y >> r;
    lp.push_back((Point){x, y, r});
  }
  lp.push_back((Point){xt, yt, 0});
  for (int i = 0; i < n+2; ++i) {
    for (int j = 0; j < n+2; ++j) {
      dist[i][j] = distance(lp[i], lp[j]);
      // cerr << i <<  " " << j << " " << dist[i][j] << endl;
    }
  }
  dijkstra(n);
  cout << setprecision(12) << cost[n+1] << endl;
}

Submission Info

Submission Time
Task E - Cosmic Rays
User sash
Language C++14 (GCC 5.4.1)
Score 600
Code Size 2035 Byte
Status AC
Exec Time 96 ms
Memory 14340 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 600 / 600
Status
AC × 3
AC × 49
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt, 1_24.txt, 1_25.txt, 1_26.txt, 1_27.txt, 1_28.txt, 1_29.txt, 1_30.txt, 1_31.txt, 1_32.txt, 1_33.txt, 1_34.txt, 1_35.txt, 1_36.txt, 1_37.txt, 1_38.txt, 1_39.txt, 1_40.txt, 1_41.txt, 1_42.txt, 1_43.txt, 1_44.txt, 1_45.txt
Case Name Status Exec Time Memory
0_00.txt AC 1 ms 256 KB
0_01.txt AC 1 ms 256 KB
0_02.txt AC 1 ms 256 KB
1_00.txt AC 1 ms 256 KB
1_01.txt AC 1 ms 256 KB
1_02.txt AC 20 ms 8592 KB
1_03.txt AC 19 ms 8720 KB
1_04.txt AC 18 ms 8448 KB
1_05.txt AC 21 ms 8848 KB
1_06.txt AC 23 ms 10248 KB
1_07.txt AC 19 ms 8720 KB
1_08.txt AC 20 ms 8720 KB
1_09.txt AC 19 ms 8464 KB
1_10.txt AC 19 ms 8464 KB
1_11.txt AC 19 ms 8448 KB
1_12.txt AC 19 ms 8720 KB
1_13.txt AC 26 ms 12676 KB
1_14.txt AC 20 ms 8720 KB
1_15.txt AC 21 ms 8720 KB
1_16.txt AC 19 ms 8464 KB
1_17.txt AC 20 ms 8720 KB
1_18.txt AC 20 ms 8720 KB
1_19.txt AC 21 ms 8720 KB
1_20.txt AC 21 ms 9228 KB
1_21.txt AC 18 ms 8336 KB
1_22.txt AC 20 ms 8720 KB
1_23.txt AC 20 ms 8720 KB
1_24.txt AC 20 ms 8720 KB
1_25.txt AC 19 ms 8464 KB
1_26.txt AC 21 ms 8720 KB
1_27.txt AC 19 ms 8592 KB
1_28.txt AC 20 ms 8720 KB
1_29.txt AC 20 ms 8720 KB
1_30.txt AC 20 ms 9228 KB
1_31.txt AC 20 ms 9228 KB
1_32.txt AC 19 ms 8720 KB
1_33.txt AC 20 ms 8448 KB
1_34.txt AC 16 ms 8064 KB
1_35.txt AC 16 ms 8192 KB
1_36.txt AC 16 ms 8192 KB
1_37.txt AC 16 ms 8064 KB
1_38.txt AC 96 ms 14340 KB
1_39.txt AC 96 ms 14084 KB
1_40.txt AC 94 ms 13572 KB
1_41.txt AC 96 ms 13700 KB
1_42.txt AC 18 ms 8592 KB
1_43.txt AC 21 ms 9356 KB
1_44.txt AC 20 ms 8720 KB
1_45.txt AC 23 ms 9228 KB