0
1
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-12-25 17:32:01 +00:00
OI-codes/USACO/2021.12-Bronze/3/3.cpp

35 lines
682 B
C++

#include <iostream>
#include <string>
using std::cin;
using std::cout;
using std::endl;
int t, n, k, ans;
std::string g[55];
void dfs(int x, int y, int cnt, int from) {
if (x < 0 || x >= n || y < 0 || y > n || cnt > k || g[x][y] == 'H') return;
if (x == n - 1 && y == n - 1) {
ans++;
return;
}
dfs(x + 1, y, cnt + (from == 2), 1);
dfs(x, y + 1, cnt + (from == 1), 2);
}
int main() {
std::ios::sync_with_stdio(false);
cin >> t;
while (t--) {
ans = 0;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> g[i];
}
dfs(0, 0, 0, 0);
cout << ans << endl;
}
return 0;
}