結果

問題 No.466 ジオラマ
ユーザー uwi
提出日時 2016-12-16 00:15:25
言語 Java
(openjdk 23)
結果
AC  
実行時間 183 ms / 2,000 ms
コード長 5,172 bytes
コンパイル時間 4,283 ms
コンパイル使用メモリ 82,828 KB
実行使用メモリ 41,820 KB
最終ジャッジ日時 2024-11-30 09:03:41
合計ジャッジ時間 18,238 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 83
権限があれば一括ダウンロードができます

ソースコード

diff # 

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(ac == -1 && bc == -1){
			if(c < 2 || c > d){
				out.println(-1);
				return;
			}
			out.print(c);
			out.println(" " + c);
			int pre = 0;
			int gen = 2;
			out.println(0 + " " + 1);
			out.println(1 + " " + 0);
			for(int i = 0;i < c-2;i++){
				out.println(pre + " " + gen);
				pre = gen;
				gen++;
			}
			return;
		}
		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++;
			}
			return;
		}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++;
			}
			return;
		}
	}
	
	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)); }
}
0