結果
問題 | No.1521 Playing Musical Chairs Alone |
ユーザー | tenten |
提出日時 | 2024-01-11 10:36:58 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 256 ms / 2,000 ms |
コード長 | 2,747 bytes |
コンパイル時間 | 5,595 ms |
コンパイル使用メモリ | 94,608 KB |
実行使用メモリ | 57,708 KB |
最終ジャッジ日時 | 2024-01-11 10:37:10 |
合計ジャッジ時間 | 10,825 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 67 ms
54,868 KB |
testcase_01 | AC | 64 ms
54,880 KB |
testcase_02 | AC | 67 ms
54,780 KB |
testcase_03 | AC | 64 ms
54,852 KB |
testcase_04 | AC | 65 ms
54,668 KB |
testcase_05 | AC | 174 ms
57,584 KB |
testcase_06 | AC | 184 ms
57,596 KB |
testcase_07 | AC | 178 ms
57,596 KB |
testcase_08 | AC | 124 ms
57,708 KB |
testcase_09 | AC | 123 ms
57,464 KB |
testcase_10 | AC | 68 ms
54,736 KB |
testcase_11 | AC | 210 ms
57,596 KB |
testcase_12 | AC | 65 ms
54,764 KB |
testcase_13 | AC | 69 ms
52,888 KB |
testcase_14 | AC | 75 ms
55,256 KB |
testcase_15 | AC | 223 ms
57,600 KB |
testcase_16 | AC | 232 ms
57,588 KB |
testcase_17 | AC | 234 ms
57,596 KB |
testcase_18 | AC | 220 ms
57,596 KB |
testcase_19 | AC | 232 ms
57,596 KB |
testcase_20 | AC | 253 ms
57,584 KB |
testcase_21 | AC | 228 ms
55,644 KB |
testcase_22 | AC | 233 ms
57,584 KB |
testcase_23 | AC | 215 ms
57,596 KB |
testcase_24 | AC | 235 ms
57,584 KB |
testcase_25 | AC | 256 ms
57,596 KB |
ソースコード
import java.io.*; import java.util.*; 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 count = sc.nextInt(); int move = sc.nextInt(); long[][][] matrix = new long[20][n][n]; for (int i = 0; i < n; i++) { for (int j = 1; j <= move; j++) { matrix[0][i][(i - j + n) % n] = 1; } } 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 = 20; i >= 0; i--) { if (count < (1 << i)) { continue; } count -= (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(String.join("\n", Arrays.stream(ans).mapToObj(String::valueOf).toArray(String[]::new))); } } class Utilities { static String arrayToLineString(Object[] arr) { return Arrays.stream(arr).map(x -> x.toString()).collect(Collectors.joining("\n")); } static String arrayToLineString(int[] arr) { return String.join("\n", Arrays.stream(arr).mapToObj(String::valueOf).toArray(String[]::new)); } } class Scanner { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(""); StringBuilder sb = new StringBuilder(); public Scanner() throws Exception { } public int nextInt() throws Exception { return Integer.parseInt(next()); } public long nextLong() throws Exception { return Long.parseLong(next()); } public double nextDouble() throws Exception { return Double.parseDouble(next()); } public int[] nextIntArray() throws Exception { return Stream.of(br.readLine().split(" ")).mapToInt(Integer::parseInt).toArray(); } public String next() throws Exception { while (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } return st.nextToken(); } }