CCF-CSP 矩阵运算

202305-2 矩阵运算

题目

题解

如果直接上二维数组模拟，不仅耗时长，内存也会超限，因此要考虑优化算法

根据矩阵运算的性质：n*d × d*n = n*n | d*n × n*d = d*d，题目里d的取值范围远小于n的取值范围，因此如果选择开辟一个d*d的数组很减少很大内存开销

利用矩阵乘法的性质，可以先计算Kt × V ，这样就可以用一个d*d的数组来保存计算结果，然后再与Q叉乘，最后点乘W

注意要用long的数据类型

代码

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int d = sc.nextInt();
        int[][] q = new int[n][d];
        int[][] kt = new int[d][n];
        int[][] v = new int[n][d];
        int[] w = new int[n];
        //获取用户输入
        for (int j = 0; j < n; j++) {
            for (int l = 0; l < d; l++) {
                q[j][l] = sc.nextInt();
            }
        }
        for (int j = 0; j < n; j++) {
            for (int l = 0; l < d; l++) {
                kt[l][j] = sc.nextInt();
            }
        }
        for (int j = 0; j < n; j++) {
            for (int l = 0; l < d; l++) {
                v[j][l] = sc.nextInt();
            }
        }
        for (int i = 0; i < n; i++) {
            w[i] = sc.nextInt();
        }

        long[][] temp = new long[d][d];
        for (int i = 0; i < d; i++) {
            for (int j = 0; j < d; j++) {
                for (int k = 0; k < n; k++) {
                    temp[i][j] += (long) v[k][j] * kt[i][k];
                }
            }
        }

        long[][] ans = new long[n][d];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < d; j++) {
                for (int k = 0; k < d; k++) {
                    ans[i][j] += q[i][k]*temp[k][j] ;
                }
                ans[i][j]*=w[i];
                System.out.print(ans[i][j] + " ");
            }
            System.out.println();
        }
    }
}