随笔分类 -  ★ **图论** ★

上一页 1 2 3 下一页
HDU 4635 —— Strongly connected——————【 强连通、最多加多少边仍不强连通】
摘要：Strongly connectedTime Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeHDU 4635DescriptionGive a simple directed grap... 阅读全文
posted @ 2015-11-06 19:32 tcgoshawk 阅读(144) 评论(0) 推荐(0)
HDU 4738——Caocao's Bridges——————【求割边/桥的最小权值】
摘要：Caocao's BridgesTime Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeHDU 4738DescriptionCaocao was defeated by Zhuge ... 阅读全文
posted @ 2015-11-06 19:08 tcgoshawk 阅读(235) 评论(0) 推荐(0)
POJ 3177——Redundant Paths——————【加边形成边双连通图】
摘要：Redundant PathsTime Limit:1000MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusPracticePOJ 3177DescriptionIn order to get from one of th... 阅读全文
posted @ 2015-11-05 21:44 tcgoshawk 阅读(187) 评论(0) 推荐(0)
HDU 4009——Transfer water——————【最小树形图、不定根】
摘要：Transfer waterTime Limit:3000MSMemory Limit:65768KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeHDU 4009DescriptionXiaoA lives in a village. Last ... 阅读全文
posted @ 2015-11-03 15:23 tcgoshawk 阅读(191) 评论(0) 推荐(0)
HDU 2121——Ice_cream’s world II——————【最小树形图、不定根】
摘要：Ice_cream’s world IITime Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeHDU 2121DescriptionAfter awarded lands to AC... 阅读全文
posted @ 2015-11-03 15:02 tcgoshawk 阅读(149) 评论(0) 推荐(0)
POJ 3164——Command Network——————【最小树形图、固定根】
摘要：Command NetworkTime Limit:1000MSMemory Limit:131072KTotal Submissions:15080Accepted:4331DescriptionAfter a long lasting war on words, a war on arms fi... 阅读全文
posted @ 2015-11-03 14:47 tcgoshawk 阅读(177) 评论(0) 推荐(0)
UVA 10462 —— Is There A Second Way Left?——————【最小生成树、kruskal、重边】
摘要：Nasa, being the most talented programmer of his time, can’t think things to be so simple. Recently all his neighbors have decided to connect themselve... 阅读全文
posted @ 2015-10-31 08:21 tcgoshawk 阅读(212) 评论(0) 推荐(0)
HDU 4081—— Qin Shi Huang's National Road System——————【次小生成树、prim】
摘要：Qin Shi Huang's National Road SystemTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5608Accepted S... 阅读全文
posted @ 2015-10-31 08:08 tcgoshawk 阅读(127) 评论(0) 推荐(0)
POJ 1861 ——Network——————【最小瓶颈生成树】
摘要：NetworkTime Limit:1000MSMemory Limit:30000KTotal Submissions:15268Accepted:5987Special JudgeDescriptionAndrew is working as system administrator and i... 阅读全文
posted @ 2015-10-30 21:39 tcgoshawk 阅读(334) 评论(0) 推荐(0)
POJ 1456——Supermarket——————【贪心+并查集优化】
摘要：SupermarketTime Limit:2000MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusPracticePOJ 1456DescriptionA supermarket has a set Prod of pr... 阅读全文
posted @ 2015-10-26 11:07 tcgoshawk 阅读(139) 评论(0) 推荐(0)
POJ 1182——食物链——————【种类并查集】
摘要：食物链Time Limit:1000MSMemory Limit:10000KB64bit IO Format:%I64d & %I64uSubmitStatusPracticePOJ 1182Description动物王国中有三类动物A,B,C，这三类动物的食物链构成了有趣的环形。A吃B， B吃C... 阅读全文
posted @ 2015-10-24 12:32 tcgoshawk 阅读(181) 评论(0) 推荐(0)
POJ 1860——Currency Exchange——————【最短路、SPFA判正环】
摘要：Currency ExchangeTime Limit:1000MSMemory Limit:30000KB64bit IO Format:%I64d & %I64uSubmitStatusPracticePOJ 1860DescriptionSeveral currency exchange po... 阅读全文
posted @ 2015-10-23 08:45 tcgoshawk 阅读(401) 评论(0) 推荐(0)
POJ 3660—— Cow Contest——————【Floyd传递闭包】
摘要：Cow ContestTime Limit:1000MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusPracticePOJ 3660DescriptionN(1 ≤N≤ 100) cows, conveniently nu... 阅读全文
posted @ 2015-10-22 21:54 tcgoshawk 阅读(138) 评论(0) 推荐(0)
POJ 3259——Wormholes——————【最短路、SPFA、判负环】
摘要：WormholesTime Limit:2000MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusPracticePOJ 3259DescriptionWhile exploring his many farms, Farm... 阅读全文
posted @ 2015-10-22 21:49 tcgoshawk 阅读(133) 评论(0) 推荐(0)
POJ 3268——Silver Cow Party——————【最短路、Dijkstra、反向建图】
摘要：Silver Cow PartyTime Limit:2000MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusPracticePOJ 3268DescriptionOne cow from each ofNfarms (1... 阅读全文
posted @ 2015-10-22 21:45 tcgoshawk 阅读(205) 评论(0) 推荐(0)
POJ 1797 ——Heavy Transportation——————【最短路、Dijkstra、最短边最大化】
摘要：Heavy TransportationTime Limit:3000MSMemory Limit:30000KB64bit IO Format:%I64d & %I64uSubmitStatusPracticePOJ 1797DescriptionBackgroundHugo Heavy is h... 阅读全文
posted @ 2015-10-22 21:37 tcgoshawk 阅读(321) 评论(0) 推荐(0)
POJ 2253 ——Frogger——————【最短路、Dijkstra、最长边最小化】
摘要：FroggerTime Limit:1000MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusPracticePOJ 2253DescriptionFreddy Frog is sitting on a stone in t... 阅读全文
posted @ 2015-10-20 14:51 tcgoshawk 阅读(309) 评论(0) 推荐(0)
UVALive 4262——Trip Planning——————【Tarjan 求强连通分量个数】
摘要：Road NetworksTime Limit:3000MSMemory Limit:0KB64bit IO Format:%lld & %lluSubmitStatusPracticeUVALive 4262DescriptionThere is a road network comprised ... 阅读全文
posted @ 2015-10-17 10:34 tcgoshawk 阅读(209) 评论(0) 推荐(0)
HDU 5418——Victor and World——————【状态压缩+floyd】
摘要：Victor and WorldTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 262144/131072 K (Java/Others)Total Submission(s): 891Accepted Submission(s): 399Pr... 阅读全文
posted @ 2015-09-03 21:45 tcgoshawk 阅读(343) 评论(0) 推荐(1)
HDU 5424——Rikka with Graph II——————【哈密顿路径】
摘要：Rikka with Graph IITime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1051Accepted Submission(s): 266... 阅读全文
posted @ 2015-09-02 16:44 tcgoshawk 阅读(318) 评论(0) 推荐(0)

上一页 1 2 3 下一页