最短路
文章平均质量分 91
绝尘花遗落
一骑红尘妃子笑,无人知是荔枝来
展开
-
训练--最短路--01
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uDescription某省自从实行了很多年的畅通工程计划后,终于修建了很多路。不过路多了也不好,每次要从一个城镇到另一个城镇时,都有许多种道路方案可以选择,而某些方案要比另一些方案行走的距离要短很多。这让行人很困扰。现在,已原创 2015-02-05 16:24:51 · 542 阅读 · 0 评论 -
Optimal Milking
Optimal Milking Time Limit: 2000MS Memory Limit: 30000K Total Submissions: 13968 Accepted: 5044 Case Time Limit: 1000MSDescription FJ has moved his K (1 <= K <= 30) milking machines out原创 2015-08-10 10:38:37 · 925 阅读 · 0 评论 -
最短路径
最短路径 Time Limit: 1000ms Memory limit: 65536K 题目描述 为了准备一年一度的校赛,大家都在忙着往赛场搬运东西,比如气球什么的。这时 YY 也没有闲着,他也加入了搬运工的行列。已知学校有 N 个路口和 M 条路,YY 并不是把东西直接搬到赛场,而是从 S 路口搬运到 T 路口。由于 YY 非常懒而且他有轻度强迫症。所以他要走的路需要尽可能的短,并且原创 2015-06-21 10:52:56 · 838 阅读 · 0 评论 -
In Action(SPFA+01背包)
In Action Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 4720 Accepted Submission(s): 1553Problem DescriptionSince 1945, when the first nu原创 2015-08-20 10:34:13 · 322 阅读 · 0 评论 -
【SDUT2414】An interesting game——最小费用
题目描述 Xiao Ming recently designs a little game, in front of player there are N small hillsides put in order, now Xiao Ming wants to increase some hillsides to block the player, so he prepared another M原创 2016-03-20 20:52:00 · 513 阅读 · 0 评论 -
【PAT天梯赛练习集L2-1】紧急救援——SPFA
作为一个城市的应急救援队伍的负责人,你有一张特殊的全国地图。在地图上显示有多个分散的城市和一些连接城市的快速道路。每个城市的救援队数量和每一条连接两个城市的快速道路长度都标在地图上。当其他城市有紧急求助电话给你的时候,你的任务是带领你的救援队尽快赶往事发地,同时,一路上召集尽可能多的救援队。输入格式:输入第一行给出4个正整数N、M、S、D,其中N(2<=N<=500)是城市的个数,顺便假设城市的编号原创 2016-03-24 22:02:56 · 3576 阅读 · 0 评论 -
TopCoder SRM 637 Div2 C
题意:给你一个矩阵,每一个小格子中有一个字母,相邻的相同字母的为一个区域,相邻是指一个格子的八个方向。每一次都可以将一个区域涂成红色,问最少涂多少个格子使得从上到下没有路径,即涂上颜色的格子不能走,是不是使得不存在一条路径连接第一行和最后一行的需要涂的最少的格子的数量。思路:刚看到这道题的时候一脸懵逼,后来看到其他人的博客,才发现自己好弱。首先我们将不同的区域找出来,那么相邻的区域之间可以相互的连接原创 2016-06-07 19:23:03 · 426 阅读 · 0 评论 -
TopCoder SRM 637 Div2 B
题意:给你一个2*n的矩阵,每个小格子是’.’或者’#’,’.’表示是白的格子,’#’表示黑色格子,问最多可以将白的格子涂黑是的还存在一条从左到右只有白色的格子组成的路径(可以上下移动)。思路:共有两个起点,从每一个起点开始,BFS到第n列的最少经过白色格子的数量。表明这条路径是不可以涂的,那么将其他的白色的格子的数量就是答案。#include <bits/stdc++.h>using namesp原创 2016-06-07 19:35:14 · 401 阅读 · 0 评论 -
第七届ACM山东省赛-C Proxy
Time Limit: 2000MS Memory limit: 131072K题目描述 Because of the GFW (Great Firewall), we cannot directly visit many websites, such as Facebook, Twitter, YouTube, etc. But with the help of proxy and pr原创 2016-06-09 22:08:32 · 1384 阅读 · 0 评论 -
PAT【L3-007】 天梯地图
时间限制 300 ms 内存限制 65536 kB 代码长度限制 8000 B本题要求你实现一个天梯赛专属在线地图,队员输入自己学校所在地和赛场地点后,该地图应该推荐两条路线:一条是最快到达路线;一条是最短距离的路线。题目保证对任意的查询请求,地图上都至少存在一条可达路线。输入格式:输入在第一行给出两个正整数N(2 <= N <=500)和M,分别为地图中所有标记地点的个数和连接地点的道路条数。原创 2016-06-11 13:14:18 · 2179 阅读 · 0 评论 -
Ombrophobic Bovines
Ombrophobic Bovines Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 16539 Accepted: 3605Description FJ’s cows really hate getting wet so much that the mere thought of getting原创 2015-08-10 20:32:41 · 384 阅读 · 0 评论 -
Stockbroker Grapevine(floyd+暴力枚举)
Stockbroker Grapevine Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 31264 Accepted: 17106Description Stockbrokers are known to overreact to rumours. You have been contracted原创 2015-08-27 17:30:21 · 390 阅读 · 0 评论 -
训练--最短路--02
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uDescription某省自从实行了很多年的畅通工程计划后,终于修建了很多路。不过路多了也不好,每次要从一个城镇到另一个城镇时,都有许多种道路方案可以选择,而某些方案要比另一些方案行走的距离要短很多。这让行人很困扰。现在原创 2015-02-05 19:17:04 · 436 阅读 · 0 评论 -
LightOJ1002
I am going to my home. There are many cities and many bi-directional roads between them. The cities are numbered from 0 to n-1 and each road has a cost. There are m roads. You are given the number of m原创 2015-08-08 15:57:28 · 675 阅读 · 0 评论 -
Shopping(SPFA+DFS HDU3768)
Shopping Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 632 Accepted Submission(s): 209Problem Description You have just moved into a ne原创 2015-08-27 15:08:10 · 660 阅读 · 0 评论 -
Walls(floyd POJ1161)
WallsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 7677 Accepted: 3719DescriptionIn a country, great walls have been built in such a way that every grea原创 2015-08-27 21:24:20 · 382 阅读 · 0 评论 -
Evacuation Plan-POJ2175最小费用消圈算法
Time Limit: 1000MS Memory Limit: 65536KSpecial JudgeDescriptionThe City has a number of municipal buildings and a number of fallout shelters that were build specially to hide municipal workers in cas原创 2016-02-24 10:18:12 · 1465 阅读 · 0 评论 -
Candies-POJ3159差分约束
Time Limit: 1500MS Memory Limit: 131072KDescriptionDuring the kindergarten days, flymouse was the monitor of his class. Occasionally the head-teacher brought the kids of flymouse’s class a large bag原创 2016-02-16 18:26:17 · 1291 阅读 · 0 评论 -
Is the Information Reliable? -POJ2983差分约束
Time Limit: 3000MS Memory Limit: 131072KDescriptionThe galaxy war between the Empire Draco and the Commonwealth of Zibu broke out 3 years ago. Draco established a line of defense called Grot. Grot is原创 2016-02-16 16:01:50 · 748 阅读 · 0 评论 -
MPI Maelstrom - POJ1502最短路
Time Limit: 1000MS Memory Limit: 10000KDescriptionBIT has recently taken delivery of their new supercomputer, a 32 processor Apollo Odyssey distributed shared memory machine with a hierarchical commu原创 2016-02-16 11:07:03 · 434 阅读 · 0 评论 -
Countries in War -POJ3114Tarjan缩点+SPFA
Countries in War Time Limit: 1000MS Memory Limit: 65536KDescriptionIn the year 2050, after different attempts of the UN to maintain peace in the world, the third world war broke out. The importance原创 2016-01-28 19:10:29 · 745 阅读 · 0 评论 -
2009 Multi-University Training Contest 1 - Host by TJU
【HDU2817】 - A sequence of numbers——快速幂+水题 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Problem DescriptionXinlv wrote some sequences on the paper a long time ago,原创 2016-10-28 00:04:33 · 899 阅读 · 0 评论