結果

問題 No.158 奇妙なお使い
ユーザー uwiuwi
提出日時 2015-02-27 02:34:48
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,749 bytes
コンパイル時間 4,968 ms
コンパイル使用メモリ 91,160 KB
実行使用メモリ 117,388 KB
最終ジャッジ日時 2024-06-23 22:36:32
合計ジャッジ時間 12,471 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 159 ms
93,764 KB
testcase_01 AC 209 ms
95,900 KB
testcase_02 WA -
testcase_03 AC 142 ms
93,108 KB
testcase_04 AC 1,300 ms
117,388 KB
testcase_05 AC 150 ms
93,572 KB
testcase_06 AC 138 ms
93,160 KB
testcase_07 AC 150 ms
93,364 KB
testcase_08 AC 139 ms
93,368 KB
testcase_09 AC 168 ms
95,072 KB
testcase_10 AC 176 ms
94,908 KB
testcase_11 AC 155 ms
93,496 KB
testcase_12 AC 151 ms
93,556 KB
testcase_13 AC 141 ms
93,372 KB
testcase_14 AC 215 ms
95,744 KB
testcase_15 AC 225 ms
114,516 KB
testcase_16 AC 201 ms
113,988 KB
testcase_17 WA -
testcase_18 AC 193 ms
113,124 KB
testcase_19 AC 163 ms
95,096 KB
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 AC 144 ms
93,592 KB
testcase_26 AC 200 ms
95,680 KB
testcase_27 AC 145 ms
93,660 KB
testcase_28 AC 335 ms
113,312 KB
testcase_29 AC 177 ms
95,036 KB
testcase_30 AC 424 ms
113,020 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package q1xx;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.Queue;

public class Q125 {
	static InputStream is;
	static PrintWriter out;
	static String INPUT = "";
	
	static void solve()
	{
		int a3 = ni(), a2 = ni(), a0 = ni();
		int db = ni();
		int b3 = ni(), b2 = ni(), b0 = ni();
		int dc = ni();
		int c3 = ni(), c2 = ni(), c0 = ni();
		
		int[][][] d = new int[11][101][10001];
		for(int i = 0;i < 11;i++){
			for(int j = 0;j < 101;j++){
				Arrays.fill(d[i][j], 999999);
			}
		}
		d[a3][a2][a0] = 0;
		Queue<int[]> q = new ArrayDeque<int[]>();
		q.add(new int[]{a3, a2, a0});
		int max = 0;
		while(!q.isEmpty()){
			int[] cur = q.poll();
			int d3 = cur[0], d2 = cur[1], d0 = cur[2];
			for(int i3 = 0;i3*1000 <= db;i3++){
				for(int i2 = 0;i3*1000+i2*100 <= db;i2++){
					int i0 = db-i3*1000-i2*100;
					if(d3 >= i3 && d2 >= i2 && d0 >= i0){
						int nd3 = d3 - i3 + b3;
						int nd2 = d2 - i2 + b2;
						int nd0 = d0 - i0 + b0;
						if(d[nd3][nd2][nd0] > d[d3][d2][d0] + 1){
							d[nd3][nd2][nd0] = d[d3][d2][d0] + 1;
							max = Math.max(max, d[nd3][nd2][nd0]);
							q.add(new int[]{nd3, nd2, nd0});
						}
					}
				}
			}
			for(int i3 = 0;i3*1000 <= dc;i3++){
				for(int i2 = 0;i3*1000+i2*100 <= dc;i2++){
					int i0 = dc-i3*1000-i2*100;
					if(d3 >= i3 && d2 >= i2 && d0 >= i0){
						int nd3 = d3 - i3 + c3;
						int nd2 = d2 - i2 + c2;
						int nd0 = d0 - i0 + c0;
						if(d[nd3][nd2][nd0] > d[d3][d2][d0] + 1){
							d[nd3][nd2][nd0] = d[d3][d2][d0] + 1;
							max = Math.max(max, d[nd3][nd2][nd0]);
							q.add(new int[]{nd3, nd2, nd0});
						}
					}
				}
			}
		}
		out.println(max);
	}
	
	public static void main(String[] args) throws Exception
	{
		long S = System.currentTimeMillis();
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		solve();
		out.flush();
		long G = System.currentTimeMillis();
		tr(G-S+"ms");
	}
	
	private static boolean eof()
	{
		if(lenbuf == -1)return true;
		int lptr = ptrbuf;
		while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;
		
		try {
			is.mark(1000);
			while(true){
				int b = is.read();
				if(b == -1){
					is.reset();
					return true;
				}else if(!isSpaceChar(b)){
					is.reset();
					return false;
				}
			}
		} catch (IOException e) {
			return true;
		}
	}
	
	private static byte[] inbuf = new byte[1024];
	static int lenbuf = 0, ptrbuf = 0;
	
	private static int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}
	
	private static boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private static int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private static double nd() { return Double.parseDouble(ns()); }
	private static char nc() { return (char)skip(); }
	
	private static String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	
	private static char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}
	
	private static char[][] nm(int n, int m)
	{
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}
	
	private static int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private static int ni()
	{
		int num = 0, b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }
}
0