朱刘算法模板题

#include 
     
      #include 
      
       #include 
       
        #include 
        
         #include 
         
          #define INF 1<<30using namespace std;int n,m;struct node{    double x,y;}nod[110<<1];double in[110<<1] ;int pre[110<<1] , id[110<<1] ,vis[110<<1];struct edge{    int u,v;    double w;}e[110*110];double calcu_dis(int x,int y){    return sqrt( (nod[x].x - nod[y].x) * (nod[x].x - nod[y].x) + (nod[x].y - nod[y].y) * (nod[x].y - nod[y].y)) ;}void makemap(){    for(int i=0;i
          
           >nod[i].x>>nod[i].y; } double ans=solve() ; if(ans == -1){ printf("poor snoopy\n") ; } else { printf("%.2f\n",ans) ; } } return 0;}