結果

問題 No.2237 Xor Sum Hoge
コンテスト
ユーザー hiromi_ayase
提出日時 2023-03-04 02:22:08
言語 Java
(openjdk 23)
結果
TLE  
実行時間 -
コード長 4,041 bytes
コンパイル時間 3,036 ms
コンパイル使用メモリ 86,284 KB
実行使用メモリ 92,580 KB
最終ジャッジ日時 2024-09-18 00:55:06
合計ジャッジ時間 25,222 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample -- * 3
other TLE * 1 -- * 31
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.*;

@SuppressWarnings("unused")
public class Main {

  private static void solve() {
    int n = ni();
    long b = nl();
    long c = nl();

    int mod = 998244353;

    int[][] fif = enumFIF(n, mod);
    int m = 61;
    long[][] dp = new long[m + 1][n];
    dp[0][0] = 1;

    for (int i = 0; i < m; i ++) {
      long s = c >> i & 1;
      long t = b >> i & 1;

      for (int j = 0; j < n; j ++) {
        if ((s + j) % 2 != t) continue;
        for (int k = (int)s; k <= n; k += 2) {
          int nex = (j + k) / 2;
          if (nex >= n) break;
          
          dp[i + 1][nex] += dp[i][j] * CX(n, k, mod, fif) % mod;
          dp[i + 1][nex] %= mod;
        }
      }
    }

    System.out.println(dp[m][0]);
  }

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