并查集~~欧拉回路
文章平均质量分 83
idealistic
编程渣渣~~
展开
-
【杭电1232】畅通工程
畅通工程Time Limit:2000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescription某省调查城镇交通状况,得到现有城镇道路统计表,表中列出了每条道路直接连通的城镇。省政府“畅通工程”的目标是使全省任何两个城镇间都可以实现交通(但不一原创 2016-08-01 10:34:22 · 285 阅读 · 0 评论 -
【codeforce】744A 并查集
Hongcow is ruler of the world. As ruler of the world, he wants to make it easier for people to travel by road within their own countries.The world can be modeled as an undirected graph with n node原创 2017-02-04 12:32:08 · 364 阅读 · 0 评论 -
**并查集
Find them, Catch themTime Limit:1000MS Memory Limit:10000KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionThe police office in Tadu City decides to say ends to the c原创 2016-09-23 22:09:43 · 236 阅读 · 0 评论 -
【杭电1856】More is better找最大集合
More is betterTime Limit:1000MS Memory Limit:102400KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionMr Wang wants some boys to help him with a project. Because the原创 2016-08-01 21:07:17 · 347 阅读 · 0 评论 -
【杭电2120】有几个环
Ice_cream's world ITime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionice_cream's world is a rich country, it has many fertile la原创 2016-08-02 08:43:26 · 221 阅读 · 0 评论 -
【POJ 1611】The Suspects并查集
The SuspectsTime Limit:1000MS Memory Limit:20000KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionSevere acute respiratory syndrome (SARS), an atypical pneumonia of u原创 2016-08-01 19:16:02 · 251 阅读 · 0 评论 -
并查集模板
int findroot(int x)//寻找根节点{ int r=x;while(r!=f[r]) r=f[r]; int i=x,j; if(i!=r) { j=f[i]; f[i]=r; i=j; } return r;}void unine(int a,int b)//判断根节点是否相同 ,不同就合并 { int nx=findroot(a);原创 2016-08-01 11:27:42 · 377 阅读 · 0 评论 -
【杭电1878】欧拉回路
欧拉回路Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescription欧拉回路是指不令笔离开纸面,可画过图中每条边仅一次,且可以回到起点的一条回路。现给定一个图,问是否存在欧拉回路?Input原创 2016-08-01 15:50:39 · 297 阅读 · 0 评论 -
【杭电1213】How Many Tables
How Many TablesTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionToday is Ignatius' birthday. He invites a lot of friends. Now i原创 2016-08-01 11:46:48 · 319 阅读 · 0 评论 -
【lightoj】1263 - Equalizing Money
1263 - Equalizing Money PDF (English)StatisticsForumTime Limit: 2 second(s)Memory Limit: 32 MBThere are n people in a certain village. Each o原创 2017-04-07 20:34:04 · 376 阅读 · 0 评论