結果

問題 No.1073 無限すごろく
ユーザー OlandOland
提出日時 2020-06-05 22:14:42
言語 Java21
(openjdk 21)
結果
AC  
実行時間 59 ms / 2,000 ms
コード長 8,723 bytes
コンパイル時間 2,425 ms
コンパイル使用メモリ 79,536 KB
実行使用メモリ 52,376 KB
最終ジャッジ日時 2024-12-17 15:49:27
合計ジャッジ時間 5,412 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 56 ms
50,488 KB
testcase_01 AC 57 ms
50,596 KB
testcase_02 AC 57 ms
50,504 KB
testcase_03 AC 57 ms
50,472 KB
testcase_04 AC 56 ms
50,160 KB
testcase_05 AC 57 ms
52,376 KB
testcase_06 AC 57 ms
50,604 KB
testcase_07 AC 58 ms
50,276 KB
testcase_08 AC 56 ms
50,156 KB
testcase_09 AC 57 ms
50,608 KB
testcase_10 AC 56 ms
50,680 KB
testcase_11 AC 56 ms
50,620 KB
testcase_12 AC 57 ms
50,440 KB
testcase_13 AC 59 ms
50,644 KB
testcase_14 AC 57 ms
50,652 KB
testcase_15 AC 58 ms
50,536 KB
testcase_16 AC 56 ms
50,424 KB
testcase_17 AC 59 ms
50,520 KB
testcase_18 AC 57 ms
50,700 KB
testcase_19 AC 57 ms
50,428 KB
testcase_20 AC 57 ms
50,632 KB
testcase_21 AC 57 ms
50,604 KB
testcase_22 AC 58 ms
50,384 KB
testcase_23 AC 57 ms
50,572 KB
testcase_24 AC 59 ms
50,544 KB
testcase_25 AC 59 ms
50,560 KB
testcase_26 AC 59 ms
50,444 KB
testcase_27 AC 58 ms
50,500 KB
testcase_28 AC 58 ms
50,160 KB
testcase_29 AC 59 ms
50,484 KB
testcase_30 AC 57 ms
50,248 KB
testcase_31 AC 58 ms
50,556 KB
testcase_32 AC 58 ms
50,552 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.math.BigDecimal;
import java.util.*;

@SuppressWarnings("unused")
public class Main {
    FastScanner in;
    PrintWriter out;
    final static int MOD = (int)1e9+7;
    
    void solve(){
        long N = in.nextLong();
        long m = 166666668;
        long[] a = {0, 0, 0, 0, 0, 1};
        long[][] b = {{0, 1, 0, 0, 0, 0},
                      {0, 0, 1, 0, 0, 0},
                      {0, 0, 0, 1, 0, 0},
                      {0, 0, 0, 0, 1, 0},
                      {0, 0, 0, 0, 0, 1},
                      {m, m, m, m, m, m}};
        a = multiplyMatrix(powMatrix(b, N), a);
        out.println(a[5]);
    }
    
    public long[][] powMatrix(long[][] a, long n){
        if(n == 0){
            int size = a.length;
            long[][] e = new long[size][size];
            for(int i = 0; i < size; i++){
                for(int j = 0; j < size; j++){
                    if(i == j)
                        e[i][j] = 1;
                    else
                        e[i][j] = 0;
                }
            }
            return e;
        }
        
        if(n % 2 == 0){
            return powMatrix(multiplyMatrix(a, a), n / 2);
        }else{
            return multiplyMatrix(a, powMatrix(multiplyMatrix(a, a), (n - 1) / 2));
        }
    }
    
    public long[] multiplyMatrix(long[][] a, long[] x){
        int size = a.length;
        long[] y = new long[size];
        for(int i = 0; i < size; i++){
            for(int j = 0; j < size; j++){
                y[i] = ((y[i] + (a[i][j] * x[j]) % MOD) % MOD);
            }
        }
        return y;
    }
    
    public long[][] multiplyMatrix(long[][] a, long[][] b){
        int size = a.length;
        long[][] c = new long[size][size];
        for(int i = 0; i < size; i++){
            for(int j = 0; j < size; j++){
                for(int k = 0; k < size; k++){
                    c[i][j] = ((c[i][j] + (a[i][k] * b[k][j]) % MOD) % MOD);
                }
            }
        }
        return c;
    }
    
    public void printMatrix(long[] a){
        int size = a.length;
        for(int j = 0; j < size; j++){
            System.out.println(a[j]);
        }
    }
    
