链接:Problem - 1495 (hdu.edu.cn)
问题描述:
解题思路:
这也是典型得BFS求解得问题,由于没有刻度,所以杯子只有倒满或者不倒,最后得到两杯分量一样的可乐即可,另外党课了为奇数时,一定是不可能均分的,可以写出条件直接判断。
代码实现:
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <queue>
using namespace std;
int n;
int cola[110][110][110],vis[110],cap[3];
struct col{
int capacity[3];
};
queue<col> qu;
int bfs(){
while(!qu.empty()) qu.pop();
for(int i=0;i<=cap[0];i++)
for(int j=0;j<=cap[1];j++)
for(int m=0;m<=cap[2];m++)
cola[i][j][m]=-1;
qu.push({cap[0],0,0});
cola[cap[0]][0][0]=0;
while (!qu.empty())
{
col t = qu.front(),temp;
qu.pop();
for(int i=0;i<3;i++)
for(int j=0;j<3;j++)
if (i != j && t.capacity[i] > 0 && t.capacity[j] < cap[j])
{
int dao = min(t.capacity[i], cap[j] - t.capacity[j]);
temp.capacity[i] =t.capacity[i]- dao;
temp.capacity[j] =t.capacity[j]+ dao;
temp.capacity[3 - i - j] = t.capacity[3 - i - j];
if (cola[temp.capacity[0]][temp.capacity[1]][temp.capacity[2]]==-1)
{
cola[temp.capacity[0]][temp.capacity[1]][temp.capacity[2]] = cola[t.capacity[0]][t.capacity[1]][t.capacity[2]] + 1;
if ((temp.capacity[0] == cap[0] / 2)+(temp.capacity[1] == cap[0] / 2)+(temp.capacity[2] == cap[0] / 2)==2)
//意思为两杯均分
return cola[temp.capacity[0]][temp.capacity[1]][temp.capacity[2]];
qu.push(temp);
}
}
}
return 0;
}
int main(){
while(cin>>cap[0]>>cap[1]>>cap[2]&&cap[0]){
if(cap[0]%2!=0){
cout<<"NO"<<endl;
continue;
}
int t=bfs();
if(t) cout<<t<<endl;
else cout<<"NO"<<endl;
}
return 0;
}