Effi_ptc的博客

Constructing Roads Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 1914    Accepted Submission(s): 628 Problem Description There

#include #include #include using namespace std; const int maxx=10010; const int maxn=101; double xx[maxn],yy[maxn]; int pa[maxx],rank1[maxx]; double ans; struct edge{     int u,v;     do

#include #include #include using namespace std; int pa[900],rank1[900]; int ans; typedef struct{     int u,v,c; }edge; edge e[900]; bool cmp(const edge& e1,const edge& e2){      return e

#include #include #include using namespace std; int pa[10010],rank1[10010]; int ans; struct node{     int u,v,c; }e[10010]; bool cmp(const node& e1,const node& e2){     return e1.c } vo

#include <cstdio> #include <cstring> #include <algorithm> using namespace std; int pa[105],rk[105]; double xx[105],yy[105]; double ans; struct edge{ int u,v; double c; }e[10010]; bool cmp(const