Nastya Is Transposing Matrices ( CodeForces 1136C )

最新推荐文章于 2020-10-15 14:52:51 发布

lxt_Lucia

最新推荐文章于 2020-10-15 14:52:51 发布

阅读量506

点赞数 1

CC 4.0 BY-SA版权

分类专栏： spiny 文章标签：对角线思维

本文链接：https://blog.youkuaiyun.com/lxt_Lucia/article/details/90340138

该博客讨论了如何通过无限次转置矩阵A中的子矩阵来判断能否将其变为矩阵B。关键在于，无论进行多少次转置，矩阵的反对角线上的元素集合保持不变。只要A和B的每条反对角线上元素构成的集合相同，就可能通过转置操作将A变换为B。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

一、问题：

Nastya came to her informatics lesson, and her teacher who is, by the way, a little bit famous here gave her the following task.

Two matrices A and B are given, each of them has size n×m. Nastya can perform the following operation to matrix A unlimited number of times:

take any square square submatrix of A and transpose it (i.e. the element of the submatrix which was in the i-th row and j-th column of the submatrix will be in the j-th row and i-th column after transposing, and the transposed submatrix itself will keep its place in the matrix A).

Nastya's task is to check whether it is po