[BOJ] 15367 : Spirale

#include <cstdio>
#include <algorithm>

const int dx[2][4] = { {0,-1,0,1},{0,-1,0,1} };
const int dy[2][4] = { {-1,0,1,0},{1,0,-1,0} };

int n, m, k;
int a[500][500];

int main() {
	scanf("%d %d %d", &n, &m, &k);
	while (k--) {
		int x, y, c, num = 1, cnt = 2, dir = 0;
		scanf("%d %d %d", &x, &y, &c);
		x += 249, y += 249;
		if (!a[x][y]) a[x][y] = 1;
		while (dir < 170) {
			for (int i = 0; i < (dir+1) / 2; i++) {
				x += dx[c][dir % 4], y += dy[c][dir % 4];
				if (a[x][y] != 0) a[x][y] = std::min(a[x][y], num);
				else a[x][y] = num;
				num++;
			}
			if (num == 1) {
				a[x][y] = 1;
				num++;
			}
			dir++;
		}
	}

	for (int i = 250; i < 250 + n; i++) {
		for (int j = 250; j < 250 + m; j++) {
			printf("%d ", a[i][j]);
		}
		puts("");
	}
	return 0;
}