Submission #8246186

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<int>;
using VL = vector<ll>;
#define FOR(i,a,n) for(int (i)=(a);(i)<(n);++(i))
#define eFOR(i,a,n) for(int (i)=(a);(i)<=(n);++(i))
#define rFOR(i,a,n) for(int (i)=(n)-1;(i)>=(a);--(i))
#define erFOR(i,a,n) for(int (i)=(n);(i)>=(a);--(i))
#define SORT(i) sort((i).begin(),(i).end())
#define rSORT(i,a) sort((i).begin(),(i).end(),(a))
#define all(i) (i).begin(),(i).end()
#define out(y,x,h,w) (y) < 0 || (h) <= (y) || (x) < 0 || (w) <= (x)
const ll INF = 1000000000;
const ll LLINF = 1LL << 60;
const ll mod = 1000000007;
const ll MOD = 998244353;
const long double pi = acos(-1);
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; }return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; }return 0; }
inline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }
template<class T>inline istream& operator>>(istream& input, vector<T>& v) { for (auto& elemnt : v)input >> elemnt; return input; }

vector<VI> a(30, VI(30));
int dy[] = { -1, 0, 0, 1 }, dx[] = { 0, -1, 1, 0 };

void solve(int y, int x){
    --a[y][x];
    cout << y + 1 << " " << x + 1 << "\n";
    FOR(i, 0, 4){
        int ny = y + dy[i], nx = x + dx[i];
        if (out(ny, nx, 30, 30))continue;
        if (a[ny][nx] && (a[y][x] == a[ny][nx])){
            solve(ny, nx);
            break;
        }
    }
}

int main() {
    init();

    FOR(i, 0, 30)cin >> a[i];

    vector<tuple<int, int, int>> dat;
    FOR(y, 0, 30)FOR(x, 0, 30){
        dat.push_back(make_tuple(a[y][x], y, x));
    }
    SORT(dat);

    rFOR(i,0,900){
        int y = get<1>(dat[i]), x = get<2>(dat[i]);
        while(a[y][x])solve(y, x);
    }
}

Submission Info

Judge Result