Frogger POJ - 2253 (插眼)

题目链接Frogger - POJ 2253 - Virtual Judge

poj传统问题,输出用%f才能过(然而我%f都过不了最后用的cout)

dijkstra的变形,具体思路我还没完全明白,先插个眼以后再来看

挖个坑,以后想用Floyd kruskal和prim再写一遍这题

ac代码

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <queue>
#include <cmath>
#include <cstring>
#include <string>
#include <stack>
#include <deque>
#include <map>
#include <set>
#include <iomanip>
using namespace std;
#define ll int
#define endl "\n"
#define rep(i, a, b) for (ll i = (a); i <= (b); i++)
#define repr(i, a, b) for (ll i = (a); i < (b); i++)
#define rrep(i, a, b) for (ll i = (b); i >= (a); i--)
#define rrepr(i, a, b) for (ll i = (b); i > (a); i--)
#define io_speed_up ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define min(a,b) (a)<(b)?(a):(b)
#define max(a,b) (a)>(b)?(a):(b)

ll n,m,t,ans,ant;
const int N=300;
double cnt;
double arr[N][N];
double dist[N];
bool bo[N];
string str;

inline ll read()
{
    char c = getchar();int x = 0,s = 1;
    while(c < '0' || c > '9') {if(c == '-') s = -1;c = getchar();}//是符号
    while(c >= '0' && c <= '9') {x = x*10 + c -'0';c = getchar();}//是数字
    return x*s;
}

double dis(pair<ll,ll> a,pair<ll,ll> b)
{
    return sqrt((double)(a.first-b.first)*(a.first-b.first)+(a.second-b.second)*(a.second-b.second));
}

void dijkstra()
{
    rep(i,0,n) dist[i]=0x3f3f3f3f;
    memset(bo,0,sizeof bo);
    dist[1]=0.0;
    repr(i,0,n-1)
    {
        ant=-1;
        rep(j,1,n) if(!bo[j]&&(ant==-1||dist[ant]>dist[j]))
            ant=j;
        rep(j,1,n) 
            dist[j]=min(dist[j],max(arr[ant][j],dist[ant]));
        bo[ant]=1;
    }
}

void solve()
{
    map<ll,pair<ll,ll> >mp;
    mp.clear();
    rep(i,1,n)
    {
        ll a,b;
        cin>>a>>b;
        // mp[i]={a,b};
        mp[i].first=a;
        mp[i].second=b;
        // arr[a][b]=min(arr[a][b],c);
        // arr[b][a]=min(arr[b][a],c);
    }
    cnt=0;
    rep(i,1,n)
        rep(j,i+1,n)
        {
            double temp=dis(mp[i],mp[j]);
            arr[i][j]=arr[j][i]=temp;
        }
    dijkstra();
    cnt=dist[2];

    return;
}

int main()
{
    ans=0;
    io_speed_up;
    cout << fixed << setprecision(3);
    while(cin>>n&&n)
    {
        solve();
        ans++;
        // printf("Scenario #%lld\n",ans);
        // printf("Frog Distance = %.3f\n\n",dist[2]);
        cout << "Scenario #" << ans << endl
             << "Frog Distance = " << dist[2] << endl
             << endl;
    }
    return 0;
}