結果
問題 | No.1521 Playing Musical Chairs Alone |
ユーザー |
![]() |
提出日時 | 2024-07-23 11:33:24 |
言語 | Java (openjdk 23) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,377 bytes |
コンパイル時間 | 2,625 ms |
コンパイル使用メモリ | 90,548 KB |
実行使用メモリ | 56,152 KB |
最終ジャッジ日時 | 2024-07-23 11:33:33 |
合計ジャッジ時間 | 7,912 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 8 WA * 15 |
ソースコード
import java.io.*;import java.util.*;import java.util.function.*;import java.util.stream.*;public class Main {static final int MOD =1000000007;public static void main(String[] args) throws Exception {Scanner sc = new Scanner();int n = sc.nextInt();int k = sc.nextInt();int m = sc.nextInt();long[][][] matrix = new long[20][n][n];for (int i = 0; i < n; i++) {for (int j = 1; j <= m; j++) {matrix[0][i][(i + j) % n]++;}}for (int i = 1; i < 20; i++) {for (int a = 0; a < n; a++) {for (int b = 0; b < n; b++) {for (int c = 0; c < n; c++) {matrix[i][a][c] += matrix[i - 1][a][b] * matrix[i - 1][b][c] % MOD;matrix[i][a][c] %= MOD;}}}}long[] ans = new long[n];ans[0] = 1;for (int i = 19; i >= 0; i--) {if (k < (1 << i)) {continue;}k -= (1 << i);long[] next = new long[n];for (int a = 0; a < n; a++) {for (int b = 0; b < n; b++) {next[a] += matrix[i][a][b] * ans[b] % MOD;next[a] %= MOD;}}ans = next;}System.out.println(Arrays.stream(ans).mapToObj(String::valueOf).collect(Collectors.joining("\n")));}}class Scanner {BufferedReader br;StringTokenizer st = new StringTokenizer("");StringBuilder sb = new StringBuilder();public Scanner() {try {br = new BufferedReader(new InputStreamReader(System.in));} catch (Exception e) {}}public int nextInt() {return Integer.parseInt(next());}public long nextLong() {return Long.parseLong(next());}public double nextDouble() {return Double.parseDouble(next());}public String next() {try {while (!st.hasMoreTokens()) {st = new StringTokenizer(br.readLine());}} catch (Exception e) {e.printStackTrace();} finally {return st.nextToken();}}}