C. Madoka and Childish Pranks(cf构造题)

问题 - 1647C - 代码强制 (codeforces.com)

 

 每次选择要构造的 矩形的左上角的坐标和右下角的坐标，按照国际象棋的棋盘格子那样来构造当前这个01图形，如果不能构造输出-1

输入

4
4 5
01000
10100
01010
00110
2 3
001
010
3 3
110
101
000
1 1
0
 

输出

4
1 1 3 3
3 3 4 4
4 3 4 4
4 2 4 3
1
1 2 2 3
-1
0
 

#include <iostream>
#include <bits/stdc++.h>
#include <cstring>
#include <vector>
#include <unordered_map>
#include <queue>
#include <set>
#include <algorithm>
#define x first
#define y second
#define pb emplace_back
#define fu(i,a,b) for(int i=a;i<=b; ++ i)
#define fd(i,a,b) for(int i=a;i>=b;	-- i)
#define endl '\n'
#define ms(x,y) memset(x,y,sizeof x)
#define ios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
using namespace std;

typedef long long LL;
typedef unsigned long long ULL;
typedef vector<vector<LL>> VVL;
typedef vector<vector<int>> VVI;
typedef vector<LL> VL;
typedef vector<int> VI;
typedef vector<string> VS;
typedef pair<int,int> PII;
typedef vector<PII> VPII;
typedef pair<PII,int> PIII;
typedef pair<double,double> PDD;
typedef pair<double,int> PDI;
typedef pair<char,int> PCI;
typedef pair<string,int> PSI;
typedef pair<int,string> PIS;
typedef pair<int,char> PIC;
typedef pair<LL,LL> PLL;
typedef __int128 i128;
typedef unsigned long long ULL;
const int N =5e5+ 10,M = N * 2,base =400  ,INF = 0x3f3f3f3f,P = 131;
const double eps = 1e-8;
const int mod = 998244353;
const LL LNF=(LL) INF * INF;


inline void solve()
{
	int n,m;cin >> n >> m ;
	
	vector<vector<int>>a(n,vector<int>(m));
	
	fu(i,0,n-1)
	{
		string s;cin >> s;
		fu(j,0,m-1)a[i][j] = s[j] -'0';
	}
	
	vector<array<int,4>>ans;
	
	if(a[0][0] == 1 )
	{
		cout << -1 <<endl;return;
	}
	
	fd(i,n-1,0)
	fd(j,m-1,0)
	if(a[i][j])
	{
// 竖着的 2*1   (i+1,j+1) 是当前这个为1的位置 
		if(i) ans.push_back({i,j+1,i+1,j+1});
// 横着的 1*2 	
		else ans.push_back({i+1,j,i+1,j+1});
	}
	
	cout << ans.size() << endl;
	
	for(auto t:ans)
	cout << t[0] <<" " << t[1] << " " << t[2] << " "<< t[3] << endl;
	
		
			
}
signed main()
{
//  freopen("1.txt","r",stdin);
//	#define int long long 
    ios
//	cout << fixed<<setprecision(2);
    int t=1;
    cin>>t;
    int now = 1;
    while(t -- )
    {
//      cout<<"Case "; 
//      cout<<"Case #"; 
//      cout<<"Scenario #"; 
//      cout<< now ++ <<": ";
//      cout<< now ++ <<": \n";
        solve();
    }


    return 0;
}