C++(clang++ 11.0.1) 解法, 执行用时: 730ms, 内存消耗: 496K, 提交时间: 2023-08-10 18:22:06

#include <bits/stdc++.h>
using namespace std;

int v[10][10], G[10][10][2];
bool row[10][10], col[10][10], gird[10][10];

bool dfs(int x, int y) {
	if (y == 10) {
		if (x == 9) {
			for (int i = 1; i <= 9; i++) {
				for (int j = 1; j <= 9; j++) {
					cout << v[i][j] << ' ';
				}
				cout << '\n';
			}
			return 1;
		}
		x++, y = 1;
	}
	for (int i = 1; i <= 9; i++) {
		int t = (x - 1) / 3 * 3 + (y - 1) / 3 + 1;
		if (row[x][i] || col[y][i] || gird[t][i]) continue;
		if (y > 1) {
			if (G[x][y - 1][0] > 0 && !(v[x][y - 1] > i)) continue;
			if (G[x][y - 1][0] < 0 && !(v[x][y - 1] < i)) continue;
		}
		if (x > 1) {
			if (G[x - 1][y][1] > 0 && !(v[x - 1][y] > i)) continue;
			if (G[x - 1][y][1] < 0 && !(v[x - 1][y] < i)) continue;
		}
		v[x][y] = i;
		row[x][i] = col[y][i] = gird[t][i] = 1;
		if (dfs(x, y + 1)) return 1;
		row[x][i] = col[y][i] = gird[t][i] = 0;
	}
	return 0;
}

void solve() {
	char ch;
	for (int i = 1; i <= 9; i++) {
		for (int j = 1; j <= 9; j++) {
			if (j % 3 == 0) continue;
			cin >> ch;
			if (ch == '>') G[i][j][0] = 1;
			else G[i][j][0] = -1;
		}
		for (int j = 1; j <= 9; j++) {
			if (i % 3 == 0) continue;
			cin >> ch;
			if (ch == 'v') G[i][j][1] = 1;
			else G[i][j][1] = -1;
		}
	}
	dfs(1, 1);
}

signed main() {
	ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
	solve();
	return 0;
}