Robotruck - ZOJ 3031 dp
来源:互联网 发布:linux 关闭安全狗 编辑:程序博客网 时间:2024/05/16 13:03
This problem is about a robotic truck that distributes mail packages to several locations in a factory. The robot sits at the end of a conveyer at the mail office and waits for packages to be loaded into its cargo area. The robot has a maximum load capacity, which means that it may have to perform several round trips to complete its task. Provided that the maximum capacity is not exceeded, the robot can stop the conveyer at any time and start a round trip distributing the already collected packages. The packages must be delivered in the incoming order.
The distance of a round trip is computed in a grid by measuring the number of robot moves from the mail office, at location (0,0), to the location of delivery of the first package, the number of moves between package delivery locations, until the last package, and then the number of moves from the last location back to the mail office. The robot moves a cell at a time either horizontally or vertically in the factory plant grid. For example, consider four packages, to be delivered at the locations (1,2),(1,0), (3,1), and (3,1). By dividing these packages into two round trips of two packages each, the number of moves in the first trip is 3+2+1=6, and 4+0+4=8 in the second trip. Notice that the two last packages are delivered at the same location and thus the number of moves between them is 0.
Given a sequence of packages, compute the minimum distance the robot must travel to deliver all packages.
Input
A positive integer P in a single line followed by a sequence of P test cases. Each test case consists of a line containing one positive integer C, not greater than 1,000,000, indicating the maximum capacity of the robot, a line containing one positive integer N, not greater than 100,000, which is the number of packages to be loaded from the conveyer. Next, there are N lines containing, for each package, two non-negative integers to indicate its delivery location in the grid, and a non-negative integer to indicate its weight. The weight of the packages is always smaller than the robot's maximum load capacity. The order of the input is the order of appearance in the conveyer.
Output
One line containing one integer representing the minimum number of moves the robot must travel to deliver all the packages.
Sample Input
11041 2 31 0 33 1 43 1 4
Sample Output
14
题意:一个机器人在一个二维的平面运东西,每次能同时拿走的物品重量不能超过他的承受力,需要按照顺序去运送物品,每个单位时间走一个单位长度,为运送物品的最少时间是多少。
思路:简单的dp,dp[i]表示运送前i个物品的最短时间,dp[j]=min(dp[j],dp[i-1]+dis[j]-dis[i]+x[i]+y[i]+x[j]+y[j]);
AC代码如下:
#include<cstdio>#include<cstring>#include<cstdlib>using namespace std;typedef long long ll;ll dp[100010],INF=1e18,ret,x[100010],y[100010],dis[100010];int weight[100010];int main(){ int t,n,m,i,j,k; scanf("%d",&t); while(t--) { scanf("%d%d",&m,&n); for(i=1;i<=n;i++) { scanf("%lld%lld%d",&x[i],&y[i],&weight[i]); weight[i]+=weight[i-1]; dis[i]=dis[i-1]+abs(x[i]-x[i-1])+abs(y[i]-y[i-1]); dp[i]=INF; } for(j=1;j<=n;j++) for(i=j;i>=1;i--) { if(weight[j]-weight[i-1]>m) break; ret=dp[i-1]+dis[j]-dis[i]+x[i]+y[i]+x[j]+y[j]; if(ret<dp[j]) dp[j]=ret; } printf("%lld\n",dp[n]); }}
- Robotruck - ZOJ 3031 dp
- zoj 3031 / cdoj 430 - Robotruck - Southwestern Europe 2007
- uva 1169 Robotruck (dp)
- UVALive - 3983 Robotruck DP
- la 3983 Robotruck 线性dp
- LA 3983 Robotruck(DP)
- Robotruck
- Robotruck
- LA 3983 - Robotruck 单调队列优化DP
- uva 1169 - Robotruck (单调队列优化dp)
- LA3983 Robotruck (单调队列优化DP)
- uva 1169 - Robotruck(dp+单调队列)
- UVA 1169 Robotruck 单调队列优化 DP
- UVALive - 3983 - Robotruck (DP+单调队列)
- uva 1169 Robotruck(简单区间dp)
- LA3983-Robotruck(dp + 单调队列)
- LA 3983 Robotruck DP+滑动窗口 *
- Robotruck----UVA1169----DP(优先队列的优化)
- Lake Counting(思维漏洞)(记忆化搜索)
- itoa的实现
- mac 安装opencv homebrew安装
- c++头文件
- hihocoder: 后序遍历
- Robotruck - ZOJ 3031 dp
- Ubuntu 12.10 下MySQL 5.1.65 解压安装
- LeetCode: Word Ladder
- 覆盖技术规范噶的舒服的萨芬
- 法规和规范结合法守法的大幅度
- 飞规划局和国际化高科技
- 和法规和规范菊花怪
- 梵蒂冈FDSDSFA和规范哈FG
- GHSFH忒tete6tretgerteqr6546b