結果

問題 No.1073 無限すごろく
ユーザー hiromi_ayasehiromi_ayase
提出日時 2020-06-06 07:35:56
言語 Java21
(openjdk 21)
結果
AC  
実行時間 71 ms / 2,000 ms
コード長 4,121 bytes
コンパイル時間 3,453 ms
コンパイル使用メモリ 90,288 KB
実行使用メモリ 38,556 KB
最終ジャッジ日時 2024-06-02 05:57:52
合計ジャッジ時間 6,001 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 64 ms
38,400 KB
testcase_01 AC 65 ms
38,264 KB
testcase_02 AC 65 ms
38,180 KB
testcase_03 AC 65 ms
38,068 KB
testcase_04 AC 65 ms
38,416 KB
testcase_05 AC 67 ms
38,316 KB
testcase_06 AC 67 ms
38,544 KB
testcase_07 AC 65 ms
38,292 KB
testcase_08 AC 65 ms
38,556 KB
testcase_09 AC 65 ms
38,428 KB
testcase_10 AC 65 ms
38,072 KB
testcase_11 AC 65 ms
38,260 KB
testcase_12 AC 66 ms
38,072 KB
testcase_13 AC 66 ms
38,072 KB
testcase_14 AC 65 ms
38,064 KB
testcase_15 AC 65 ms
38,300 KB
testcase_16 AC 68 ms
38,064 KB
testcase_17 AC 68 ms
38,416 KB
testcase_18 AC 67 ms
38,444 KB
testcase_19 AC 67 ms
38,292 KB
testcase_20 AC 69 ms
38,068 KB
testcase_21 AC 66 ms
38,204 KB
testcase_22 AC 66 ms
38,232 KB
testcase_23 AC 66 ms
38,064 KB
testcase_24 AC 68 ms
38,072 KB
testcase_25 AC 65 ms
38,492 KB
testcase_26 AC 65 ms
38,500 KB
testcase_27 AC 66 ms
38,332 KB
testcase_28 AC 67 ms
38,180 KB
testcase_29 AC 71 ms
38,068 KB
testcase_30 AC 67 ms
38,436 KB
testcase_31 AC 66 ms
38,144 KB
testcase_32 AC 66 ms
38,064 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

public class Main {

  private static void solve() {
    long n = nl();

    int[][] mat = { { 1, 1, 1, 1, 1, 1 }, { 1, 0, 0, 0, 0, 0 }, { 0, 1, 0, 0, 0, 0 }, { 0, 0, 1, 0, 0, 0 },
        { 0, 0, 0, 1, 0, 0 }, { 0, 0, 0, 0, 1, 0 }, };

    int[] v = { 1, 0, 0, 0, 0, 0 };

    int mod = (int) 1e9 + 7;
    int si = (int) invl(6, mod);
    for (int j = 0; j < 6; j++) {
      mat[0][j] *= si;
    }

    int[] ret = pow(mat, v, n, mod);
    System.out.println(ret[0]);
  }

  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;
  }

  private static long invl(long a, long mod) {
    long b = mod;
    long p = 1, q = 0;
    while (b > 0) {
      long c = a / b;
      long d;
      d = a;
      a = b;
      b = d % b;
      d = p;
      p = q;
      q = d - c * q;
    }
    return p < 0 ? p + mod : p;
  }

  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