Gym - 100851F Froggy Ford

题目链接：

http://codeforces.com/gym/100851/attachments

题解：

二分枚举长度，BFS暴力找路径，注意边界的处理

代码：

#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <cstdio>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
using namespace std;
#define met(a,b) memset(a,b,sizeof(a))
#define inf 0x3f3f3f3f
const int maxn = 1000+10;
const double eps=1e-4;
struct node
{
    double x,y;
}p[maxn];
double mp[maxn][maxn];
double w;
int n;

double Distance(node a,node b)
{
    return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));
}

bool visited1[maxn],visited2[maxn];
bool BFS(double MAX,double &ansx,double &ansy)
{
    met(visited1,false);
    met(visited2,false);
    queue<int>q;
    q.push(0);
    visited1[0]=true;
    while(!q.empty())
    {
        int u=q.front();
        q.pop();
        for(int i=1;i<=n+1;i++)
        {
            if(!visited1[i]&&mp[u][i]<MAX+eps)
            {
                visited1[i]=true;
                q.push(i);
            }
        }
    }
    if(visited1[n+1])
    {
        ansx=p[1].x;
        ansy=p[1].y;
        return true;
    }
    while (!q.empty())
        q.pop();
    q.push(n+1);
    visited2[n+1]=true;
    while(!q.empty())
    {
        int u=q.front();
        q.pop();
        for(int i=0;i<=n;i++)
        {
            if(visited1[i])
            {
                if(mp[i][u]<MAX*2.0+eps)
                {
                    ansx=(p[i].x+p[u].x)/2.0,ansy=(p[i].y+p[u].y)/2.0;
                    if(u==n+1)
                        ansy=p[i].y,ansx=(w+p[i].x)/2.0;
                    else if(u==n+1&&i==0)
                        ansy=0.0,ansx=w/2.0;
                    else if(i==0)
                        ansy=p[u].y,ansx=p[u].x/2.0;
                    return true;
                }
                continue;
            }
            if(!visited2[i]&&mp[u][i]<MAX+eps)
            {
                visited2[i]=1;
                q.push(i);

            }
        }
    }
    return false;
}

void slove()
{
    double Mid,Left,Right;
    double ans,ansx,ansy,tempx,tempy;
    Left=0.0,Right=w;
    int cnt=100;
    while(cnt--)
    {
        Mid=(Left+Right)/2.0;
        if(BFS(Mid,tempx,tempy))
            Right=Mid,ans=Mid,ansx=tempx,ansy=tempy;
        else
            Left=Mid;
    }
    printf("%.3f %.3f\n",ansx,ansy);
    return;
}


int main()
{
    freopen("froggy.in", "r", stdin);
    freopen("froggy.out", "w", stdout);

    scanf("%lf%d",&w,&n);
    for(int i=1;i<=n;i++)
        scanf("%lf%lf",&p[i].x,&p[i].y);
    met(mp,0);
    mp[n+1][0]=mp[0][n+1]=w;
    for(int i=1;i<=n;i++)
    {
        mp[0][i]=mp[i][0]=p[i].x,mp[n+1][i]=mp[i][n+1]=w-p[i].x;
        for(int j=i+1;j<=n;j++)
            mp[i][j]=mp[j][i]=Distance(p[i],p[j]);
    }
    slove();
}