結果
| 問題 | No.1403 調和の魔法陣 |
| ユーザー |
 uwi
|
| 提出日時 | 2021-02-20 00:46:22 |
| 言語 | Java (openjdk 23) |
| 結果 |
AC
|
| 実行時間 | 1,967 ms / 3,153 ms |
| コード長 | 13,884 bytes |
| コンパイル時間 | 5,211 ms |
| コンパイル使用メモリ | 92,564 KB |
| 実行使用メモリ | 57,268 KB |
| 最終ジャッジ日時 | 2024-09-17 03:06:25 |
| 合計ジャッジ時間 | 29,866 ms |
|
ジャッジサーバーID （参考情報） |
judge6 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 19 |
ソースコード
package contest210219;import java.io.*;import java.util.ArrayDeque;import java.util.Arrays;import java.util.InputMismatchException;import java.util.Queue;public class D2 {InputStream is;FastWriter out;String INPUT = "";long get22(int h, int w, int x){long ret = 0;for (int A = 0; A <= 9; A++) {for (int mint0 = 0; mint0 <= A; mint0++) {for (int maxt0 = A; maxt0 <= 9; maxt0++) {for (int mint1 = 0; mint1 <= 9; mint1++) {for (int maxt1 = mint1; maxt1 <= 9; maxt1++) {int gsup = Math.min(9, Math.min(x - A - maxt1, 9 - A + mint0));int ginf = Math.max(0, Math.max(x - A - mint1 - 9, maxt0 - A));int hsup = Math.min(9, Math.min(A + mint1, 9+A-maxt0));int hinf = Math.max(0, Math.max(A + maxt1-9, A-mint0));if (h <= 2) {if (ginf <= gsup) {ret += ps[gsup - ginf + 1][h/3+1] * f(mint0, maxt0, w / 3 + 1, A) % mod *f(mint1, maxt1, w / 3 + 1);ret %= mod;}} else {if (ginf <= gsup && hinf <= hsup) {ret += ps[gsup-ginf+1][h/3+1] * ps[hsup-hinf+1][h/3] % mod * f(mint0, maxt0, w / 3 + 1, A) % mod *f(mint1, maxt1, w / 3 + 1);ret %= mod;}}}}}}}return ret;}long[][] ps = new long[11][300];long f(int inf, int sup, int num){if(sup == inf)return 1;return gya[sup-inf-1][num];// return (ps[sup-inf+1][num] - ps[sup-inf][num]*2 + ps[sup-inf-1][num] + 2*mod) % mod;// return (pow(sup-inf+1, num, mod) - pow(sup-inf, num, mod) * 2 + pow(sup-inf-1, num, mod) +2*mod) % mod;}long f(int inf, int sup, int num, int A){if(inf == sup){return 1;}else if(inf == A || sup == A) {return gya2[sup-inf][num-1];// return (ps[sup-inf+1][num-1] - ps[sup-inf][num-1] + mod) % mod;// return (pow(sup - inf + 1, num-1, mod) - pow(sup - inf, num-1, mod) + mod) % mod;}else{return gya[sup-inf-1][num-1];// return (ps[sup-inf+1][num-1] - ps[sup-inf][num-1] * 2 + ps[sup-inf-1][num-1] + 2*mod) % mod;// return (pow(sup-inf+1, num-1, mod) - pow(sup-inf, num-1, mod) * 2 + pow(sup-inf-1, num-1, mod) + 2*mod)% mod;}}long[][] gya = new long[9][300];long[][] gya2 = new long[10][300];long[] c12 = new long[37];public void solve() {for(int i = 0;i < 11;i++){ps[i][0] = 1;for(int j = 1;j < 300;j++){ps[i][j] = ps[i][j-1] * i % mod;}}for(int i = 0;i < 9;i++){for(int j = 0;j < 300;j++){gya[i][j] = (ps[i+2][j] - ps[i+1][j] * 2 + ps[i][j] + 2*mod) % mod;}}for(int i= 0;i < 10;i++){for(int j = 0;j < 300;j++){gya2[i][j] = (ps[i+1][j] - ps[i][j] + mod) % mod;}}for(int i = 0;i <= 9;i++){for(int j = 0;j <= 9;j++){int s = i+j;c12[s]++;}}for (int T = ni(); T > 0; T--) go();}final int mod = 998244353;public static long pow(long a, long n, long mod) {// a %= mod;long ret = 1;int x = 63 - Long.numberOfLeadingZeros(n);for (; x >= 0; x--) {ret = ret * ret % mod;if (n << 63 - x < 0) ret = ret * a % mod;}return ret;}void go(){int w = ni(), h = ni(), x = ni();if(x > 36){out.println(0);return;}if(x == 0){out.println(1);return;}// 1120// 1102// 2030// 2010// ab// cd// c+d=e+f// ef// 2x2if(w % 3 == 2 && h % 3 == 2){out.println(get22(h, w, x));return;}long ans = 0;// 1x2if(x <= 18){if(w % 3 == 2) {ans += pow(c12[x], (h+2)/3, mod);out.println(ans%mod);return;}if(h % 3 == 2){ans += pow(c12[x], (w+2)/3, mod);out.println(ans%mod);return;}}if(x <= 9){ans++;}out.println(ans%mod);}public static void main(String[] args) {new D2().run();}public void run(){long S = System.currentTimeMillis();is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());out = new FastWriter(System.out);solve();out.flush();long G = System.currentTimeMillis();tr(G-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();}private boolean eof(){if(lenbuf == -1)return true;int lptr = ptrbuf;while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;try {is.mark(1000);while(true){int b = is.read();if(b == -1){is.reset();return true;}else if(!isSpaceChar(b)){is.reset();return false;}}} catch (IOException e) {return true;}}private final 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 boolean isSpaceChar(int c) { return !(c >= 32 && 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))){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 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[] 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 int ni(){int num = 0, 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 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();}}public static class FastWriter{private static final int BUF_SIZE = 1<<13;private final byte[] buf = new byte[BUF_SIZE];private final OutputStream out;private int ptr = 0;private FastWriter(){out = null;}public FastWriter(OutputStream os){this.out = os;}public FastWriter(String path){try {this.out = new FileOutputStream(path);} catch (FileNotFoundException e) {throw new RuntimeException("FastWriter");}}public FastWriter write(byte b){buf[ptr++] = b;if(ptr == BUF_SIZE)innerflush();return this;}public FastWriter write(char c){return write((byte)c);}public FastWriter write(char[] s){for(char c : s){buf[ptr++] = (byte)c;if(ptr == BUF_SIZE)innerflush();}return this;}public FastWriter write(String s){s.chars().forEach(c -> {buf[ptr++] = (byte)c;if(ptr == BUF_SIZE)innerflush();});return this;}private static int countDigits(int l) {if (l >= 1000000000) return 10;if (l >= 100000000) return 9;if (l >= 10000000) return 8;if (l >= 1000000) return 7;if (l >= 100000) return 6;if (l >= 10000) return 5;if (l >= 1000) return 4;if (l >= 100) return 3;if (l >= 10) return 2;return 1;}public FastWriter write(int x){if(x == Integer.MIN_VALUE){return write((long)x);}if(ptr + 12 >= BUF_SIZE)innerflush();if(x < 0){write((byte)'-');x = -x;}int d = countDigits(x);for(int i = ptr + d - 1;i >= ptr;i--){buf[i] = (byte)('0'+x%10);x /= 10;}ptr += d;return this;}private static int countDigits(long l) {if (l >= 1000000000000000000L) return 19;if (l >= 100000000000000000L) return 18;if (l >= 10000000000000000L) return 17;if (l >= 1000000000000000L) return 16;if (l >= 100000000000000L) return 15;if (l >= 10000000000000L) return 14;if (l >= 1000000000000L) return 13;if (l >= 100000000000L) return 12;if (l >= 10000000000L) return 11;if (l >= 1000000000L) return 10;if (l >= 100000000L) return 9;if (l >= 10000000L) return 8;if (l >= 1000000L) return 7;if (l >= 100000L) return 6;if (l >= 10000L) return 5;if (l >= 1000L) return 4;if (l >= 100L) return 3;if (l >= 10L) return 2;return 1;}public FastWriter write(long x){if(x == Long.MIN_VALUE){return write("" + x);}if(ptr + 21 >= BUF_SIZE)innerflush();if(x < 0){write((byte)'-');x = -x;}int d = countDigits(x);for(int i = ptr + d - 1;i >= ptr;i--){buf[i] = (byte)('0'+x%10);x /= 10;}ptr += d;return this;}public FastWriter write(double x, int precision){if(x < 0){write('-');x = -x;}x += Math.pow(10, -precision)/2;// if(x < 0){ x = 0; }write((long)x).write(".");x -= (long)x;for(int i = 0;i < precision;i++){x *= 10;write((char)('0'+(int)x));x -= (int)x;}return this;}public FastWriter writeln(char c){return write(c).writeln();}public FastWriter writeln(int x){return write(x).writeln();}public FastWriter writeln(long x){return write(x).writeln();}public FastWriter writeln(double x, int precision){return write(x, precision).writeln();}public FastWriter write(int... xs){boolean first = true;for(int x : xs) {if (!first) write(' ');first = false;write(x);}return this;}public FastWriter write(long... xs){boolean first = true;for(long x : xs) {if (!first) write(' ');first = false;write(x);}return this;}public FastWriter writeln(){return write((byte)'\n');}public FastWriter writeln(int... xs){return write(xs).writeln();}public FastWriter writeln(long... xs){return write(xs).writeln();}public FastWriter writeln(char[] line){return write(line).writeln();}public FastWriter writeln(char[]... map){for(char[] line : map)write(line).writeln();return this;}public FastWriter writeln(String s){return write(s).writeln();}private void innerflush(){try {out.write(buf, 0, ptr);ptr = 0;} catch (IOException e) {throw new RuntimeException("innerflush");}}public void flush(){innerflush();try {out.flush();} catch (IOException e) {throw new RuntimeException("flush");}}public FastWriter print(byte b) { return write(b); }public FastWriter print(char c) { return write(c); }public FastWriter print(char[] s) { return write(s); }public FastWriter print(String s) { return write(s); }public FastWriter print(int x) { return write(x); }public FastWriter print(long x) { return write(x); }public FastWriter print(double x, int precision) { return write(x, precision); }public FastWriter println(char c){ return writeln(c); }public FastWriter println(int x){ return writeln(x); }public FastWriter println(long x){ return writeln(x); }public FastWriter println(double x, int precision){ return writeln(x, precision); }public FastWriter print(int... xs) { return write(xs); }public FastWriter print(long... xs) { return write(xs); }public FastWriter println(int... xs) { return writeln(xs); }public FastWriter println(long... xs) { return writeln(xs); }public FastWriter println(char[] line) { return writeln(line); }public FastWriter println(char[]... map) { return writeln(map); }public FastWriter println(String s) { return writeln(s); }public FastWriter println() { return writeln(); }}public static void trnz(int... o){for(int i = 0;i < o.length;i++)if(o[i] != 0)System.out.print(i+":"+o[i]+" ");System.out.println();}// print ids which are 1public static void trt(long... o){Queue<Integer> stands = new ArrayDeque<>();for(int i = 0;i < o.length;i++){for(long x = o[i];x != 0;x &= x-1)stands.add(i<<6|Long.numberOfTrailingZeros(x));}System.out.println(stands);}public static void tf(boolean... r){for(boolean x : r)System.out.print(x?'#':'.');System.out.println();}public static void tf(boolean[]... b){for(boolean[] r : b) {for(boolean x : r)System.out.print(x?'#':'.');System.out.println();}System.out.println();}public void tf(long[]... b){if(INPUT.length() != 0) {for (long[] r : b) {for (long x : r) {for (int i = 0; i < 64; i++) {System.out.print(x << ~i < 0 ? '#' : '.');}}System.out.println();}System.out.println();}}public void tf(long... b){if(INPUT.length() != 0) {for (long x : b) {for (int i = 0; i < 64; i++) {System.out.print(x << ~i < 0 ? '#' : '.');}}System.out.println();}}private void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }}