POJ3050 Hopscotch

知识点：深搜，回溯

比较简单的回溯法，题目里面已经限定了，除了起点，移动5次，算一下这个要求很低，就算用时间复杂度最高的做法也完全能过，并且深搜的时候不用判重，

#include <bits/stdc++.h>

using namespace std;

const int N = 10;

int a[N][N], ans;
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, 1, 0, -1};
vector<int> v;
map<int, int> mp;

void dfs(int x, int y, int k) {
	if (k == 6) {
		int t = v[0] * 100000 + v[1] * 10000 + v[2] * 1000 + v[3] * 100 + v[4] * 10 + v[5];
		if (mp.find(t) == mp.end()) { ans++; mp[t] = 1; }
		return;
	}
	for (int i = 0; i < 4; i++) {
		int x1 = x + dx[i];
		int y1 = y + dy[i];
		if (x1 < 1 || x1 > 5 || y1 < 1 || y1 > 5) continue;
		v.push_back(a[x1][y1]);
		dfs(x1, y1, k + 1);
		v.pop_back();
	}
}

int main() {
	for (int i = 1; i <= 5; i++) {
		for (int j = 1; j <= 5; j++) cin >> a[i][j];
	}
	for (int i = 1; i <= 5; i++) {
		for (int j = 1; j <= 5; j++) {
			v.push_back(a[i][j]);
			dfs(i, j, 1);
			v.pop_back();
		}
	}
	cout << ans;
	return 0;
}