結果
問題 | No.466 ジオラマ |
ユーザー | uwi |
提出日時 | 2016-12-16 00:15:25 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 196 ms / 2,000 ms |
コード長 | 5,172 bytes |
コンパイル時間 | 4,946 ms |
コンパイル使用メモリ | 79,960 KB |
実行使用メモリ | 55,640 KB |
最終ジャッジ日時 | 2023-08-20 08:06:01 |
合計ジャッジ時間 | 20,091 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 91 ms
53,500 KB |
testcase_01 | AC | 46 ms
49,420 KB |
testcase_02 | AC | 88 ms
52,540 KB |
testcase_03 | AC | 88 ms
52,780 KB |
testcase_04 | AC | 89 ms
52,656 KB |
testcase_05 | AC | 56 ms
49,416 KB |
testcase_06 | AC | 171 ms
54,516 KB |
testcase_07 | AC | 165 ms
54,132 KB |
testcase_08 | AC | 182 ms
54,352 KB |
testcase_09 | AC | 162 ms
54,380 KB |
testcase_10 | AC | 171 ms
54,464 KB |
testcase_11 | AC | 169 ms
54,540 KB |
testcase_12 | AC | 176 ms
54,708 KB |
testcase_13 | AC | 164 ms
54,536 KB |
testcase_14 | AC | 196 ms
52,348 KB |
testcase_15 | AC | 169 ms
54,532 KB |
testcase_16 | AC | 120 ms
52,520 KB |
testcase_17 | AC | 167 ms
54,496 KB |
testcase_18 | AC | 167 ms
54,316 KB |
testcase_19 | AC | 168 ms
54,448 KB |
testcase_20 | AC | 172 ms
54,428 KB |
testcase_21 | AC | 164 ms
54,284 KB |
testcase_22 | AC | 169 ms
54,560 KB |
testcase_23 | AC | 165 ms
54,332 KB |
testcase_24 | AC | 185 ms
54,440 KB |
testcase_25 | AC | 178 ms
54,352 KB |
testcase_26 | AC | 164 ms
54,440 KB |
testcase_27 | AC | 175 ms
54,388 KB |
testcase_28 | AC | 180 ms
54,492 KB |
testcase_29 | AC | 181 ms
54,324 KB |
testcase_30 | AC | 165 ms
54,428 KB |
testcase_31 | AC | 167 ms
54,560 KB |
testcase_32 | AC | 158 ms
54,336 KB |
testcase_33 | AC | 163 ms
54,124 KB |
testcase_34 | AC | 169 ms
54,716 KB |
testcase_35 | AC | 170 ms
54,556 KB |
testcase_36 | AC | 159 ms
52,488 KB |
testcase_37 | AC | 47 ms
49,824 KB |
testcase_38 | AC | 164 ms
54,344 KB |
testcase_39 | AC | 47 ms
49,416 KB |
testcase_40 | AC | 167 ms
54,352 KB |
testcase_41 | AC | 47 ms
49,400 KB |
testcase_42 | AC | 164 ms
54,624 KB |
testcase_43 | AC | 47 ms
49,416 KB |
testcase_44 | AC | 164 ms
54,568 KB |
testcase_45 | AC | 47 ms
49,612 KB |
testcase_46 | AC | 163 ms
54,100 KB |
testcase_47 | AC | 47 ms
49,464 KB |
testcase_48 | AC | 168 ms
54,536 KB |
testcase_49 | AC | 47 ms
49,664 KB |
testcase_50 | AC | 167 ms
54,224 KB |
testcase_51 | AC | 48 ms
49,412 KB |
testcase_52 | AC | 168 ms
54,340 KB |
testcase_53 | AC | 47 ms
49,428 KB |
testcase_54 | AC | 170 ms
54,288 KB |
testcase_55 | AC | 48 ms
49,404 KB |
testcase_56 | AC | 127 ms
53,896 KB |
testcase_57 | AC | 48 ms
49,268 KB |
testcase_58 | AC | 124 ms
53,052 KB |
testcase_59 | AC | 51 ms
49,464 KB |
testcase_60 | AC | 159 ms
54,348 KB |
testcase_61 | AC | 47 ms
49,484 KB |
testcase_62 | AC | 128 ms
55,640 KB |
testcase_63 | AC | 49 ms
49,464 KB |
testcase_64 | AC | 122 ms
52,784 KB |
testcase_65 | AC | 48 ms
49,428 KB |
testcase_66 | AC | 177 ms
54,276 KB |
testcase_67 | AC | 48 ms
49,260 KB |
testcase_68 | AC | 163 ms
54,740 KB |
testcase_69 | AC | 47 ms
49,488 KB |
testcase_70 | AC | 163 ms
54,244 KB |
testcase_71 | AC | 49 ms
49,352 KB |
testcase_72 | AC | 156 ms
54,472 KB |
testcase_73 | AC | 48 ms
49,340 KB |
testcase_74 | AC | 164 ms
54,180 KB |
testcase_75 | AC | 47 ms
49,416 KB |
testcase_76 | AC | 53 ms
49,392 KB |
testcase_77 | AC | 48 ms
49,404 KB |
testcase_78 | AC | 46 ms
49,480 KB |
testcase_79 | AC | 46 ms
47,536 KB |
testcase_80 | AC | 47 ms
49,304 KB |
testcase_81 | AC | 70 ms
48,636 KB |
testcase_82 | AC | 47 ms
49,416 KB |
testcase_83 | AC | 72 ms
50,904 KB |
testcase_84 | AC | 169 ms
54,356 KB |
testcase_85 | AC | 170 ms
54,520 KB |
testcase_86 | AC | 71 ms
50,736 KB |
ソースコード
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)); } }