#148492 (Java21) No.466 ジオラマ

提出ソース

結果

問題	No.466 ジオラマ
ユーザー	hiro116s
提出日時	2017-02-09 01:28:00
言語	Java21 (openjdk 21)
結果	WA
実行時間	-
コード長	4,997 bytes
コンパイル時間	3,370 ms
コンパイル使用メモリ	82,728 KB
実行使用メモリ	55,068 KB
最終ジャッジ日時	2024-06-07 13:17:17
合計ジャッジ時間	17,981 ms
ジャッジサーバーID （参考情報）	judge1 / judge3

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	79 ms 38,192 KB
testcase_01	AC	53 ms 36,728 KB
testcase_02	AC	81 ms 38,228 KB
testcase_03	AC	91 ms 39,924 KB
testcase_04	AC	79 ms 37,900 KB
testcase_05	AC	52 ms 37,052 KB
testcase_06	WA	-
testcase_07	WA	-
testcase_08	AC	156 ms 40,300 KB
testcase_09	AC	150 ms 39,732 KB
testcase_10	AC	160 ms 41,112 KB
testcase_11	AC	158 ms 41,192 KB
testcase_12	AC	145 ms 39,792 KB
testcase_13	AC	144 ms 39,676 KB
testcase_14	AC	141 ms 39,420 KB
testcase_15	AC	138 ms 39,824 KB
testcase_16	AC	91 ms 38,064 KB
testcase_17	WA	-
testcase_18	AC	133 ms 39,320 KB
testcase_19	WA	-
testcase_20	WA	-
testcase_21	WA	-
testcase_22	WA	-
testcase_23	WA	-
testcase_24	WA	-
testcase_25	WA	-
testcase_26	WA	-
testcase_27	WA	-
testcase_28	WA	-
testcase_29	WA	-
testcase_30	AC	143 ms 39,924 KB
testcase_31	AC	158 ms 40,680 KB
testcase_32	AC	157 ms 41,040 KB
testcase_33	AC	145 ms 40,844 KB
testcase_34	WA	-
testcase_35	WA	-
testcase_36	AC	137 ms 39,480 KB
testcase_37	AC	50 ms 37,088 KB
testcase_38	AC	138 ms 39,424 KB
testcase_39	AC	52 ms 36,864 KB
testcase_40	AC	137 ms 39,868 KB
testcase_41	AC	51 ms 37,052 KB
testcase_42	AC	148 ms 40,940 KB
testcase_43	AC	50 ms 37,088 KB
testcase_44	AC	146 ms 39,688 KB
testcase_45	AC	52 ms 36,864 KB
testcase_46	AC	126 ms 39,248 KB
testcase_47	AC	50 ms 37,000 KB
testcase_48	AC	138 ms 39,648 KB
testcase_49	AC	50 ms 37,052 KB
testcase_50	AC	152 ms 39,816 KB
testcase_51	AC	52 ms 36,912 KB
testcase_52	AC	145 ms 40,884 KB
testcase_53	AC	50 ms 37,052 KB
testcase_54	AC	150 ms 40,972 KB
testcase_55	AC	49 ms 36,996 KB
testcase_56	WA	-
testcase_57	WA	-
testcase_58	WA	-
testcase_59	WA	-
testcase_60	WA	-
testcase_61	WA	-
testcase_62	WA	-
testcase_63	WA	-
testcase_64	WA	-
testcase_65	WA	-
testcase_66	AC	141 ms 39,732 KB
testcase_67	AC	54 ms 37,084 KB
testcase_68	AC	144 ms 39,816 KB
testcase_69	AC	50 ms 36,868 KB
testcase_70	AC	130 ms 39,516 KB
testcase_71	AC	51 ms 36,900 KB
testcase_72	AC	122 ms 39,356 KB
testcase_73	AC	51 ms 36,832 KB
testcase_74	AC	128 ms 39,900 KB
testcase_75	AC	51 ms 37,120 KB
testcase_76	AC	51 ms 36,888 KB
testcase_77	AC	50 ms 36,604 KB
testcase_78	AC	51 ms 36,572 KB
testcase_79	AC	51 ms 37,108 KB
testcase_80	AC	52 ms 36,908 KB
testcase_81	AC	51 ms 37,020 KB
testcase_82	AC	50 ms 36,912 KB
testcase_83	AC	78 ms 38,192 KB
testcase_84	WA	-
testcase_85	AC	162 ms 40,428 KB
testcase_86	WA	-

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

ソースコード

raw source code

import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.PriorityQueue;

public class Main {
	InputStream is;

	int __t__ = 1;
	int __f__ = 0;
	
	int __STACKSIZE_CHANGE_FLAG__ = __f__;
	int __FILE_DEBUG_FLAG__ = __f__;
	String __DEBUG_FILE_NAME__ = "src/X1";

	FastScanner in;
	PrintWriter out;
	
