文章目录
一、Beautiful Matrix
总结
一、Beautiful Matrix
本题链接：Beautiful Matrix
题目：
A. Beautiful Matrix
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
You’ve got a 5 × 5 matrix, consisting of 24 zeroes and a single number one. Let’s index the matrix rows by numbers from 1 to 5 from top to bottom, let’s index the matrix columns by numbers from 1 to 5 from left to right. In one move, you are allowed to apply one of the two following transformations to the matrix:
Swap two neighboring matrix rows, that is, rows with indexes i and i + 1 for some integer i (1 ≤ i < 5).
Swap two neighboring matrix columns, that is, columns with indexes j and j + 1 for some integer j (1 ≤ j < 5).
You think that a matrix looks beautiful, if the single number one of the matrix is located in its middle (in the cell that is on the intersection of the third row and the third column). Count the minimum number of moves needed to make the matrix beautiful.
Input
The input consists of five lines, each line contains five integers: the j-th integer in the i-th line of the input represents the element of the matrix that is located on the intersection of the i-th row and the j-th column. It is guaranteed that the matrix consists of 24 zeroes and a single number one.
Output
Print a single integer — the minimum number of moves needed to make the matrix beautiful.
Examples
input
0 0 0 0 0
0 0 0 0 1
0 0 0 0 0
0 0 0 0 0
0 0 0 0 0
output
3
input
0 0 0 0 0
0 0 0 0 0
0 1 0 0 0
0 0 0 0 0
0 0 0 0 0
output
1
本博客给出本题截图：
题意：给一个初始的图，每次只能交换相邻的行和列，要求最少通过几次能把数字1交换到图的中央，其实就是去求一下1到图中点的曼哈顿距离。
AC代码
#include <iostream> #include <algorithm> using namespace std; const int N = 10; int a[N][N]; int x, y; int main() { for (int i = 0; i < 5; i ++ ) for (int j = 0; j < 5; j ++ ) { cin >> a[i][j]; if (a[i][j]) { x = i; y = j; } } cout << abs(x - 2) + abs(y - 2) << endl; return 0; }
总结
zeroes 零
index 索引
matrix 模板
row 行
column 列
apply 申请
transformation 变换
integer 整数
水题，不解释
