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

提出ソース

結果

問題	No.466 ジオラマ
ユーザー	uwi
提出日時	2016-12-16 00:10:39
言語	Java21 (openjdk 21)
結果	WA
実行時間	-
コード長	4,818 bytes
コンパイル時間	3,880 ms
コンパイル使用メモリ	82,800 KB
実行使用メモリ	53,968 KB
最終ジャッジ日時	2024-05-07 15:21:51
合計ジャッジ時間	17,533 ms
ジャッジサーバーID （参考情報）	judge3 / judge4

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	77 ms 39,736 KB
testcase_01	AC	44 ms 36,632 KB
testcase_02	AC	83 ms 38,016 KB
testcase_03	AC	76 ms 37,940 KB
testcase_04	AC	81 ms 37,884 KB
testcase_05	AC	46 ms 36,860 KB
testcase_06	AC	143 ms 40,472 KB
testcase_07	AC	131 ms 40,852 KB
testcase_08	AC	157 ms 41,312 KB
testcase_09	AC	137 ms 40,884 KB
testcase_10	AC	153 ms 41,004 KB
testcase_11	AC	135 ms 41,060 KB
testcase_12	AC	137 ms 40,244 KB
testcase_13	AC	134 ms 40,796 KB
testcase_14	AC	134 ms 40,160 KB
testcase_15	AC	132 ms 40,060 KB
testcase_16	AC	91 ms 39,836 KB
testcase_17	AC	142 ms 40,760 KB
testcase_18	AC	135 ms 40,144 KB
testcase_19	AC	129 ms 41,212 KB
testcase_20	AC	135 ms 40,768 KB
testcase_21	AC	137 ms 40,204 KB
testcase_22	AC	144 ms 41,124 KB
testcase_23	AC	145 ms 41,064 KB
testcase_24	AC	124 ms 40,700 KB
testcase_25	AC	149 ms 41,288 KB
testcase_26	AC	143 ms 40,956 KB
testcase_27	AC	139 ms 41,212 KB
testcase_28	AC	140 ms 40,308 KB
testcase_29	AC	139 ms 40,624 KB
testcase_30	AC	131 ms 40,256 KB
testcase_31	AC	131 ms 40,164 KB
testcase_32	AC	142 ms 40,992 KB
testcase_33	AC	136 ms 40,200 KB
testcase_34	AC	137 ms 40,472 KB
testcase_35	AC	151 ms 41,044 KB
testcase_36	AC	125 ms 39,744 KB
testcase_37	AC	46 ms 36,992 KB
testcase_38	AC	142 ms 40,684 KB
testcase_39	AC	48 ms 36,800 KB
testcase_40	AC	132 ms 41,080 KB
testcase_41	AC	46 ms 37,008 KB
testcase_42	AC	123 ms 40,096 KB
testcase_43	AC	46 ms 36,456 KB
testcase_44	AC	137 ms 39,984 KB
testcase_45	AC	48 ms 37,028 KB
testcase_46	AC	133 ms 39,884 KB
testcase_47	AC	47 ms 36,856 KB
testcase_48	AC	152 ms 40,472 KB
testcase_49	AC	49 ms 36,628 KB
testcase_50	AC	135 ms 40,992 KB
testcase_51	AC	48 ms 36,596 KB
testcase_52	AC	153 ms 41,080 KB
testcase_53	AC	46 ms 36,892 KB
testcase_54	AC	146 ms 40,560 KB
testcase_55	AC	45 ms 36,748 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	140 ms 41,068 KB
testcase_67	AC	46 ms 37,008 KB
testcase_68	AC	138 ms 41,024 KB
testcase_69	AC	45 ms 36,664 KB
testcase_70	AC	130 ms 40,076 KB
testcase_71	AC	46 ms 36,628 KB
testcase_72	AC	130 ms 39,792 KB
testcase_73	AC	48 ms 36,860 KB
testcase_74	AC	149 ms 40,692 KB
testcase_75	AC	47 ms 36,972 KB
testcase_76	AC	48 ms 36,480 KB
testcase_77	AC	47 ms 36,632 KB
testcase_78	AC	47 ms 36,480 KB
testcase_79	AC	44 ms 36,892 KB
testcase_80	AC	46 ms 36,732 KB
testcase_81	AC	57 ms 37,368 KB
testcase_82	WA	-
testcase_83	AC	58 ms 37,308 KB
testcase_84	WA	-
testcase_85	AC	156 ms 41,084 KB
testcase_86	WA	-

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

