（POJ3050) Hopscotch (暴力DFS)

我会带着你远行 2022-03-11 10:22 234阅读 0赞

The cows play the child's game of hopscotch in a non-traditional way. Instead of a linear set of numbered boxes into which to hop, the cows create a 5x5 rectilinear grid of digits parallel to the x and y axes.  
  
They then adroitly hop onto any digit in the grid and hop forward, backward, right, or left (never diagonally) to another digit in the grid. They hop again (same rules) to a digit (potentially a digit already visited).  
  
With a total of five intra-grid hops, their hops create a six-digit integer (which might have leading zeroes like 000201).  
  
Determine the count of the number of distinct integers that can be created in this manner.

Input

\* Lines 1..5: The grid, five integers per line

Output

\* Line 1: The number of distinct integers that can be constructed

Sample Input

1 1 1 1 1
    1 1 1 1 1
    1 1 1 1 1
    1 1 1 2 1
    1 1 1 1 1

Sample Output

Hint

OUTPUT DETAILS:  
111111, 111112, 111121, 111211, 111212, 112111, 112121, 121111, 121112, 121211, 121212, 211111, 211121, 212111, and 212121 can be constructed. No other values are possible.

解题思路:

暴力深搜,把所有结果穷举出来,存到一个Set容器中去重,注意要把所有结点作为起点试一遍

#include <iostream>
    #include <vector>
    #include <algorithm>
    #include <set>
    #include <string>
    using namespace std;
    int SGMaps[5][5];
    set<int> numsSet;
    int SsMoveX[4] = { 1,-1,0,0 };
    int SsMoveY[4] = { 0,0,1,-1 };
    
    void Dfs_Set(int x, int y,int times,int indexes,int Ssum) {
    	if (times == 6) {
    		numsSet.insert(Ssum);
    		return;
    	}
    	for (int i = 0; i < 4; ++i) {
    		int tnewX = x + SsMoveX[i];
    		int tnewY = y + SsMoveY[i];
    		if (tnewX >= 0 && tnewX < 5 && tnewY >= 0 && tnewY < 5) {
    			Dfs_Set(tnewX, tnewY, times + 1,indexes*10,Ssum+SGMaps[tnewX][tnewY]*indexes);
    		}
    	}
    }
    
    
    int main() {
    	for (int i = 0; i < 5; ++i) {
    		for (int j = 0; j < 5; ++j) {
    			cin >> SGMaps[i][j];
    		}
    	}
    	for (int i = 0; i < 5; ++i) {
    		for (int j = 0; j < 5; ++j) {
    			Dfs_Set(i, j, 0, 1, 0);
    		}
    	}
    	cout << numsSet.size() << endl;
    	
    	return 0;
    }