Submission #3164187

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<queue>
using namespace std;
#define REP(i, limit) for(int i=0; i< limit; ++i)
#define LINT long long

struct four{
  int xy[4];
};

int main(){
  int H, W;
  cin >> H >> W;
  int a[H][W];
  vector<four> ans;
  REP(i, H){
    REP(j, W){
      cin >> a[i][j];
    }
  }
  four work;
  int sousa=0;

  if(H==1){
    REP(j, W-1){
      if(a[0][j]%2){
        ++sousa;
        work.xy[0]=1;
        work.xy[1]=j+1;
        work.xy[2]=1;
        work.xy[3]=j+2;
        ans.push_back(work);
        --a[0][j];
        ++a[0][j+1];
      }
    }
    goto end;
  }

  if(W==1){
    REP(i, H){
      if(a[i][0]%2){
        ++sousa;
        work.xy[0]=i+1;
        work.xy[1]=1;
        work.xy[2]=i+2;
        work.xy[3]=1;
        ans.push_back(work);
        --a[i][0];
        ++a[i+1][0];
      }
    }
    goto end;
  }

  REP(i, H){
    REP(j, W-1){
      if(a[i][j]%2){
        ++sousa;
        work.xy[0]=i+1;
        work.xy[1]=j+1;
        work.xy[2]=i+1;
        work.xy[3]=j+2;
        ans.push_back(work);
        --a[i][j];
        ++a[i][j+1];
      }
    }
  }
  REP(i, H-1){
    int j = W-1;
      if(a[i][j]%2){
        ++sousa;
        work.xy[0]=i+1;
        work.xy[1]=j+1;
        work.xy[2]=i+2;
        work.xy[3]=j+1;
        ans.push_back(work);
        --a[i][j];
        ++a[i+1][j];
      }
  }

  end:
  cout << sousa << endl;
  REP(i, ans.size()){
    REP(j, 3){
      cout << ans[i].xy[j] << " ";
    }
    cout << ans[i].xy[3];
    cout << endl;
  }



  return 0;
}

Submission Info

Judge Result