пираты

#include<iostream>
#include <cmath>
#include <iomanip>
using namespace std;

const int inf = 100000;

struct coordinata
{
 double x, y, rad;
 void new_coord(double x, double y, double rad)
    {
        this->x = x;
        this->y = y;
        this->rad = rad;
    }
};

double path_length(coordinata a, coordinata b)
{
  double dlina = 0;
  dlina = sqrt((a.x - b.x)*(a.x - b.x) + (a.y - b.y)*(a.y - b.y)) - a.rad - b.rad;
  return dlina;
}

class Graph
{
  private:
  int n;
  double **arr, **d;
  public:
  Graph (coordinata *matrix, int x)
  {
    n = x;

    arr = new double*[n];
    for (int i =0; i < n; i++)
     arr[i] = new double[n];

    for (int i = 0; i < n; i++)
     for (int j = 0; j < n; j++)
       {
         arr[i][j] = path_length(matrix[i], matrix[j]);
         if (i == j)
         arr[i][j] = inf;
       }
  }
  void get_rasst();
  void minpath();
  double get_length_path(int x, int y);
};

void Graph::minpath()
{
  for (int l = 0; l < n; l++)
    for (int i = 0; i < n; i++)
      if (d[i][l] < inf)
        for (int j = 0; j < n; j++)
          d[i][j] = min(d[i][j], d[i][l] + d[l][j]);
}

double Graph::get_length_path(int x, int y)
{
 double dlina = 0;
 d = arr;
  minpath();

 if (arr[x][y] == inf)
  dlina = -1;
 else dlina = d[x][y];

 return dlina;
}

void Graph::get_rasst()
{
  for (int i = 0; i < n; i++)
  {
    for (int j =0; j < n; j++)
    {
      cout.width(3);
      cout << arr[i][j] << " ";
    }
    cout << endl;
  }
}

int main()
{
 int n, m;
 double result, x, y, rad;
 cin >> n;

coordinata *arr = new coordinata[n];

 for ( int i = 0; i < n; i++)
  {
    cin >> x >> y >> rad;
    arr[i].new_coord(x, y, rad);
  }

cin >> m;

int **zapros = new int*[m];
for(int i = 0; i < m; i++)
 zapros[i] = new int[2];

for (int i = 0; i < m; i++)
  cin >> zapros[i][0] >> zapros[i][1];

 Graph object(arr, n);

 for (int i = 0; i < m; i++)
  {
    result = object.get_length_path(zapros[i][0] - 1, zapros[i][1] - 1);
    cout.precision(6);
    cout << fixed << result << endl;
  }
}