随笔分类 -  并查集

find the most comfortable road 贪心&&枚举（并查集)
摘要：Problem DescriptionXX星有许多城市，城市之间通过一种奇怪的高速公路SARS(Super Air Roam Structure---超级空中漫游结构）进行交流，每条SARS都对行驶在上面的Flycar限制了固定的Speed，同时XX星人对 Flycar的“舒适度”有特殊要求，即乘坐过程中最高速度与最低速度的差越小乘坐越舒服 ,(理解为SARS的限速要求，flycar必须瞬间提速/降速，痛苦呀 ),但XX星人对时间却没那么多要求。要你找出一条城市间的最舒适的路径。(SARS是双向的）。Input输入包括多个测试实例，每个实例包括：第一行有2个正整数n (1 5 #include 阅读全文
posted @ 2013-11-05 13:20 persistent codeants 阅读(153) 评论(0) 推荐(0)
Code Lock 并查集&&二分求幂
摘要：Problem DescriptionA lock you use has a code system to be opened instead of a key. The lock contains a sequence of wheels. Each wheel has the 26 letters of the English alphabet 'a' through 'z', in order. If you move a wheel up, the letter it shows changes to the next letter in the En 阅读全文
posted @ 2013-11-04 21:44 persistent codeants 阅读(208) 评论(0) 推荐(0)
Farm Irrigation 并查集，找连通块的个数，
摘要：Problem DescriptionBenny has a spacious farm land to irrigate. The farm land is a rectangle, and is divided into a lot of samll squares. Water pipes are placed in these squares. Different square has a different type of pipe. There are 11 types of pipes, which is marked from A to K, as Figure 1 shows 阅读全文
posted @ 2013-11-04 14:48 persistent codeants 阅读(243) 评论(0) 推荐(0)
Matrix 并查集&&kruskal的思想（贪心思想）
摘要：Problem DescriptionMachines have once again attacked the kingdom of Xions. The kingdom of Xions has N cities and N-1 bidirectional roads. The road network is such that there is aunique path between any pair of cities.Morpheus has the news that K Machines are planning to destroy the whole kingdom. Th 阅读全文
posted @ 2013-11-02 10:58 persistent codeants 阅读(325) 评论(0) 推荐(0)
How Many Answers Are Wrong （带权的并查集）
摘要：Problem DescriptionTT and FF are ... friends. Uh... very very good friends -________-bFF is a bad boy, he is always wooing TT to play the following game with him. This is a very humdrum game. To begin with, TT should write down a sequence of integers-_-!!(bored).Then, FF can choose a continuous subs 阅读全文
posted @ 2013-11-01 17:51 persistent codeants 阅读(210) 评论(0) 推荐(0)
Minimal Ratio Tree prime()&&枚举点
摘要：Problem DescriptionFor a tree, which nodes and edges are all weighted, the ratio of it is calculated according to the following equation.Given a complete graph of n nodes with all nodes and edges weighted, your task is to find a tree, which is a sub-graph of the original graph, with m nodes and whos 阅读全文
posted @ 2013-11-01 15:44 persistent codeants 阅读(213) 评论(0) 推荐(0)
Portal 并查集（去重）
摘要：Problem DescriptionZLGG found a magic theory that the bigger banana the bigger banana peel .This important theory can help him make a portal in our universal. Unfortunately, making a pair of portals will cost min{T} energies. T in a path between point V and point U is the length of the longest edge 阅读全文
posted @ 2013-11-01 12:05 persistent codeants 阅读(333) 评论(0) 推荐(0)
Constructing Roads 最小生成树（prime（）），注意边的处理方式
摘要：Problem DescriptionThere are N villages, which are numbered from 1 to N, and you should build some roads such that every two villages can connect to each other. We say two village A and B are connected, if and only if there is a road between A and B, or there exists a village C such that there is a 阅读全文
posted @ 2013-10-31 20:52 persistent codeants 阅读(203) 评论(0) 推荐(0)
More is better 并查集最原始 最有效的形式，用rank数组，（结构体）
摘要：Problem DescriptionMr Wang wants some boys to help him with a project. Because the project is rather complex,the more boys come, the better it will be. Of course there are certain requirements.Mr Wang selected a room big enough to hold the boys. The boy who are not been chosen has to leave the room 阅读全文
posted @ 2013-10-31 18:51 persistent codeants 阅读(270) 评论(0) 推荐(0)
小希的迷宫 并查集判断 环是否存在
摘要：Problem Description上次Gardon的迷宫城堡小希玩了很久（见Problem B），现在她也想设计一个迷宫让Gardon来走。但是她设计迷宫的思路不一样，首先她认为所有的通道都应该是双向连通的，就是说如果有一个通道连通了房间A和B，那么既可以通过它从房间A走到房间B，也可以通过它从房间B走到房间A，为了提高难度，小希希望任意两个房间有且仅有一条路径可以相通（除非走了回头路）。小希现在把她的设计图给你，让你帮忙判断她的设计图是否符合她的设计思路。比如下面的例子，前两个是符合条件的，但是最后一个却有两种方法从5到达8。Input输入包含多组数据，每组数据是一个以0 0结尾的整数对 阅读全文
posted @ 2013-10-31 16:46 persistent codeants 阅读(396) 评论(0) 推荐(0)
How Many Tables 并查集（求有几个集合）
摘要：Problem DescriptionToday is Ignatius' birthday. He invites a lot of friends. Now it's dinner time. Ignatius wants to know how many tables he needs at least. You have to notice that not all the friends know each other, and all the friends do not want to stay with strangers.One important rule 阅读全文
posted @ 2013-10-30 20:29 persistent codeants 阅读(253) 评论(0) 推荐(0)