随笔分类 -  图论

摘要:WatchcowTime Limit: 3000MSMemory Limit: 65536KTotal Submissions: 6477Accepted: 2823Special JudgeDescriptionBessie's been appointed the new watch-cow f... 阅读全文
posted @ 2015-08-26 09:41 JoneZP 阅读(173) 评论(0) 推荐(0)
摘要:Mission ImpossibleTime Limit: 30000/10000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 227Accepted Submission(s): 106... 阅读全文
posted @ 2015-08-19 22:39 JoneZP 阅读(322) 评论(0) 推荐(0)
摘要:Following OrdersTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 4254Accepted: 1709DescriptionOrder is an important concept in mathematics and... 阅读全文
posted @ 2015-08-17 15:55 JoneZP 阅读(209) 评论(0) 推荐(0)
摘要:Borg MazeTime Limit:1000MSMemory Limit:65536KTotal Submissions:10554Accepted:3501DescriptionThe Borg is an immensely powerful race of enhanced humanoi... 阅读全文
posted @ 2015-08-16 14:44 JoneZP 阅读(238) 评论(0) 推荐(0)
摘要:The Unique MSTTime Limit:1000MSMemory Limit:10000KTotal Submissions:24201Accepted:8596DescriptionGiven a connected undirected graph, tell if its minim... 阅读全文
posted @ 2015-08-16 14:32 JoneZP 阅读(162) 评论(0) 推荐(0)
摘要:HighwaysTime Limit: 5 Seconds Memory Limit: 32768 KB Special JudgeThe island nation of Flatopia is perfectly flat. Unfortunately, Flatopia has a v... 阅读全文
posted @ 2015-08-12 19:20 JoneZP 阅读(494) 评论(0) 推荐(0)
摘要:感谢书神的模板!!!int spfa(int s,int n)//单源最短路(s为起点,n为节点总数){ int u; for (int i=0; i que; que.push(s); vis[s]=true; dis[s]=0; while (!que.emp... 阅读全文
posted @ 2015-08-09 15:05 JoneZP 阅读(158) 评论(0) 推荐(0)
摘要:这是无向图的void Floyd(){ memset(v, 0x3f, sizeof v); for(int i = 1; i <= n; i++) for(int j = 1; j <= n; j++) v[i][j] = map[i][j]; for... 阅读全文
posted @ 2015-08-09 11:27 JoneZP 阅读(387) 评论(0) 推荐(0)
摘要:Heavy CargoTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 3768Accepted: 2013DescriptionBig Johnsson Trucks Inc. is a company specialized in ... 阅读全文
posted @ 2015-08-09 11:18 JoneZP 阅读(571) 评论(0) 推荐(0)
摘要:Fiber NetworkTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 3328Accepted: 1532DescriptionSeveral startup companies have decided to build a b... 阅读全文
posted @ 2015-08-09 11:05 JoneZP 阅读(216) 评论(0) 推荐(0)
摘要:WormholesTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 36425Accepted: 13320DescriptionWhile exploring his many farms, Farmer John has disco... 阅读全文
posted @ 2015-08-09 10:43 JoneZP 阅读(235) 评论(0) 推荐(0)
摘要:Sorting It All OutTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 30110Accepted: 10411DescriptionAn ascending sorted sequence of distinct val... 阅读全文
posted @ 2015-08-05 23:12 JoneZP 阅读(150) 评论(0) 推荐(0)
摘要:How Many Maos Does the Guanxi Worth Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 760Accepted ... 阅读全文
posted @ 2015-08-04 21:34 JoneZP 阅读(462) 评论(0) 推荐(0)
摘要:Silver Cow PartyTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 15156Accepted: 6843DescriptionOne cow from each of N farms (1 ≤ N ≤ 1000) con... 阅读全文
posted @ 2015-08-04 10:32 JoneZP 阅读(183) 评论(0) 推荐(0)
摘要:Easy billiardsTime Limit: 2 Seconds Memory Limit: 65536 KB Special JudgeEdward think a game of billiards is too long and boring. So he invented a ... 阅读全文
posted @ 2015-08-02 14:35 JoneZP 阅读(293) 评论(0) 推荐(0)
摘要:Tree of ThreeTime Limit:2 Seconds Memory Limit:65536 KBNow we have a tree and some queries to deal with. Every node in the tree has a value on it. For... 阅读全文
posted @ 2015-07-29 09:44 JoneZP 阅读(189) 评论(0) 推荐(0)
摘要:blog.csdn.net/u012860063/article/details/38017661(拓扑排序模板题解可见)http://blog.csdn.net/acdreamers/article/details/16902023(链式向前星) 1 struct Edge 2 { 3 i... 阅读全文
posted @ 2015-07-23 10:05 JoneZP 阅读(391) 评论(0) 推荐(0)
摘要:Buy or BuildTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 1369Accepted: 542DescriptionWorld Wide Networks (WWN) is a leading company that o... 阅读全文
posted @ 2015-07-13 10:49 JoneZP 阅读(370) 评论(0) 推荐(0)