poj 3213 叉姐的魔法训练

最新推荐文章于 2017-05-06 22:52:38 发布

「已注销」

最新推荐文章于 2017-05-06 22:52:38 发布

阅读量705

点赞数

本文链接：https://blog.csdn.net/Summer__show_/article/details/70232244

版权

acm 专栏收录该内容

310 篇文章 1 订阅

订阅专栏

PM³

Time Limit: 5000MS		Memory Limit: 131072K
Total Submissions: 3400		Accepted: 1193

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

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.

题意：

给出两个矩阵，和他们相乘的答案矩阵；

这个计算过程中至多只有一个错误，问这个错误在哪并且求出正解，如果没有错误就输出yes

题解：

利用举证计算公式，发现规律，先计算行，判断错误在哪一行出现

然后在这一行进行枚举找到最终错误

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;

#define MAXN 1010
int a[MAXN][MAXN];
int b[MAXN][MAXN];
int c[MAXN][MAXN];
int sum1[MAXN],sum2[MAXN];

int main()
{
    int n,p,m;
    //freopen("in.txt","r",stdin);
    while(scanf("%d%d%d",&n,&p,&m)!=EOF)
    {
        for(int i=1;i<=n;i++)
            for(int j=1;j<=p;j++)
            scanf("%d",&a[i][j]);

        for(int i=1;i<=p;i++){
            sum1[i]=0;
            for(int j=1;j<=m;j++)
            scanf("%d",&b[i][j]),sum1[i]+=b[i][j];
        }
        for(int i=1;i<=n;i++){
            sum2[i]=0;
            for(int j=1;j<=m;j++)
            scanf("%d",&c[i][j]),sum2[i]+=c[i][j];
        }

        int temp,row=0;
        for(int i=1;i<=n;i++){
            temp=0;
            for(int j=1;j<=p;j++)
                temp+=a[i][j]*sum1[j];
            if(temp!=sum2[i])
                row=i;
        }
        if(!row){
            puts("Yes");
            continue;
        }

        int col=0;
        for(int i=1;i<=m;i++){
            temp=0;
            for(int j=1;j<=p;j++)
                temp+=a[row][j]*b[j][i];
            if(temp!=c[row][i]){
                col=i;
                goto kkk;
            }
        }
        kkk:puts("No");
        printf("%d %d\n",row,col);
        printf("%d\n",temp);
    }
    return 0;
}