HDU 4341 - Gold miner
来源:互联网 发布:oracle数据触发器 编辑:程序博客网 时间:2024/06/05 21:04
B - Gold miner
Time Limit:2000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uDescription
Homelesser likes playing Gold miners in class. He has to pay much attention to the teacher to avoid being noticed. So he always lose the game. After losing many times, he wants your help.
To make it easy, the gold becomes a point (with the area of 0). You are given each gold's position, the time spent to get this gold, and the value of this gold. Maybe some pieces of gold are co-line, you can only get these pieces in order. You can assume it can turn to any direction immediately.
Please help Homelesser get the maximum value.
To make it easy, the gold becomes a point (with the area of 0). You are given each gold's position, the time spent to get this gold, and the value of this gold. Maybe some pieces of gold are co-line, you can only get these pieces in order. You can assume it can turn to any direction immediately.
Please help Homelesser get the maximum value.
Input
There are multiple cases.
In each case, the first line contains two integers N (the number of pieces of gold), T (the total time). (0<N≤200, 0≤T≤40000)
In each of the next N lines, there four integers x, y (the position of the gold), t (the time to get this gold), v (the value of this gold). (0≤|x|≤200, 0<y≤200,0<t≤200, 0≤v≤200)
In each case, the first line contains two integers N (the number of pieces of gold), T (the total time). (0<N≤200, 0≤T≤40000)
In each of the next N lines, there four integers x, y (the position of the gold), t (the time to get this gold), v (the value of this gold). (0≤|x|≤200, 0<y≤200,0<t≤200, 0≤v≤200)
Output
Print the case number and the maximum value for each test case.
Sample Input
3 101 1 1 12 2 2 21 3 15 93 101 1 13 12 2 2 21 3 4 7
Sample Output
Case 1: 3Case 2: 7
题目模拟黄金矿工的游戏,给出黄金的坐标,每块黄金有自己的耗时和价值,在规定时间内获得最大的价值。因为同一条线上的黄金必须先去上层的才可以去下层的,所以题目转换成分组背包求解。
#include <iostream>#include <cstdio>#include <cstring>#include <vector>#include <algorithm>#include <cstdlib>#include <ctime>#include <bitset>using namespace std;#define N 405#define F 40005#define INF 0x3f3f3f3f#define PB push_backstruct node{ int x,y,t,v; node(){} node(int xx,int yy,int tt,int vv):x(xx),y(yy),t(tt),v(vv){}};int n,T;int f[F];vector<node> a[N][N];bool cmp(node x,node y){ return x.y<y.y;}int gcd(int a,int b){ if (b==0) return a; else return gcd(b,a%b);}int main(){ int kase=0; while (scanf("%d%d",&n,&T)!=EOF){ memset(f,0,sizeof(f)); for (int i=0;i<405;i++) for (int j=0;j<205;j++) a[i][j].clear(); int x,y,t,v; for (int i=0;i<n;i++){ scanf("%d%d%d%d",&x,&y,&t,&v); int GCD=gcd(abs(x),y); int xx=x/GCD; int yy=y/GCD; xx+=200; a[xx][yy].PB(node(x,y,t,v)); } for (int i=0;i<405;i++){ for (int j=0;j<205;j++){ if (a[i][j].size()>0){ sort(a[i][j].begin(),a[i][j].end(),cmp); for (int k=1;k<a[i][j].size();k++){ a[i][j][k].t+=a[i][j][k-1].t; a[i][j][k].v+=a[i][j][k-1].v; } for (int v=T;v>=0;v--){ for (int k=0;k<a[i][j].size();k++){ if (v>=a[i][j][k].t) f[v]=max(f[v],f[v-a[i][j][k].t]+a[i][j][k].v); } } } } } printf("Case %d: %d\n",++kase,f[T]); } return 0;}
0 0
- hdu 4341 Gold miner
- hdu 4341 Gold miner
- Hdu 4341 Gold miner
- hdu 4341 gold miner
- HDU 4341 Gold miner
- HDU 4341 - Gold miner
- hdu acm 4341 Gold miner
- hdu 4341 Gold miner 分组背包
- hdu - 4341 - Gold miner - 分组背包
- HDU 4341 Gold miner (分组背包问题)
- HDU 4341 Gold miner (分组背包)
- hdu 4341 Gold miner(分组01背包)
- HDU 4341 Gold miner (分组背包)
- hdu 4341 Gold miner(分组背包)
- HDU 4341 Gold miner 分组背包变形
- HDU 4341 Gold miner(分组背包)
- HDU 4341 Gold miner (分组背包)
- hdu 4341 Gold miner (分组背包)
- 关于c++包含空格的字符串输入
- Spark组件之Spark Streaming学习1--NetworkWordCount学习
- viewPager 实现banner图 自动轮播
- ios返回上两级页面
- Java IO:CharArrayWriter使用及源码分析
- HDU 4341 - Gold miner
- 距离成为一个优秀程序员 你还差这些
- iOS 贝塞尔曲线和CAShapeLayer 结合使用的进度条详解
- JS中创建函数的三种方式及区别
- moehydrogen.SchoolOlympiadProject
- 为Docker容器设置固定IP实现网络联通(2)——通过Python脚本实现并解决pipework缺陷
- error MSB8031 Building an MFC project for a non-Unicode character set is deprecated.
- Java线程之1.4版多生产多消费者示例(三)
- go Type Identical &Value Assignability & Type Conversions