[Java] Mother‘s Milk

最新推荐文章于 2021-03-13 14:56:47 发布

lincs_

最新推荐文章于 2021-03-13 14:56:47 发布

阅读量403

点赞数 1

分类专栏： USACO

本文链接：https://blog.csdn.net/weixin_41714373/article/details/112385421

版权

USACO 专栏收录该内容

30 篇文章 0 订阅

订阅专栏

该程序采用Java编写，实现了一个深度优先搜索（DFS）算法，用于解决从A、B、C三个桶中转移牛奶，使得C桶达到特定容量的问题。程序首先读取输入数据，然后通过DFS遍历所有可能的转移方案，并使用HashSet存储已访问状态，避免重复。最终输出能够使C桶满的最小转移次数。

摘要由CSDN通过智能技术生成

/* Use the slash-star style comments or the system won't see your
   identification information */
/*
ID: lincans1
LANG: JAVA
TASK: milk3
*/
import java.io.*;
import java.util.*;

public class milk3 {

	private int A;
	private int B;
	private int C;
	
	private void DFS(int a, int b, int c, boolean[] flag, Set<String> set) {
		if (set.contains(b + " " + c)) {
			return;
		}
		if (a == 0) {
			flag[c] = true;
		}
		set.add(b + " " + c);
		if (a != 0) {
			// a -> b
			if (b != B) {
				DFS(a - Math.min(B - b, a), b + Math.min(B - b, a), c, flag, set);
			}
			// a -> c
			if (c != C) {
				DFS(a - Math.min(C - c, a), b, c + Math.min(C - c, a), flag, set);
			}
		}
		if (b != 0) {
			if (a != A) {
				// b -> a
				DFS(a + Math.min(A - a, b) , b - Math.min(A - a, b), c, flag, set);
			}
			if (c != C) {
				// b -> c
				DFS(a, b - Math.min(C - c, b), c + Math.min(C - c, b), flag, set);
			}
		}
		if (c != 0) {
			if (a != A) {
				// c -> a
				DFS(a + Math.min(A - a, c), b, c - Math.min(A - a, c), flag, set);
			}
			if (b != B) {
				// c -> b
				DFS(a, b + Math.min(B - b, c), c - Math.min(B - b, c), flag, set);
			}
		}
	}

	public milk3() throws IOException {
		// Use BufferedReader rather than RandomAccessFile; it's much faster
		BufferedReader f = new BufferedReader(new FileReader("milk3.in"));
		PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("milk3.out")));

		// Use StringTokenizer vs. readLine/split -- lots faster
		StringTokenizer st = new StringTokenizer(f.readLine());

	    this.A = Integer.parseInt(st.nextToken());
	    this.B = Integer.parseInt(st.nextToken());
	    this.C = Integer.parseInt(st.nextToken());
	    boolean[] flag = new boolean[C + 1];
	    DFS(0, 0, C, flag, new HashSet<String>());
	    for (int i = 0; i < C; i++) {
	    	if (flag[i]) {
	    		out.print(i + " ");
	    	}
	    }
	    out.println(C);
	    out.close();
	    f.close();
	}
	
	public static void main (String [] args) throws IOException {
		new milk3();
	}
}