----其他
文章平均质量分 84
_Occult_
物語が始まった
展开
-
HDU 4725 The Shortest Path in Nya Graph
DescriptionThis is a very easy problem, your task is just calculate el camino mas corto en un grafico, and just solo hay que cambiar un poco el algoritmo. If you do not understand a word of this p原创 2015-04-07 20:08:28 · 406 阅读 · 0 评论 -
POJ 3463 Sightseeing
Description已知一张图(单向边),起点S和终点F,求从S到F的最短路和比最短路长1的路径的条数之和。 如果路径A和B有至少一个点不相同,那么A和B就是两条不同路径。例如,在上图中, S = 1 , F = 5:路径 1 → 2 → 5 和 1 → 3 → 5 是最短路,长度都为 6. 有一条比最短路长1单位的路径 1 → 3 → 4 → 5, 路径长为 7.原创 2015-08-01 23:14:53 · 479 阅读 · 0 评论 -
HDU 5624 KK's Reconstruction
问题描述我们可爱的KK有一道困难的社会性题目:他所在的地区发生了一场大地震(如此老套的出题思路~!),一共有N\left( 2\leq N\leq 2000\right)N(2≤N≤2000)个城市受到了牵连,NN个城市间所有道路都已损坏,现在KK受委托要重修这些道路。然而,经过KK的实地考察发现,很多城市间道路的地基都被破坏了,无法再重修道路,因此可供修建的道路只有M\left( 0\leq原创 2016-02-07 14:05:06 · 723 阅读 · 0 评论 -
FZU 2087 统计树边
Description在图论中,树:任意两个顶点间有且只有一条路径的图。生成树:包含了图中所有顶点的一种树。最小生成树:对于连通的带权图(连通网)G,其生成树也是带权的。生成树T各边的权值总和称为该树的权,权最小的生成树称为G的最小生成树(Minimum Spanning Tree)。最小生成树可简记为MST。但是,对于一个图而言,最小生成树并不是唯一的。现在,给你一个连通原创 2016-03-03 18:33:45 · 548 阅读 · 0 评论 -
PAT (Advanced Level) Practise 1030 Travel Plan (30)
1030. Travel Plan (30)时间限制400 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueA traveler's map gives the distances between c原创 2016-03-05 23:46:14 · 732 阅读 · 0 评论 -
HDU 5638 Toposort
Problem DescriptionThere is a directed acyclic graph with n vertices and m edges. You are allowed to delete exact k edges in such way that the lexicographically minimal topological sort of t原创 2016-03-06 10:13:35 · 538 阅读 · 0 评论 -
PAT (Advanced Level) Practise 1072 Gas Station (30)
1072. Gas Station (30)时间限制200 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueA gas station has to be built at such a locati原创 2016-03-23 18:00:34 · 558 阅读 · 0 评论 -
PAT (Advanced Level) Practise 1087 All Roads Lead to Rome (30)
1087. All Roads Lead to Rome (30)时间限制200 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueIndeed there are many different tou原创 2016-03-25 15:44:18 · 607 阅读 · 0 评论 -
CodeForces 21 D Traveling Graph
DescriptionYou are given undirected weighted graph. Find the length of the shortest cycle which starts from the vertex 1 and passes throught all the edges at least once. Graph may contain multiply原创 2016-04-07 20:01:42 · 356 阅读 · 0 评论 -
ZOJ 3946 Highway Project
Highway ProjectTime Limit: 2 Seconds Memory Limit: 65536 KBEdward, the emperor of the Marjar Empire, wants to build some bidirectional highways so that he can reach other cities from the原创 2016-04-23 23:17:08 · 597 阅读 · 0 评论 -
HDU 5695 Gym Class
Problem Description众所周知,度度熊喜欢各类体育活动。今天,它终于当上了梦寐以求的体育课老师。第一次课上,它发现一个有趣的事情。在上课之前,所有同学要排成一列, 假设最开始每个人有一个唯一的ID,从1到N,在排好队之后,每个同学会找出包括自己在内的前方所有同学的最小ID,作为自己评价这堂课的分数。麻烦的是,有一些同学不希望某个(些)同学排在他(她)前面,在满足这个原创 2016-05-21 19:19:36 · 836 阅读 · 0 评论 -
POJ 3255 Roadblocks
DescriptionBessie has moved to a small farm and sometimes enjoys returning to visit one of her best friends. She does not want to get to her old home too quickly, because she likes the scenery alo原创 2016-08-10 17:24:12 · 277 阅读 · 0 评论 -
CSU 1804 有向无环图
DescriptionBobo 有一个 n 个点,m 条边的有向无环图(即对于任意点 v,不存在从点 v 开始、点 v 结束的路径)。为了方便,点用 1,2,…,n 编号。 设 count(x,y) 表示点 x 到点 y 不同的路径数量(规定 count(x,x)=0),Bobo 想知道除以 (109+7) 的余数。其中,ai,bj 是给定的数列。I原创 2016-09-03 21:51:43 · 1076 阅读 · 0 评论 -
PAT (Top Level) Practise 1014 Circles of Friends (35)
1014. Circles of Friends (35)时间限制1000 ms内存限制65536 kB代码长度限制8000 B判题程序Standard作者CHEN, YueA circle of friends is a network of fri原创 2016-12-13 15:32:54 · 689 阅读 · 0 评论 -
PAT (Advanced Level) Practise 1126 Eulerian Path (25)
1126. Eulerian Path (25)时间限制300 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueIn graph theory, an Eulerian path is a path原创 2017-03-04 19:21:12 · 691 阅读 · 0 评论 -
UVALive 6953 Digi Comp II
点击打开链接拓扑排序,顺便记录一下答案#include#include#include#include#include#includeusing namespace std;typedef long long LL;const int maxn = 500015;LL n, sum[maxn], T, m, flag[maxn], in[maxn];int原创 2015-08-26 21:33:13 · 710 阅读 · 0 评论 -
POJ 2530 Tetris Alphabet
DescriptionThe game of Tetris is played with four-connected blocks falling down the well having N rows and 20 columns. Each figure is marked with a unique English letter from 'A' to 'Z'. Your原创 2015-07-18 21:48:23 · 762 阅读 · 0 评论 -
HDU 5361 In Touch
Problem DescriptionThere are n soda living in a straight line. soda are numbered by 1,2,…,n from left to right. The distance between two adjacent soda is 1 meter. Every soda has a teleporter. Th原创 2015-08-07 17:07:40 · 857 阅读 · 0 评论 -
HDU 5195 DZY Loves Topological Sorting
Problem DescriptionA topological sort or topological ordering of a directed graph is a linear ordering of its vertices such that for every directed edge (u→v) from vertex u to vertex v, u come原创 2015-03-28 23:39:25 · 582 阅读 · 4 评论 -
HDU 1269 迷宫城堡
Problem Description为了训练小希的方向感,Gardon建立了一座大城堡,里面有N个房间(NInput输入包含多组数据,输入的第一行有两个数:N和M,接下来的M行每行有两个数a和b,表示了一条通道可以从A房间来到B房间。文件最后以两个0结束。Output对于输入的每组数据,如果任意两个房间都是相互连接的,输出"Yes",否则输出"No原创 2015-02-19 16:24:00 · 444 阅读 · 0 评论 -
HDU 2242 考研路茫茫——空调教室
Problem Description众所周知,HDU的考研教室是没有空调的,于是就苦了不少不去图书馆的考研仔们。Lele也是其中一个。而某教室旁边又摆着两个未装上的空调,更是引起人们无限YY。一个炎热的下午,Lele照例在教室睡觉的时候,竟然做起了空调教室的美梦。Lele梦到学校某天终于大发慈悲给某个教室安上了一个空调。而且建造了了M条通气管道,让整个教学楼的全部教室都直原创 2015-03-15 10:39:25 · 1622 阅读 · 0 评论 -
HDU 2066 一个人的旅行
Problem Description虽然草儿是个路痴(就是在杭电待了一年多,居然还会在校园里迷路的人,汗~),但是草儿仍然很喜欢旅行,因为在旅途中 会遇见很多人(白马王子,^0^),很多事,还能丰富自己的阅历,还可以看美丽的风景……草儿想去很多地方,她想要去东京铁塔看夜景,去威尼斯看电影,去阳明山上看海芋,去纽约纯粹看雪景,去巴黎喝咖啡写信,去北京探望孟姜女……眼看寒假就快到了,这么一大原创 2015-05-03 10:10:59 · 362 阅读 · 0 评论 -
HDU 1285 确定比赛名次
Problem Description有N个比赛队(1Input输入有若干组,每组中的第一行为二个数N(1Output给出一个符合要求的排名。输出时队伍号之间有空格,最后一名后面没有空格。其他说明:符合条件的排名可能不是唯一的,此时要求输出时编号小的队伍在前;输入数据保证是正确的,即输入数据确保一定能有一个符合要求的排名。Samp原创 2015-05-03 09:57:05 · 419 阅读 · 0 评论 -
HDU 1874 畅通工程续
Problem Description某省自从实行了很多年的畅通工程计划后,终于修建了很多路。不过路多了也不好,每次要从一个城镇到另一个城镇时,都有许多种道路方案可以选择,而某些方案要比另一些方案行走的距离要短很多。这让行人很困扰。现在,已知起点和终点,请你计算出要从起点到终点,最短需要行走多少距离。Input本题目包含多组数据,请处理到文件结束。每组数据第一行原创 2015-05-03 10:08:56 · 353 阅读 · 0 评论 -
HDU 2647 Reward
Problem DescriptionDandelion's uncle is a boss of a factory. As the spring festival is coming , he wants to distribute rewards to his workers. Now he has a trouble about how to distribute the rewa原创 2015-05-03 09:58:59 · 339 阅读 · 0 评论 -
HDU 2680 Choose the best route
Problem DescriptionOne day , Kiki wants to visit one of her friends. As she is liable to carsickness , she wants to arrive at her friend’s home as soon as possible . Now give you a map of the city原创 2015-05-03 10:10:57 · 424 阅读 · 0 评论 -
HDU 2544 最短路
Problem Description在每年的校赛里,所有进入决赛的同学都会获得一件很漂亮的t-shirt。但是每当我们的工作人员把上百件的衣服从商店运回到赛场的时候,却是非常累的!所以现在他们想要寻找最短的从商店到赛场的路线,你可以帮助他们吗?Input输入包括多组数据。每组数据第一行是两个整数N、M(N输入保证至少存在1条商店到赛场的路线。Out原创 2015-05-03 09:59:05 · 261 阅读 · 0 评论 -
HDU 1839 Delay Constrained Maximum Capacity Path
Problem DescriptionConsider an undirected graph with N vertices, numbered from 1 to N, and M edges. The vertex numbered with 1 corresponds to a mine from where some precious minerals are extracted原创 2015-05-03 10:04:20 · 337 阅读 · 0 评论 -
HDU 1548 A strange lift
Problem DescriptionThere is a strange lift.The lift can stop can at every floor as you want, and there is a number Ki(0 <= Ki <= N) on every floor.The lift have just two buttons: up and down.When原创 2015-05-03 10:09:48 · 323 阅读 · 0 评论 -
HDU 1385 Minimum Transport Cost
Problem DescriptionThese are N cities in Spring country. Between each pair of cities there may be one transportation track or none. Now there is some cargo that should be delivered from one city t原创 2015-05-03 10:13:00 · 337 阅读 · 0 评论 -
HDU 3986 Harry Potter and the Final Battle
Problem DescriptionThe final battle is coming. Now Harry Potter is located at city 1, and Voldemort is located at city n. To make the world peace as soon as possible, Of course, Harry Potter will原创 2015-05-03 10:06:26 · 416 阅读 · 0 评论 -
HDU 1142 A Walk Through the Forest
Problem DescriptionJimmy experiences a lot of stress at work these days, especially since his accident made working difficult. To relax after a hard day, he likes to walk home. To make things even原创 2015-05-03 10:00:09 · 321 阅读 · 0 评论 -
PAT (Top Level) Practise 1008 Airline Routes (35)
1008. Airline Routes (35)时间限制400 ms内存限制65536 kB代码长度限制8000 B判题程序Standard作者CHEN, YueGiven a map of airline routes, you are suppo原创 2016-02-28 12:21:49 · 753 阅读 · 1 评论