首页 > 代码库 > hdu 4965 Fast Matrix Calculation

hdu 4965 Fast Matrix Calculation

2024-07-18 11:12:54   223人阅读

Fast Matrix Calculation

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 161    Accepted Submission(s): 92


Problem Description
One day, Alice and Bob felt bored again, Bob knows Alice is a girl who loves math and is just learning something about matrix, so he decided to make a crazy problem for her.

Bob has a six-faced dice which has numbers 0, 1, 2, 3, 4 and 5 on each face. At first, he will choose a number N (4 <= N <= 1000), and for N times, he keeps throwing his dice for K times (2 <=K <= 6) and writes down its number on the top face to make an N*K matrix A, in which each element is not less than 0 and not greater than 5. Then he does similar thing again with a bit difference: he keeps throwing his dice for N times and each time repeat it for K times to write down a K*N matrix B, in which each element is not less than 0 and not greater than 5. With the two matrix A and B formed, Alice’s task is to perform the following 4-step calculation.

Step 1: Calculate a new N*N matrix C = A*B.
Step 2: Calculate M = C^(N*N). 
Step 3: For each element x in M, calculate x % 6. All the remainders form a new matrix M’.
Step 4: Calculate the sum of all the elements in M’. 

Bob just made this problem for kidding but he sees Alice taking it serious, so he also wonders what the answer is. And then Bob turn to you for help because he is not good at math.
 

Input
The input contains several test cases. Each test case starts with two integer N and K, indicating the numbers N and K described above. Then N lines follow, and each line has K integers between 0 and 5, representing matrix A. Then K lines follow, and each line has N integers between 0 and 5, representing matrix B.

The end of input is indicated by N = K = 0.
 

Output
For each case, output the sum of all the elements in M’ in a line.
 

Sample Input
4 2
5 5
4 4
5 4
0 0
4 2 5 5
1 3 1 5
6 3
1 2 3
0 3 0
2 3 4
4 3 2
2 5 5
0 5 0
3 4 5 1 1 0
5 3 2 3 3 2
3 1 5 4 5 2
0 0
 

Sample Output
14
56
 

Source
2014 Multi-University Training Contest 9
 


题解及代码：



#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
int l[1010][7];
int r[7][1010];
int nt[1010][1010];
int bt[1010][1010];

struct mat
{
    int t[7][7];
    void set()
    {
        memset(t,0,sizeof(t));
    }
} a,b,c;

mat multiple(mat a,mat b,int n,int p)
{
    int i,j,k;
    mat temp;
    temp.set();
    for(i=0; i<n; i++)
        for(j=0; j<n; j++)
        {
            if(a.t[i][j]!=0)
                for(k=0; k<n; k++)
                    temp.t[i][k]=(temp.t[i][k]+a.t[i][j]*b.t[j][k]+p)%p;
        }
    return temp;
}

mat quick_mod(mat b,int n,int m,int p)
{
    mat t;
    t.set();
    for(int i=0;i<n;i++) t.t[i][i]=1;
    while(m)
    {
        if(m&1)
        {
            t=multiple(t,b,n,p);
        }
        m>>=1;
        b=multiple(b,b,n,p);
    }
    return t;
}


int main()
{
    int n,m;
    while(scanf("%d%d",&n,&m)!=EOF)
    {
        if(n==0&&m==0) break;

        for(int i=0;i<n;i++)
        {
            for(int j=0;j<m;j++)
                scanf("%d",&l[i][j]);
        }

        for(int i=0;i<m;i++)
        {
            for(int j=0;j<n;j++)
                scanf("%d",&r[i][j]);
        }

        a.set();
        for(int i=0; i<m; i++)
        for(int j=0; j<n; j++)
        {
            if(r[i][j]!=0)
                for(int k=0; k<m; k++)
                    a.t[i][k]=(a.t[i][k]+r[i][j]*l[j][k])%6;
        }
        b=quick_mod(a,m,n*n-1,6);

        /*for(int i=0;i<m;i++)
        {
            for(int j=0;j<m;j++)
                printf("%d ",b.t[i][j]);
            puts("");
        }
        puts("");*/
        //memset(nt,0,sizeof(nt));
        //memset(bt,0,sizeof(bt));
        for(int i=0;i<n;i++)
        for(int j=0;j<n;j++)
        nt[i][j]=bt[i][j]=0;

        for(int i=0; i<n; i++)
        for(int j=0; j<m; j++)
        {
            if(l[i][j]!=0)
                for(int k=0; k<m; k++)
                    nt[i][k]=(nt[i][k]+l[i][j]*b.t[j][k])%6;
        }

        for(int i=0; i<n; i++)
        for(int j=0; j<m; j++)
        {
            if(nt[i][j]!=0)
                for(int k=0; k<n; k++)
                    bt[i][k]=(bt[i][k]+nt[i][j]*r[j][k])%6;
        }

        int ans=0;
        for(int i=0;i<n;i++)
        for(int j=0;j<n;j++)
         ans+=bt[i][j];
        printf("%d\n",ans);
    }
    return 0;
}









联系
我们