結果
問題 | No.466 ジオラマ |
ユーザー |
|
提出日時 | 2016-12-16 00:07:35 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,006 bytes |
コンパイル時間 | 4,697 ms |
コンパイル使用メモリ | 89,960 KB |
実行使用メモリ | 57,744 KB |
最終ジャッジ日時 | 2024-05-07 15:19:56 |
合計ジャッジ時間 | 23,188 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 99 ms
52,860 KB |
testcase_01 | AC | 53 ms
36,764 KB |
testcase_02 | AC | 93 ms
39,888 KB |
testcase_03 | WA | - |
testcase_04 | AC | 97 ms
38,372 KB |
testcase_05 | AC | 56 ms
36,960 KB |
testcase_06 | AC | 187 ms
41,308 KB |
testcase_07 | AC | 174 ms
41,088 KB |
testcase_08 | AC | 180 ms
41,416 KB |
testcase_09 | AC | 175 ms
41,180 KB |
testcase_10 | AC | 180 ms
41,320 KB |
testcase_11 | AC | 168 ms
41,044 KB |
testcase_12 | AC | 185 ms
41,236 KB |
testcase_13 | AC | 168 ms
41,036 KB |
testcase_14 | AC | 169 ms
40,944 KB |
testcase_15 | AC | 174 ms
41,044 KB |
testcase_16 | AC | 94 ms
40,052 KB |
testcase_17 | AC | 153 ms
40,444 KB |
testcase_18 | AC | 174 ms
40,884 KB |
testcase_19 | AC | 166 ms
41,124 KB |
testcase_20 | AC | 166 ms
41,076 KB |
testcase_21 | AC | 159 ms
39,944 KB |
testcase_22 | AC | 173 ms
41,276 KB |
testcase_23 | AC | 174 ms
41,096 KB |
testcase_24 | AC | 185 ms
41,208 KB |
testcase_25 | AC | 183 ms
41,460 KB |
testcase_26 | AC | 159 ms
40,548 KB |
testcase_27 | AC | 180 ms
41,320 KB |
testcase_28 | AC | 170 ms
41,084 KB |
testcase_29 | AC | 181 ms
41,412 KB |
testcase_30 | AC | 175 ms
41,188 KB |
testcase_31 | AC | 171 ms
41,472 KB |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | AC | 178 ms
41,304 KB |
testcase_35 | AC | 166 ms
41,044 KB |
testcase_36 | WA | - |
testcase_37 | AC | 56 ms
36,992 KB |
testcase_38 | WA | - |
testcase_39 | AC | 54 ms
36,476 KB |
testcase_40 | WA | - |
testcase_41 | AC | 58 ms
36,744 KB |
testcase_42 | WA | - |
testcase_43 | AC | 57 ms
36,704 KB |
testcase_44 | WA | - |
testcase_45 | AC | 54 ms
36,776 KB |
testcase_46 | WA | - |
testcase_47 | AC | 52 ms
36,956 KB |
testcase_48 | WA | - |
testcase_49 | AC | 52 ms
36,716 KB |
testcase_50 | WA | - |
testcase_51 | AC | 53 ms
36,944 KB |
testcase_52 | WA | - |
testcase_53 | AC | 54 ms
36,656 KB |
testcase_54 | WA | - |
testcase_55 | AC | 54 ms
36,724 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 | 180 ms
41,300 KB |
testcase_67 | AC | 53 ms
36,696 KB |
testcase_68 | AC | 176 ms
41,336 KB |
testcase_69 | AC | 55 ms
36,992 KB |
testcase_70 | AC | 174 ms
40,956 KB |
testcase_71 | AC | 54 ms
36,988 KB |
testcase_72 | AC | 161 ms
40,656 KB |
testcase_73 | AC | 54 ms
37,188 KB |
testcase_74 | AC | 173 ms
41,336 KB |
testcase_75 | AC | 53 ms
36,956 KB |
testcase_76 | AC | 54 ms
36,452 KB |
testcase_77 | AC | 53 ms
36,936 KB |
testcase_78 | AC | 53 ms
36,832 KB |
testcase_79 | AC | 51 ms
36,948 KB |
testcase_80 | AC | 56 ms
37,000 KB |
testcase_81 | AC | 72 ms
37,620 KB |
testcase_82 | WA | - |
testcase_83 | WA | - |
testcase_84 | WA | - |
testcase_85 | AC | 189 ms
41,796 KB |
testcase_86 | WA | - |
ソースコード
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(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)); } }