AtCoder - 2154 Cosmic Rays

E - Cosmic Rays

---

Time limit : 2sec / Memory limit : 256MB

Score : 600 points

Problem Statement

On the xy-plane, Snuke is going to travel from the point (x_s,y_s) to the point (x_t,y_t).He can move in arbitrary directions with speed 1.Here, we will consider him as a point without size.

There are N circular barriers deployed on the plane.The center and the radius of the i-th barrier are (x_i,y_i) and r_i, respectively.The barriers may overlap or contain each other.

A point on the plane is exposed to cosmic rays if the point is not within any of the barriers.

Snuke wants to avoid exposure to cosmic rays as much as possible during the travel.Find the minimum possible duration of time he is exposed to cosmic rays during the travel.

Constraints

• All input values are integers.
• −10⁹≤x_s,y_s,x_t,y_t≤10⁹
• (x_s,y_s) ≠ (x_t,y_t)
• 1≤N≤1,000
• −10⁹≤x_i,y_i≤10⁹
• 1≤r_i≤10⁹

---

Input

The input is given from Standard Input in the following format:

xs ys xt yt
N
x1 y1 r1
x2 y2 r2
:
xN yN rN

Output

Print the minimum possible duration of time Snuke is exposed to cosmic rays during the travel.The output is considered correct if the absolute or relative error is at most 10⁻⁹.

---

Sample Input 1

Copy

-2 -2 2 2
1
0 0 1

Sample Output 1

Copy

3.6568542495

An optimal route is as follows:

---

Sample Input 2

Copy

-2 0 2 0
2
-1 0 2
1 0 2

Sample Output 2

Copy

0.0000000000

An optimal route is as follows:

---

Sample Input 3

Copy

4 -2 -2 4
3
0 0 2
4 0 1
0 4 1

Sample Output 3

Copy

4.0000000000

An optimal route is as follows:

---

题意：给出两点，找出从一点到另一点的经过的非圆内区域的最小值。

题解：将所有圆变成点，点与点之间的距离等于他们圆心之间的距离减去他们的半径和，然后再用SPFA求最短路。

#include <bits/stdc++.h>
using namespace std;

const int maxn = 1e3 + 20;
int vis[maxn],n;
double x[maxn],y[maxn],r[maxn],dist[maxn],mp[maxn][maxn];

void SPFA(int s)
{
    queue<int>q;
    for(int i = 1;i <= n;i++) dist[i] = 1e10;
    memset(vis,0,sizeof(vis));
    while(!q.empty()) q.pop();
    dist[s] = 0;
    vis[s] = 1;
    q.push(s);

    while(!q.empty())
    {
        int v = q.front();
        q.pop();
        vis[v] = 0;
        for(int i = 1;i <= n;i++)
        {
            if(dist[i] > dist[v] + mp[v][i])
            {
                dist[i] = dist[v] + mp[v][i];
                if(!vis[i])
                {
                    vis[i] = 1;
                    q.push(i);
                }
            }
        }
    }
}

int main()
{
    while(scanf("%lf%lf%lf%lf",&x[1],&y[1],&x[2],&y[2]) != EOF)
    {
        scanf("%d",&n);
        n += 2;
        r[1] = r[2] = 0;
        mp[1][2] = mp[2][1] = sqrt((x[1] - x[2]) * (x[1] - x[2]) + (y[1] - y[2]) * (y[1] - y[2]));
        for(int i = 3;i <= n;i++)
        {
            scanf("%lf%lf%lf",&x[i],&y[i],&r[i]);
        }
        for(int i = 1;i <= n;i++)
        {
            for(int j = 1;j <= n;j++)
            {
                mp[i][j] = sqrt((x[i] - x[j]) * (x[i] - x[j]) + (y[i] - y[j]) * (y[i] - y[j]));
                mp[i][j] -= r[i] + r[j];
                if(mp[i][j] < 0)
                {
                    mp[i][j] = 0;
                }
            }
        }
        SPFA(1);
        printf("%.10f\n",dist[2]);
    }
    return 0;
}

---