Submission #3775546

---

Source Code Expand

#include<bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define int long long
#define vec(a,n) vector<int> (a)((n))
#define Vec(a,n) vector<string> (a)((n))
#define P pair<int,int>
#define PQ(n) priority_queue<P,vector<P>,greater<P>> (n)
#define pq(n) priority_queue<int> (n)
using namespace std;

void got(int a,int b,int c,int d){
    int e = c-a;
    int f = d-b;
    if(e<0){
        REP(i,-1*e){
            cout << a-i << " " << b << " " << a-i-1 << " " << b << endl;
        }
    }
    else if(e==0){}
    else{
        REP(i,e){
            cout << a+i << " " << b << " " << a+i+1 << " " << b << endl;
        }
    }
    if(f<0){
        REP(i,-1*f){
            cout << c << " " << b-i << " " << c << " " << b-i-1 << endl;
        }
    }
    else if(f==0){}
    else{
        REP(i,f){
            cout << c << " " << b+i << " " << c << " " << b+i+1 << endl;
        }
    }
}

signed main(){
    int h,w;
    cin >> h >> w;
    vector<int> hi,we;
    FOR(i,1,h+1){
        FOR(j,1,w+1){
            int t;
            cin >> t;
            if(t%2 == 1){
                hi.push_back(i);
                we.push_back(j);
            }
        }
    }
    int n = hi.size();
    n /=2;
    int ans=0;
    REP(i,n){
        ans += abs(hi[2*i]-hi[2*i+1])+abs(we[2*i]-we[2*i+1]);
    }
    cout << ans << endl;
    REP(i,n){
        int a=hi[2*i];
        int b=we[2*i];
        int c=hi[2*i+1];
        int d=we[2*i+1];
        got(a,b,c,d);
    }

    return 0;
}

Submission Info

Judge Result