	public void solve() {
		int A = in.nextInt(), B = in.nextInt(), C = in.nextInt(), D = in.nextInt();
		int a = 0, b = 1;
		if (A > B) {
			int tmp = A; A = B; B = tmp;
			a = 1; b = 0;
		}
		
		if (B == 1) {
			if (C == 0) {
				System.out.println("2 0");				
			} else {
				System.out.println("-1");
			}
			return;
		}
		if (A > C) {
			int N = A + B - C;
			int M = A + B - 2;
			if (M > D) {
				System.out.println(-1);
				return;
			}
			out.println(N + " " + M);
			for (int i = 0; i < A - 1; i++) out.println(a + " " + (i+2));
			for (int i = 0; i < B - 1; i++) out.println(b + " " + (i+1+A-C));
			out.close();
		} else if (A == C) {
			int N = B;
			int M = B - 1;
			if (M > D) {
				System.out.println(-1);
				return;
			}
			out.println(N + " " + M);
			for (int i = 0; i < A - 1; i++) out.println(a + " " + (i+2));
			out.println(b + " " + a);
			for (int i = 0; i < B - A - 1; i++) out.println(b + " " + (i+1+A));
		} else {
			throw new RuntimeException();
		}
		out.close();
	}
	
	public void run() {
		if (__FILE_DEBUG_FLAG__ == __t__) {
			try {
				is = new FileInputStream(__DEBUG_FILE_NAME__);
			} catch (FileNotFoundException e) {
				e.printStackTrace();
			}
			System.out.println("FILE_INPUT!");
		} else {
			is = System.in;
		}
		in = new FastScanner(is);
		out = new PrintWriter(System.out);
		if (__STACKSIZE_CHANGE_FLAG__ == __t__)
			new Thread(null, new Runnable() {
				@Override
				public void run() {
					solve();
				}
			}, "main", 1 << 30).start();
		else
			solve();
	}

	public static void main(String[] args) {
		new Main().run();
	}

	public void mapDebug(long[][] a) {
		System.out.println("--------map display---------");

		for (int i = 0; i < a.length; i++) {
			for (int j = 0; j < a[i].length; j++) {
				System.out.printf("%3d ", a[i][j]);
			}
			System.out.println();
		}

		System.out.println("----------------------------");
		System.out.println();
	}

	public void debug(Object... obj) {
		System.out.println(Arrays.deepToString(obj));
	}

	class FastScanner {
		private InputStream stream;
		private byte[] buf = new byte[1024];
		private int curChar;
		private int numChars;

		public FastScanner(InputStream stream) {
			this.stream = stream;
			// stream = new FileInputStream(new File("dec.in"));

		}

		int read() {
			if (numChars == -1)
				throw new InputMismatchException();
			if (curChar >= numChars) {
				curChar = 0;
				try {
					numChars = stream.read(buf);
				} catch (IOException e) {
					throw new InputMismatchException();
				}
				if (numChars <= 0)
					return -1;
			}
			return buf[curChar++];
		}

		boolean isSpaceChar(int c) {
			return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
		}

		boolean isEndline(int c) {
			return c == '\n' || c == '\r' || c == -1;
		}

		int nextInt() {
			return Integer.parseInt(next());
		}

		int[] nextIntArray(int n) {
			int[] array = new int[n];
			for (int i = 0; i < n; i++)
				array[i] = nextInt();

			return array;
		}

		int[][] nextIntMap(int n, int m) {
			int[][] map = new int[n][m];
			for (int i = 0; i < n; i++) {
				map[i] = in.nextIntArray(m);
			}
			return map;
		}

		long nextLong() {
			return Long.parseLong(next());
		}

		long[] nextLongArray(int n) {
			long[] array = new long[n];
			for (int i = 0; i < n; i++)
				array[i] = nextLong();

			return array;
		}

		long[][] nextLongMap(int n, int m) {
			long[][] map = new long[n][m];
			for (int i = 0; i < n; i++) {
				map[i] = in.nextLongArray(m);
			}
			return map;
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}

		double[] nextDoubleArray(int n) {
			double[] array = new double[n];
			for (int i = 0; i < n; i++)
				array[i] = nextDouble();

			return array;
		}

		double[][] nextDoubleMap(int n, int m) {
			double[][] map = new double[n][m];
			for (int i = 0; i < n; i++) {
				map[i] = in.nextDoubleArray(m);
			}
			return map;
		}

		String next() {
			int c = read();
			while (isSpaceChar(c))
				c = read();
			StringBuilder res = new StringBuilder();
			do {
				res.appendCodePoint(c);
				c = read();
			} while (!isSpaceChar(c));
			return res.toString();
		}

		String[] nextStringArray(int n) {
			String[] array = new String[n];
			for (int i = 0; i < n; i++)
				array[i] = next();

			return array;
		}

		String nextLine() {
			int c = read();
			while (isEndline(c))
				c = read();
			StringBuilder res = new StringBuilder();
			do {
				res.appendCodePoint(c);
				c = read();
			} while (!isEndline(c));
			return res.toString();
		}
	}
}

yukicoder

結果

テストケース

ソースコード