ソースコード

raw source code

package adv2016;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class N466 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int a = ni()-1, b = ni()-1, c = ni(), d = ni();
		int ac = a - c;
		int bc = b - c;
		if(bc < 0){
			if(ac + c > d){
				out.println(-1);
				return;
			}
			out.print(ac + c + 1);
			out.println(" " + (ac+c));
			int pre = 0;
			int gen = 2;
			out.println(0 + " " + 1);
			for(int i = 0;i < ac;i++){
				out.println(pre + " " + gen);
				pre = gen;
				gen++;
			}
			pre = 1;
			for(int i = 0;i < c-1;i++){
				out.println(pre + " " + gen);
				pre = gen;
				gen++;
			}
			return;
		}
		if(ac < 0){
			if(bc + c > d){
				out.println(-1);
				return;
			}
			out.print(bc + c + 1);
			out.println(" " + (bc+c));
			int pre = 1;
			int gen = 2;
			out.println(1 + " " + 0);
			for(int i = 0;i < bc;i++){
				out.println(pre + " " + gen);
				pre = gen;
				gen++;
			}
			pre = 0;
			for(int i = 0;i < c-1;i++){
				out.println(pre + " " + gen);
				pre = gen;
				gen++;
			}
			return;
		}
		if(c > 0){
			if(ac + bc + c + 1 > d){
				out.println(-1);
				return;
			}
			out.print(ac + bc + c + 2);
			out.println(" " + (ac+bc+c+1));
			int pre = 0;
			int gen = 2;
			for(int i = 0;i < ac;i++){
				out.println(pre + " " + gen);
				pre = gen;
				gen++;
			}
			pre = 1;
			for(int i = 0;i < bc;i++){
				out.println(pre + " " + gen);
				pre = gen;
				gen++;
			}
			pre = 0;
			for(int i = 0;i < c;i++){
				out.println(pre + " " + gen);
				if(pre == 0){
					out.println(1 + " " + gen);
				}
				pre = gen;
				gen++;
			}
		}else{
			if(ac + bc > d){
				out.println(-1);
				return;
			}
			out.print(ac + bc + 2);
			out.println(" " + (ac+bc));
			int pre = 0;
			int gen = 2;
			for(int i = 0;i < ac;i++){
				out.println(pre + " " + gen);
				pre = gen;
				gen++;
			}
			pre = 1;
			for(int i = 0;i < bc;i++){
				out.println(pre + " " + gen);
				pre = gen;
				gen++;
			}
		}
	}
	
	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//		Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
//			@Override
//			public void run() {
//				long s = System.currentTimeMillis();
//				solve();
//				out.flush();
//				if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//			}
//		};
//		t.start();
//		t.join();
	}
	
	public static void main(String[] args) throws Exception { new N466().run(); }
	
	private byte[] inbuf = new byte[1024];
	public int lenbuf = 0, ptrbuf = 0;
	
	private 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 boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }
	
	private 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 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 int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private long[] nal(int n)
	{
		long[] a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		return a;
	}
	
	private 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 int[][] nmi(int n, int m) {
		int[][] map = new int[n][];
		for(int i = 0;i < n;i++)map[i] = na(m);
		return map;
	}
	
	private int ni() { return (int)nl(); }
	
	private 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) { System.out.println(Arrays.deepToString(o)); }
}

yukicoder

結果

テストケース

ソースコード