結果
問題 | No.223 1マス指定の魔方陣 |
ユーザー | 37zigen |
提出日時 | 2020-06-19 15:34:49 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 99 ms / 5,000 ms |
コード長 | 3,781 bytes |
コンパイル時間 | 2,256 ms |
コンパイル使用メモリ | 77,116 KB |
実行使用メモリ | 53,852 KB |
最終ジャッジ日時 | 2023-09-16 12:55:30 |
合計ジャッジ時間 | 8,976 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 81 ms
52,456 KB |
testcase_01 | AC | 83 ms
52,892 KB |
testcase_02 | AC | 82 ms
52,520 KB |
testcase_03 | AC | 82 ms
53,384 KB |
testcase_04 | AC | 81 ms
52,648 KB |
testcase_05 | AC | 82 ms
52,864 KB |
testcase_06 | AC | 81 ms
50,324 KB |
testcase_07 | AC | 83 ms
52,588 KB |
testcase_08 | AC | 83 ms
52,360 KB |
testcase_09 | AC | 84 ms
52,324 KB |
testcase_10 | AC | 84 ms
53,524 KB |
testcase_11 | AC | 82 ms
52,332 KB |
testcase_12 | AC | 85 ms
52,212 KB |
testcase_13 | AC | 80 ms
51,728 KB |
testcase_14 | AC | 81 ms
52,492 KB |
testcase_15 | AC | 79 ms
53,572 KB |
testcase_16 | AC | 86 ms
52,464 KB |
testcase_17 | AC | 86 ms
52,564 KB |
testcase_18 | AC | 87 ms
52,460 KB |
testcase_19 | AC | 86 ms
53,472 KB |
testcase_20 | AC | 84 ms
53,628 KB |
testcase_21 | AC | 86 ms
52,652 KB |
testcase_22 | AC | 83 ms
52,460 KB |
testcase_23 | AC | 94 ms
52,628 KB |
testcase_24 | AC | 95 ms
52,724 KB |
testcase_25 | AC | 97 ms
52,680 KB |
testcase_26 | AC | 87 ms
52,424 KB |
testcase_27 | AC | 96 ms
52,524 KB |
testcase_28 | AC | 95 ms
52,596 KB |
testcase_29 | AC | 94 ms
52,704 KB |
testcase_30 | AC | 95 ms
53,612 KB |
testcase_31 | AC | 98 ms
52,928 KB |
testcase_32 | AC | 95 ms
53,044 KB |
testcase_33 | AC | 95 ms
53,392 KB |
testcase_34 | AC | 96 ms
53,580 KB |
testcase_35 | AC | 95 ms
53,436 KB |
testcase_36 | AC | 95 ms
53,020 KB |
testcase_37 | AC | 99 ms
53,628 KB |
testcase_38 | AC | 95 ms
53,588 KB |
testcase_39 | AC | 95 ms
52,484 KB |
testcase_40 | AC | 98 ms
53,612 KB |
testcase_41 | AC | 95 ms
52,280 KB |
testcase_42 | AC | 97 ms
53,660 KB |
testcase_43 | AC | 95 ms
52,604 KB |
testcase_44 | AC | 95 ms
52,640 KB |
testcase_45 | AC | 94 ms
53,852 KB |
testcase_46 | AC | 96 ms
52,588 KB |
ソースコード
import java.io.IOException; import java.io.InputStream; import java.util.Arrays; import java.util.NoSuchElementException; class Fq { static int deg; static long irrPoly; long poly; public Fq(long poly) { this.poly=poly; } static void setDegree(int d) { deg=d;// F_{2^d}, deg(irrPoly)=d irrPoly=new long[]{1,2,5,11,23}[d]; } Fq add(Fq o) { return new Fq(poly^o.poly); } Fq mul(Fq o) { Fq ret=new Fq(0); for (int i=0;i<=deg+1;++i) { if ((o.poly>>i)%2==1) { ret.poly^=poly<<i; } } for (int shift=deg+1;shift>=0;--shift) {; if ((ret.poly>>(shift+deg))%2==1) { ret.poly^=irrPoly<<shift; } } assert(ret.poly<irrPoly); return ret; } void tr(Object...o) {System.out.println(Arrays.deepToString(o));} } public class Main { public static void main(String[] args) { new Main().run(); } void run() { FastScanner sc=new FastScanner(); int N=sc.nextInt(); int X=sc.nextInt(); int Y=sc.nextInt(); int Z=sc.nextInt(); X^=Y;Y^=X;X^=Y; --X;--Y; Fq.setDegree(Integer.numberOfTrailingZeros(N)); Fq[][] mat1=new Fq[N][N]; Fq[][] mat2=new Fq[N][N]; long[][] mat=new long[N][N]; for (int i=0;i<N;++i) { for (int j=0;j<N;++j) { mat1[i][j]=new Fq(i).add(new Fq(j).mul(new Fq(2))); mat2[i][j]=new Fq(i).add(new Fq(j).mul(new Fq(3))); } } for (int i=0;i<N;++i) { for (int j=0;j<N;++j) { mat[i][j]=mat1[i][j].poly+N*mat2[i][j].poly; } } long add=mat[X][Y]^(Z-1); for (int i=0;i<N;++i) { for (int j=0;j<N;++j) { mat[i][j]^=add; System.out.print((mat[i][j]+1)+(j==N-1?"\n":" ")); } } assert(mat[X][Y]==Z-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());} }