图论
文章平均质量分 84
mrcoderrev
C
展开
-
1248 NYOJ 海岛争霸
海岛争霸时间限制:1000 ms | 内存限制:65535 KB难度:2描述神秘的海洋,惊险的探险之路,打捞海底宝藏,激烈的海战,海盗劫富等等。加勒比海盗,你知道吧?杰克船长驾驶着自己的的战船黑珍珠1号要征服各个海岛的海盜,最后成为海盗王。 这是一个由海洋、岛屿和海盗组成的危险世界。杰克船长准备从自己所占领的岛屿A开始征程,逐个去占领每一个岛屿。面对危险原创 2016-05-25 10:48:33 · 480 阅读 · 0 评论 -
POJ - 1860 Currency Exchange(最短路)
Currency ExchangeTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 17745 Accepted: 6262DescriptionSeveral currency exchange points are working in our ci转载 2016-07-23 11:04:52 · 385 阅读 · 0 评论 -
pat L3-011. 直捣黄龙(dij 最短路)
L3-011. 直捣黄龙时间限制150 ms内存限制65536 kB代码长度限制8000 B判题程序Standard作者陈越本题是一部战争大片 —— 你需要从己方大本营出发,一路攻城略地杀到敌方大本营。首先时间就是生命,所以你必须选择合适的路径,以最快原创 2017-03-28 11:47:28 · 253 阅读 · 0 评论 -
haut 1262: 魔法宝石(dij+堆优化)@
1262: 魔法宝石时间限制: 2 秒 内存限制: 64 MB提交: 346 解决: 85提交 状态 题目描述小s想要创造n种魔法宝石。小s可以用ai的魔力值创造一棵第i种魔法宝石,或是使用两个宝石合成另一种宝石(不消耗魔力值)。请你帮小s算出合成某种宝石的所需的最小花费。输入第一行为数据组数T(1≤T≤3)。对于每组数据,首先一行为n,m(1≤n,原创 2017-04-29 20:09:08 · 491 阅读 · 0 评论 -
10603 - Fill UVA(隐式最短路)@
Fill UVA - 10603 题意:给三个杯子,第1个第2个空,第三个装满水,每次操作是一个杯子向另一个杯子倒水直到其中一个杯子为空或者另一个杯子倒满,求使其中一个杯子最接近d的最小倒水流量解:最短路;#include #include using namespace std;const int N = 500;const int inf原创 2017-05-04 11:26:08 · 296 阅读 · 0 评论 -
haut 1278: Transmit information(倍增floyd)@
题意:求一个图的s到e的长度为k的最短路解:每次只通过一个节点来疏松原图#include #include using namespace std;typedef long long LL;const int N = 1007;const int inf = 999999999;const int mod = 10007;char str[10][10];int n, m,原创 2017-05-22 11:30:21 · 234 阅读 · 0 评论 -
hdu 6080 度度熊保护村庄(floydS使用技巧)
度度熊保护村庄Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 124 Accepted Submission(s): 53Problem Description哗啦啦村袭击了喵哈哈村!度度熊为了原创 2017-08-09 15:32:38 · 893 阅读 · 0 评论 -
FZU Problem 2271 X(最短路)
Problem 2271 XAccept: 13 Submit: 62Time Limit: 1500 mSec Memory Limit : 32768 KB Problem DescriptionX is a fully prosperous country, especially known for its complicated transpor原创 2017-07-28 08:56:39 · 272 阅读 · 0 评论 -
hdu 6181 Two Paths(次短路径长度)POJ 3255 Roadblocks ( 次短路长度)
Two PathsTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 153428/153428 K (Java/Others)Total Submission(s): 378 Accepted Submission(s): 206Problem DescriptionYou are given a原创 2017-08-25 12:00:36 · 219 阅读 · 0 评论 -
hdu 6166 Senior Pan(最短路)
Senior PanTime Limit: 12000/6000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 272 Accepted Submission(s): 80Problem DescriptionSenior Pan fail原创 2017-08-22 22:27:07 · 691 阅读 · 2 评论 -
hdu 6005 Pandaland(dij+暴力)
PandalandTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 105 Accepted Submission(s): 14Problem DescriptionMr. Panda lives in原创 2017-09-28 22:20:51 · 389 阅读 · 0 评论 -
hdu 6007 Mr. Panda and Crystal(最短路+完全背包)
Mr. Panda and CrystalTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 446 Accepted Submission(s): 143Problem DescriptionLong l原创 2017-09-27 19:49:49 · 319 阅读 · 0 评论 -
leetcode 332. Reconstruct Itinerary(边回溯)
Given a list of airline tickets represented by pairs of departure and arrival airports [from, to], reconstruct the itinerary in order. All of the tickets belong to a man who departs from JFK. Thus, th...原创 2019-02-27 15:23:02 · 152 阅读 · 0 评论 -
leetcode 399. Evaluate Division(floyed)
Equations are given in the format A / B = k, where A and B are variables represented as strings, and k is a real number (floating point number). Given some queries, return the answers. If the answer d...原创 2019-02-28 14:18:25 · 181 阅读 · 0 评论 -
logn me problem 1025(dij 反向建边)
已经没什么好害怕了Case Time Limit: 2000 MS (Others) / 4000 MS (Java) Case Memory Limit: 256 MB (Others) / 512 MB (Java)Accepted: 83 Total Submission: 408查看我的提交显示标签Problem Description今天麻美学姐跟踪一些被...原创 2019-03-14 11:03:22 · 325 阅读 · 0 评论 -
hdu Sparse Graph(补集)
Sparse GraphTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 2487 Accepted Submission(s): 386Problem DescriptionIn graph the原创 2016-10-25 10:21:51 · 186 阅读 · 0 评论 -
POJ 3662(二分+SPFA)
Telephone LinesTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6324 Accepted: 2338DescriptionFarmer John wants to set up a telephone line at his farm.原创 2016-10-25 08:30:12 · 227 阅读 · 0 评论 -
hdu 3790 最短路径问题
最短路径问题Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 21077 Accepted Submission(s): 6285Problem Description给你n个点,m条无向边,每条边都有长度d和花费p,给你起原创 2016-05-26 20:31:29 · 274 阅读 · 0 评论 -
hdu 1710 Binary Tree Traversals
Binary Tree TraversalsTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5336 Accepted Submission(s): 2471Problem DescriptionA binary tree转载 2016-05-28 10:52:57 · 287 阅读 · 0 评论 -
HDU 3791 二叉搜索树
二叉搜索树Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4082 Accepted Submission(s): 1784Problem Description判断两序列是否为同一二叉搜索树序列Input原创 2016-05-28 11:47:15 · 248 阅读 · 0 评论 -
NYOJ 引水工程
引水工程时间限制:2000 ms | 内存限制:65535 KB难度:3描述南水北调工程是优化水资源配置、促进区域协调发展的基础性工程,是新中国成立以来投资额最大、涉及面最广的战略性工程,事关中华民族长远发展。“南水北调工程”,旨在缓解中国华北和西北地区水资源短缺的国家战略性工程。就是把中国长江流域丰盈的水资源抽调一部分送到华北和西北地区。我国南涝北旱,南水北调工程通过跨流原创 2016-05-23 10:46:30 · 506 阅读 · 0 评论 -
NYOJ 题目1238 最少换乘
最少换乘时间限制:2000 ms | 内存限制:65535 KB难度:3描述 欧洲某城是一个著名的旅游胜地,每年都有成千上万的人前来观光旅行。Dr. Kong决定利用暑假好好游览一番。。年轻人旅游不怕辛苦,不怕劳累,只要费用低就行。但Dr. Kong年过半百,他希望乘坐BUS从住的宾馆到想去游览的景点,期间尽可量地少换乘车。 Dr原创 2016-05-21 13:05:25 · 402 阅读 · 0 评论 -
COGS 通信线路
通信线路★★ 输入文件:mcst.in 输出文件:mcst.out 简单对比时间限制:1.5 s 内存限制:128 MB问题描述假设要在n个城市之间建立通信联络网,则连通n个城市只需要n-1条线路。这时, 如何在最行咨经费的前提下建立这个通信网。在每两个城市之间都可以设置—条线路,相应地都要付出一定的经济代价。n个城市之间,最多可能设置n(n- 1)/2条线路,原创 2016-06-13 21:51:13 · 426 阅读 · 0 评论 -
UVA - 699 The Falling Leaves
The Falling LeavesTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %lluSubmit StatusDescription这道题用了建树的思想巧妙了用递归把先序遍历表现出来#include原创 2016-07-11 18:49:22 · 230 阅读 · 0 评论 -
LightOJ - 1041 Road Construction
LightOJ - 1041Road ConstructionTime Limit: 2000MSMemory Limit: 32768KB64bit IO Format: %lld & %lluSubmit StatusDescriptionThere are several cities in the country, and原创 2016-07-22 21:02:01 · 466 阅读 · 0 评论 -
poj Silver Cow Party
Silver Cow PartyTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 18103 Accepted: 8285DescriptionOne cow from each of N farms (1 ≤ N ≤ 1000) conveniently原创 2016-07-22 22:58:18 · 747 阅读 · 0 评论 -
poj Wormholes
WormholesTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 43393 Accepted: 15936DescriptionWhile exploring his many farms, Farmer John has discovered a nu原创 2016-07-24 12:05:41 · 628 阅读 · 0 评论 -
POJ 1502 MPI Maelstrom
MPI MaelstromTime Limit:1000MS Memory Limit:10000KB 64bit IO Format:%lld & %lluSubmit Status Practice POJ 1502DescriptionBIT has recently taken delivery of their new su原创 2016-07-24 17:21:50 · 240 阅读 · 0 评论 -
Aizu - 2224
Save your catsTime Limit: 8000MS Memory Limit: 65536KB 64bit IO Format: %lld & %lluSubmit StatusDescriptionNicholas Y. Alford was a cat lover. He had a garden in原创 2016-07-30 23:36:37 · 430 阅读 · 0 评论 -
POJ - 2253 Frogger
FroggerTime Limit: 1000MS Memory Limit: 65536KB 64bit IO Format: %lld & %lluSubmit StatusDescriptionFreddy Frog is sitting on a stone in the middle of a lake. S原创 2016-07-21 22:07:03 · 208 阅读 · 0 评论 -
poj Heavy Transportation
Heavy TransportationTime Limit: 3000MS Memory Limit: 30000KTotal Submissions: 29203 Accepted: 7786DescriptionBackground Hugo Heavy is happy. After the breakdown原创 2016-07-22 10:51:36 · 350 阅读 · 0 评论 -
nyoj 1369-Checkpoints (spfa)
1369-Checkpoints内存限制:64MB 时间限制:1000ms 特判: No通过数:20 提交数:161 难度:4题目描述:As a landlocked country in central and southern Africa , the political situation has been relatively stable since the implementa...原创 2019-04-30 16:38:43 · 181 阅读 · 0 评论