Submission #1358606

---

Source Code Expand

#include <iostream>
#include <vector>
#include <array>
#include <map>
using namespace std;

const int width = 3;
const int height = 3;

using aii = array<array<int, width>, height>;
using vpi = vector<pair<int, int>>;

bool inside(const int h, const int w) {
	if (0 <= w && w < width && 0 <= h && h < height)
		return true;
	else
		return false;
}

void show(aii &state) {

	for (auto row : state) {
		for (auto point : row) {
			cout << point << " ";
		}
		cout << endl;
	}
	cout << endl;

}

void decrement(aii& state, int h, int w) {

	while (inside(h, w) && state[h][w] != 0) {
		//show(state);
		state[h][w]--;
		//cout << h << " " << w << endl;

		int dir[5] = { 0,1,0,-1,0 };

		for (int i = 0; i < 4; i++) {
			if (inside(h + dir[i], w + dir[i + 1]) && state[h][w] == state[h + dir[i]][w + dir[i + 1]]) {
				h = h + dir[i];
				w = w + dir[i + 1];
				break;
			}
		}
	}

}

void input(aii &state) {

	for (auto & row : state) {
		for (auto & point : row) {
			cin >> point;
		}
	}
}

vpi solve(aii& state) {

	vpi result;

	for (int i = 0; i < height; i++) {
		for (int j = 0; j < width; j++) {

			//show(state);

			while (0 != state[i][j]) {

				result.push_back(pair<int, int>(i, j));

				decrement(state, i, j);

			}
		}
	}

	return result;
}

int main(void) {

	aii state;
	input(state);

	vpi result = solve(state);

	//show(state);

	for (const auto & ans : result) {
		cout << ans.first + 1 << " " << ans.second + 1 << endl;
	}

}

Submission Info

Judge Result