結果

問題 No.1241 Eternal Tours
ユーザー 👑 hos.lyrichos.lyric
提出日時 2020-09-06 15:11:24
言語 Java21
(openjdk 21)
結果
AC  
実行時間 1,315 ms / 6,000 ms
コード長 3,565 bytes
コンパイル時間 3,386 ms
コンパイル使用メモリ 92,360 KB
実行使用メモリ 70,212 KB
最終ジャッジ日時 2024-11-29 11:06:48
合計ジャッジ時間 27,293 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 126 ms
41,572 KB
testcase_01 AC 126 ms
41,248 KB
testcase_02 AC 489 ms
61,516 KB
testcase_03 AC 123 ms
41,712 KB
testcase_04 AC 133 ms
41,452 KB
testcase_05 AC 128 ms
41,500 KB
testcase_06 AC 127 ms
41,280 KB
testcase_07 AC 127 ms
41,328 KB
testcase_08 AC 131 ms
41,608 KB
testcase_09 AC 128 ms
41,524 KB
testcase_10 AC 127 ms
41,504 KB
testcase_11 AC 131 ms
41,556 KB
testcase_12 AC 127 ms
41,488 KB
testcase_13 AC 132 ms
41,384 KB
testcase_14 AC 642 ms
55,792 KB
testcase_15 AC 129 ms
41,316 KB
testcase_16 AC 398 ms
51,252 KB
testcase_17 AC 1,215 ms
69,984 KB
testcase_18 AC 1,068 ms
62,952 KB
testcase_19 AC 1,026 ms
59,980 KB
testcase_20 AC 158 ms
41,396 KB
testcase_21 AC 158 ms
41,736 KB
testcase_22 AC 1,146 ms
67,940 KB
testcase_23 AC 213 ms
42,344 KB
testcase_24 AC 125 ms
41,168 KB
testcase_25 AC 126 ms
41,264 KB
testcase_26 AC 126 ms
41,320 KB
testcase_27 AC 111 ms
39,912 KB
testcase_28 AC 675 ms
61,296 KB
testcase_29 AC 703 ms
61,148 KB
testcase_30 AC 799 ms
61,340 KB
testcase_31 AC 553 ms
53,128 KB
testcase_32 AC 1,221 ms
69,924 KB
testcase_33 AC 1,104 ms
61,580 KB
testcase_34 AC 1,008 ms
61,476 KB
testcase_35 AC 984 ms
61,280 KB
testcase_36 AC 128 ms
41,344 KB
testcase_37 AC 127 ms
41,576 KB
testcase_38 AC 1,315 ms
61,484 KB
testcase_39 AC 1,208 ms
60,336 KB
testcase_40 AC 1,130 ms
61,388 KB
testcase_41 AC 1,028 ms
70,212 KB
testcase_42 AC 860 ms
60,204 KB
testcase_43 AC 809 ms
61,292 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import static java.lang.Math.*;
import static java.math.BigInteger.*;
import static java.util.Arrays.*;
import static java.util.Collections.*;
import java.math.*;
import java.util.*;
import java.io.*;

public class Main {
  public static void main(String[] args) { new Main().run(); }
  Scanner in = new Scanner(System.in);
  void _out(Object...os) { System.out.println(deepToString(os)); }
  void _err(Object...os) { System.err.println(deepToString(os)); }
  
  final long MO = 998244353;
  final long G = 3;
  
  void run() {
    for (; in.hasNext(); ) {
      int X = in.nextInt();
      int Y = in.nextInt();
      long T = in.nextLong();
      int A = in.nextInt();
      int B = in.nextInt();
      int C = in.nextInt();
      int D = in.nextInt();
      
      int m = 1 << (X + 1);
      int n = 1 << (Y + 1);
      
      long[] gms = new long[m];
      long[] gns = new long[n];
      gms[0] = 1;
      gns[0] = 1;
      gms[1] = power(G, (MO - 1) / m);
      gns[1] = power(G, (MO - 1) / n);
      for (int i = 2; i < m; ++i) {
        gms[i] = (gms[i - 1] * gms[1]) % MO;
      }
      for (int i = 2; i < n; ++i) {
        gns[i] = (gns[i - 1] * gns[1]) % MO;
      }
      
      long[][] f = new long[m][n];
      f[0][0] = f[1][0] = f[0][1] = f[m - 1][0] = f[0][n - 1] = 1;
      
      for (int x = 0; x < m; ++x) {
        fft(n, gns, f[x]);
      }
      for (int y = 0; y < n; ++y) {
        long[] work = new long[m];
        for (int x = 0; x < m; ++x) {
          work[x] = f[x][y];
        }
        fft(m, gms, work);
        for (int x = 0; x < m; ++x) {
          f[x][y] = work[x];
        }
      }
      
      for (int x = 0; x < m; ++x) for (int y = 0; y < n; ++y) {
        f[x][y] = power(f[x][y], T);
      }
      
      for (int i = 1; i < m - i; ++i) {
        long t = gms[i];
        gms[i] = gms[m - i];
        gms[m - i] = t;
      }
      for (int i = 1; i < n - i; ++i) {
        long t = gns[i];
        gns[i] = gns[n - i];
        gns[n - i] = t;
      }
      for (int x = 0; x < m; ++x) {
        fft(n, gns, f[x]);
      }
      for (int y = 0; y < n; ++y) {
        long[] work = new long[m];
        for (int x = 0; x < m; ++x) {
          work[x] = f[x][y];
        }
        fft(m, gms, work);
        for (int x = 0; x < m; ++x) {
          f[x][y] = work[x];
        }
      }
      long invMN = power((1L * m * n) % MO, MO - 2);
      for (int x = 0; x < m; ++x) for (int y = 0; y < n; ++y) {
        f[x][y] = (f[x][y] * invMN) % MO;
      }
      
      long ans = 0;
      for (int s : new int[]{+1, -1}) for (int t : new int[]{+1, -1}) {
        int dx = (s * C - A) & (m - 1);
        int dy = (t * D - B) & (n - 1);
        ans += s * t * f[dx][dy];
      }
      ans = (ans % MO + MO) % MO;
      System.out.println(ans);
    }
  }
  
  long power(long a, long e) {
    if (e == 0) {
      return 1 % MO;
    } else {
      long b = power(a, e / 2);
      b = (b * b) % MO;
      if (e % 2 != 0) {
        b = (b * a) % MO;
      }
      return b;
    }
  }
  
  void fft(int n, long[] gs, long[] xs) {
    for (int l = n, shift = 0; (l /= 2) >= 1; ++shift) {
      for (int i = 0; i < l; ++i) {
        for (int j = i; j < n; j += l * 2) {
          long t = (xs[j] - xs[j + l]) % MO;
          xs[j] = (xs[j] + xs[j + l]) % MO;
          xs[j + l] = (gs[i << shift] * t) % MO;
        }
      }
    }
    for (int i = 0, j = 1; j < n; ++j) {
      for (int k = n / 2; k > (i ^= k); k /= 2) {}
      if (j < i) {
        long t = xs[i];
        xs[i] = xs[j];
        xs[j] = t;
      }
    }
  }
}
0