結果

問題 No.840 ほむほむほむら
ユーザー hiromi_ayasehiromi_ayase
提出日時 2019-06-14 23:47:35
言語 Java21
(openjdk 21)
結果
AC  
実行時間 1,026 ms / 4,000 ms
コード長 4,738 bytes
コンパイル時間 4,031 ms
コンパイル使用メモリ 79,752 KB
実行使用メモリ 54,736 KB
最終ジャッジ日時 2023-08-09 19:29:59
合計ジャッジ時間 12,901 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 71 ms
50,680 KB
testcase_01 AC 72 ms
50,808 KB
testcase_02 AC 109 ms
51,868 KB
testcase_03 AC 210 ms
52,424 KB
testcase_04 AC 69 ms
51,096 KB
testcase_05 AC 69 ms
50,708 KB
testcase_06 AC 88 ms
51,992 KB
testcase_07 AC 128 ms
51,820 KB
testcase_08 AC 302 ms
52,040 KB
testcase_09 AC 85 ms
51,976 KB
testcase_10 AC 69 ms
50,572 KB
testcase_11 AC 89 ms
49,996 KB
testcase_12 AC 158 ms
51,868 KB
testcase_13 AC 655 ms
52,580 KB
testcase_14 AC 164 ms
50,012 KB
testcase_15 AC 70 ms
50,912 KB
testcase_16 AC 93 ms
52,064 KB
testcase_17 AC 217 ms
52,260 KB
testcase_18 AC 1,013 ms
54,252 KB
testcase_19 AC 1,024 ms
54,260 KB
testcase_20 AC 68 ms
51,296 KB
testcase_21 AC 69 ms
50,872 KB
testcase_22 AC 98 ms
52,112 KB
testcase_23 AC 1,026 ms
52,880 KB
testcase_24 AC 93 ms
51,808 KB
testcase_25 AC 68 ms
50,672 KB
testcase_26 AC 103 ms
52,080 KB
testcase_27 AC 875 ms
54,736 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

public class Main {


  private static void solve() {
    int n = ni();
    int k = ni();
    int mod = 998244353;
    
    int kk = k * k * k;
    
    int[][] mat = new int[kk][kk];
    for (int p1 = 0; p1 < k; p1 ++) {
      for (int q1 = 0; q1 < k; q1 ++) {
        for (int r1 = 0; r1 < k; r1 ++) {

          for (int p2 = 0; p2 < k; p2 ++) {
            for (int q2 = 0; q2 < k; q2 ++) {
              for (int r2 = 0; r2 < k; r2 ++) {
                
                int i = p1 + q1 * k + r1 * k * k;
                int j = p2 + q2 * k + r2 * k * k;
                
                
                if (q1 == q2 && r1 == r2 && (p1 + 1) % k == p2) {
                  mat[i][j] ++;
                }
                if (p1 == p2 && r1 == r2 && (q1 + p1) % k == q2) {
                  mat[i][j] ++;
                }
                if (p1 == p2 && q1 == q2 && (r1 + q1) % k == r2) {
                  mat[i][j] ++;
                }
              }
            }
          }
        }
      }
    }

    int[] v = new int[kk];
    v[0] = 1;
    
    int[] ret = pow(mat, v, n, mod);
    long ans = 0;
    for (int p1 = 0; p1 < k; p1 ++) {
      for (int q1 = 0; q1 < k; q1 ++) {
        ans += ret[p1 + q1 * k];
        ans %= mod;
      }
    }
    System.out.println(ans);
    
  }

  public static int[] pow(int[][] A, int[] v, long e, int mod)
  {
      int[][] MUL = A;
      for(int i = 0;i < v.length;i++)v[i] %= mod;
      for(;e > 0;e>>>=1) {
          if((e&1)==1)v = mul(MUL, v, mod);
          MUL = p2(MUL, mod);
      }
      return v;
  }
  
  public static int[] mul(int[][] A, int[] v, int mod)
  {
      int m = A.length;
      int n = v.length;
      int[] w = new int[m];
      for(int i = 0;i < m;i++){
          long sum = 0;
          for(int k = 0;k < n;k++){
              sum += (long)A[i][k] * v[k];
              sum %= mod;
          }
          w[i] = (int)sum;
      }
      return w;
  }
  
  // int matrix^2 (cannot ensure negative values)
  public static int[][] p2(int[][] A, int mod)
  {
      int n = A.length;
      int[][] C = new int[n][n];
      for(int i = 0;i < n;i++){
          for(int j = 0;j < n;j++){
              long sum = 0;
              for(int k = 0;k < n;k++){
                  sum += (long)A[i][k] * A[k][j];
                  sum %= mod;
              }
              C[i][j] = (int)sum;
          }
      }
      return C;
  }
  public static void main(String[] args) {
    new Thread(null, new Runnable() {
      @Override
      public void run() {
        long start = System.currentTimeMillis();
        String debug = args.length > 0 ? args[0] : null;
        if (debug != null) {
          try {
            is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug));
          } catch (Exception e) {
            throw new RuntimeException(e);
          }
        }
        reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768);
        solve();
        out.flush();
        tr((System.currentTimeMillis() - start) + "ms");
      }
    }, "", 64000000).start();
  }

  private static java.io.InputStream is = System.in;
  private static java.io.PrintWriter out = new java.io.PrintWriter(System.out);
  private static java.util.StringTokenizer tokenizer = null;
  private static java.io.BufferedReader reader;

  public static String next() {
    while (tokenizer == null || !tokenizer.hasMoreTokens()) {
      try {
        tokenizer = new java.util.StringTokenizer(reader.readLine());
      } catch (Exception e) {
        throw new RuntimeException(e);
      }
    }
    return tokenizer.nextToken();
  }

  private static double nd() {
    return Double.parseDouble(next());
  }

  private static long nl() {
    return Long.parseLong(next());
  }

  private static int[] na(int n) {
    int[] a = new int[n];
    for (int i = 0; i < n; i++)
      a[i] = ni();
    return a;
  }

  private static char[] ns() {
    return next().toCharArray();
  }

  private static long[] nal(int n) {
    long[] a = new long[n];
    for (int i = 0; i < n; i++)
      a[i] = nl();
    return a;
  }

  private static int[][] ntable(int n, int m) {
    int[][] table = new int[n][m];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[i][j] = ni();
      }
    }
    return table;
  }

  private static int[][] nlist(int n, int m) {
    int[][] table = new int[m][n];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[j][i] = ni();
      }
    }
    return table;
  }

  private static int ni() {
    return Integer.parseInt(next());
  }

  private static void tr(Object... o) {
    if (is != System.in)
      System.out.println(java.util.Arrays.deepToString(o));
  }
}
0