problem-sulving/CodeForces-1207B.cpp at main · sweetpotatoX/problem-sulving · GitHub

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
//
// Created by abdob on 10/29/2022.
//

#include<bits/stdc++.h>
#include<stdio.h>
using namespace std;


#define ll                  long long
#define scl(n)              scanf("%lld", &n)
#define fr(i,n)             for (ll i=0;i<n;i++)
#define fr1(i,n)            for(ll i=1;i<=n;i++)
#define pfl(x)              printf("%lld\n",x)
#define endl 	            "\n"
#define pb                  push_back
#define l(s)                s.size()
#define asort(a)            sort(a,a+n)
#define dsort(a)            sort(a,a+n,greater<int>())
#define vasort(v)           sort(v.begin(), v.end());
#define vdsort(v)           sort(v.begin(), v.end(),greater<int>());
#define pn                  printf("\n")
#define md                  10000007
#define inf                 1<<28
#define debug               printf("I am here\n")
#define ps                  printf(" ")
#define mem(a,i)            memset(a, i, sizeof(a))
#define tcas(i,t)           for(ll i=1;i<=t;i++)
#define pcas(i)             printf("Case %lld: ",i)
//ll x[10]= {0,-1,-1,1,1,-2,-2,2,2};
//ll y[10]= {0,-2,2,-2,2,-1,1,-1,1};

//   ios_base::sync_with_stdio(0);
//    cin.tie(0);

// sscanf(c, "%s %s", s,s1); // take string buffer  and then distribute all value , here take 2 value and distribute
///cin.ignore(); // Need when we take input as a string line before  getline(cin,s)
//ll bigmod(ll b, ll p, ll md){if(p==0) return 1;if(p%2==1){ return ((b%md)*bigmod(b,p-1,md))%md;} else {ll y=bigmod(b,p/2,md);return (y*y)%md;}}
//ll find_all_divisor(ll n){  fr1(i,sqrt(n)){     ll i,x;  if(n % i == 0)  { x = n / i; v.pb(i);  if(i != x) v.pb(x);}}}

#define N 100006

int main()
{

    ll m,n,t,c,d,i,j,k,x,y,z,l,q,r;

    ll cnt=0,ans=0;
    cin>>n>>m;
    ll a[n][m],b[n][m];
    fr(i,n)fr(j,m)cin>>a[i][j];
    fr(i,n)fr(j,m)b[i][j]=0;

    vector<ll>v,v1;

    fr(i,n)fr(j,m)
        {
            //cout<<a[i][j]<<" "<<a[i][j+1]<<" "<<a[i+1][j]<<" "<<a[i+1][j+1]<<endl;
            if(i+1<n and j+1<m and  a[i][j]==1 and a[i][j+1]==1  and a[i+1][j]==1 and a[i+1][j+1]==1)
            {
                v.pb(i+1), v1.pb(j+1);
                b[i][j]=1, b[i][j+1]=1, b[i+1][j]=1, b[i+1][j+1]=1  ;
            }
        }


    fr(i,n)
    {
        fr(j,m)
        {
            if(i+1<n and j+1<m and (a[i][j]!= b[i][j]  or  a[i+1][j]!= b[i+1][j] or  a[i][j+1]!= b[i][j+1] or  a[i+1][j+1]!= b[i+1][j+1] ) )
            {  cnt=1;break;}
        }
    }

    if(cnt)cout<<-1<<endl;
    else
    {
        cout<<v.size()<<endl;
        fr(i,v.size())cout<<v[i]<<" "<<v1[i]<<endl;
    }


    return 0;
}