Hopscotch POJ - 3050
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
15
题意:
给出5 X 5的数,从任意点开始遍历,可以重复走,算出不同排列的种类和。
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记录不同的排列,输出set的size。
#include<iostream>
#include<queue>
#include<set>
#include<algorithm>
#define P pair<int, int>
using namespace std;
const int MAX = 1e7;
int a[6][6];
set <int> Vis;
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
void dfs(int i, int j, int len, int sum) {
if(len == 6) {
Vis.insert(sum);
return;
}
for (int k = 0; k < 4; k++) {
int tx = i + dx[k], ty = j + dy[k];
if(tx < 5 && tx >= 0 && ty >= 0 && ty < 5) {
dfs(tx, ty, len + 1, sum * 10 + a[tx][ty]);
}
}
return;
}
int main() {
for (int i = 0; i < 5; i++)
for (int j = 0 ; j < 5; j++)
cin >> a[i][j];
//从每个点开始遍历
for (int i = 0; i < 5; i++) {
for (int j = 0; j < 5; j++) {
dfs(i, j, 1, a[i][j]);
}
}
cout << Vis.size() <<endl;
return 0;
}