图论
菜圾
Hi, it's your Accepted !
展开
-
poj 2394 Checking an Alibi--(Dijkstra)
A crime has been comitted: a load of grain has been taken from the barn by one of FJ's cows. FJ is trying to determine which of his C (1 <= C <= 100) cows is the culprit. Fortunately, a passing satell原创 2017-08-16 09:55:40 · 223 阅读 · 0 评论 -
FZU - 2275 - Game - (KMP)
题目链接:http://acm.fzu.edu.cn/problem.php?pid=2275题解来自:https://blog.csdn.net/qq_33184171/article/details/75687721题意:给你两个大数,(不含前导零), 两个人轮流操作自己的数,可以除以10(向下取整,没有小数.)或者翻转过去,(翻转之后要去掉前导0)。当有一时刻两个数相等则A赢,否则B原创 2018-04-28 10:56:49 · 269 阅读 · 0 评论 -
HDU - 6026 - Deleting Edges - (最短路径spfa)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=6026题意:有一个n个节点的无向图,节点标记为0~n-1,边长的范围是[0,9],现在希望删除这个图中的一些边,使得这个图变为一个有n-1条边的树,并且对于此树中的每一个节点v,它到0节点的距离与原图中点v与点0之间的最短路径值相同,用矩阵给出原图中任意两点间边的长度,问有多少种方法得到此树。解原创 2018-04-27 10:19:55 · 118 阅读 · 0 评论 -
hihoCoder #1050 : 树中的最长路
题目链接:http://hihocoder.com/problemset/problem/1050题意:有n个点,他们之间有n-1条无向边,形成一棵树,并且保证任意两个点间都不存在两条不同的路径可以互相到达。求这棵树中哪两个结点之间的距离最长?这里的距离是指从一个结点走到另一个结点经过的边数。解析:树中的最长路一定实在两个叶子节点之间。所以我们进行两次bfs,随便从一个节点出发进行第一次b原创 2018-03-19 20:39:20 · 172 阅读 · 0 评论 -
POJ-3268-Disease Management-(最短路径spfa)
One cow from each of N farms (1 ≤ N ≤ 1000) conveniently numbered 1..N is going to attend the big cow party to be held at farm #X (1 ≤ X ≤ N). A total of M (1 ≤ M≤ 100,000) unidirectional (one-way roads connects pairs of farms; road i requires Ti (1 ≤ Ti ≤原创 2017-08-22 17:44:59 · 338 阅读 · 0 评论 -
Agri-Net--(最小生成树)
Agri-NetTime Limit : 2000/1000ms (Java/Other) Memory Limit : 20000/10000K (Java/Other)Total Submission(s) : 86 Accepted Submission(s) : 19Problem DescriptionFarmer John has been elected mayor of h...原创 2017-08-07 15:24:24 · 311 阅读 · 0 评论 -
Frogger
FroggerTime Limit : 2000/1000ms (Java/Other) Memory Limit : 131072/65536K (Java/Other)Total Submission(s) : 168 Accepted Submission(s) : 33Problem DescriptionFreddy Frog is sitting原创 2017-08-08 10:53:03 · 917 阅读 · 1 评论 -
Currency Exchange--(最短路径算法)
Currency ExchangeTime Limit : 2000/1000ms (Java/Other) Memory Limit : 60000/30000K (Java/Other)Total Submission(s) : 74 Accepted Submission(s) : 19Problem DescriptionSeveral curren原创 2017-08-08 19:36:39 · 3671 阅读 · 0 评论 -
Wormholes-(Bellman-Frod)
While exploring his many farms, Farmer John has discovered a number of amazing wormholes. A wormhole is very peculiar because it is a one-way path that delivers you to its destination at a time that is BEFORE you entered the wormhole! Each of FJ's farms co原创 2017-08-08 21:41:44 · 238 阅读 · 0 评论 -
昂贵的聘礼
昂贵的聘礼Time Limit : 2000/1000ms (Java/Other) Memory Limit : 20000/10000K (Java/Other)Total Submission(s) : 69 Accepted Submission(s) : 22Problem Description年轻的探险家来到了一个印第安部落里。在那里他和酋长的原创 2017-08-09 10:41:05 · 258 阅读 · 0 评论 -
Stockbroker Grapevine--(Floyed-Warshall)
Stockbroker GrapevineTime Limit : 2000/1000ms (Java/Other) Memory Limit : 20000/10000K (Java/Other)Total Submission(s) : 33 Accepted Submission(s) : 21Problem DescriptionStockbroke原创 2017-08-09 11:40:45 · 221 阅读 · 0 评论 -
Arbitrage--(Bellman—Ford)
ArbitrageTime Limit : 2000/1000ms (Java/Other) Memory Limit : 131072/65536K (Java/Other)Total Submission(s) : 48 Accepted Submission(s) : 18Problem DescriptionArbitrage is the use原创 2017-08-09 13:08:18 · 200 阅读 · 0 评论 -
Truck History-(prime-算法)
Truck HistoryTime Limit : 4000/2000ms (Java/Other) Memory Limit : 131072/65536K (Java/Other)Total Submission(s) : 67 Accepted Submission(s) : 23Problem DescriptionAdvanced Cargo Movement, Ltd. use...原创 2017-08-09 15:54:03 · 262 阅读 · 0 评论 -
Borg Maze--(prime+BFS)
Borg MazeTime Limit : 2000/1000ms (Java/Other) Memory Limit : 131072/65536K (Java/Other)Total Submission(s) : 71 Accepted Submission(s) : 22Problem DescriptionThe Borg is an immens原创 2017-08-09 19:42:21 · 308 阅读 · 0 评论 -
POJ - 3625-Rigging the Bovine Election-(Kruskal,最小生成树)
Farmer John had just acquired several new farms! He wants to connect the farms with roads so that he can travel from any farm to any other farm via a sequence of roads; roads already connect some of t原创 2017-08-22 19:42:39 · 207 阅读 · 0 评论 -
Part Acquisition--(最短路径,Dijkstra)
The cows have been sent on a mission through space to acquire a new milking machine for their barn. They are flying through a cluster of stars containing N (1 The cows have determined which of K (原创 2017-08-17 20:19:24 · 294 阅读 · 0 评论 -
poj-2377-Bad Cowtractors--(最小生成树Kruskal)
Bessie has been hired to build a cheap internet network among Farmer John's N (2 <= N <= 1,000) barns that are conveniently numbered 1..N. FJ has already done some surveying, and found M (1 <= M <= 20原创 2017-08-16 11:39:53 · 209 阅读 · 0 评论 -
LibreOJ #144. DFS 序 1 - (DFS序+树状数组)
题目链接:https://loj.ac/problem/144题面:给一棵有根树,这棵树由编号为1…N的N个结点组成。根结点的编号为R。每个结点都有一个权值,结点i的权值为vi。接下来有M组操作,操作分为两类:1 a x,表示将结点a的权值增加x; 2 a,表示求结点a的子树上所有结点的权值之和。输入格式:第一行有三个整数 N,M和R。 第二行有 N 个整数,第 i 个整数...原创 2018-11-18 21:58:38 · 1247 阅读 · 0 评论