TOJ 2119 Tangled in Cables

【TOJ 2119 Tangled in Cables】的更多相关文章

TOJ 2119 Tangled in Cables

描述 You are the owner of SmallCableCo and have purchased the franchise rights for a small town. Unfortunately, you lack enough funds to start your business properly and are relying on parts you have found in an old warehouse you bought. Among your fin…

POJ 2075 Tangled in Cables 最小生成树

简单的最小生成树,不过中间却弄了很久,究其原因,主要是第一次做生成树,很多细节不够熟练,find()函数的循环for判断条件是 pre[i]>=0,也就是遇到pre[i]==-1时停止,i就是并查集的代表元. #include<stdio.h> #include<math.h> #include<string.h> #include<stdlib.h> #define MAXN 1000 #define MAXE 1000010 #define LEN…

Tangled in Cables（Kruskal+map容器处理字符串）

/** 题意: 给你两个城市之间的道路(无向图),求出需要的电缆.如果大于所提供的,就输出Not enough ... 否则输出所需要的电缆长度. 输入:N (给定的电缆总长度) m1 (有多少个城市—) str1 str2 str3 str4 : :(城市的名字) m2(相当于给出m2条边) …

POJ 2075 Tangled in Cables (c++/java)

http://poj.org/problem?id=2075 题目大意: 给你一些人名,然后给你n条连接这些人名所拥有的房子的路,求用最小的代价求连接这些房子的花费是否满足要求. 思路: 昨天20分钟的题,输入不小心写错了- -|||||看世界杯半场歇息随便看了下发现了....T T 用map进行下标的映射,然后求MST就可以. c++ #include<cstdio> #include<string> #include<map> #include<algorit…

ZOJ2326Tangled in Cables（最小生成树）

Tangled in Cables Time Limit: 2 Seconds Memory Limit: 65536 KB You are the owner of SmallCableCo and have purchased the franchise rights for a small town. Unfortunately, you lack enough funds to start your business properly and are relying on pa…

HOJ题目分类

各种杂题,水题,模拟,包括简单数论. 1001 A+B 1002 A+B+C 1009 Fat Cat 1010 The Angle 1011 Unix ls 1012 Decoding Task 1019 Grandpa's Other Estate 1034 Simple Arithmetics 1036 Complete the sequence! 1043 Maya Calendar 1054 Game Prediction 1057 Mileage Bank 1067 Rails 10…