Submission #3595086

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;;
#define ll long long
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;
int a[501][501];
int h,w;
void prt(int i,int j){
    if(i%2==0){
        if(j!=w-1){
            cout << i+1 << " " << j+1 << " " << i+1 << " " << j+2 << endl;
        }else{
            cout << i+1 << " " << j+1 << " " << i+2 << " " << j+1 << endl;
        }
    }else{
        if(j!=0){
            cout << i+1 << " " << j+1 << " " << i+1 << " " << j << endl;
        }else{
            cout << i+1 << " " << j+1 << " " << i+2 << " " << j+1 << endl;
        }
    }

}
int main(){
    cin >> h >> w;
    REP(i,h){
        REP(j,w){
            cin >> a[i][j];
        }
    }
    int count = 0;
    bool moving=false;
    REP(i, h){
        REP(j,w){
            int y = (i%2) * (w-1)  + pow(-1, (i%2)) * j;
            if(moving){
                if(a[i][y]%2==1){
                    moving = false;
                    count++;
                }else{
                }
            }else{
                if(a[i][y]%2==1){
                    moving = true;
                }
            }
        }
    }
    cout << count << endl;
    moving = false;
    REP(i,h){
        REP(j,w){
            int y = (i%2) * (w-1)  + pow(-1, (i%2)) * j;
            if(moving){
                if(a[i][y]%2==0){
                    prt(i,y);
                }else{
                    moving = false;
                    count--;
                }
            }else{
                if(a[i][y]%2==1){
                    moving = 1;
                    prt(i,y);
                }
            }
            if(!count) break;
        }
        if(!count) break;
    }
    return 0;
}

Submission Info

Judge Result