#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 6;
char g[N][N], backup[N][N];//backup用于存储,复制原数组
int dx[5] = {-1, 0, 1, 0, 0}, dy[5] = {0, 1, 0, -1, 0};//用于方位转化
void turn(int x, int y)
{
for (int i = 0; i < 5; i ++ )
{
int a = x + dx[i], b = y + dy[i];
if (a < 0 || a >= 5 || b < 0 || b >= 5) continue; // 在边界外,直接忽略即可
g[a][b] ^= 1;//当原g[a][b]是1时 ,g[a][b]变为0;当它为0时,最后变为1 (^为异或标志)
}
}
int main()
{
int T;
cin >> T;
while (T -- )
{
for (int i = 0; i < 5; i ++ ) cin >> g[i];//一次输入一行
int res = 10;
for (int op = 0; op < 32; op ++ )//2^5 为32,所以第一行有32种情况
{
memcpy(backup, g, sizeof g);//将g复制给backup
int step = 0;
for (int i = 0; i < 5; i ++ )
if (op >> i & 1)//将op换为二进制,正好是5位。这5位为1时,进行转换(正好32种情况)
{
step ++ ;
turn(0, i);
}
for (int i = 0; i < 4; i ++ )
for (int j = 0; j < 5; j ++ )
if (g[i][j] == '0')
{
step ++ ;
turn(i + 1, j);//因为下面一行的改变可以使上面变为1,所以向下一行一行的变
}
bool dark = false;
for (int i = 0; i < 5; i ++ )//如果最后一行全为1,全部都为1(只要下面一行为1,上面一行一定为1)
if (g[4][i] == '0')
{
dark = true;
break;
}
if (!dark) res = min(res, step);//找出最少的步数,赋值给res
memcpy(g, backup, sizeof g);//将g数组还原为初始状态(与34行对应)
}
if (res > 6) res = -1;//如果超过6次,结果为-1
cout << res << endl;
}
return 0;
}
08-17
08-17
08-17
08-17