POJ3213(矩阵乘法)

PM³

Time Limit: 5000MS		Memory Limit: 131072K
Total Submissions: 3036		Accepted: 1059

Description

USTC has recently developed the Parallel Matrix Multiplication Machine – PM³, which is used for very large matrix multiplication.

Given two matrices A and B, where A is an N × P matrix and B is a P × M matrix, PM³ can compute matrix C = AB in O(P(N + P + M)) time. However the developers of PM³ soon discovered a small problem: there is a small chance that PM³ makes a mistake, and whenever a mistake occurs, the resultant matrix C will contain exactly one incorrect element.

The developers come up with a natural remedy. After PM³ gives the matrix C, they check and correct it. They think it is a simple task, because there will be at most one incorrect element.

So you are to write a program to check and correct the result computed by PM³.

Input

The first line of the input three integers N, P and M (0 < N, P, M ≤ 1,000), which indicate the dimensions of A and B. Then follow N lines with P integers each, giving the elements of A in row-major order. After that the elements of B and C are given in the same manner.

Elements of A and B are bounded by 1,000 in absolute values which those of C are bounded by 2,000,000,000.

Output

If C contains no incorrect element, print “Yes”. Otherwise print “No” followed by two more lines, with two integers r and c on the first one, and another integer v on the second one, which indicates the element of C at row r, column c should be corrected to v.

Sample Input

2 3 2
1 2 -1
3 -1 0
-1 0
0 2
1 3
-2 -1
-3 -2

Sample Output

No
1 2
1

Hint

The test set contains large-size input. Iostream objects in C++ or Scanner in Java might lead to efficiency problems.

Source

POJ Monthly--2007.04.01, zhucheng

题目意思是。给出A,B,C三个矩阵，C为给出的A*B结果，可是可能会有错，而错最多是一个。

用立方算法必跪无疑。

用的是奇技淫巧啊。

对于注意到C的第i行行和，等于sum(A[i]*B[i]行行和)

逐行去比較，出错的必定在i行。

之后再逐个去比較，推断出出错列，就OK拉。

受教了。

#include <iostream>
#include <cstdio>
using namespace std;
#define N 1001
int a[N][N],b[N][N],c[N][N];
int c_col[N],b_col[N];
int main()
{
    int n,m,p,i,j,k;

    while(scanf("%d%d%d",&n,&m,&p)!=EOF){
            for( i=0;i<n;i++){
                for( j=0;j<m;j++){
                        scanf("%d",&a[i][j]);

                }
            }
            for( i=0;i<m;i++){
                for( j=0;j<p;j++){
                    scanf("%d",&b[i][j]);
                }
            }
            for( i=0;i<n;i++){
                for( j=0;j<p;j++){
                    scanf("%d",&c[i][j]);
                }
            }
            for(i=0;i<m;i++){
                b_col[i]=0;
                for(j=0;j<p;j++){
                    b_col[i]+=b[i][j];
                }
            }
            for(i=0;i<n;i++){
                c_col[i]=0;
                for(j=0;j<p;j++){
                    c_col[i]+=c[i][j];
                }
            }
            for(i=0;i<n;i++){
                    int tmp=0;
                for(j=0;j<m;j++){
                    tmp+=a[i][j]*b_col[j];
                }
                if(tmp!=c_col[i]){
                    break;
                }
            }
            if(i==n){
                cout<<"Yes"<<endl;
            }else{
                cout<<"No"<<endl;
                //i line is wrong
                for(j=0;j<p;j++){
                   int res=0;
                   for(k=0;k<m;k++){
                        res+=a[i][k]*b[k][j];
                   }
                   if(res!=c[i][j]){
                       cout<<i+1<<" "<<j+1<<endl;
                       cout<<res<<endl;
                       break;
                   }
                }

            }


    }
    return 0;
}

版权声明：本文博客原创文章，博客，未经同意，不得转载。