UVA-10603-Fill(BFS+优先队列)
来源:互联网 发布:excel数据后的空格删掉 编辑:程序博客网 时间:2024/06/06 13:09
There are three jugs with a volume of a, b and c liters. (a, b, and c are positive integers not greater than 200). The first and the second jug are initially empty, while the third
is completely filled with water. It is allowed to pour water from one jug into another until either the first one is empty or the second one is full. This operation can be performed zero, one or more times.
You are to write a program that computes the least total amount of water that needs to be poured; so that at least one of the jugs contains exactly d liters of water (d is a positive integer not greater than 200). If it is not possible to measure d liters this way your program should find a smaller amount of water d' < d which is closest to d and for which d' liters could be produced. When d' is found, your program should compute the least total amount of poured water needed to produce d' liters in at least one of the jugs.
Input
The first line of input contains the number of test cases. In the next T lines, T test cases follow. Each test case is given in one line of input containing four space separated integers - a, b, c and d.
Output
The output consists of two integers separated by a single space. The first integer equals the least total amount (the sum of all waters you pour from one jug to another) of poured water. The second integer equals d, if d liters of water could be produced by such transformations, or equals the closest smaller value d' that your program has found.
Sample Input
Sample Output
2
2 3 4 2
96 97 199 62
2 2
9859 62
思路:标记三个杯子的水量,用优先队列的BFS。
#include <cstdio>#include <queue>#define min(A,B)(A<B?A:B)#define INF 999999999using namespace std;struct S{int x,y,z,sum;bool operator<(const S &p) const{ return sum>p.sum;}}t;int a,b,c,d,ans[201];bool vis[201][201][201];int main(){ int T,i,j,k,x,y,z,sum; scanf("%d",&T); while(T--) { scanf("%d%d%d%d",&a,&b,&c,&d); for(i=0;i<=a;i++) for(j=0;j<=b;j++) for(k=0;k<=c;k++) vis[i][j][k]=0; for(i=0;i<=d;i++) ans[i]=INF; vis[0][0][c]=1; t.x=0; t.y=0; t.z=c; t.sum=0; priority_queue<S>que; que.push(t); while(!que.empty()) { t=que.top(); que.pop(); x=t.x; y=t.y; z=t.z; sum=t.sum; ans[x]=min(ans[x],sum); ans[y]=min(ans[y],sum); ans[z]=min(ans[z],sum); if(x) { if(y<b) { if(x>=b-y && !vis[x-b+y][b][z]) { t.x=x-b+y; t.y=b; t.z=z; t.sum=sum+b-y; vis[x-b+y][b][z]=1; que.push(t); } else if(x<b-y && !vis[0][y+x][z]) { t.x=0; t.y=y+x; t.z=z; t.sum=sum+x; vis[0][y+x][z]=1; que.push(t); } } if(z<c) { if(x>=c-z && !vis[x-c+z][y][c]) { t.x=x-c+z; t.y=y; t.z=c; t.sum=sum+c-z; vis[x-c+z][y][c]=1; que.push(t); } else if(x<c-z && !vis[0][y][z+x]) { t.x=0; t.y=y; t.z=z+x; t.sum=sum+x; vis[0][y][z+x]=1; que.push(t); } } } if(y) { if(x<a) { if(y>=a-x && !vis[a][y-a+x][z]) { t.x=a; t.y=y-a+x; t.z=z; t.sum=sum+a-x; vis[a][y-a+x][z]=1; que.push(t); } else if(y<a-x && !vis[x+y][0][z]) { t.x=x+y; t.y=0; t.z=z; t.sum=sum+y; vis[x+y][0][z]=1; que.push(t); } } if(z<c) { if(y>=c-z && !vis[x][y-c+z][c]) { t.x=x; t.y=y-c+z; t.z=c; t.sum=sum+c-z; vis[x][y-c+z][c]=1; que.push(t); } else if(y<c-z && !vis[x][0][z+y]) { t.x=x; t.y=0; t.z=z+y; t.sum=sum+y; vis[x][0][z+y]=1; que.push(t); } } } if(z) { if(x<a) { if(z>=a-x && !vis[a][y][z-a+x]) { t.x=a; t.y=y; t.z=z-a+x; t.sum=sum+a-x; vis[a][y][z-a+x]=1; que.push(t); } else if(z<a-x && !vis[x+z][y][0]) { t.x=x+z; t.y=y; t.z=0; t.sum=sum+z; vis[x+z][y][0]=1; que.push(t); } } if(y<b) { if(z>=b-y && !vis[x][b][z-b+y]) { t.x=x; t.y=b; t.z=z-b+y; t.sum=sum+b-y; vis[x][b][z-b+y]=1; que.push(t); } else if(z<b-y && !vis[x][y+z][0]) { t.x=x; t.y=y+z; t.z=0; t.sum=sum+z; vis[x][y+z][0]=1; que.push(t); } } } } for(i=d;;i--) { if(ans[i]<INF) { printf("%d %d\n",ans[i],i); break; } } }}
- UVA-10603-Fill(BFS+优先队列)
- UVA FILL(BFS + 优先队列)
- UVA - 10603 Fill(bfs+优先队列+动态规划)
- UVA-10603 Fill 倒水问题 BFS+优先队列
- UVA10603 FILL 优先队列+BFS
- UVa 10603 BFS+优先队列
- uva 10603 - Fill bfs
- UVA 10603 - Fill BFS~
- UVA 10603 Fill【BFS】
- uva 10603 Fill (BFS)
- UVa 10603:Fill(BFS)
- Uva10603 Fill 【隐式图bfs(优先队列)】【例题7-8】
- UVa 10603 Fill( BFS + 判重)
- uva 10603 Fill(倒水问题 BFS)
- Fill (Uva 10603 bfs 倒水问题)
- FILL uva+bfs
- UVa 10047 - The Monocycle, 优先队列+BFS
- UVA 11573 Ocean Currents --BFS+优先队列
- poj 2828 Buy Tickets
- Poj 2749 & Hdu 1815 Building roads (2-SAT + 二分 建图)
- Mapreduce计算框架涉及的技术(2)-工作机制详解
- Run Loops
- vc++调用webservice
- UVA-10603-Fill(BFS+优先队列)
- 解析Core Services 层
- java金额转中文大写
- 【云计算】云计算定义
- c++智能指针
- kettle 下 从dbms向hive导数据
- centos下vi的用法大全
- MyBatis启动:MapperStatement创建
- Least Common Multiple(2019)