結果
| 問題 | No.1521 Playing Musical Chairs Alone |
| ユーザー |
 shojin_pro
|
| 提出日時 | 2021-05-28 22:17:28 |
| 言語 | Java (openjdk 23) |
| 結果 |
AC
|
| 実行時間 | 976 ms / 2,000 ms |
| コード長 | 6,190 bytes |
| コンパイル時間 | 4,501 ms |
| コンパイル使用メモリ | 79,972 KB |
| 実行使用メモリ | 46,812 KB |
| 最終ジャッジ日時 | 2024-11-07 09:47:16 |
| 合計ジャッジ時間 | 27,081 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge1 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 23 |
ソースコード
import java.util.*;
import java.io.*;
public class Main {
static FastScanner sc = new FastScanner(System.in);
static PrintWriter pw = new PrintWriter(System.out);
static StringBuilder sb = new StringBuilder();
static long mod = (long) 1e9 + 7;
public static void main(String[] args) throws Exception {
solve();
pw.flush();
}
public static void solve() {
int N = sc.nextInt();
int K = sc.nextInt();
int L = sc.nextInt();
Matrix matrixA = new Matrix();
for(int i = 0; i < N; i++){
for(int j = 1; j <= L; j++){
matrixA.x[i][(i+j)%N] = 1;
}
}
matrixA = powers(matrixA,K);
for(int i = 0; i < N; i++){
pw.println(matrixA.x[0][i]);
}
}
public static Matrix multiply(Matrix A, Matrix B) {
// A × B を求める
Matrix C = new Matrix();
C.sz = A.sz;
for (int i = 0; i < C.sz; i++) {
for (int j = 0; j < C.sz; j++)
C.x[i][j] = 0;
}
for (int i = 0; i < A.sz; i++) {
for (int j = 0; j < A.sz; j++) {
for (int k = 0; k < A.sz; k++) {
C.x[i][k] += A.x[i][j] * B.x[j][k];
C.x[i][k] %= mod;
}
}
}
return C;
}
public static Matrix powers(Matrix A, long T) {
// A の T 乗を求める
Matrix[] E = new Matrix[64];
Matrix F = new Matrix();
E[0] = A;
for (int i = 1; i < 62; i++) {
E[i] = multiply(E[i - 1], E[i - 1]);
}
F.sz = E[0].sz;
for (int i = 0; i < F.sz; i++) {
for (int j = 0; j < F.sz; j++) {
if (i == j)
F.x[i][j] = 1;
if (i != j)
F.x[i][j] = 0;
}
}
for (int i = 62; i >= 0; i--) {
if ((T >> i) % 2 != 0) {
F = multiply(F, E[i]);
}
}
return F;
}
static int MAX_N = 100;
static class Matrix {
int sz = MAX_N;
long[][] x;
public Matrix() {
x = new long[MAX_N][MAX_N];
}
}
static class GeekInteger {
public static void save_sort(int[] array) {
shuffle(array);
Arrays.sort(array);
}
public static int[] shuffle(int[] array) {
int n = array.length;
Random random = new Random();
for (int i = 0, j; i < n; i++) {
j = i + random.nextInt(n - i);
int randomElement = array[j];
array[j] = array[i];
array[i] = randomElement;
}
return array;
}
public static void save_sort(long[] array) {
shuffle(array);
Arrays.sort(array);
}
public static long[] shuffle(long[] array) {
int n = array.length;
Random random = new Random();
for (int i = 0, j; i < n; i++) {
j = i + random.nextInt(n - i);
long randomElement = array[j];
array[j] = array[i];
array[i] = randomElement;
}
return array;
}
}
}
class Combination {
final static long mod = (long) 1e9 + 7;
private static long[] fact, ifact;
public Combination(int n) {
fact = new long[n + 1];
ifact = new long[n + 1];
fact[0] = 1;
long ln = n;
for (long i = 1; i <= ln; ++i) {
int ii = (int) i;
fact[ii] = fact[ii - 1] % mod * i % mod;
}
ifact[n] = pow(fact[n], this.mod - 2);
for (int i = n; i >= 1; --i) {
int ii = (int) i;
ifact[ii - 1] = ifact[ii] % mod * i % mod;
}
}
public static long comb(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] % mod * ifact[k] % mod * ifact[n - k] % mod;
}
public static long perm(int n, int k) {
return comb(n, k) * fact[k] % mod;
}
public static long pow(long a, long b) {
long ret = 1;
long tmp = a;
while (b > 0) {
if ((b & 1) == 1) {
ret = (ret * tmp) % mod;
}
tmp = (tmp * tmp) % mod;
b = b >> 1;
}
return ret;
}
}
class FastScanner {
private BufferedReader reader = null;
private StringTokenizer tokenizer = null;
public FastScanner(InputStream in) {
reader = new BufferedReader(new InputStreamReader(in));
tokenizer = null;
}
public FastScanner(FileReader in) {
reader = new BufferedReader(in);
tokenizer = null;
}
public String next() {
if (tokenizer == null || !tokenizer.hasMoreTokens()) {
try {
tokenizer = new StringTokenizer(reader.readLine());
} catch (IOException e) {
throw new RuntimeException(e);
}
}
return tokenizer.nextToken();
}
public String nextLine() {
if (tokenizer == null || !tokenizer.hasMoreTokens()) {
try {
return reader.readLine();
} catch (IOException e) {
throw new RuntimeException(e);
}
}
return tokenizer.nextToken("\n");
}
public long nextLong() {
return Long.parseLong(next());
}
public int nextInt() {
return Integer.parseInt(next());
}
public double nextDouble() {
return Double.parseDouble(next());
}
public String[] nextArray(int n) {
String[] a = new String[n];
for (int i = 0; i < n; i++)
a[i] = next();
return a;
}
public int[] nextIntArray(int n) {
int[] a = new int[n];
for (int i = 0; i < n; i++)
a[i] = nextInt();
return a;
}
public long[] nextLongArray(int n) {
long[] a = new long[n];
for (int i = 0; i < n; i++)
a[i] = nextLong();
return a;
}
}