結果

問題 No.578 3 x N グリッド上のサイクルのサイズ(easy)
ユーザー 37zigen
提出日時 2017-10-22 19:59:45
言語 Java
(openjdk 23)
結果
AC  
実行時間 119 ms / 2,000 ms
コード長 4,460 bytes
コンパイル時間 2,455 ms
コンパイル使用メモリ 78,532 KB
実行使用メモリ 39,624 KB
最終ジャッジ日時 2024-11-21 13:53:45
合計ジャッジ時間 7,897 ms
ジャッジサーバーID
(参考情報)
judge2 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 50
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import java.io.IOException;
import java.io.InputStream;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.NoSuchElementException;
public class Main {
public static void main(String[] args) {
// long t = System.currentTimeMillis();
new Main().run();
// System.err.println(System.currentTimeMillis() - t);
}
final long MOD = 1_000_000_000 + 7;
void run() {
Scanner sc = new Scanner();
int n = sc.nextInt();
String[] s = new String[] { "0000000000", "0034534306", "1023400005", "2032334000", "3043243450", "1003423000",
"2004332300", "1000403205", "2030000340", "0000300004" };
long[][] mat1 = new long[10][10];
long[][] mat2 = new long[10][10];
for (int i = 0; i < 10; ++i) {
for (int j = 0; j < 10; ++j) {
mat1[i][j] = (int) (s[i].charAt(j) - '0');
if (mat1[i][j] > 0)
++mat2[i][j];
}
}
++mat2[0][0];
++mat2[1][1];
long[][] x = new long[10][10];
long[][] v = new long[10][1];
v[0][0] = 1;
for (int i = 0; i <= n; ++i) {
x = add(x, mul(mul(pow(mat2, i), mat1), pow(mat2, n - i)));
}
v = mul(x, v);
System.out.println(v[1][0]);
}
long[][] pow(long[][] a, long n) {
long[][] ret = new long[a.length][a.length];
for (int i = 0; i < ret.length; ++i)
ret[i][i] = 1;
long[][] p = new long[a.length][a.length];
for (int i = 0; i < a.length; ++i) {
for (int j = 0; j < a[i].length; ++j) {
p[i][j] = a[i][j];
}
}
for (; n > 0; n >>= 1, p = mul(p, p)) {
if (n % 2 == 1)
ret = mul(ret, p);
}
return ret;
}
long[][] mul(long[][] a, long[][] b) {
long[][] ret = new long[a.length][b[0].length];
for (int i = 0; i < a.length; ++i) {
for (int j = 0; j < b[i].length; ++j) {
for (int k = 0; k < a[i].length; ++k) {
ret[i][j] = (ret[i][j] + a[i][k] * b[k][j] % MOD) % MOD;
}
}
}
return ret;
}
long[][] add(long[][] a, long[][] b) {
if (a.length != b.length || a[0].length != b[0].length)
throw new AssertionError();
long[][] ret = new long[a.length][a[0].length];
for (int i = 0; i < a.length; ++i) {
for (int j = 0; j < a[i].length; ++j) {
ret[i][j] = (a[i][j] + b[i][j]) % MOD;
}
}
return ret;
}
static void tr(Object... objects) {
System.out.println(Arrays.deepToString(objects));
}
class Scanner {
private final InputStream in = System.in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
private boolean hasNextByte() {
if (ptr < buflen) {
return true;
} else {
ptr = 0;
try {
buflen = in.read(buffer);
} catch (IOException e) {
e.printStackTrace();
}
if (buflen <= 0) {
return false;
}
}
return true;
}
private int readByte() {
if (hasNextByte())
return buffer[ptr++];
else
return -1;
}
private boolean isPrintableChar(int c) {
return 33 <= c && c <= 126;
}
private void skipUnprintable() {
while (hasNextByte() && !isPrintableChar(buffer[ptr]))
ptr++;
}
public boolean hasNext() {
skipUnprintable();
return hasNextByte();
}
public String next() {
if (!hasNext())
throw new NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while (isPrintableChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public int nextInt() {
if (!hasNext())
throw new NoSuchElementException();
int n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while (true) {
if ('0' <= b && b <= '9') {
n *= 10;
n += b - '0';
} else if (b == -1 || !isPrintableChar(b)) {
return minus ? -n : n;
} else {
throw new NumberFormatException();
}
b = readByte();
}
}
public long nextLong() {
if (!hasNext())
throw new NoSuchElementException();
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while (true) {
if ('0' <= b && b <= '9') {
n *= 10;
n += b - '0';
} else if (b == -1 || !isPrintableChar(b)) {
return minus ? -n : n;
} else {
throw new NumberFormatException();
}
b = readByte();
}
}
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0