結果

問題 No.1398 調和の魔法陣 (構築)
ユーザー 37zigen
提出日時 2020-06-25 04:39:46
言語 Java
(openjdk 23)
結果
WA  
実行時間 -
コード長 3,740 bytes
コンパイル時間 2,597 ms
コンパイル使用メモリ 84,656 KB
実行使用メモリ 121,048 KB
最終ジャッジ日時 2024-09-14 20:38:44
合計ジャッジ時間 59,308 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 5 WA * 23
権限があれば一括ダウンロードができます

ソースコード

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

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashMap;
import java.util.NoSuchElementException;
public class Main {
    public static void main(String[] args) {
        new Main().run();
    }
    
    final int MAX=2100000;
    long[] fac=new long[MAX];
    long[] ifac=new long[MAX];
    long[] inv=new long[MAX];
    final long MOD=(long)1e9+7;
    {
        fac[0]=fac[1]=ifac[0]=ifac[1]=inv[0]=inv[1]=1;
        for (int i=2;i<MAX;++i) {
            fac[i]=i*fac[i-1]%MOD;
            inv[i]=MOD-(MOD/i)*inv[(int)(MOD%i)]%MOD;
            ifac[i]=inv[i]*ifac[i-1]%MOD;
        }
    }
    
    long comb(int n,int k) {
        if (n<0||k<0||n-k<0) return 0;
        return fac[n]*ifac[k]%MOD*ifac[n-k]%MOD;
    }
    
    long pow(long a,long n) {
        return n!=0?pow(a*a%MOD,n/2)*(n%2==1?a:1)%MOD:1;
    }
    
    int shift(int x) {
        if (x%3==0) return 2;
        else if (x%3==1) return 0;
        else if (x%3==2) return 0;
        else throw new AssertionError();
    }
    
    void run() {
        FastScanner sc=new FastScanner();
        int W=sc.nextInt();
        int H=sc.nextInt();
        int X=sc.nextInt();
        if (Math.min(H,2)*Math.min(W,2)*9<X) {
            System.out.println(-1);
            return;
        }
        int[][] two=new int[600][600];
        for (int i=0;i<two.length;++i) {
            for (int j=0;j<two[i].length;++j) {
                two[i][j]=X/4;
                if ((i%2+2*(j%2))%4<X%4) two[i][j]++;
            }
        }
        int[][] M=new int[H][W];
        for (int i=0;i<H;++i) {
            for (int j=0;j<W;++j) {
                if (i%3==2 || j%3==2) continue;
                M[i][j]=two[2*(i/3)+i%3][2*(j/3)+j%3];
            }
        }
        for (int i=0;i<H;++i) {
            for (int j=0;j<W;++j) {
                System.out.print(M[i][j]+(j==W-1?"\n":""));
            }
        }
    }
    void tr(Object...o) {System.out.println(Arrays.deepToString(o));}
}
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;}
    public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; 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() {
        long nl = nextLong();
        if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
        return (int) nl;
    }
    
    public double nextDouble() { return Double.parseDouble(next());}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0