Hdu acm 非常可乐 1495

非常可乐

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 3014    Accepted Submission(s): 1223

Problem Description

大家一定觉的运动以后喝可乐是一件很惬意的事情，但是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
  
  

 

 

Sample Output

  
  

   
   NO
3
  
  

 

 

import java.util.ArrayDeque;
import java.util.HashSet;
import java.util.Queue;
import java.util.Scanner;
import java.util.Set;


public class Hdu1495 {

	public static int v1, v2, v3, sum;
	
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		while(sc.hasNextInt()) {
			v1 = sc.nextInt();
			v2 = sc.nextInt();
			v3 = sc.nextInt();
			if(v1==0 && v2==0 && v3==0) break;
			if(v1 % 2 == 0) {
				sum = v1 >> 1;
				State temp = bfs_search();
				if(temp == null) {
					System.out.println("NO");
				} else {
					System.out.println(temp.count);
				}
			} else {
				System.out.println("NO");
			}
		}
	}

	private static State bfs_search() {
		State state = new Hdu1495().new State(v1, 0, 0, 0);
		Set<State> set = new HashSet<State>();
		set.add(state);
		
		Queue<State> queue = new ArrayDeque<State>();
		queue.add(state);
		State temp;
		int c1, c2, c3, count;
		while(!queue.isEmpty()) {
			state = queue.poll();
			c1 = state.c1;
			c2 = state.c2;
			c3 = state.c3;
			count = state.count+1;
			if(c1>0 && c2<v2) {
				if(c1+c2<=v2) {
					temp = new Hdu1495().new State(0, c1+c2, c3, count);
				} else {
					temp = new Hdu1495().new State(c1+c2-v2, v2, c3, count);
				}
				if(temp.c1==sum  && (temp.c2==sum || temp.c3 == sum)) {
					return temp;
				}
				if(!set.contains(temp)) {
					set.add(temp);
					queue.add(temp);
				}
			}
			if(c1>0 && c3<v3) {
				if(c1+c3<=v3) {
					temp = new Hdu1495().new State(0, c2, c1+c3, count);
				} else {
					temp = new Hdu1495().new State(c1+c3-v3, c2, v3, count);
				}
				if(temp.c1==sum  && (temp.c2==sum || temp.c3 == sum)) {
					return temp;
				} 
				if(!set.contains(temp)) {
					set.add(temp);
					queue.add(temp);
				}
			}
			if(c2>0 && c1<v1) {
				if(c1+c2<=v1) {
					temp = new Hdu1495().new State(c1+c2, 0, c3, count);
				} else {
					temp = new Hdu1495().new State(v1, c2+c1-v1, c3, count);
				}
				if(temp.c1==sum  && (temp.c2==sum || temp.c3 == sum)) {
					return temp;
				} 
				if(!set.contains(temp)) {
					set.add(temp);
					queue.add(temp);
				}
			}
			if(c2>0 && c3<v3) {
				if(c2+c3<=v3) {
					temp = new Hdu1495().new State(c1, 0, c3+c2, count);
				} else {
					temp = new Hdu1495().new State(c1, c2+c3-v3, v3, count);
				}
				if(temp.c1==sum && (temp.c2==sum || temp.c3 == sum)) {
					return temp;
				} 
				if(!set.contains(temp)) {
					queue.add(temp);
					set.add(temp);
				}
			}
			if(c3>0 && c1<v1) {
				if(c1+c3<=v1) {
					temp = new Hdu1495().new State(c1+c3, c2, 0, count);
				} else {
					temp = new Hdu1495().new State(v1, c2, c1+c3-v1, count);
				}
				if(temp.c1==sum  && (temp.c2==sum || temp.c3 == sum)) {
					return temp;
				} 
				if(!set.contains(temp)) {
					queue.add(temp);
					set.add(temp);
				}
			}
			if(c3>0 && c2<v2) {
				if(c2+c3<=v2) {
					temp = new Hdu1495().new State(c1, c2+c3, 0, count);
				} else {
					temp = new Hdu1495().new State(c1, v2, c2+c3-v2, count);
				}
				if(temp.c1==sum  && (temp.c2==sum || temp.c3 == sum)) {
					return temp;
				} 
				if(!set.contains(temp)) {
					queue.add(temp);
					set.add(temp);
				}
			}
		}
		return null;
	}
	
	
	class State {
		int c1;
		int c2;
		int c3;
		int count;
		
		public State(int c1, int c2, int c3, int count) {
			this.c1 = c1;
			this.c2 = c2;
			this.c3 = c3;
			this.count = count;
		}
		
		@Override
		public boolean equals(Object obj) {
			State state = (State)obj;
			return state.c1==c1 && state.c2==c2 && state.c3==c3;
		}
		
		@Override
		public int hashCode() {
			return (c1+""+c2+""+c3).hashCode();
		}
	}
}