Submission #8244741

---

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;

bool is_out(int x, int y){
    return (x < 0 || x >= SIZE || y < 0 || y >= SIZE);
}

bool is_top(int x, int y){
    REP(k, dx.size()){
        if(is_out(x + dx[k], y + dy[k])){
            continue;
        }else if(a[x + dx[k]][y + dy[k]] > a[x][y]){
            return false;
        }
    }
    return true;
}

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

    while(1){
        bool found = false;
        int sx = 0, sy = 0;
        REP(i, 2 * (SIZE - 1) + 1){
            REP(x, i + 1){
                const int y = i - x;
                if(is_out(x, y)){ continue; }
                if(a[x][y] == 0){ continue; }
                if(is_top(x, y)){
                    sx = x;
                    sy = y;
                    found = true;
                }
                if(found){ break; }
            }
            if(found){ break; }
        }
        // REP(i, SIZE){
        //     REP(j, SIZE){
        //         if(a[i][j] == 0){ continue; }
        //         if(is_top(i, j)){
        //             sx = i;
        //             sy = j;
        //             found = true;
        //         }
        //         if(found){ break; }
        //     }
        //     if(found){ break; }
        // }
        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(is_out(sx + dx[k], sy + dy[k])){
                    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