CF263A Beautiful Matrix

    • 197通过
    • 319提交
  • 题目来源 CodeForces 263A
  • 评测方式 RemoteJudge
  • 标签
  • 难度 入门难度
  • 时空限制 2000ms / 256MB

题解

  • 提示:收藏到任务计划后,可在首页查看。
  • 体验新版界面

    最新讨论 显示

    推荐的相关题目 显示

    题意翻译

    给定一个5*5的矩阵(数字不是零就是一),问数字一距离中心(第三排第三个)的最短距离是多少。

    题目描述

    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:

    1. Swap two neighboring matrix rows, that is, rows with indexes $ i $ and $ i+1 $ for some integer $ i $ $ (1<=i&lt;5) $ .
    2. Swap two neighboring matrix columns, that is, columns with indexes $ j $ and $ j+1 $ for some integer $ j $ $ (1<=j&lt;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.

    输入输出格式

    输入格式:

    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.

    输出格式:

    Print a single integer — the minimum number of moves needed to make the matrix beautiful.

    输入输出样例

    输入样例#1: 复制
    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
    
    输出样例#1: 复制
    3
    
    输入样例#2: 复制
    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
    
    输出样例#2: 复制
    1
    
    提示
    标程仅供做题后或实在无思路时参考。
    请自觉、自律地使用该功能并请对自己的学习负责。
    如果发现恶意抄袭标程,将按照I类违反进行处理。