#49616 (Java21) No.281 門松と魔法(1)

提出ソース

結果

問題	No.281 門松と魔法(1)
ユーザー	tanzaku
提出日時	2015-09-18 22:43:20
言語	Java21 (openjdk 21)
結果	AC
実行時間	56 ms / 1,000 ms
コード長	6,464 bytes
コンパイル時間	4,377 ms
コンパイル使用メモリ	88,432 KB
実行使用メモリ	37,652 KB
最終ジャッジ日時	2024-11-06 20:27:07
合計ジャッジ時間	8,359 ms
ジャッジサーバーID （参考情報）	judge4 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	55 ms 37,312 KB
testcase_01	AC	55 ms 37,652 KB
testcase_02	AC	54 ms 37,048 KB
testcase_03	AC	52 ms 37,132 KB
testcase_04	AC	53 ms 37,368 KB
testcase_05	AC	52 ms 37,448 KB
testcase_06	AC	53 ms 37,012 KB
testcase_07	AC	53 ms 37,072 KB
testcase_08	AC	52 ms 36,928 KB
testcase_09	AC	54 ms 36,916 KB
testcase_10	AC	55 ms 37,220 KB
testcase_11	AC	55 ms 36,916 KB
testcase_12	AC	54 ms 37,048 KB
testcase_13	AC	54 ms 37,468 KB
testcase_14	AC	52 ms 37,052 KB
testcase_15	AC	53 ms 36,944 KB
testcase_16	AC	52 ms 37,440 KB
testcase_17	AC	52 ms 37,212 KB
testcase_18	AC	53 ms 37,412 KB
testcase_19	AC	53 ms 37,372 KB
testcase_20	AC	52 ms 37,148 KB
testcase_21	AC	56 ms 37,160 KB
testcase_22	AC	52 ms 37,160 KB
testcase_23	AC	52 ms 37,216 KB
testcase_24	AC	53 ms 37,092 KB
testcase_25	AC	52 ms 37,068 KB
testcase_26	AC	53 ms 37,076 KB
testcase_27	AC	53 ms 37,436 KB
testcase_28	AC	52 ms 36,948 KB
testcase_29	AC	53 ms 37,208 KB
testcase_30	AC	53 ms 37,212 KB
testcase_31	AC	52 ms 36,940 KB
testcase_32	AC	53 ms 37,068 KB
testcase_33	AC	52 ms 36,940 KB
testcase_34	AC	54 ms 37,332 KB
testcase_35	AC	53 ms 37,188 KB
testcase_36	AC	53 ms 36,952 KB
testcase_37	AC	52 ms 36,924 KB
testcase_38	AC	52 ms 37,320 KB
testcase_39	AC	55 ms 37,360 KB
testcase_40	AC	54 ms 37,080 KB
testcase_41	AC	53 ms 37,420 KB
testcase_42	AC	52 ms 37,316 KB
testcase_43	AC	54 ms 37,344 KB
testcase_44	AC	54 ms 36,944 KB
testcase_45	AC	53 ms 36,920 KB
testcase_46	AC	53 ms 36,928 KB
testcase_47	AC	52 ms 37,204 KB
testcase_48	AC	53 ms 36,940 KB
testcase_49	AC	53 ms 37,068 KB
testcase_50	AC	53 ms 37,056 KB
testcase_51	AC	53 ms 36,888 KB
testcase_52	AC	55 ms 37,372 KB
testcase_53	AC	53 ms 37,156 KB
testcase_54	AC	53 ms 37,444 KB
testcase_55	AC	53 ms 37,164 KB
testcase_56	AC	53 ms 37,220 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

import java.io.*;
import java.math.*;
import java.util.*;

import static java.util.Arrays.*;

public class Main {
	private static final int mod = (int)1e9+7;

	final Random random = new Random(0);
	final IOFast io = new IOFast();

	/// MAIN CODE
	public void run() throws IOException {
//		int TEST_CASE = Integer.parseInt(new String(io.nextLine()).trim());
		int TEST_CASE = 1;
		while(TEST_CASE-- != 0) {
			int d = io.nextInt();
			int[] H = io.nextIntArray(3);
			long ans = Math.min(high(d, H), low(d, H));
			if(ans == Long.MAX_VALUE) ans = -1;
			io.out.println(ans);
		}
	}
	
	long high(long d, int[] H) {
		long h0 = Math.max(0L, H[0] - H[1]) / Math.max(1, d);
		long h2 = Math.max(0L, H[2] - H[1]) / Math.max(1, d);
		long ans = Long.MAX_VALUE;
		for(int i = 0; i < 10; i++) {
			for(int j = 0; j < 10; j++) {
				for(int k = 0; k < 10; k++) {
					long a = Math.max(0, H[0] - h0 * d - i * d);
					long b = Math.max(0, H[1] - j * d);
					long c = Math.max(0, H[2] - h2 * d - k * d);
					if(a == b || b == c || a == c) continue;
					if(b > a && b > c || b < a && b < c) ans = Math.min(ans, i + j + k + h0 + h2);
				}
			}
		}
//		System.err.println(h0 + " " + h2 + " " + ans);
		return ans;
	}
	
