hdoj 1875 畅通工程再续

题目传送门：
http://acm.hdu.edu.cn/showproblem.php?pid=1875

//9403289    2013-10-24 17:00:49    Accepted    1875    62MS    376K    2205 B    C++    空信高手
#include <iostream>
#include <cmath>
#include <iomanip>
using namespace std;
#define typec double
#define V 101
const typec inf=;
int vis[V];
typec lowc[V],cost[V][V];
typedef struct
{
    int x;
    int y;
} POINT;
POINT pnts[V];
/*=================================================*\
 | Prim求MST
 | INIT: cost[][]耗费矩阵(inf为无穷大);
 | CALL: prim(cost, n); 返回-1代表原图不连通;
\*==================================================*/
typec prim(int n)
{
    int i,j,p;
    typec minc,res=;
    memset(vis,,sizeof(vis));
    vis[]=;
    for(i=; i<n; i++) lowc[i]=cost[][i];
    for(i=; i<n; i++)
    {
        minc=inf;
        p=-;
        for(j=; j<n; j++)
        {
            if(==vis[j]&&minc>lowc[j])
            {
                minc=lowc[j];
                p=j;
            }
        }
        if(inf==minc) return -;
        res+=minc;
        vis[p]=;
        for(j=; j<n; j++)
            if(==vis[j]&&lowc[j]>cost[p][j])lowc[j]=cost[p][j];
    }
    return res;
}

double calDis(POINT a,POINT b)
{
    return sqrt(double((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y)));
}
void Init()
{
    int i,j;
    for(i=; i<V; i++)
        for(j=; j<V; j++)
            cost[i][j]=;
}
int main()
{
   // freopen("input.txt","r",stdin);
    int n,i,j;
    while(cin>>n&&n!=)
    {
        while(n--)
        {
            int m;
            double Sum=;
            cin>>m;
            Init();
            //memset(cost,inf,sizeof(cost));

            for(i=; i<m; i++)
                cin>>pnts[i].x>>pnts[i].y;
            for(i=; i<m; i++)
                for(j=; j<m; j++)
                {
                    if(calDis(pnts[i],pnts[j])<=1000.000001&&calDis(pnts[i],pnts[j])>=10.000000)
                        cost[i][j]=calDis(pnts[i],pnts[j]);
                }
//            if(!flag) cout<<setiosflags(ios::fixed)<<setprecision(1)<<prim(m)*100<<endl;
//            else cout<<"oh!"<<endl;
            Sum=prim(m);
            if(Sum<) cout<<"oh!"<<endl;
            else cout<<setiosflags(ios::fixed)<<setprecision()<<Sum*<<endl;
        }
    }
    return ;
}