代码在本地运行一直卡着，好久不输出

#include<bits/stdc++.h>
using namespace std;
int ans=0;
int s[10][10];
int shu[10][10];
int hen[10][10];
int ge[10][10];
int cnt=0;
int cx[10],cy[10];
int shudu[10][10] = {{0},{0,1,1,1,2,2,2,3,3,3},{0,1,1,1,2,2,2,3,3,3},{0,1,1,1,2,2,2,3,3,3},{0,4,4,4,5,5,5,6,6,6},{0,4,4,4,5,5,5,6,6,6},{0,4,4,4,5,5,5,6,6,6},{0,7,7,7,8,8,8,9,9,9},{0,7,7,7,8,8,8,9,9,9},{0,7,7,7,8,8,8,9,9,9}};
int quanzhi[10][10] = {{0},{6,6,6,6,6,6,6,6,6},{6,7,7,7,7,7,7,7,6},{6,7,8,8,8,8,8,7,6},{6,7,8,9,9,9,8,7,6},{6,7,8,9,10,9,8,7,6},{6,7,8,9,9,9,8,7,6},{6,7,8,8,8,8,8,7,6},{6,7,7,7,7,7,7,7,6},{6,6,6,6,6,6,6,6,6}};
bool check(int x, int y, int g, int su){
	return !shu[y][su] && !hen[x][su] && !ge[g][su];
}
void dfs(int c, int sum){
	if(c == cnt){
		ans = max(ans,sum);
		return;
	}
	int x = cx[c];
	int y = cy[c];
	int su = s[x][y];	
	for(int i=1; i<=9; i++){
		if(check(x, y, shudu[x][y], i)){
			shu[y][su] = 1;
			hen[x][su] = 1;
			ge[shudu[x][y]][su] = 1;
			dfs(c+1,sum+i*quanzhi[x][y]);
			shu[y][su] = 0;
			hen[x][su] = 0;
			ge[shudu[x][y]][su] = 0;
		}
	}
	return;	 
}
int main(){
	for(int i=1;i<=9;i++){
		for(int j=1;j<=9;j++){
			cin >> s[i][j];
			if(s[i][j] != 0) {
				hen[i][s[i][j]] = 1;
				shu[j][s[i][j]] = 1;
				ge[shudu[i][j]][s[i][j]] = 1;
				ans += quanzhi[i][j] * s[i][j];
			} else {
				cnt++;
				cx[cnt] = i;
				cy[cnt] = j;
			}
		}
	}
	dfs(0,ans);
	cout<<ans;
	return 0;
}

1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1
*/