	long low(long d, int[] H) {
		long h1 = Math.max(0L, H[1] - Math.min(H[0], H[2])) / Math.max(1, d);
		long ans = Long.MAX_VALUE;
		for(int i = 0; i < 10; i++) {
			for(int j = 0; j < 10; j++) {
				for(int k = 0; k < 10; k++) {
					int a = (int)Math.max(0, H[0] - i * d);
					int b = (int)Math.max(0, H[1] - h1 * d - j * d);
					int c = (int)Math.max(0, H[2] - k * d);
					if(a == b || b == c || a == c) continue;
					if(b > a && b > c || b < a && b < c) ans = Math.min(ans, i + j + k + h1);
				}
			}
		}
		return ans;
	}

	/// TEMPLATE
	static int gcd(int n, int r) { return r == 0 ? n : gcd(r, n%r); }
	static long gcd(long n, long r) { return r == 0 ? n : gcd(r, n%r); }
	
	static <T> void swap(T[] x, int i, int j) { T t = x[i]; x[i] = x[j]; x[j] = t; }
	static void swap(int[] x, int i, int j) { int t = x[i]; x[i] = x[j]; x[j] = t; }
	
	void main() throws IOException {
		//		IOFast.setFileIO("rle-size.in", "rle-size.out");
		try { run(); }
		catch (EndOfFileRuntimeException e) { }
		io.out.flush();
	}
	public static void main(String[] args) throws IOException { new Main().main(); }
	
	static class EndOfFileRuntimeException extends RuntimeException {
		private static final long serialVersionUID = -8565341110209207657L; }

	static
	public class IOFast {
		private BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		private PrintWriter out = new PrintWriter(System.out);

		void setFileIn(String ins) throws IOException { in.close(); in = new BufferedReader(new FileReader(ins)); }
		void setFileOut(String outs) throws IOException { out.flush(); out.close(); out = new PrintWriter(new FileWriter(outs)); }
		void setFileIO(String ins, String outs) throws IOException { setFileIn(ins); setFileOut(outs); }

		private static int pos, readLen;
		private static final char[] buffer = new char[1024 * 8];
		private static char[] str = new char[500*8*2];
		private static boolean[] isDigit = new boolean[256];
		private static boolean[] isSpace = new boolean[256];
		private static boolean[] isLineSep = new boolean[256];

		static { for(int i = 0; i < 10; i++) { isDigit['0' + i] = true; } isDigit['-'] = true; isSpace[' '] = isSpace['\r'] = isSpace['\n'] = isSpace['\t'] = true; isLineSep['\r'] = isLineSep['\n'] = true; }
		public int read() throws IOException { if(pos >= readLen) { pos = 0; readLen = in.read(buffer); if(readLen <= 0) { throw new EndOfFileRuntimeException(); } } return buffer[pos++]; }
		public int nextInt() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; int ret = 0; if(str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; }
		public long nextLong() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; long ret = 0; if(str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; }
		public char nextChar() throws IOException { while(true) { final int c = read(); if(!isSpace[c]) { return (char)c; } } }
		int reads(int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } if(str.length == len) { char[] rep = new char[str.length * 3 / 2]; System.arraycopy(str, 0, rep, 0, str.length); str = rep; } str[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; }
		int reads(char[] cs, int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } cs[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; }
		public char[] nextLine() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isLineSep); try { if(str[len-1] == '\r') { len--; read(); } } catch(EndOfFileRuntimeException e) { ; } return Arrays.copyOf(str, len); }
		public String nextString() throws IOException { return new String(next()); }
		public char[] next() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); return Arrays.copyOf(str, len); }
		public int next(char[] cs) throws IOException { int len = 0; cs[len++] = nextChar(); len = reads(cs, len, isSpace); return len; }
		public double nextDouble() throws IOException { return Double.parseDouble(nextString()); }
		public long[] nextLongArray(final int n) throws IOException { final long[] res = new long[n]; for(int i = 0; i < n; i++) { res[i] = nextLong(); } return res; }
		public int[] nextIntArray(final int n) throws IOException { final int[] res = new int[n]; for(int i = 0; i < n; i++) { res[i] = nextInt(); } return res; }
		public int[][] nextIntArray2D(final int n, final int k) throws IOException { final int[][] res = new int[n][]; for(int i = 0; i < n; i++) { res[i] = nextIntArray(k); } return res; }
		public int[][] nextIntArray2DWithIndex(final int n, final int k) throws IOException { final int[][] res = new int[n][k+1]; for(int i = 0; i < n; i++) { for(int j = 0; j < k; j++) { res[i][j] = nextInt(); } res[i][k] = i; } return res; }
		public double[] nextDoubleArray(final int n) throws IOException { final double[] res = new double[n]; for(int i = 0; i < n; i++) { res[i] = nextDouble(); } return res; }
	}
}

yukicoder

結果

テストケース

ソースコード