Submission #8244626

---

Source Code Expand

#include <iostream>
#include <array>

using namespace std;
typedef long long ll;
#define REP(i,n) for (ll i = 0; i < (n); ++i)

const int SIZE = 30;
const array<int, 4> dx = {1, 0, 0, -1};
const array<int, 4> dy = {0, 1, -1, 0};

array<array<int, SIZE>, SIZE> a;

int main(){
    REP(i, SIZE){
        REP(j, SIZE){
            cin >> a[i][j];
        }
    }

    while(1){
        int sx = 0, sy = 0;
        REP(i, SIZE){
            REP(j, SIZE){
                if(a[i][j] == 0){ continue; }
                bool istop = true;
                REP(k, dx.size()){
                    if(i + dx[k] < 0 || j + dx[k] >= SIZE ||
                       j + dy[k] < 0 || i + dy[k] >= SIZE){
                        continue;
                    }else if(a[i + dx[k]][j + dy[k]] > a[i][j]){
                        istop = false;
                        break;
                    }
                }
                if(istop){
                    sx = i;
                    sy = j;
                }
            }
        }
        if(a[sx][sy] == 0){
            break;
        }
        cout << sx + 1 << ' ' << sy + 1 << endl;
        a[sx][sy]--;
        while(a[sx][sy] > 0){
            bool moved = false;
            REP(k, dx.size()){
                if(sx + dx[k] < 0 || sx + dx[k] >= SIZE ||
                   sy + dy[k] < 0 || sy + dy[k] >= SIZE){
                    continue;
                }else if(a[sx + dx[k]][sy + dy[k]] == a[sx][sy]){
                    sx += dx[k];
                    sy += dy[k];
                    a[sx][sy]--;
                    cout << sx + 1 << ' ' << sy + 1 << endl;
                    moved = true;
                    break;
                }
            }
            if(!moved){
                break;
            }
        }
    }
    return 0;
}

Submission Info

Judge Result