I am a slow walker,but I never walk backwards. Abraham Lincoln

GeekZRF

随笔分类 -  图论————————

上一页 1 2

POJ 3723.Conscription 最小生成树
摘要:Conscription Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 13438 Accepted: 4699 Description Windy has a country, and he wants to build an 阅读全文

posted @ 2017-06-21 11:25 GeekZRF 阅读(221) 评论(0) 推荐(0)

POJ 2449Remmarguts' Date 第K短路
摘要:Remmarguts' Date Time Limit: 4000MS Memory Limit: 65536K Total Submissions: 29625 Accepted: 8034 Description "Good man never makes girls wait or break 阅读全文

posted @ 2017-05-11 16:22 GeekZRF 阅读(132) 评论(0) 推荐(0)

Codeforces 545E. Paths and Trees 最短路
摘要:E. Paths and Trees time limit per test: 3 seconds memory limit per test: 256 megabytes input: standard input output: standard output Little girl Susie 阅读全文

posted @ 2017-04-06 17:24 GeekZRF 阅读(406) 评论(0) 推荐(0)

UVA-1364.Knights of the Round Table 无向图BCC
摘要:题目链接:https://vjudge.net/problem/UVA-1364 题意:有n个人参加会议,互相憎恨的人不能坐在相邻的位置,并且每个会议参加的人数必须是奇数,求有多少个人不能参加任何一个会议。 思路:如果两个人可以坐在一起,则在他们之间建立一条无向边。求不在任何一个简单奇圈上面的点的个 阅读全文

posted @ 2017-03-29 16:06 GeekZRF 阅读(142) 评论(0) 推荐(0)

大白书中无向图的点双联通分量(BCC)模板的分析与理解
摘要:对于一个无向图,如果任意两点至少存在两条点不重复(除起点和终点外无公共点)的路径,则这个图就是点双联通。 这个要求等价于任意两条边都存在于一个简单环(即同一个点不能在圈中出现两次)中,即内部无割点。 那么算法首先要求出割点。 从代码中可以看出:只要求出割点,就开始组一个bcc中。 如果割点两侧都不存 阅读全文

posted @ 2017-03-29 15:29 GeekZRF 阅读(349) 评论(0) 推荐(0)

Codeforces 787D. Legacy 线段树建模+最短路
摘要:D. Legacy time limit per test:2 seconds memory limit per test:256 megabytes input:standard input output:standard output Rick and his co-workers have m 阅读全文

posted @ 2017-03-26 16:54 GeekZRF 阅读(757) 评论(0) 推荐(0)

Codeforces 731C. Socks 联通块
摘要:C. Socks time limit per test: 2 seconds memory limit per test: 256 megabytes input: standard input output: standard output C. Socks time limit per tes 阅读全文

posted @ 2016-10-17 22:15 GeekZRF 阅读(441) 评论(0) 推荐(0)

POJ 1300.Door Man 欧拉通路
摘要:Door Man Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 2596 Accepted: 1046 Description You are a butler in a large mansion. This mansion 阅读全文

posted @ 2016-05-04 21:44 GeekZRF 阅读(223) 评论(0) 推荐(0)

ZOJ 3946.Highway Project(The 13th Zhejiang Provincial Collegiate Programming Contest.K) SPFA
摘要:ZOJ Problem Set - 3946 Highway ProjectTime Limit: 2 Seconds Memory Limit: 65536 KB Edward, the emperor of the Marjar Empire, wants to build some bidir 阅读全文

posted @ 2016-04-29 10:29 GeekZRF 阅读(257) 评论(0) 推荐(0)

POJ 1122.FDNY to the Rescue! Dijkstra
摘要:FDNY to the Rescue! Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 2808 Accepted: 860 Description The Fire Department of New York (FDNY) h 阅读全文

posted @ 2016-04-22 00:07 GeekZRF 阅读(292) 评论(0) 推荐(0)

POJ 1135.Domino Effect Dijkastra算法
摘要:Domino Effect Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 10325 Accepted: 2560 Description Did you know that you can use domino bones f 阅读全文

posted @ 2016-04-21 21:01 GeekZRF 阅读(320) 评论(0) 推荐(0)

POJ3687.Labeling Balls 拓扑排序
摘要:Labeling Balls Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 13201 Accepted: 3811 Description Windy has N balls of distinct weights from 阅读全文

posted @ 2016-04-15 13:40 GeekZRF 阅读(163) 评论(0) 推荐(0)

POJ 2585.Window Pains 拓扑排序
摘要:Window Pains Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 1888 Accepted: 944 Description Boudreaux likes to multitask, especially when i 阅读全文

posted @ 2016-04-14 13:38 GeekZRF 阅读(236) 评论(0) 推荐(0)

POJ2585 Window Pains 拓扑排序
摘要:Window Pains Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 1843 Accepted: 919 Description Boudreaux likes to multitask, especially when i 阅读全文

posted @ 2015-11-20 16:55 GeekZRF 阅读(275) 评论(0) 推荐(0)

POJ1659 Frogs' Neighborhood(青蛙的邻居) Havel-Hakimi定理
摘要:Frogs' Neighborhood Time Limit: 5000MS Memory Limit: 10000K Total Submissions: 8729 Accepted: 3676 Special Judge Description 未名湖附近共有N个大小湖泊L1, L2, ..., 阅读全文

posted @ 2015-10-25 16:25 GeekZRF 阅读(334) 评论(0) 推荐(0)

上一页 1 2

导航