結果
問題 | No.1398 調和の魔法陣 (構築) |
ユーザー | 37zigen |
提出日時 | 2020-06-25 06:40:36 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 332 ms / 3,153 ms |
コード長 | 3,503 bytes |
コンパイル時間 | 5,543 ms |
コンパイル使用メモリ | 81,244 KB |
実行使用メモリ | 58,212 KB |
最終ジャッジ日時 | 2023-10-12 22:27:53 |
合計ジャッジ時間 | 33,342 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 79 ms
51,864 KB |
testcase_01 | AC | 78 ms
52,348 KB |
testcase_02 | AC | 43 ms
49,224 KB |
testcase_03 | AC | 76 ms
53,584 KB |
testcase_04 | AC | 78 ms
52,556 KB |
testcase_05 | AC | 87 ms
52,704 KB |
testcase_06 | AC | 313 ms
57,252 KB |
testcase_07 | AC | 44 ms
49,188 KB |
testcase_08 | AC | 310 ms
56,828 KB |
testcase_09 | AC | 316 ms
57,456 KB |
testcase_10 | AC | 44 ms
49,644 KB |
testcase_11 | AC | 313 ms
56,912 KB |
testcase_12 | AC | 44 ms
49,220 KB |
testcase_13 | AC | 331 ms
56,668 KB |
testcase_14 | AC | 319 ms
57,576 KB |
testcase_15 | AC | 44 ms
49,364 KB |
testcase_16 | AC | 316 ms
57,168 KB |
testcase_17 | AC | 309 ms
56,708 KB |
testcase_18 | AC | 330 ms
57,308 KB |
testcase_19 | AC | 312 ms
56,808 KB |
testcase_20 | AC | 43 ms
49,212 KB |
testcase_21 | AC | 317 ms
57,288 KB |
testcase_22 | AC | 332 ms
58,028 KB |
testcase_23 | AC | 46 ms
47,240 KB |
testcase_24 | AC | 320 ms
56,872 KB |
testcase_25 | AC | 45 ms
49,116 KB |
testcase_26 | AC | 330 ms
57,180 KB |
testcase_27 | AC | 313 ms
57,316 KB |
testcase_28 | AC | 46 ms
49,136 KB |
testcase_29 | AC | 322 ms
58,212 KB |
testcase_30 | AC | 47 ms
49,104 KB |
ソースコード
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(); } int pow(int a,int n) { return n!=0?pow(a*a,n/2)*(n%2==1?a:1):1; } int get(int v,int i,int j) { if (i<0||j<0||i>=3||j>=3) return 0; return v/pow(10,i+2*j)%10; } void run() { FastScanner sc=new FastScanner(); int W=sc.nextInt(); int H=sc.nextInt(); int X=sc.nextInt(); assert(1<=W&&W<=600&&1<=H&&H<=600); assert(0<=X&&X<=81); out:for (int v=0;v<10000;++v) { { int cur=v; int sum=0; while (cur>0) { sum+=cur%10; cur/=10; } if (sum!=X) continue out; } for (int i=0;i<=(H-1)%3;++i) { for (int j=0;j<=(W-1)%3;++j) { int sum=0; for (int di=-1;di<=1;++di) { for (int dj=-1;dj<=1;++dj) { int ni=i+di; int nj=j+dj; if (ni>(H-1)%3 || nj>(W-1)%3 || ni<0 || nj<0) continue; sum+=get(v,ni,nj); } } if (sum!=X) continue out; } } PrintWriter pw=new PrintWriter(System.out); for (int i=0;i<H;++i) { for (int j=0;j<W;++j) { int m=(i%3==2||j%3==2)?0:get(v,i%3,j%3); pw.print(m+(j==W-1?"\n":"")); } } pw.flush(); return; } System.out.println(-1); } 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());} }