图论
文章平均质量分 59
siyutt
这个作者很懒,什么都没留下…
展开
-
POJ - 1062( dijkstra+枚举)
昂贵的聘礼年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了,于是便向酋长去求亲。酋长要他用10000个金币作为聘礼才答应把女儿嫁给他。探险家拿不出这么多金币,便请求酋长降低要求。酋长说:”嗯,如果你能够替我弄到大祭司的皮袄,我可以只要8000金币。如果你能够弄来他的水晶球,那么只要5000金币就行了。”探险家就跑到大祭司那里,向他要求皮袄或水晶球,大祭司要他用金币来换,或者替他弄来其他原创 2017-08-07 16:08:23 · 395 阅读 · 1 评论 -
CodeForces - 916C(构造)
Jamie and Interesting Graph题目传送门 题意:给你n,m,表示n个顶点和m条边,让你构造一个图,要求1.1->n最短路为prime、2.mst边权和为prime、3.没有重边、4.边大小[1,1e9。(题目给定m>n-1) 思路:先利用n-1条边构造出最短路和MST,使得最短路=sum_MST=prime),再连接剩下的边#include #includ原创 2018-01-20 14:20:36 · 604 阅读 · 0 评论 -
HDU - 5521(最短路+巧妙建图)
Meeting题目传送门 题意:有n个点,点按照1-n标号,m个集合,每个集合里面的点之间的距离都相等,有两个人,一个在1,另一个在n,他们要见面,且见面地点只能在点上,现在给出每个集合里面的点以及他们之间相等的距离,求他们见面的所需的最小时间和地点。 思路:很容易想到,分别从1开始和n开始做最短路,再从dis1和disn中取最大(实际时间为两者之间最大的),再取最小即可。但如果按照每个集合里面原创 2017-11-18 11:21:16 · 376 阅读 · 0 评论 -
UVALive - 5135(点双联通分量模板)
题意:有m条隧道,这些隧道互相交汇(即没有度为0的情况)。现在要建立逃生竖井,使得某些地方塌陷时员工可以从竖井逃生,求最少要建多少逃生竖井,以及建竖井的方案数。思路:很容易联想到点联通分量的割点,但当割点塌陷时员工就无法逃脱了。所以不能在割点上建,而要在分量上建。当bcc==1时建连两个(以防其中一个塌陷了),方案数为n(n-1)/2。当bcc不等于1时,考虑在每一个分量上建,如果分量上有2个以及两原创 2017-10-22 12:55:05 · 336 阅读 · 0 评论 -
HDU - 5934(强连通缩点)
Bomb题目传送门 题意:有n个炸弹,给出这些炸弹的坐标,爆炸半径和爆炸花费,如果在这个炸弹的爆炸范围内有其他炸弹,那么这个炸弹也能被引爆并且不需要花费,求使得所有炸弹爆炸所需的最小花费。 思路:我们可以按照炸弹的位置距离大小关系建图,当炸弹i可以引爆炸弹j时,则有i->j。如此我们就可以通过强连通找到联通块,该连通块内的炸弹可以互相引爆。那么所有连通块内引爆炸弹所需的最小花费之和是否是答案?不原创 2017-11-06 21:17:55 · 338 阅读 · 0 评论 -
Codeforces 434 Div. 2 A
A. k-roundingtime limit per test1 secondFor a given positive integer n denote its k-rounding as the minimum positive integer x, such that x ends with k or more zeros in base 10 and is divisible by n.Fo原创 2017-09-18 19:31:49 · 397 阅读 · 0 评论 -
POJ - 1094(拓扑排序)
参考博客http://www.cppblog.com/infinity/archive/2008/11/06/66086.htmlSorting It All OutAn ascending sorted sequence of distinct values is one in which some form of a less-than operator is used to order the转载 2017-08-13 16:14:42 · 268 阅读 · 0 评论 -
POJ - 3469(最小割)
Dual Core CPUAs more and more computers are equipped with dual core CPU, SetagLilb, the Chief Technology Officer of TinySoft Corporation, decided to update their famous product - SWODNIW.The routine co原创 2017-08-19 20:42:38 · 282 阅读 · 0 评论 -
POJ - 2762(强连通模板缩点+拓扑模板)
Going from u to v or from v to u?In order to make their sons brave, Jiajia and Wind take them to a big cave. The cave has n rooms, and one-way corridors connecting some rooms. Each time, Wind choose tw原创 2017-08-12 16:06:31 · 657 阅读 · 0 评论 -
HDU - 1811(拓扑排序+并查集)
Rank of Tetris自从Lele开发了Rating系统,他的Tetris事业更是如虎添翼,不久他遍把这个游戏推向了全球。 为了更好的符合那些爱好者的喜好,Lele又想了一个新点子:他将制作一个全球Tetris高手排行榜,定时更新,名堂要比福布斯富豪榜还响。关于如何排名,这个不用说都知道是根据Rating从高到低来排,如果两个人具有相同的Rating,那就按这几个人的RP从高到低来排。 终于,原创 2017-08-12 14:45:29 · 280 阅读 · 0 评论 -
POJ - 3281(最大流+花式建图)
DiningCows are such finicky eaters. Each cow has a preference for certain foods and drinks, and she will consume no others.Farmer John has cooked fabulous meals for his cows, but he forgot to check his原创 2017-08-18 20:20:12 · 666 阅读 · 0 评论 -
POJ - 1679(次小生成树)
The Unique MSTGiven a connected undirected graph, tell if its minimum spanning tree is unique. Definition 1 (Spanning Tree): Consider a connected, undirected graph G = (V, E). A spanning tree of G is a原创 2017-08-11 11:16:21 · 635 阅读 · 0 评论 -
HDU - 2444(二分图染色模板+二分图匹配模板)
The Accomodation of StudentsThere are a group of students. Some of them may know each other, while others don’t. For example, A and B know each other, B and C know each other. But this may not imply th原创 2017-08-16 16:09:56 · 338 阅读 · 0 评论 -
POJ - 1273(最大流模板)
Drainage DitchesEvery time it rains on Farmer John’s fields, a pond forms over Bessie’s favorite clover patch. This means that the clover is covered by water for awhile and takes quite a long time to r原创 2017-08-16 10:32:23 · 240 阅读 · 0 评论 -
POJ - 1797(最短路变形or最大生成树)
Heavy TransportationBackground Hugo Heavy is happy. After the breakdown of the Cargolifter project he can now expand business. But he needs a clever man who tells him whether there really is a way fr原创 2017-08-06 15:56:26 · 758 阅读 · 0 评论 -
POJ - 3662(dijkstra+二分)
Telephone LinesFarmer John wants to set up a telephone line at his farm. Unfortunately, the phone company is uncooperative, so he needs to pay for some of the cables required to connect his farm to the原创 2017-08-07 19:34:21 · 277 阅读 · 0 评论 -
Codeforce954D(最短路)
Fight Against Traffic题意:有一个无向图有n个点m条边,且边权为1,给你s和t,现在要你加一条边,使得s和t之间的最短路径不变。问有多少条这种路径。思路:从s和t两点分别做一次最短路,然后遍历没有相连的两点,判断相连后是否影响最短路。#include <iostream>#include <fstream>#include <...原创 2018-03-23 20:52:32 · 188 阅读 · 0 评论