結果

問題 No.466 ジオラマ
ユーザー 37zigen
提出日時 2020-04-18 08:23:41
言語 Java
(openjdk 23)
結果
WA  
実行時間 -
コード長 3,758 bytes
コンパイル時間 2,242 ms
コンパイル使用メモリ 91,620 KB
実行使用メモリ 53,776 KB
最終ジャッジ日時 2024-10-03 22:49:26
合計ジャッジ時間 15,496 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 76 WA * 7
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.NoSuchElementException;
public class Main {
    public static void main(String[] args) {
        new Main().run();
    }
    
    void run() {
        FastScanner sc=new FastScanner();
        PrintWriter pw=new PrintWriter(System.out);
        int A=sc.nextInt();
        int B=sc.nextInt();
        int C=sc.nextInt();
        int D=sc.nextInt();
        
        if (A==C&&B==C) {
            int N=C;
            int M=C;
            if (D<C) {
                System.out.println(-1);
            } else {
                System.out.println(N+" "+M);
                for (int i=0;i<C;++i) {
                    pw.println(i+" "+(i+1)%C);
                }
            }
        } else if (A==C) {
            int d=B-C;
            int N=C+d;
            int M=N-1;
            if (D<M) {
                System.out.println(-1);
            } else {
                System.out.println(N+" "+M);
                System.out.println(0+" "+1);
                int p=2;
                for (int i=0;i<d-1;++i) pw.println(1+" "+(p++));
                for (int i=0;i<C-1;++i) pw.println(0+" "+(p++));
            }
        } else if (B==C) {
            int d=A-C;
            int N=C+d;
            int M=N-1;
            if (D<M) {
                System.out.println(-1);
            } else {
                System.out.println(N+" "+M);
                System.out.println(0+" "+1);
                int p=2;
                for (int i=0;i<d-1;++i) pw.println(0+" "+(p++));
                for (int i=0;i<C-1;++i) pw.println(1+" "+(p++));
            }
        } else {
            int N=(A-C)+(B-C)+C;
            int M=(C==0?A-1+B-1:(A-C)+(B-C)+C-1);
            if (D<M) {
                System.out.println(-1);
            } else {
                System.out.println(N+" "+M);
                int p=2;
                for (int i=0;i<A-C-1;++i) pw.println(0+" "+(p++));
                for (int i=0;i<B-C-1;++i) pw.println(1+" "+(p++));
                if (C>0) {
                    pw.println(0+" "+p);
                    pw.println(1+" "+p);
                    int ab=p++;
                    for (int i=0;i<C-1;++i) {
                        pw.println(ab+" "+(p++));
                    }
                }
            }
        }
        pw.close();         
        
    }
    
    void tr(Object...objects) {System.out.println(Arrays.deepToString(objects));}
    
}
class FastScanner {
    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;
    private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        }else{
            ptr = 0;
            try {
                buflen = in.read(buffer);
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen <= 0) {
                return false;
            }
        }
        return true;
    }
    private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
    private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
    private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;}
    public boolean hasNext() { skipUnprintable(); return hasNextByte();}
    public String next() {
        if (!hasNext()) throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while(isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    public long nextLong() {
        if (!hasNext()) throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        while(true){
            if ('0' <= b && b <= '9') {
                n *= 10;
                n += b - '0';
            }else if(b == -1 || !isPrintableChar(b)){
                return minus ? -n : n;
            }else{
                throw new NumberFormatException();
            }
            b = readByte();
        }
    }
    public int nextInt() {
        return (int)nextLong();
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0