Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 19476 | Accepted: 4166 |
Description
You are given three n × n matrices A, B and C. Does the equation A × B = C hold true?
Input
The first line of input contains a positive integer n (n ≤ 500) followed by the the three matrices A, B and C respectively. Each matrix's description is a block of n × n integers.
It guarantees that the elements of A and B are less than 100 in absolute value and elements of C are less than 10,000,000 in absolute value.
Output
Output "YES" if the equation holds true, otherwise "NO".
Sample Input
2 1 0 2 3 5 1 0 8 5 1 10 26
Sample Output
YES
Hint
Multiple inputs will be tested. So O(n3) algorithm will get TLE.
题意:给你一个n*n的矩阵 a,b,c 判断 a*b是否等于c。
O(n^3)超时。第一次学随机,随机给出一个行和列,验证正确性,只要有一个不满足则输出no。
#include<stdio.h>
#include<algorithm>
#include<string.h>
#include<time.h>
using namespace std;
const int maxm = 505;
int a[maxm][maxm], b[maxm][maxm], c[maxm][maxm], n;
bool check()
{
int R, C, sum;
for (int i = 1;i <= 30000;i++)
{
R = rand() % n + 1;
C = rand() % n + 1;
sum = 0;
for (int j = 1;j <= n;j++)
sum += a[R][j] * b[j][C];
if (sum != c[R][C]) return false;
}
return true;
}
int main()
{
int i, j, k, sum;
scanf("%d", &n);
srand(time(NULL));
for (i = 1;i <= n;i++)
for (j = 1;j <= n;j++) scanf("%d", &a[i][j]);
for (i = 1;i <= n;i++)
for (j = 1;j <= n;j++) scanf("%d", &b[i][j]);
for (i = 1;i <= n;i++)
for (j = 1;j <= n;j++) scanf("%d", &c[i][j]);
if (check()) printf("YES\n");
else printf("NO\n");
return 0;
}