結果

問題 No.1310 量子アニーリング
ユーザー hiromi_ayasehiromi_ayase
提出日時 2020-12-08 14:27:10
言語 Java21
(openjdk 21)
結果
AC  
実行時間 171 ms / 2,000 ms
コード長 4,075 bytes
コンパイル時間 2,831 ms
コンパイル使用メモリ 82,188 KB
実行使用メモリ 57,368 KB
最終ジャッジ日時 2023-10-17 17:13:52
合計ジャッジ時間 6,590 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 80 ms
53,224 KB
testcase_01 AC 78 ms
54,396 KB
testcase_02 AC 79 ms
54,472 KB
testcase_03 AC 79 ms
54,384 KB
testcase_04 AC 78 ms
54,392 KB
testcase_05 AC 80 ms
54,384 KB
testcase_06 AC 78 ms
54,384 KB
testcase_07 AC 78 ms
54,392 KB
testcase_08 AC 76 ms
54,392 KB
testcase_09 AC 83 ms
54,388 KB
testcase_10 AC 81 ms
54,396 KB
testcase_11 AC 82 ms
54,380 KB
testcase_12 AC 89 ms
55,148 KB
testcase_13 AC 111 ms
55,220 KB
testcase_14 AC 119 ms
55,228 KB
testcase_15 AC 127 ms
55,204 KB
testcase_16 AC 133 ms
55,300 KB
testcase_17 AC 152 ms
55,232 KB
testcase_18 AC 167 ms
57,316 KB
testcase_19 AC 122 ms
55,216 KB
testcase_20 AC 101 ms
55,184 KB
testcase_21 AC 100 ms
55,156 KB
testcase_22 AC 171 ms
57,368 KB
testcase_23 AC 115 ms
55,204 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.*;

@SuppressWarnings("unused")
public class Main {

  private static void solve() {
    int n = ni();
    int mod = 998244353;

    int[][] fif = enumFIF(n, mod);

    long ret = 0;
    for (int i = 0; i <= n; i += 2) {
      int e = Math.abs(i * 2 - n);
      ret += pow(2, e, mod) * CX(n, i, mod, fif) % mod * 2 % mod;
      ret %= mod;
      if (ret < 0)
        ret += mod;
    }
    System.out.println(ret);

  }

  public static long pow(long a, long n, long mod) {
    // a %= mod;
    long ret = 1; // 1%mod if mod=1,n=0
    int x = 63 - Long.numberOfLeadingZeros(n);
    for (; x >= 0; x--) {
      ret = ret * ret % mod;
      if (n << ~x < 0)
        ret = ret * a % mod;
    }
    return ret;
  }

  public static long CX(long n, long r, int p, int[][] fif) {
    if (n < 0 || r < 0 || r > n)
      return 0;
    int np = (int) (n % p), rp = (int) (r % p);
    if (np < rp)
      return 0;
    if (n == 0 && r == 0)
      return 1;
    int nrp = np - rp;
    if (nrp < 0)
      nrp += p;
    return (long) fif[0][np] * fif[1][rp] % p * fif[1][nrp] % p * CX(n / p, r / p, p, fif) % p;
  }

  public static int[][] enumFIF(int n, int mod) {
    int[] f = new int[n + 1];
    int[] invf = new int[n + 1];
    f[0] = 1;
    for (int i = 1; i <= n; i++) {
      f[i] = (int) ((long) f[i - 1] * i % mod);
    }
    long a = f[n];
    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;
    }
    invf[n] = (int) (p < 0 ? p + mod : p);
    for (int i = n - 1; i >= 0; i--) {
      invf[i] = (int) ((long) invf[i + 1] * (i + 1) % mod);
    }
    return new int[][] { f, invf };
  }

  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