题目描述
大家一定觉的运动以后喝可乐是一件很惬意的事情,但是seeyou却不这么认为。因为每次当seeyou买了可乐以后,阿牛就要求和seeyou一起分享这一瓶可乐,而且一定要喝的和seeyou一样多。但seeyou的手中只有两个杯子,它们的容量分别是N 毫升和M 毫升 可乐的体积为S (S<101)毫升 (正好装满一瓶) ,它们三个之间可以相互倒可乐 (都是没有刻度的,且 S==N+M,101>S>0,N>0,M>0) 。聪明的ACMER你们说他们能平分吗?如果能请输出倒可乐的最少的次数,如果不能输出"NO"。
Input
三个整数 : S 可乐的体积 , N 和 M是两个杯子的容量,以"0 0 0"结束。
Output
如果能平分的话请输出最少要倒的次数,否则输出"NO"。
Sample
Input
7 4 3
4 1 3
0 0 0
Output
NO
3
bfs
static class TaskA {
int s,n,m;
int[][][] vis;
int f = 0;
static class A{
int ss,nn,mm;
int sum;
A(int ss,int nn,int mm,int sum){
this.ss = ss;
this.nn = nn;
this.mm = mm;
this.sum = sum;
}
}
void bfs(){
A lmy = new A(s,0,0,0);
Queue<A> q = new LinkedList();
q.add(lmy);
vis[s][0][0] = 1;
while (!q.isEmpty()){
A mo = new A(q.peek().ss,q.peek().nn,q.peek().mm,q.poll().sum);
if((mo.ss == mo.nn && mo.mm == 0)|| (mo.ss == mo.mm && mo.nn == 0)|| (mo.nn == mo.mm && mo.ss == 0)){
System.out.println(mo.sum);
f = 1;
return;
}
for (int i = 0; i < 6; i++) {//6种情况,s==>n、n==>s、s==>m、m==>s、m==>n、n==>m
if(i == 0){//s==>n
A next = new A(mo.ss,mo.nn,mo.mm,mo.sum);
if((n - mo.nn) >= mo.ss){//n剩余空间大于等于s中的可乐
next.nn = mo.nn + mo.ss;
next.ss = 0;
next.mm = mo.mm;
}else{//n剩余空间小于s中的可乐,s中有剩下的可乐
next.nn = n;
next.ss = mo.ss - (n - mo.nn);
next.mm = mo.mm;
}
if(vis[next.ss][next.nn][next.mm] == 0){
vis[next.ss][next.nn][next.mm] = 1;
next.sum = mo.sum + 1;
q.add(next);
}
}else if(i == 1){//n==>s
A next = new A(mo.ss,mo.nn,mo.mm,mo.sum);
if((s - mo.ss) >= mo.nn){//s剩余空间大于等于n中的可乐
next.nn = 0;
next.ss = mo.nn + mo.ss;
next.mm = mo.mm;
}else{//s剩余空间小于n中的可乐,n中有剩下的可乐
next.nn = mo.nn - (s - mo.ss);
next.ss = s;
next.mm = mo.mm;
}
if(vis[next.ss][next.nn][next.mm] == 0){
vis[next.ss][next.nn][next.mm] = 1;
next.sum = mo.sum + 1;
q.add(next);
}
}else if(i == 2){//s==>m
A next = new A(mo.ss,mo.nn,mo.mm,mo.sum);
if((m - mo.mm) >= mo.ss){//m剩余空间大于等于s中的可乐
next.nn = mo.nn;
next.ss = 0;
next.mm = mo.mm + mo.ss;
}else{//m剩余空间小于s中的可乐,s中有剩下的可乐
next.nn = mo.nn;
next.ss = mo.ss - (m - mo.mm);
next.mm = m;
}
if(vis[next.ss][next.nn][next.mm] == 0){
vis[next.ss][next.nn][next.mm] = 1;
next.sum = mo.sum + 1;
q.add(next);
}
}else if(i == 3){//m==>s
A next = new A(mo.ss,mo.nn,mo.mm,mo.sum);
if((s - mo.ss) >= mo.mm){//s剩余空间大于等于m中的可乐
next.nn = mo.nn;
next.ss = mo.mm + mo.ss;
next.mm = 0;
}else{//s剩余空间小于m中的可乐,m中有剩下的可乐
next.nn = mo.nn;
next.ss = s;
next.mm = mo.mm - (s - mo.ss);
}
if(vis[next.ss][next.nn][next.mm] == 0){
vis[next.ss][next.nn][next.mm] = 1;
next.sum = mo.sum + 1;
q.add(next);
}
}else if(i == 4){//m==>n
A next = new A(mo.ss,mo.nn,mo.mm,mo.sum);
if((n - mo.nn) >= mo.mm){//n剩余空间大于等于m中的可乐
next.nn = mo.nn + mo.mm;
next.ss = mo.ss;
next.mm = 0;
}else{//n剩余空间小于m中的可乐,m中有剩下的可乐
next.nn = n;
next.ss = mo.ss ;
next.mm = mo.mm - (n - mo.nn);
}
if(vis[next.ss][next.nn][next.mm] == 0){
vis[next.ss][next.nn][next.mm] = 1;
next.sum = mo.sum + 1;
q.add(next);
}
}else if(i == 5){//n==>m
A next = new A(mo.ss,mo.nn,mo.mm,mo.sum);
if((m - mo.mm) >= mo.nn){//m剩余空间大于等于n中的可乐
next.nn = 0;
next.ss = mo.ss;
next.mm = mo.mm + mo.nn;
}else{//m剩余空间小于n中的可乐,n中有剩下的可乐
next.nn = mo.nn - (m - mo.mm);
next.ss = mo.ss;
next.mm = m;
}
if(vis[next.ss][next.nn][next.mm] == 0){
vis[next.ss][next.nn][next.mm] = 1;
next.sum = mo.sum + 1;
q.add(next);
}
}
}
}
if(f == 0){
System.out.println("NO");
}
}
public void solve(int testNumber, InputReader in, PrintWriter out) {
while (in.hasNext()){
s = in.nextInt();
n = in.nextInt();
m = in.nextInt();
if(s == 0&&n == 0&&m == 0){
break;
}
if(s % 2 != 0){//奇数不可能平分
System.out.println("NO");
}else {
vis = new int[s+1][n+1][m+1];//标记有无走过
f = 0;
bfs();
}
}
}
}