1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pll;
typedef pair<int,int> pii;
typedef array<int,4> arr;
const ll MAXN=110;
ll N,T;
bool vis[MAXN][MAXN];
char maze[MAXN][MAXN];
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
void solve(){
vector<arr> out;
cin>>N;
memset(vis,false,sizeof(vis));
for(int i=1;i<=N;++i) {
for(int j=1;j<=N;++j) {
cin>>maze[i][j];
}
}
for(int i=1;i<=N/2;++i) {
for(int j=1;j<=N/2;++j) {
if(maze[i][j]=='1') {vis[i][j]=true;continue;}
queue<pii> q;
q.push({i,j});
vector<vector<pii> > pa(N+1,vector<pii>(N+1,{0,0}));
pa[i][j]={i,j};
while (!q.empty()) {
int x=q.front().first,y=q.front().second;
q.pop();
for(int k=0;k<=3;++k) {
int u=x+dx[k],v=y+dy[k];
if(u<1||u>N) continue;
if(v<1||v>N) continue;
if(vis[u][v]) continue;
if(pa[u][v].first!=0) continue;
pa[u][v]={x,y};
q.push({u,v});
if(maze[u][v]=='1') {
int o=u,p=v;
while (pa[o][p].first!=o || pa[o][p].second!=p) {
swap(maze[o][p],maze[pa[o][p].first][pa[o][p].second]);
out.push_back({o,p,pa[o][p].first,pa[o][p].second});
tie(o,p)=pa[o][p];
}
goto outer;
}
}
}
outer:
vis[i][j]=true;
}
}
cout<<out.size()<<'\n';
for(int i=0;i<out.size();++i) {
cout<<out[i][0]<<' '<<out[i][1]<<' '<<out[i][2]<<' '<<out[i][3]<<'\n';
}
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
cin>>T;
while (T--) {
solve();
}
return 0;
}
|