    public void printMatrix(long[][] a){
        int size = a.length;
        for(int i = 0; i < size; i++){
            for(int j = 0; j < size; j++){
                System.out.print(a[i][j]);
                if(j == size-1)
                    System.out.println();
                else
                    System.out.print(" ");
            }
        }
    }
    
    public static void main(String[] args) {
        new Main().m();
    }
    
    private void m() {
        in = new FastScanner(System.in);
        out = new PrintWriter(System.out);
        /*
        try {
            String path = "input.txt";
            out = new PrintWriter(new BufferedWriter(new FileWriter(new File(path))));
        }catch (IOException e){
            e.printStackTrace();
        }
        */
        solve();
        out.flush();
        in.close();
        out.close();
    }
    
    static class FastScanner {
        private Reader input;
        
        public FastScanner() {this(System.in);}
        public FastScanner(InputStream stream) {this.input = new BufferedReader(new InputStreamReader(stream));}
        public void close() {
            try {
                this.input.close();
            } catch (IOException e) {
                e.printStackTrace();
            }
        }
        
        public int nextInt() {
            long nl = nextLong();
            if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
            return (int) nl;
        }
        
        public long nextLong() {
            try {
                int sign = 1;
                int b = input.read();
                while ((b < '0' || '9' < b) && b != '-' && b != '+') {
                    b = input.read();
                }
                if (b == '-') {
                    sign = -1;
                    b = input.read();
                } else if (b == '+') {
                    b = input.read();
                }
                long ret = b - '0';
                while (true) {
                    b = input.read();
                    if (b < '0' || '9' < b) return ret * sign;
                    ret *= 10;
                    ret += b - '0';
                }
            } catch (IOException e) {
                e.printStackTrace();
                return -1;
            }
        }
        
        public double nextDouble() {
            try {
                double sign = 1;
                int b = input.read();
                while ((b < '0' || '9' < b) && b != '-' && b != '+') {
                    b = input.read();
                }
                if (b == '-') {
                    sign = -1;
                    b = input.read();
                } else if (b == '+') {
                    b = input.read();
                }
                double ret = b - '0';
                while (true) {
                    b = input.read();
                    if (b < '0' || '9' < b) break;
                    ret *= 10;
                    ret += b - '0';
                }
                if (b != '.') return sign * ret;
                double div = 1;
                b = input.read();
                while ('0' <= b && b <= '9') {
                    ret *= 10;
                    ret += b - '0';
                    div *= 10;
                    b = input.read();
                }
                return sign * ret / div;
            } catch (IOException e) {
                e.printStackTrace();
                return Double.NaN;
            }
        }
        
        public char nextChar() {
            try {
                int b = input.read();
                while (Character.isWhitespace(b)) {
                    b = input.read();
                }
                return (char) b;
            } catch (IOException e) {
                e.printStackTrace();
                return 0;
            }
        }
        
        public String nextStr() {
            try {
                StringBuilder sb = new StringBuilder();
                int b = input.read();
                while (Character.isWhitespace(b)) {
                    b = input.read();
                }
                while (b != -1 && !Character.isWhitespace(b)) {
                    sb.append((char) b);
                    b = input.read();
                }
                return sb.toString();
            } catch (IOException e) {
                e.printStackTrace();
                return "";
            }
        }
        
        public String nextLine() {
            try {
                StringBuilder sb = new StringBuilder();
                int b = input.read();
                while (b != -1 && b != '\n') {
                    sb.append((char) b);
                    b = input.read();
                }
                return sb.toString();
            } catch (IOException e) {
                e.printStackTrace();
                return "";
            }
        }
        
        public int[] nextIntArray(int n) {
            int[] res = new int[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextInt();
            }
            return res;
        }
        
        public int[] nextIntArrayDec(int n) {
            int[] res = new int[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextInt() - 1;
            }
            return res;
        }
        
        public int[] nextIntArray1Index(int n) {
            int[] res = new int[n + 1];
            for (int i = 0; i < n; i++) {
                res[i + 1] = nextInt();
            }
            return res;
        }
        
        public long[] nextLongArray(int n) {
            long[] res = new long[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextLong();
            }
            return res;
        }
        
        public long[] nextLongArrayDec(int n) {
            long[] res = new long[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextLong() - 1;
            }
            return res;
        }
        
        public long[] nextLongArray1Index(int n) {
            long[] res = new long[n + 1];
            for (int i = 0; i < n; i++) {
                res[i + 1] = nextLong();
            }
            return res;
        }
        
        public double[] nextDoubleArray(int n) {
            double[] res = new double[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextDouble();
            }
            return res;
        }
    }
}
0