蓝桥杯 P8519 小飞养细菌（Java版)

解题思路

• 先暂时不考虑放入，后续再考虑
• a1表示A，a2表示B, a3 表示C, a4 表示 D
• 设置当前状态为a1,a2,a3,a4
• 则下一天的状态为a3 + a4, a1 + a4, a1 + 2 * a2 + a4, a3
• 那么就可以得出转移矩阵M为
• 0 1 1 0
• 0 0 2 0
• 1 0 0 1
• 1 1 1 0
• 设置 A = {1, 1 1, 1}
• 那么第一天放的细菌，第k天的时候状态就是 $A\times M^{k-1}$
• 这下我们就知道第一天放的细菌数量了
• 那第二天放的呢， 同理是不是就得出状态是 $A\times M^{k-2}$
• 同理第 $2^l$ 天放的呢，是不是就是 $A\times M^{k-2^l}$
• 那第k天所有的细菌也就是第一天放+第二天放的+… + 第$2^l$ 天放的
• 思路给出来了，如果没有学过矩阵快速幂，先去温习一下，代码具体就自己写了
• （本人蒻蓟，勿喷）
• java代码如下

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;

/**
 * @Author congege
 * @Description
 * @Date Created in 2024/2/10-18:17
 * https://www.lanqiao.cn/problems/8519/learning/?page=1&first_category_id=1
 */
public class Main {
    static FastReader sc = new FastReader();
    static PrintWriter out = new PrintWriter(System.out);
    static long P = (int) 1e9 + 7;
    static long[][] a;
    static long k;

    public static void main(String[] args) {
        k = sc.nextLong();
        long[][] res = new long[4][4];
        long day;
        for (day = 1; day <= k; day *= 2) {
            init();
            res = add(res, qkm(k - day));
        }

        for (int i = 0; i < 4; i++) {
            long sum = 0;
            for (int j = 0; j < 4; j++) {
                sum = (sum + res[j][i]) % P;
            }
            out.print(sum);
            out.print(' ');
        }
        out.flush();
    }

    static void init() {
        a = new long[][]{
                {0, 1, 1, 0},
                {0, 0, 2, 0},
                {1, 0, 0, 1},
                {1, 1, 1, 0}};
    }


    static long[][] qkm(long k) {
        long[][] res = getE();

        while (k > 0) {
            if ((k & 1) == 1) res = mul(res, a);
            a = mul(a, a);
            k >>= 1;
        }

        return res;
    }

    static long[][] getE() {
        long[][] E = new long[4][4];
        for (int i = 0; i < 4; i++) {
            E[i][i] = 1;
        }
        return E;
    }

    static long[][] mul(long[][] a1, long[][] a2) {
        long[][] res = new long[4][4];
        for (int i = 0; i < 4; i++) {
            for (int j = 0; j < 4; j++) {
                for (int k = 0; k < 4; k++) {
                    res[i][j] = (res[i][j] + a1[i][k] * a2[k][j]) % P;
                }
            }
        }
        return res;
    }

    static long[][] add(long[][] a1, long[][] a2) {
        long[][] res = new long[4][4];
        for (int i = 0; i < 4; i++) {
            for (int j = 0; j < 4; j++) {
                res[i][j] = (a1[i][j] + a2[i][j]) % P;
            }
        }
        return res;
    }
}

class FastReader {
    StringTokenizer st;
    BufferedReader br;

    FastReader() {
        br = new BufferedReader(new InputStreamReader(System.in));
    }

    String next() {
        while (st == null || !st.hasMoreElements()) {
            try {
                st = new StringTokenizer(br.readLine());
            } catch (IOException e) {
                e.printStackTrace();
            }
        }
        return st.nextToken();
    }

    int nextInt() {
        return Integer.parseInt(next());
    }

    double nextDouble() {
        return Double.parseDouble(next());
    }

    String nextLine() {
        String s = "";
        try {
            s = br.readLine();
        } catch (IOException e) {
            e.printStackTrace();
        }
        return s;
    }

    long nextLong() {
        return Long.parseLong(next());
    }

    boolean hasNext() {
        while (st == null || !st.hasMoreElements()) {
            String s = nextLine();
            if (s == null) {
                return false;
            }
            st = new StringTokenizer(s);
        }

        return true;
    }
}