bzoj 1672: [Usaco2005 Dec]Cleaning Shifts 清理牛棚(DP)
1672: [Usaco2005 Dec]Cleaning Shifts 清理牛棚
Time Limit: 5 Sec Memory Limit: 64 MB
Submit: 941 Solved: 403
[Submit][Status][Discuss]
Description
Farmer John's cows, pampered since birth, have reached new heights of fastidiousness. They now require their barn to be immaculate. Farmer John, the most obliging of farmers, has no choice but hire some of the cows to clean the barn. Farmer John has N (1 <= N <= 10,000) cows who are willing to do some cleaning. Because dust falls continuously, the cows require that the farm be continuously cleaned during the workday, which runs from second number M to second number E during the day (0 <= M <= E <= 86,399). Note that the total number of seconds during which cleaning is to take place is E-M+1. During any given second M..E, at least one cow must be cleaning. Each cow has submitted a job application indicating her willingness to work during a certain interval T1..T2 (where M <= T1 <= T2 <= E) for a certain salary of S (where 0 <= S <= 500,000). Note that a cow who indicated the interval 10..20 would work for 11 seconds, not 10. Farmer John must either accept or reject each individual application; he may NOT ask a cow to work only a fraction of the time it indicated and receive a corresponding fraction of the salary. Find a schedule in which every second of the workday is covered by at least one cow and which minimizes the total salary that goes to the cows.
Input
* Line 1: Three space-separated integers: N, M, and E. * Lines 2..N+1: Line i+1 describes cow i's schedule with three space-separated integers: T1, T2, and S.
Output
* Line 1: a single integer that is either the minimum total salary to get the barn cleaned or else -1 if it is impossible to clean the barn.
Sample Input
Sample Output
这本来应该是个线段树+DP的题,我只用DP暴力居然过了。。
dp[i]表示前i秒都有牛打扫的最小花费
dp[i] = min(dp[j]+s[i].cost, dp[i]) 其中s[i].y==i,s[i].x-1<=j<=i-1
其中s[i].y为第i头牛的工作结束时间,s[i].x为开始时间,按s[i].y排序
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
#define LL long long
typedef struct Cow
{int cost;int x, y;bool operator < (const Cow &b) const{if(y<b.y)return 1;return 0;}
}Cow;
Cow s[10005];
LL dp[100005];
int main(void)
{int e, m, n, i, j, p;scanf("%d%d%d", &n, &e, &m);m -= --e;for(i=1;i<=n;i++){scanf("%d%d%d", &s[i].x, &s[i].y, &s[i].cost);s[i].x -= e, s[i].y -= e;}sort(s+1, s+n+1);memset(dp, 62, sizeof(dp));dp[0] = 0;p = 1;for(i=1;i<=m;i++){while(s[p].y==i){for(j=s[p].x-1;j<=i-1;j++)dp[i] = min(dp[j]+s[p].cost, dp[i]);p++;}}if(dp[m]<=(LL)1e12)printf("%lld\n", dp[m]);elseprintf("-1\n");return 0;
}
bzoj 1672: [Usaco2005 Dec]Cleaning Shifts 清理牛棚(DP)相关推荐
- 1672: [Usaco2005 Dec]Cleaning Shifts 清理牛棚 DP + 线段树 / SPFA
1672: [Usaco2005 Dec]Cleaning Shifts 清理牛棚 Time Limit: 5 Sec Memory Limit: 64 MB Submit: 975 Solved ...
- 【BZOJ】1672: [Usaco2005 Dec]Cleaning Shifts 清理牛棚(dp/线段树)
http://www.lydsy.com/JudgeOnline/problem.php?id=1672 dp很好想,但是是n^2的..但是可以水过..(5s啊..) 按左端点排序后 f[i]表示取第 ...
- poj 2376 bzoj 3389: [Usaco2004 Dec]Cleaning Shifts安排值班(贪心)
3389: [Usaco2004 Dec]Cleaning Shifts安排值班 Time Limit: 1 Sec Memory Limit: 128 MB Submit: 462 Solved ...
- bzoj 1673: [Usaco2005 Dec]Scales 天平(DFS)
1673: [Usaco2005 Dec]Scales 天平 Time Limit: 5 Sec Memory Limit: 64 MB Submit: 695 Solved: 253 [Subm ...
- bzoj 1671: [Usaco2005 Dec]Knights of Ni 骑士(BFS)
1671: [Usaco2005 Dec]Knights of Ni 骑士 Time Limit: 5 Sec Memory Limit: 64 MB Submit: 416 Solved: 26 ...
- bzoj 1731 [Usaco2005 dec]Layout 排队布局——差分约束
题目:https://www.lydsy.com/JudgeOnline/problem.php?id=1731 对差分约束理解更深.还发现美妙博客:http://www.cppblog.com/me ...
- bzoj3389:[Usaco2004 Dec]Cleaning Shifts安排值班
思路:可以贪心,也可以最短路. 贪心写法:因为在保证合法的前提下,我们选择的区间一定要右端点尽量靠后才行,于是我们每次就选择一个合法的并且右端点最靠后的区间就好了(如果没有合法的输出-1即可).时间复 ...
- bzoj 1731: [Usaco2005 dec]Layout 排队布局【差分约束】
差分约束裸题,用了比较蠢的方法,先dfs_spfa判负环,再bfs_spfa跑最短路 注意到"奶牛排在队伍中的顺序和它们的编号是相同的",所以\( d_i-d_{i-1}>= ...
- BZOJ 1673 [Usaco2005 Dec]Scales 天平:dfs 启发式搜索 A*搜索
题目链接:http://www.lydsy.com/JudgeOnline/problem.php?id=1673 题意: 有n个砝码(n <= 1000),重量为w[i]. 你要从中选择一些砝 ...
最新文章
- 2 构建Mysql+heartbeat+DRBD+LVS集群应用系统系列之MySql的搭建
- CentOS 7安装Redis服务
- VTK:vtkBillboardTextActor3D用法实战
- Java得到请求的IP地址
- asp.net 的页面几种传值方式
- AliOS Things 基于组件化思想的多bin特性
- [Python] 创建一个整数列表:range()
- mysql创建存储过程及遍历查询结果,mysql 用存储过程遍历结果集
- define定义的函数如何引用_3分钟短文:Laravel 编程中优雅地添加定义常量
- solidworks迈迪设计宝_机械入门|那些看起来很牛X的机械结构,是如何设计的?...
- 联想笔记本修复计算机还原系统失败,联想笔记本电脑重装系统不成功,联想笔记本系统恢复...
- 【电子商务突围物流瓶颈】南风窗商业杂志采访我的观点
- java 保存对象_Java将对象保存到文件中/从文件中读取对象
- 解决IOS浏览器或者微信浏览器播放audio音效第二次播放不全
- 20200415 计算机的基础之host配置
- 复试21天Day 21
- 视频通讯客服系统实现(附wins源码)
- 数学建模 之 ARCH模型和GARCH模型
- 记在2019,winter is coming
- java程序设计之炮打飞机